-
源代码
七段s曲线路径规划程序详解 非常适合做运动控制规划(Detailed solution of seven segment s curve path planning program)
- 2018-02-01 09:38:46下载
- 积分:1
-
rcs1
运用物理光学法和矩量法计算带罩天线的远场辐射(The use of physical optics method and moment method with cover antenna far-field radiation
)
- 2012-12-12 09:57:59下载
- 积分:1
-
Desktop
说明: 在进行激光熔覆或者焊接时可用到的移动热源命令流(Command flow of moving heat source available during laser cladding or welding)
- 2020-07-01 22:55:37下载
- 积分:1
-
FDTD-WireAtenna3
采用相互垂直的两个振子构成圆极化天线的FDTD程序.可以计算其圆极化波瓣宽度等天线指标
(perpendicular to each other using the two oscillator constitute a circularly polarized antenna FDTD procedures. Can calculate its lobed circular polarization antennas width indicators)
- 2006-10-25 18:44:52下载
- 积分:1
-
Computational-Science-codes
开发环境没有可选项,fortran90,Fortran_90_and_Computational_Science-_codes(Computational Science codes by fortran90
)
- 2013-10-10 17:07:12下载
- 积分:1
-
zuijinercheng
基于C环境下的最小二乘法的计算编程算法相当相当实用。(C based on the circumstances of the least squares algorithm for calculating the programming very well.)
- 2009-05-12 23:42:37下载
- 积分:1
-
zipf-random
随机数生成程序,该随机数呈zipf分布,就是大家常说对于内容的访问遵循80/20原则,也就是20 的内容,会占有80 的访问量。(Random number generator, the zipf was distributed random numbers, that is, we often say that the access to the content to follow the 80/20 principle, which is 20 of the content will occupy 80 of visits.)
- 2013-06-27 17:56:45下载
- 积分:1
-
naturePoly
在Z2[X]中判断一个多项式是否本原多项式,并能对给定的多项式求逆。
(in Z2 [X] to judge whether a polynomial primitive polynomial, and the right to the inverse polynomials.)
- 2007-05-21 14:57:08下载
- 积分:1
-
zuixiaofa
最小二乘法数据处理软件,翻遍计算的程序,应用于各种优化算法(math caculateor)
- 2013-12-04 14:39:11下载
- 积分:1
-
na7
Orthogonal Polynomials Approximation
数值分析,计算正交基多项式的系数
(Given a function f and a set of m >0 distinct points . You are supposed to write a function to approximate f by an orthogonal polynomial using the exact function values at the given m points with a weight assigned to each point . The total error must be no larger than a given tolerance.
Format of function
int OPA( double (*f)(double t), int m, double x[], double w[], double c[], double*eps )
where the function pointer double (*f)(double t) defines the function f int m is the number of points double x[] contains points double w[] contains the values of a weight function at the given points x[] double c[] contains the coefficients of the approximation polynomial double*eps is passed into the function as the tolerance for the error, and is supposed to be returned as the value of error. The function OPA is supposed to return the degree of the approximation polynomial.
Note: a constant Max_n is defined so that if the total error is still not small enough when n = Ma)
- 2011-11-27 11:47:21下载
- 积分:1