矩阵鞍点求法

文件中包括了最优化中的最小费最大流程序以及例子和程序(File included in the most optimal maximum flow procedures and examples of trees and procedures)

用于计算学分绩,是大学实行学分制后比较实用的一个软件(used in the calculation of the credit performance of college credit system after a more practical software)

Orthogonal Polynomials Approximation 数值分析，计算正交基多项式的系数 (Given a function f and a set of m >0 distinct points . You are supposed to write a function to approximate f by an orthogonal polynomial using the exact function values at the given m points with a weight assigned to each point . The total error must be no larger than a given tolerance. Format of function int OPA( double (*f)(double t), int m, double x[], double w[], double c[], double*eps ) where the function pointer double (*f)(double t) defines the function f int m is the number of points double x[] contains points double w[] contains the values of a weight function at the given points x[] double c[] contains the coefficients of the approximation polynomial double*eps is passed into the function as the tolerance for the error, and is supposed to be returned as the value of error. The function OPA is supposed to return the degree of the approximation polynomial. Note: a constant Max_n is defined so that if the total error is still not small enough when n = Ma)

新建复数类进行复数运算，重载+、=+、*、/等运算符用于复数间的运算。(New complex class complex operation, overloading+ =+,*,/operator for computing the plural.)

正交变换源程序，带vc工程。 学习正交变换算法的有力工具。(Orthogonal transformation source code, with vc works. Orthogonal transformation algorithm to learn a powerful tool.)

通过C++头文件实现的有限元形状函数计算程序(finite element shape function)

数值计算各算法的程序,包括:牛顿迭代法,超松驰迭代法,微分法等.对于初学数值分析这门课程的人有很大的帮助.(Numerical calculation procedure of the algorithm, including: Newton iteration, ultra-relaxation iteration method, differential method and so on. Beginner numerical analysis for this course were very helpful.)

该程序是正定矩阵的Cholesky分解实例，Cholesky是矩阵分解常用的方法(The procedure is the Cholesky decomposition of positive definite matrix example, Cholesky matrix decomposition is a commonly used method)

多项式拟合，最小二乘法，c++版本实现，运行环境vc6(Polynomial fitting)

说明：  一维黎曼问题，一维问题，即激波管问题，是一个典型的一维可压缩无黏气体动力学问题，并有 解析解。对它采用二阶精度两步差分格式进行数值求解。(Riemann problem, One dimensional problem, the shock tube problem, is a typical one-dimensional compressible non viscous gas dynamic problem with analytic solutions. It is solved numerically by two order two step difference scheme.)