FFT_Original

严格的衍射积分计算，实现光栅结构透过反射场2维分布的严格解计算，利用散射积分对耦合模方程进行严格计算解 衍射，光栅，场，二维，积分，散射矩阵，耦合模理论(Strict calculation of the diffraction integral, the grating structure is realized through the rigorous solution of the 2 dimensional distribution of the reflection field. Diffraction, grating, field, two-dimensional, integral, scattering matrix, coupled mode theory)

一个短时傅里叶变换的C语言实现，对3万个数据进行加窗、FFT处理(A short time Fourier transform of C language, for 30,000 data windowing, FFT processing)

music高阶谱分析算法，IDW距离反比加权方法，BP神经网络用于函数拟合与模式识别。( music higher order spectral analysis algorithm, IDW inverse distance weighting method, BP neural network function fitting and pattern recognition.)

这个程序分别用二分法，Newton法，弦截法，Newton下山法等算法求解非线性方程(this procedure were used dichotomy, Newton, String interception, Newton downhill law for solving nonlinear equations)

椭圆曲线密码体制中的ECC校验验算法分析和程序实现可直接使用。 (The inspection algorithm analysis and procedures of the elliptic curve cryptosystem ECC can be used directly.)

ansys 求解桥梁结构弯矩响线的命令流，非常实用(ansys solving the stream of the bridge structure bending ring line command is very useful)

打靶法求解两点边值问题 实例测试通过，可直接运行，并带有详细代码注释 采用全局收敛的牛顿-拉普森迭代算法求解编制问题 绝对物超所值！(Two-point boundary value problem shooting method)

牛顿插值算法，利用数组存储均差表，一步步迭代求得插值(Newton interpolation algorithm, the use of array stores are differential gauge, step by step, iterative get interpolation )

此程序为香农编码的程序实现的过程及相关参数和结果。(shannon)

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)