smallest

反密法在数值计算中的地位就不用我来一一列举了，此程序就可以轻易的使其实现。(anti-secret numerical calculation method in the position I would not have to list them one by one, this procedure can easily achieve it.)

一个表达式计算库，支持算术，逻辑运算，位运算，支持多层级的if/then/else，功能强大。(Calculation of an expression library, support for arithmetic, logic operations, bit computing, multi-level support if/then/else, powerful.)

该函数用来计算任意函数的一阶偏导数(数值方法),使用大量的有限元法求解偏微分方程，基于kaiser窗的双谱线插值FFT谐波分析。( This function is used to calculate the arbitrary function of the first order partial derivative (numerical methods), Using a large number of finite element method to solve partial differential equations, Dual-line interpolation FFT harmonic analysis kais)

频域二维卷积算法，通过在频域用fft计算，加速了卷积的实现过程(Frequency domain of two-dimensional convolution algorithm, by calculating the frequency domain using fft and accelerate the realization of the convolution process)

这是一个对时间序列进行短时傅立叶变换的源程序,测试过,好用的.(This is a program for STFT,which had tested.)

fluent中关于co2的真实气体模型的自定义程序(fluent in about co2 real gas model custom program)

假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品，能否从n件物品中挑选若干件恰好装满背包，即使w1 +w2 + … + wn=T，要求找出所有满足上述条件的解。例如：当T=10，各件物品的体积{1，8，4，3，5，2}时，可找到下列4组解：（1，4，3，2），（1，4，5），（8，2），（3，5，2）。 [需求分析](Suppose there are a load of the backpack of the total volume of T and n volumes were w1, w2, ... wn items, whether selected from n items a number of exactly filled backpack, even if w1+w2+ ...+ wn = T, find out the solution of all the above conditions are met. For example: when T = 10, the volume of items {1,8,4,3,5,2}, can be found in the following four solutions: (1,4,3,2), (1,4,5 ), (8,2), (3,5,2). [Needs Analysis])

maple学习资料，以后学习maple就不用担心了(maple learning materials)

用三元组表为结构，实现稀疏矩阵的加法并输出。(Achieve sparse matrix addition)

经典的可编程添加模块的面向对象的有限元程序代码(C++ code for OOFEM based on multi-systems)