FractalDim

用矩阵法求定积分1/(1+x^2)dx，区间是（-4，4）(Definite Integral Matrix Method)

用C++编写的一维和二维快速傅里叶变换程序(Prepared with C++ one-dimensional and two-dimensional fast Fourier transform procedure)

信号维数的估计，计算一维光子晶体的透射特性和反射特性，小波包分析提取振动信号中的特征频率。( Signal dimension estimates, Calculated transmission characteristics and reflection characteristics of the one-dimensional photonic crystals, Wavelet packet analysis to extract vibration signal characteristic frequency.)

说明：  一维黎曼问题，一维问题，即激波管问题，是一个典型的一维可压缩无黏气体动力学问题，并有 解析解。对它采用二阶精度两步差分格式进行数值求解。(Riemann problem, One dimensional problem, the shock tube problem, is a typical one-dimensional compressible non viscous gas dynamic problem with analytic solutions. It is solved numerically by two order two step difference scheme.)

一个通用的CFD求解器，代码结构清楚，简洁，适用于开发自己的CFD程序。(A general of CFD solver, the code structure is clear, concise, applicable to the development of the CFD program.)

用一个N点复序列的FFT同时计算两个N点实序列离散傅里叶变换(With an N-point complex sequence of N-point FFT calculate two real sequences discrete Fourier transform)

可进行最小二乘法线性拟合输出，包含源代码及生成后的程序(Least-squares linear fit can be output)

二分法，用于多项式求解，迭代12次能达到很高的精度(Dichotomy for polynomial solving, iterative 12 times to achieve high precision)

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)

Fractional knapsack problem, Greedy algorithm