duoxiangshi

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)

Dot Matrix 5 x 7 sample progmam , hope you enjoy

分数阶滑模工具箱，可用于解决阶次比较低的时候(fractional order sliding mode )

数值分析课程必备的算法：列主元高斯消去法算法。有需要的同学下载(Numerical analysis courses required algorithms: PCA out Gaussian elimination algorithm. Those students in need to download)

最优解回溯法0-1问题，为了构造最优解，必须在算法中记录与当前最优值相应的当前最优解。(The optimal solution backtracking 0-1 must be recorded in the algorithm, in order to construct the optimal solution, corresponding to the current optimal value, the current optimal solution.)

实现线性代数的矩阵运算的C++程序，矩阵计算器。(Linear algebra matrix operations C++ procedures matrix calculator.)

说明：  曲线的三次样条插值，在非首尾节点处具有三次光滑性质(Curve cubic spline interpolation, in both nodes with non-smooth nature of the three)

c语言程序编写在经验模态分解，包含三次样条(c language programming in the empirical mode decomposition, contains the cubic spline)

一个仓本模型计算程序，用于计算奇异态和序参量(a program of kuramotto)

各种数值积分，龙贝格积分。反常积分。高斯积分。三重积分。(Various numerical integration Romberg integration. Improper integrals. Gaussian integral. Triple integral.)