A sparsity for decomposing a symmetric matrix

DOI10.1016/0898-1221(93)90201-6zbMath0778.65019OpenAlexW2062907060MaRDI QIDQ2365956

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)90201-6

zbMATH Keywords

complexity779decompositionsparse matricesdirect methodsymmetric matrixmatrix inversion

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)

Extended concept of stair-shape sparsity for the inverse of an asymmetric matrix ⋮ A sparse approximate inverse preconditioner for parallel preconditioning of general sparse matrices ⋮ An optimum partition for inverting a nonsingular matrix

Cites Work

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

This page was built for publication: A sparsity for decomposing a symmetric matrix