搜索资源列表
GEE
- The "GEE! It s Simple" package illustrates Gaussian elimination with partial pivoting, which produces a factorization of P*A into the product L*U where P is a permutation matrix, and L and U are lower and upper triangular, respectively. The fu
ldiv
- The "GEE! It s Simple" package illustrates Gaussian elimination with partial pivoting, which produces a factorization of P*A into the product L*U where P is a permutation matrix, and L and U are lower and upper triangular, respectively. The fu
superlu_3.1.tar
- SuperLU is a general purpose library for the direct solution of large, sparse, nonsymmetric systems of linear equations on high performance machines. The library is written in C and is callable from either C or Fortran. The library routines will perf
Gauss_E_Pivoting
- Gaussian Elimination with partial pivoting (LU factorization)
tridiagSolvers
- tridiagLU Obtain the LU factorization of a tridiagonal matrix-tridiagLU Obtain the LU factorization of a tridiagonal matrix
plu
- Rectangular PA=LU factorization *with row exchanges*.
slu
- LU factorization of a square matrix using *no row exchanges*.
splu
- Square PA=LU factorization *with row exchanges*.
CGandLU
- compare CG iterations and LU factorization when solving linear equation A*X=b
LU
- 利用高斯消元列选主元法进行矩阵的LU分解和利用此分解解线性方程组-LU matrix factorization and use this decomposition of Linear Equations
smartinv
- 通过求解LU分解解线性方程组 大型稀疏矩阵LU分解有用的是容易计算的。不是最快的方式来计算逆矩阵，但要避免消耗储存的问题-computing selected entries of the inverse, by solving a sequence of linear equations after doing an LU factorization. Useful for large sparse matrix which LU decomposition is easy to c
doolittle
- LU分解在本质上是高斯消元法的一种表达形式。实质上是将A通过初等行变换变成一个上三角矩阵，其变换矩阵就是一个单位下三角矩阵。这正是所谓的杜尔里特算法（Doolittle algorithm）：从下至上地对矩阵A做初等行变换，将对角线左下方的元素变成零，然后再证明这些行变换的效果等同于左乘一系列单位下三角矩阵，这一系列单位下三角矩阵的乘积的逆就是L矩阵，它也是一个单位下三角矩阵。 这类算法的复杂度一般在左右，对充分消元的分解则不然。 -LU decomposition is esse
slv
- TCodes, for Tcodes,...LU factorization to solve AX=B
LU_factor.m
- Method with Gaussian Elimination without Pivoting LU factorization of matrix A using Gaussian-elimination without pivoting Inputs : A --> n x n matrix Outputs : L (lower triangular) && U (upper triangular) - Method with Gaussi
linearsystem
- Chapter 3. The Solution of Linear Systems AX = B Algorithm 3.1 Back Substitution Algorithm 3.2 Upper-Triangularization Followed by Back Substitution Algorithm 3.3 PA = LU Factorization with Pivoting Algorithm 3.4 Jacobi Iteration Al
LU-factorization
- LU分解的过程演示，本人原创，测试无误，内含详细注释。-LU decomposition procedure demonstrates I originality, test correct, containing detailed notes.
LU
- 这是matlab中进行矩阵LU分解的代码。是一个包，集合了模拟LU分解所需的函数文件。-A function for matrix LU factorization.This is the first function.There are another three function named "bslashtx","forward","backsubs".
LU_DecomME1
- MATLAB 数值分析，矩阵分解实例，LU分解-MATLAB numerical analysis, matrix factorization example, LU decomposition
LU-factorization
- 实现矩阵的LU最大主元分解，方便快捷有效，可以查看分解过程，适合初学者-Achieve maximum principal component matrix LU decomposition, convenient and effective, you can view the decomposition process, suitable for beginners
LU-Factorization
- The function decomposes the matrix A into a lower triangular matrix L and an upper triangular matrix U, using Crout s method such that A=LU. Input variables: A The matrix of coefficients. Output variable: L Lower triangular matrix. U Uppe