Gaussian elimination is stable for the inverse of a diagonally dominant matrix

DOI10.1090/S0025-5718-03-01591-6zbMath1050.65024OpenAlexW2003508782MaRDI QIDQ4452154

Khakim D. Ikramov, Alan George

Publication date: 12 February 2004

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-03-01591-6

zbMATH Keywords

stabilityGaussian eliminationdiagonally dominant matrix

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (4)

Factoring symmetric totally nonpositive matrices and inverses with a diagonal pivoting method ⋮ The Bunch-Kaufman factorization of symmetric matrices signature similar to sign regular matrices ⋮ On diagonal dominance of FEM stiffness matrix of fractional Laplacian and maximum principle preserving schemes for the fractional Allen-Cahn equation ⋮ Block LU factorization is stable for block matrices whose inverses are block diagonally dominant

Uses Software

• mctoolbox

Cites Work

• Unnamed Item
• Backward error analysis for linear systems associated with inverses of H- matrices
• The inverse M-matrix problem
• Matrix Analysis
• Factorizing complex symmetric matrices with positive definite real and imaginary parts
• A Time Series Approach to Numerical Differentiation
• Note on Bounds for Determinants with Dominant Principal Diagonal

This page was built for publication: Gaussian elimination is stable for the inverse of a diagonally dominant matrix