On asymmetric implicit hierarchical forms of the inverse of sparse matrices (Q1089720)
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: On asymmetric implicit hierarchical forms of the inverse of sparse matrices |
scientific article; zbMATH DE number 4005437
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On asymmetric implicit hierarchical forms of the inverse of sparse matrices |
scientific article; zbMATH DE number 4005437 |
Statements
On asymmetric implicit hierarchical forms of the inverse of sparse matrices (English)
0 references
1987
0 references
A general scheme for the factorization of a sparse nonsymmetric matrix is presented. It is shown that as particular cases this scheme includes Gaussian elimination with (or without) block triangularization, nested dissection and many others. A version of the factorization allows to obtain a compromise between fill-in and number of computations. It is used to find the inverse of a sparse matrix and to solve a sparse linear system of equations.
0 references
LU decomposition
0 references
factorization
0 references
sparse nonsymmetric matrix
0 references
Gaussian elimination
0 references
block triangularization
0 references
nested dissection
0 references
number of computations
0 references
inverse
0 references
0.8051902651786804
0 references
0.7640942335128784
0 references
0.7627987265586853
0 references
