Minimal sets alternative to minimal Geršgorin sets

DOI10.1016/J.APNUM.2009.09.005MaRDI QIDQ972311zbMATH OpenOpenAlexFDO

Authors Ljiljana Cvetković, J. M. Peña

Publication date 25 May 2010

Published in Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apnum.2009.09.005

zbMATH Keywords

eigenvalue localizationGeršgorin theoremminimal Geršgorin set

Mathematics Subject Classification ID

Inequalities involving eigenvalues and eigenvectors (15A42) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• Between Geršgorin and minimal Geršgorin sets
• Minimal Gerschgorin sets for partitioned matrices. II: The spectral conjecture
• An algorithm for computing minimal Geršgorin sets.
• A minimal Gerschgorin set for eigenvalues of matrices
• On an alternative to Gerschgorin circles and ovals of Cassini

Cites work

• \(H\)-matrix theory vs. eigenvalue localization
• A class of P-matrices with applications to the localization of the eigenvalues of a real matrix
• A new Geršgorin-type eigenvalue inclusion set
• Between Geršgorin and minimal Geršgorin sets
• Doubly diagonally dominant matrices
• scientific article; zbMATH DE number 2120941 (Why is no real title available?)
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• Minimal Gerschgorin sets
• New criteria for identifying \(H\)-matrices
• On an alternative to Gerschgorin circles and ovals of Cassini
• On some subclasses ofP-matrices
• Refining Gerschgorin disks through new criteria for nonsingularity

Cited in

(14)

• Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems
• Some classes of nonsingular matrices and applications
• On general principles of eigenvalue localizations via diagonal dominance
• Between Geršgorin and minimal Geršgorin sets
• New error bounds for the linear complementarity problem with an \(SB\)-matrix
• A minimal Gerschgorin set for eigenvalues of matrices
• Error bounds for linear complementarity problems involving \(B^S\)-matrices
• scientific article; zbMATH DE number 6473234 (Why is no real title available?)
• An algorithm for computing minimal Geršgorin sets.
• An implicit algorithm for computing the minimal Geršgorin set
• New error bounds for linear complementarity problems for B^S-matrices
• The dominant degree for Schur complement of \(S\)-strictly diagonally dominant matrix and its applications
• An alternative error bound for linear complementarity problems involving \(B^{S}\)-matrices
• Approximation of the minimal Geršgorin set of a square complex matrix

This page was built for publication: Minimal sets alternative to minimal Geršgorin sets

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