tsvd

利用拉格朗日松弛法求解机组组合问题，考虑领域搜索的随机性(Using Lagrangian relaxation method to solve the unit combination problem, considering the randomness of the search field)

共轭梯度法（Conjugate Gradient）是介于最速下降法与牛顿法之间的一个方法，它仅需利用一阶导数信息，但克服了最速下降法收敛慢的缺点，又避免了牛顿法需要存储和计算Hesse矩阵并求逆的缺点，共轭梯度法不仅是解决大型线性方程组最有用的方法之一，也是解大型非线性最优化最有效的算法之一。 在各种优化算法中，共轭梯度法是非常重要的一种。其优点是所需存储量小，具有步收敛性，稳定性高，而且不需要任何外来参数。(Conjugate gradient method (Conjugate Gradient) is between the steepest descent method between the method and Newton' s method, it takes only a first derivative information, but to overcome the steepest descent method convergence slow shortcomings, but also to avoid the Newton method needs to be stored Hesse and disadvantages of computing inverse matrix and the conjugate gradient method is not only one of the most useful methods to solve large linear equations, solution of large-scale nonlinear optimization is one of the most effective algorithm. In various optimization algorithm, conjugate gradient method is a very important one. The advantage is that a small amount of memory required, with step convergence, high stability, and does not require any external parameters.)

实现了对文档的数据读入，实现了文档的数据读入(The realization of the document data read into, The realization of the document data read into, )

说明：  实现快速离散傅里叶变换，即FFT,很有用的程序(Fast discrete Fourier transform, namely, FFT, very useful program)

fluent模拟焊接，熔滴过渡的质量源项(Welding Simulation， mass source)

说明：  二维笛卡尔坐标系下网格的划分，包括多重网格等。(Two-dimensional Cartesian coordinate system, the division of the grid, including the multi-grid and so on.)

无网格MLPG程序,gauss积分，移动最小二乘法(meshless local petrov-Galerkin methods )

说明：  siPLS和biPLS是两种用于近红外光谱特征波段筛选的变量选择方法，可筛选出与兴关注指标密切相关的特征波段，并去除无关和干扰变量，提高模型稳健性(Bipls and sipls are two variable selection methods for screening the characteristic intervals of near-infrared spectra, which are closely related to performance indicators, to improve the robustness of models.)

假设有一个能装入总体积为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])

LDL分解法，用于求解大型的线性方程组。此程序中最多能解100维的，速度还不错(LDL decomposition method for solving large-scale linear equations. This procedure can be up to 100 peacekeepers solutions, speed is not bad.)