On the Condition of Symmetric Quasi-Definite Matrices

DOI10.1137/S0895479898333247MaRDI QIDQ4943671zbMATH OpenOpenAlexFDO

Authors Alan George, Kh. D. Ikramov

Publication date 19 March 2000

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895479898333247

zbMATH Keywords

algorithmscondition numbersGaussian eliminationleast squares problemsreorderingsparse systemssparsity preserving methodssymmetric quasi-definite matrices

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50)

Recommendations

• scientific article; zbMATH DE number 2115912
• Symmetric Quasidefinite Matrices
• Iterative solution of symmetric quasi-definite linear systems
• scientific article; zbMATH DE number 3888795
• ``Compress and Eliminate” Solver for Symmetric Positive Definite Sparse Matrices

Cited in

(6)

• On symmetric matrices with indeterminate leading diagonals
• Some Properties of Symmetric Quasi-Definite Matrices
• scientific article; zbMATH DE number 2115912 (Why is no real title available?)
• Necessary and sufficient conditions for robust D-symmetrizability of matrices
• Adaptive block algebraic multigrid method for multiphysics problems
• Equivalent conditions for noncentral generalized Laplacianness and independence of matrix quadratic forms

This page was built for publication: On the Condition of Symmetric Quasi-Definite Matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943671)