搜索资源列表
spgs
- 用途：利用二分法快速求解非线性方程f(x) = 0； 用向量形式（普通存储格式）的Gauss-Seidel迭代解线性方程组Ax=b；Newton迭代法解非线性方程f(x) = 0；用分量形式的SOR迭代解线性方程组Ax=b；用向量（稀疏存储）形式的Gauss-Seidel迭代解线性方程组Ax=b -Purposes: the use of dichotomy quickly solving nonlinear equations f (x) = 0 with vector form o
Crout_Solve
- Solve Ax=B with Crout s method
ww
- Modify the Matlab Gauss Elimination routine given in lectures so that it (a) performs implicit complete pivoting, and (b) handles m right hand sides at once by performing an LU decomposition of the matrix A first and then doing forward substitu
UMFPACK
- UMFPACK是求解线性方程组AX=B的函数库,其使用非常简单-UMFPACK is a set of routines for solving unsymmetric sparse linear systems, Ax=b, using the Unsymmetric MultiFrontal method.
jacobi
- Write an MPI program that solves a set of linear equations Ax = b with the 并行计算 Jacobi method. The root process reads the matrix A and the vector b from files. The file names have to be specified by the user as parameters.-Write an MPI p
homework1
- :用列主元Gauss消去法解线性方程组Ax=b,-: The Principal out Gauss elimination method solution of linear equations Ax = b,
homework4
- 题：用Jacobi和Gauss-Seidel方法解线性方程组Ax=b-Title: The Jacobi and Gauss-Seidel method to solve linear equations Ax = b
maseidel
- 用Gauss-Seidel迭代法解线性方程组Ax=b， A为系数矩阵，b为右端向量-Using Gauss-Seidel iteration method for solving linear equations Ax = b, A as the coefficient matrix, b is the right end of the vector
majacobi
- 用Jacobi迭代法解线性方程组Ax=b，A为系数矩阵，b为右端向量-Solution using Jacobi iterative method of linear equations Ax = b, A as the coefficient matrix, b is the right end of the vector
art
- 用于解反问题的代数重建法，对于Ax=b，输入矩阵A，列向量b，以及迭代步数k，可求的列向量x-Algebraic solution of the inverse problem for the reconstruction of France, for Ax = b, the input matrix A, the column vector b, as well as the number of iterations k, rectifiable column vector x
cgls
- 用于解反问题的共轭梯度法，对于Ax=b，输入矩阵A，列向量b，以及迭代步数k，可求的列向量x-Solution of inverse problems for the conjugate gradient method, for Ax = b, the input matrix A, the column vector b, as well as the number of iterations k, rectifiable column vector x
mr2
- 用于解反问题的算法，对于Ax=b，输入矩阵A，列向量b，以及迭代步数k，可求的列向量x-The algorithm for solution of the inverse problem, for Ax = b, the input matrix A, the column vector b, as well as the number of iterations k, rectifiable column vector x
nu
- 用于解反问题的算法，对于Ax=b，输入矩阵A，列向量b，以及迭代步数k，可求的列向量x-The algorithm for solution of the inverse problem, for Ax = b, the input matrix A, the column vector b, as well as the number of iterations k, rectifiable column vector x
LSQR
- 采用CG法求解稀疏不对称的Ax=b-Implementation of a conjugate-gradient type method for solving sparse linear equations and sparse least-squares problems: Solve Ax = b or minimize || Ax- b ||2 or minimize || Ax- b ||2+ d2 ||x||2. The matrix A may be squ
MINRES
- 采用CG法求解稀疏对称奇异矩阵得到的Ax=b-Implementation of a conjugate-gradient type method for solving sparse linear equations: Solve Ax = b or (A- sI)x = b. The matrix A- sI must be symmetric but it may be definite or indefinite or singular. The scalar s is a
SYMMLQ
- 采用CG法求解稀疏对称非奇异矩阵得到的线性系统Ax=b-Implementation of a conjugate-gradient type method for solving sparse linear equations: Solve Ax = b or (A- sI)x = b. The matrix A- sI must be symmetric and nonsingular, but it may be definite or indefinite. The scal
GroupSparseBox_V2
- Approximate Greedy Solutions to the problem min||x(k)||_2,0 such that Ax = b
Linear
- 一元线性回归曲线 y=ax+b,求解出a b 和相关系数r-Unary linear regression curve y = ax+ b, solving out of ab and the correlation coefficient r
LS
- 利用Fortran程式計算平面座標上各點的最適線，其座標上各點到此線段的距離為最小，此法稱為最小方差法，InputX及InputY分別為平面座標上各點的X座標及Y座標，輸入完成後，執行LS.EXE，接著在輸入所要計算的線段的最高次方，以及座標點的個數即可，接著程式便會產生一個OUTPUT，內容從上而下分別為最高次方項至常數項，舉例來說，若最高次方項為2。則計算出的結果第一項便為y=ax+b的a，第二行便為b`.-Fortran program using the calculation plan
jtest
- Funzione: jtest --------------- Stabilisce se il metodo di Jacobi converge alla soluzione esatta del sistema lineare Ax = b di cui è data la matrice A Prototipo: [bool,iter] = jtest(A,m) Input: La matrice dei coefficienti A Il