An optimum partition for inverting a nonsingular matrix

DOI10.1016/0893-9659(93)90106-WzbMath0782.65043OpenAlexW2015425790MaRDI QIDQ1312047

Jenn-Ching Luo

Publication date: 19 January 1994

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(93)90106-w

zbMATH Keywords

complexitymatrix inversionblock partitioneconomical partitionoptimum partition

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Analysis of round-off errors
• A proof in favor of block-based procedure
• 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
• Extended concept of stair-shape sparsity for the inverse of an asymmetric matrix
• Gaussian elimination is not optimal

This page was built for publication: An optimum partition for inverting a nonsingular matrix