Algorithm for checking S-SDD matrices

MaRDI QIDQ3371279zbMATH OpenFDO

Authors Nenad Morača, Ljiljana Cvetković

Publication date 21 February 2006

zbMATH Keywords

algorithm\(H\)-matricesnonsingularitystrictly diagonally dominant matrixS-SDD matrices

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• Subdirect sums of SDD\(_1\) matrices
• Diagonal dominance, Schur complements and some classes of H-matrices and P-matrices
• On \(\mathrm{SDD}_1\) matrices
• An interleaved iterative criterion for \(H\)-matrices
• Simple criteria for generalized diagonally dominant matrices

Cited in

(3)

• \(H\)-matrix theory vs. eigenvalue localization
• Selecting algorithms for black box matrices, checking for matrix properties that can simplify computations
• Upper bounds for the infinity norm of the inverse of SDD and \(\mathcal S\)-SDD matrices

This page was built for publication: Algorithm for checking S-SDD matrices

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