Description: 稀疏矩阵分解的最好方法之一，LU分解，快速高效的分解矩阵-sparse matrix factorization one of the best ways, LU decomposition, fast and efficient decomposition matrix Platform: |
Size: 142336 |
Author:wang |
Hits:
Description: 用LU分解实现解方程，用visual C++编写，可以使用一下-with factorization of solving equations, using visual C, can use this to s Platform: |
Size: 265216 |
Author:wu |
Hits:
Description: 1． Using LU factorization method to solve the following tri-diagonal system
for n=10 and 100
-1. Using LU factorization method to solve the following tri-diagonal system for n = 10 and 100 Platform: |
Size: 1024 |
Author:吕鹏 |
Hits:
Description: 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 functions in this package are accurate, but they are far slower than their MATLAB equivalents (x=A\b, [L,U,p]=lu(A), and so on). They are presented here merely to illustrate and educate. "Real" production code should use backslash and lu, not this package. Platform: |
Size: 10240 |
Author:Allan KAO |
Hits:
Description: 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 functions in this package are accurate, but they are far slower than their MATLAB equivalents (x=A\b, [L,U,p]=lu(A), and so on). They are presented here merely to illustrate and educate. "Real" production code should use backslash and lu, not this package. Platform: |
Size: 1024 |
Author:Allan KAO |
Hits:
Description: 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 perform an LU decomposition with partial pivoting and triangular system solves through forward and back substitution. The LU factorization routines can handle non-square matrices but the triangular solves are performed only for square matrices. The matrix columns may be preordered (before factorization) either through library or user supplied routines. This preordering for sparsity is completely separate from the factorization. Working precision iterative refinement subroutines are provided for improved backward stability. Routines are also provided to equilibrate the system, estimate the condition number, calculate the relative backward error, and estimate error bounds for the refined solutions. -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 Platform: |
Size: 1955840 |
Author:anfangde |
Hits:
Description: 对稀疏矩阵进行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 SIAM News.
Platform: |
Size: 560128 |
Author:aaq |
Hits:
Description: tridiagLU Obtain the LU factorization of a tridiagonal matrix-tridiagLU Obtain the LU factorization of a tridiagonal matrix Platform: |
Size: 4096 |
Author:hamideh |
Hits:
Description: LU分解在本质上是高斯消元法的一种表达形式。实质上是将A通过初等行变换变成一个上三角矩阵，其变换矩阵就是一个单位下三角矩阵。这正是所谓的杜尔里特算法（Doolittle algorithm）：从下至上地对矩阵A做初等行变换，将对角线左下方的元素变成零，然后再证明这些行变换的效果等同于左乘一系列单位下三角矩阵，这一系列单位下三角矩阵的乘积的逆就是L矩阵，它也是一个单位下三角矩阵。
这类算法的复杂度一般在左右，对充分消元的分解则不然。
-LU decomposition is essentially a Gaussian elimination method expression. A substance is through the primary transformation into an upper triangular matrix, the transformation matrix is a unit lower triangular matrix. This is the so-called Duerlite algorithms (Doolittle algorithm): from the bottom row of the matrix A do elementary transformation, the diagonal elements into the bottom left of zero, and then show the effect of these lines is equivalent to transform the left by a unit lower triangular matrix, this series of unit lower triangular matrix inverse is the product of L matrices, it is also a unit lower triangular matrix. The complexity of these algorithms is generally about the full elimination of the decomposition is not. Platform: |
Size: 1024 |
Author:王伟 |
Hits:
Description: 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. This decomposition is used in numerical analysis to solve systems of linear equations or calculate the determinant of a matrix. Platform: |
Size: 2048 |
Author:James |
Hits:
Description: 这是matlab中进行矩阵LU分解的代码。是一个包，集合了模拟LU分解所需的函数文件。-A function for matrix LU factorization.This is the first function.There are another three function named "bslashtx","forward","backsubs". Platform: |
Size: 3072 |
Author:余思勰 |
Hits:
Description: 纯OpenMP实现LU分解的并行算法，包含代码和运行结果-Pure OpenMP implementation of parallel LU factorization algorithm, including the results of the code and run Platform: |
Size: 31744 |
Author:查修齐 |
Hits:
Description: 实现矩阵的LU最大主元分解，方便快捷有效，可以查看分解过程，适合初学者-Achieve maximum principal component matrix LU decomposition, convenient and effective, you can view the decomposition process, suitable for beginners Platform: |
Size: 2048 |
Author:YeePhon Lae |
Hits:
Description: 数值代数的LU分解c++实现
数值代数的LU分解c++实现-LU factorization LU factorization LU factorization LU factorization LU factorization LU factorization LU factorization Platform: |
Size: 1024 |
Author:Jack |
Hits:
Description: 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 Upper triangular matrix.
Platform: |
Size: 59392 |
Author:Zolo |
Hits:
Search - lu factorization