css

LS_SVM 偏最小二乘结合支持向量机(The LS SVM partial least squares and Support Vector Machine)

程序算任意点FFT和小波变换,以及可选择多种小波及小波变换后的单频带重够,另算信号的Lipschitz指数,高级数字信号处理!(counting procedures arbitrary point FFT and Wavelet Transform, and the choice of multiple wavelet and the wavelet transform of a single-band heavy enough, and another count signal Lipschitz index advanced digital signal processing!)

Wdisp，是基于建造结构计算软件pkpm的结果数据提取文件，方便使用，提取数据后，可用于绘制曲线。(Wdisp, is based on The construction structure calculations software pkpm the results of data extraction files, easy to use, extract data, can be used to draw the curve.)

用mfc实现计算器的基本操作，支持键盘输入，并保留xp风格,可计算平方，幂，时间显示等操作(With mfc achieve the basic operation of the calculator, support for keyboard input, and retain xp style, calculates the square, power, time display and other operations)

划分网格一个开源的库，有限元的算法，很好用(Meshing an open source library = for finite element)

说明：  距阵链乘问题: 找出矩阵链乘A(35*40) A(40*20) A(20*10) A(10*15)的最佳相乘次序。 算法来自:计算机算法导引(matrix chain by : identify matrix chain by A (35* 40) A (40* 20) A (20* 10) A (10* 15) concludes the best order. Algorithm from : computer algorithm Seeker)

汽车油耗计算（C实现）对于家用经济型小轿车来说，统计油耗是经常做的一件事。本题目要求根据汽油单价、每次加油所用钱数，以及该次加的油所跑里程数计算出该车的百公里油耗，并进行保存，根据需要给出统计数据。(Vehicle fuel consumption calculation (C implementation) for the household economy cars, the fuel consumption statistics is often one of the things. The questions asked based on gasoline price, amount of money each fuel used, and the second oil added to calculate the mileage run car 100 km fuel consumption, and save, according to the need to give statistics.)

四阶龙格库塔法，用C++编写，很有参考价值(Fourth-order Runge-Kutta method, written in C, a good reference)

处理大规模矩阵，对大规模的矩阵进行分解，即形如分解A=UV(To deal with large-scale matrix, mass matrix decomposition, that is shaped like a decomposition A = UV)

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)