Factorial

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.)

湍流模型re计算流体力学软件udf 可以用于修改UDF文件(turbulence model FLUENT)

说明：  这是一个ACM试题中的算法，叫分而治之算法，上面有PPT还有实例代码，希望喜欢ACM的同学可以喜欢(This is a Question in the ACM algorithm, called divide and conquer algorithms, there are examples of the code above, there are PPT hope that students like to be like the ACM)

有限元常用子程序模块，WORD版内含各种有限元法C++编程的子模块(finite element commonly used subroutine modules, Word version containing various Finite Element Method C Programming Module)

经典矩阵运算问题求解(classic problem solving matrix operations)

说明：  用二分法求解一元五次非线性方程的实数解，在高等电路学习中有很好的用途。(One yuan of five nonlinear equations dichotomy solving real solutions, there is a very good use in the higher circuit learning.)

最小二乘法拟合曲线C++代码，任意的M个数据，任意的次数N(N不易太高)。输出拟合曲线的表达式(Least Squre For ...)

This program is used to find the union, intersection and exclusive OR for given two sorted arrays.

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)

提供函数能进行1维2维的FFT，输入输出的序列长度应为2的整数次方倍(Provides functions can be one-dimensional two-dimensional FFT, sequence length input and output should be an integer power of 2 times)