vumat1

使用奇异值分解来帮助求解最小二乘问题，特别是在方程系数矩阵不满秩的情况下。(SGELSD computes the minimum-norm solution to a real linear least * squares problem: * minimize 2-norm(| b- A*x |) * using the singular value decomposition (SVD) of A. A is an M-by-N * matrix which may be rank-deficient.)

说明：  瑞利分布的随机变量，标准高斯分布的随机变量，莱斯分布的随机变量(Random Variables of Rayleigh Distribution, Standard Gauss Distribution and Rice Distribution)

支持向量机和BP神经网络都可以用来做非线性回归拟合，但它们的原理是不相同的，支持向量机基于结构风险最小化理论，普遍认为其泛化能力要比神经网络的强。大量仿真证实，支持向量机的泛化能力强于BP网络，而且能避免神经网络的固有缺陷——训练结果不稳定。本源码可以用于线性回归、非线性回归、非线性函数拟合、数据建模、预测、分类等多种应用场合(Support vector machines and BP neural network can be used for non-linear regression fit, but they is not the same principle, support vector machine based on structural risk minimization theory, generally considered its generalization ability than the neural network of strong . Inherent defect- a large number of simulation confirmed that generalization ability of support vector machine is stronger than the BP network, but also to avoid neural network training results unstable. The source code can be used for linear regression, nonlinear regression, nonlinear function fitting a variety of applications, data modeling, forecasting, classification)

正入射的自由曲面透镜设计，计算获得透镜的二维坐标(The free-form surface lens is incident on the design, the two-dimensional coordinates of the lens calculated)

万有引力单目标优化算法，用于单目标线性规划问题(Universal gravitation single objective optimization algorithm is used for single target linear programming problem.)

储层产能预测文献，对于研究利用测井进行产能预测有帮助！(Prediction of Specific Productivity Index for Sihapas Formation in Uncored Wells of Minas Field Using Limited Available Core and Log Data)

针对运用最小二乘法求解DV-Hop定位算法带来的节点定位误差较大的问题，提出基于代数重建法的DV-Hop定位算法(Least square method for the use of DV-Hop localization algorithm node localization errors caused by the larger issues, proposed algebraic reconstruction method based on DV-Hop localization algorithm)

用于计算锁模激光腔中增益饱和强度，用于锁模激光(For calculating the gain saturation intensity in a mode-locked laser cavity for a mode locke)

说明：  距阵链乘问题: 找出矩阵链乘A(35*40) A(40*20) A(20*10) A(10*15)的最佳相乘次序。 算法来自:计算机算法导引(matrix chain by : identify matrix chain by A (35* 40) A (40* 20) A (20* 10) A (10* 15) concludes the best order. Algorithm from : computer algorithm Seeker)

正确率可以达到98％，抑制载波型差分相位调制，数据包传送源码程序。( Accuracy can reach 98 , Suppressed carrier type differential phase modulation, Data packet transfer source program.)