Extended concept of stair-shape sparsity for the inverse of an asymmetric matrix

DOI10.1016/0898-1221(93)90204-9zbMath0778.65018OpenAlexW1967452912MaRDI QIDQ2365959

Jenn-Ching Luo

Publication date: 29 June 1993

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(93)90204-9

zbMATH Keywords

complexitydecompositiondirect methodsmatrix inversionasymmetric matrixstair-shape sparsity

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (3)

A sparse approximate inverse preconditioner for parallel preconditioning of general sparse matrices ⋮ An optimum partition for inverting a nonsingular matrix ⋮ Multigrid treatment and robustness enhancement for factored sparse approximate inverse preconditioning

Cites Work

• A new class of decomposition for symmetric systems
• A new class of decomposition for inverting asymmetric and indefinite matrices
• A sparsity for decomposing a symmetric matrix
• Unnamed Item

This page was built for publication: Extended concept of stair-shape sparsity for the inverse of an asymmetric matrix