搜索资源列表
LU
- 1． Using LU factorization method to solve the following tri-diagonal system for n=10 and 100
UMFPACK
- UMFPACK: unsymmetric multifrontal sparse LU factorization package
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
KLU-1.1.0.tar
- 对稀疏矩阵进行LU分解，可用于电路仿真、FEM求解等 C语言-KLU is a sparse LU factorization algorithm well-suited for use in circuit simulation. KLU is a sparse LU factorization algorithm well-suited for use in circuit simulation. It was highlighted in the May 2007 issue of SIA
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*.
doolittle
- LU分解在本质上是高斯消元法的一种表达形式。实质上是将A通过初等行变换变成一个上三角矩阵，其变换矩阵就是一个单位下三角矩阵。这正是所谓的杜尔里特算法（Doolittle algorithm）：从下至上地对矩阵A做初等行变换，将对角线左下方的元素变成零，然后再证明这些行变换的效果等同于左乘一系列单位下三角矩阵，这一系列单位下三角矩阵的乘积的逆就是L矩阵，它也是一个单位下三角矩阵。 这类算法的复杂度一般在左右，对充分消元的分解则不然。 -LU decomposition is esse
LU
- In linear algebra, LU decomposition (also called LU factorization) is a matrix decomposition which writes a matrix as the product of a lower triangular matrix and an upper triangular matrix. The product sometimes includes a permutation matrix as well
slv
- TCodes, for Tcodes,...LU factorization to solve AX=B
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
- 纯OpenMP实现LU分解的并行算法，包含代码和运行结果-Pure OpenMP implementation of parallel LU factorization algorithm, including the results of the code and run
LU-factorization
- 实现矩阵的LU最大主元分解，方便快捷有效，可以查看分解过程，适合初学者-Achieve maximum principal component matrix LU decomposition, convenient and effective, you can view the decomposition process, suitable for beginners
lu
- 数值代数的LU分解c++实现 数值代数的LU分解c++实现-LU factorization LU factorization LU factorization LU factorization LU factorization LU factorization LU factorization
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