Description: 本题采用的计算方法为：矩阵的 分解和Cholesky分解。根据Gauss消去法的的矩阵意义，可以将矩阵A分解为一个单位下三角矩阵与一个上三角矩阵的乘积即：即矩阵的LU分解A=LU，进而可以分解为： 的形式。当A为对称矩阵时，A可分解为： 的形式。-that the use of the method of calculating : matrix decomposition and Cholesky decomposition. According to the Gauss elimination of the matrix significance, A matrix can be decomposed into a unit lower triangular matrices and a triangular matrix on the product : that the matrix factorization A = LU, which can be decomposed as follows : form. When A symmetric matrix A can be divided into : form. Platform: |
Size: 1013 |
Author:王明明 |
Hits:
Description: 本题采用的计算方法为：矩阵的 分解和Cholesky分解。根据Gauss消去法的的矩阵意义，可以将矩阵A分解为一个单位下三角矩阵与一个上三角矩阵的乘积即：即矩阵的LU分解A=LU，进而可以分解为： 的形式。当A为对称矩阵时，A可分解为： 的形式。-that the use of the method of calculating : matrix decomposition and Cholesky decomposition. According to the Gauss elimination of the matrix significance, A matrix can be decomposed into a unit lower triangular matrices and a triangular matrix on the product : that the matrix factorization A = LU, which can be decomposed as follows : form. When A symmetric matrix A can be divided into : form. Platform: |
Size: 1024 |
Author:王明明 |
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: 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: 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 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)
Platform: |
Size: 1024 |
Author:Mhdh |
Hits:
Description: 此包包含了众多矩阵处理程序，能够满足矩阵处理的一般要求，由于将各功能分开到不同的“.cpp”文件中，故使用时需要用户自行选取更换合适自己使用的“.cpp”文件。其中，矩阵功能有：输出矩阵、矩阵转置、矩阵归一化、判断矩阵对称、判断矩阵对称正定、全选主元法求矩阵行列式、全选主元高斯(Gauss)消去法求一般矩阵的秩、用全选主元高斯-约当(Gauss-Jordan)消去法计算实(复)矩阵的逆矩阵、用“变量循环重新编号法”法求对称正定矩阵逆、特兰持(Trench)法求托伯利兹(Toeplitz)矩阵逆、实矩阵LU分解、用豪斯荷尔德(Householder)变换对一般m*n阶的实矩阵进行QR分解、对称正定阵的乔里斯基(Cholesky)分解及求其行列式值、一般实矩阵的奇异值分解、广义逆的奇异值分解。-This package contains a number of matrix processing, matrix processing to meet the general requirements, due to the separation of functions to different ". Cpp" file, so the need to use their own user-selected replacement suitable to use ". Cpp" files. Among them, the matrix function: output matrix, the matrix transpose, matrix normalized to determine the matrix symmetric, symmetric positive definite matrix to determine the whole pivoting method for the matrix determinant, full pivoting Gauss (Gauss) elimination method for the general matrix of rank, with full pivoting Gauss- Jordan (Gauss-Jordan) elimination method to calculate the real (complex) inverse of a matrix, with a "variable cycle re-number method" method for the symmetric positive definite matrix inverse, Portland hold (Trench) method for the Tuobo Leeds (Toeplitz) matrix inverse real matrix LU factorization, with high Siheerde (Householder) transformations of the general order of m* n matrix QR decomposition of real symmetr Platform: |
Size: 1077248 |
Author:wuzw |
Hits:
Description: 矩阵分解的C程序 包括有矩阵的LU分解，矩阵的UU分解还有共轭梯度法-Matrix decomposition of the C program, including a matrix LU decomposition, the UU decomposition of the matrix conjugate gradient method Platform: |
Size: 451584 |
Author:平沙沙 |
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 method