An algorithm for decomposing a class of matrices into lower and upper triangular matrices (Q923596)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for decomposing a class of matrices into lower and upper triangular matrices |
scientific article; zbMATH DE number 4169957
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for decomposing a class of matrices into lower and upper triangular matrices |
scientific article; zbMATH DE number 4169957 |
Statements
An algorithm for decomposing a class of matrices into lower and upper triangular matrices (English)
0 references
1990
0 references
For a class of almost tridiagonal matrices an efficient algorithm for factoring it into a product of lower and upper \((=LU)\) triangular matrices is presented. Numerical examples are given.
0 references
LU decomposition
0 references
direct method
0 references
almost tridiagonal matrices
0 references
algorithm
0 references
Numerical examples
0 references
