guimai_v53

说明：  计算两组向量之间的旋转矩阵。输入参数为在两个不同坐标系中的同名向量（模为1），返回参数是一个3X3的旋转矩阵。(The function of RM realize the rotation between two sets of vectors, whose magnitude are 1, defined in two different refrence frames. Input parameters are two sets of vectors r and b, return value is a rotaton matrix.)

编程序，按如下要求来求解n元一次线性方程组（假设方程组具有唯一解）。 （1）方程个数n之值由用户通过键盘输入； （2）方程组存放在“增广矩阵”A之中，而n行n+1列的A存储空间通过new来动态分配，且A的各元素值也由用户通过键盘输入 (Allocation procedures, the following requirements to solve the n-a system of linear equations (assuming a unique solution of equations). (1) the number n of the value equation by the user through the keyboard input (2) equations stored in the augmented matrix A, while n line n+ 1 column A storage space through the new dynamically allocated, and A The value of each element by the user through the keyboard input)

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

用传输矩阵法计算光栅场，寻找bloch 模(use of the transfer matrix method grating market, find bloch Die)

采用动量梯度下降算法训练BP网络，采用两种训练方法，即 L-M 优化算法（trainlm）和贝叶斯正则化算法（trainbr），用以训练 BP 网络(Gradient descent algorithm using momentum BP network training, using two training methods, namely, LM optimization algorithm (trainlm) and Bayesian regularization algorithm (trainbr), to facilitate the training of BP network)

在计算流体力学中，多项流中有相变时，基于温度的相变UDF(Mass based on the temperature of the phase change in the UDF)

拟牛顿迭代法是相对比较新的一种方法，克服了牛顿迭代需要求导数和求逆的缺点，用于求解非线性方程组(For solving nonlinear equations)

基二、基四、基八 FFT变化源代码，有详细注解(Second base, the base four or eight FFT-based changes in the source code, detailed comments)

说明：  工艺优化中偏最小二乘法对响应面法的改进，显著改善模型系数不显著现象(Matlab program for calculating grey correlation matrix)

利用矩阵法求解对策论中的二元零和博弈最优策略(Game theory using matrix method for solving binary zero-sum game in the optimal strategy)