搜索资源列表
Gauss消元法----不选主元
- 我们的计算方法作业 线性方程组的Gauss消元法（不选主元法）算法实现-our method of calculating operating linear equations Gauss elimination method (Pivot) Algorithm
ToSolveAnEquationSet
- 数值分析中五种常用的解方程组的算法在Linux下的实现。 在本压缩包里分别是： ColPivotElim.d 枢轴元素消去法解方程组 GaussElim.d 高斯销元法解方程组 GSItera.d 高斯赛德尔迭代法解方程组 JacobiItera.d 雅克比迭代解方程组 TriDecompo.d 线性方程组的直接三角分解法 运行环境是Linux，用G++编译的。-Numerical analysis of five commonly used soluti
P248-1
- 二次曲线拟合，应用了高斯列主元消去法，并且应用了矩阵的转置-Quadratic curve fitting, application of Gaussian elimination pivot column
gauss
- 列主元高斯消元法，可以求解线性方程组，比较好用-Gauss elimination pivot column element method that can solve linear equations, compare easy to use
gaosi
- 列主元高斯消元法，比较好用的程序，希望能对大家所帮助！-Gauss elimination pivot column element method
A_LU
- bool lu(double *a, int *pivot, int n)；矩阵的LU分解。 假设数组an*n在内存中按行优先次序存放，此函数使用高斯列选主元消去法，将其就地进行LU分解。pivot为输出函数.pivot[0,n)中存放主元的位置排列. 函数成功时返回false，否则返回true. bool guass(double const *lu, int const *p, double *b, int n) 求线性方程组的解。 假设矩阵lum*n为某个矩阵a
shuzhifenxi
- 里面是例题，Gauss消元法，Gauss列主元消元法，平方根法，追赶法，SOR法求方程组的根-There are examples, Gauss elimination method, Gauss elimination method pivot column, the square root law, pursuit method, SOR Method root equations
GAUSS
- 高斯列主元求解线性方程组，本人自己编写，供大家参考，请多多指教-Gauss pivot column
Elimination-pivot-column
- 这是计算方法的一个实验，主要功能是列主元消元。-Elimination pivot column
gaosi
- 用c++实现高斯列主元消去法，并可实际进行运算-C++ implementation using Gaussian elimination pivot column, and the actual conduct of operations
gauss_original
- 本源代码是数值计算方法的列主元高斯消去法。-Source code is a numerical method of Gaussian elimination pivot column.
cmath
- 选择Cramer算法Gauss列主元Gauss全主元组及Doolittle算法解方程组-Select the pivot column Cramer Gauss algorithm Gauss pivot the whole group and Doolittle algorithm for solving equations
GAUSS1
- 列主元高斯消元法，可以求解线性方程组，简单易用-Column pivot Gauss elimination method, can solve linear equations, simple to use
sparsematrix
- 求解大型对称或非对称方程组，采用稀疏矩阵存储及求解算法，在电力系统仿真分析软件中得到应用-Sparse1.3 is a flexible package of subroutines written in C used to quickly and accurately solve large sparse systems of linear equations. The package is able to handle arbitrary real and complex
quicsort
- QUICK SORT ALORITHM THAT USES RANDOM NUMBERS AS PIVOT THUS GIVES DIFFERENT RESULTS THAN COMMON ALGORITHM
untitled27
- ///Simplex Method/// Let a linear program be given by a canonical tableau. The simplex algorithm proceeds by performing successive pivot operations which each give an improved basic feasible solution the choice of pivot element at each step is larg