利用杜利特路分解求解线性方程组！

bfgs算法求全域最小数值点，c++源程序,文件读入套用方便-bfgs domain algorithm ambitious minimum values, c source, the document read into the convenient use

lingo编程解决公司多种资产投资的问题-lingo programming to solve a variety of assets of company investment

最小二乘法直线拟合拟合直线方程(Y=kX+b)

基于Givens transformation的QR分解。其使用需要调用Givens transformation程序。-Givens transformation based on the QR decomposition. Their use need to call Givens transformation process.

资源描述基于opencv的手势识别的前期处理，，运行环境是VS2013，opencv2.4.9,通过修改链接器可以自行修改运行环境。代码直接debug编译可以使用，该代码是应用于轮廓的绘制。基于opencv的手势识别前期必须对图像进行一系列的处理，这是其中的一种，有了轮廓之后再去判定tips数。

提供了PID控制的程序框图，可根据实际需要进行修改。-provide PID control of the process diagram, can be based on actual need to be modified.

构建小世界网络来表示学校学生的人际关系网络，在此基础之上研究学风的演化过程，考虑因素有学生的坚持程度、学生间的亲密程度、老师和家长的影响作用-Construction of small-world network to represent the networks of relationships between school students in this study based on the evolution of the style of study, considering factors of students adhere to the degree of closeness between students, teachers, and parents influence

有关lingo的学习课件，很好用的东西。-The lingo of learning courseware, very good thing to use.

逐次超松驰迭代法(Successive Over Relaxation Me thod,简称SOR方法)是高斯―塞德尔方法的一种加速方法，是解大型稀疏矩阵方程组的有效方法之一，它具有计算公式简单，程序设计容易,占用计算机内存较少等优点,但需要较好的加速因子(即最佳松驰因子).下面我们首先说说松驰一词的含意,再利用它来解释雅可比迭代法与高斯―塞德尔迭代法,最后给出逐次超松驰迭代法的推算公式和收敛性条件.-Successive over relaxation iteration method (Successive Over Relaxation Me thod, called SOR method) is the Gauss- Seidel method for an accelerated method is solution of large sparse matrix equations, one effective method, it has a simple formula, programming easy, take up less computer memory, etc., but the need for better acceleration factor (that is, the best relaxation factor). Let us first talk about the meaning of the term relaxation, and then use it to explain the Jacobi s iterative method and the Gauss- Seidel iterative method, and finally gives successive over relaxation iterative method of projection formula and the convergence condition.

操作系统中的进程调度算法-operating system, the process of scheduling algorithm