Minimal sets alternative to minimal Geršgorin sets
From MaRDI portal
Publication:972311
DOI10.1016/J.APNUM.2009.09.005zbMATH Open1195.15021OpenAlexW2010866132MaRDI QIDQ972311FDOQ972311
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
Recommendations
Inequalities involving eigenvalues and eigenvectors (15A42) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cites Work
- A class of \(P\)-matrices with applications to the localization of the eigenvalues of a real matrix
- Title not available (Why is that?)
- \(H\)-matrix theory vs. eigenvalue localization
- Title not available (Why is that?)
- A new Geršgorin-type eigenvalue inclusion set
- On an alternative to Gerschgorin circles and ovals of Cassini
- Doubly diagonally dominant matrices
- Minimal Gerschgorin sets
- Between Geršgorin and minimal Geršgorin sets
- New criteria for identifying \(H\)-matrices
- On some subclasses ofP-matrices
- Refining Gerschgorin disks through new criteria for nonsingularity
Cited In (14)
- Error bounds for linear complementarity problems involving \(B^S\)-matrices
- The dominant degree for Schur complement of \(S\)-strictly diagonally dominant matrix and its applications
- Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems
- A minimal Gerschgorin set for eigenvalues of matrices
- Between Geršgorin and minimal Geršgorin sets
- An implicit algorithm for computing the minimal Geršgorin set
- On general principles of eigenvalue localizations via diagonal dominance
- Title not available (Why is that?)
- Some classes of nonsingular matrices and applications
- New error bounds for the linear complementarity problem with an \(SB\)-matrix
- Approximation of the minimal Geršgorin set of a square complex matrix
- New error bounds for linear complementarity problems for \(B^S\)-matrices
- An alternative error bound for linear complementarity problems involving \(B^{S}\)-matrices
- An algorithm for computing minimal Geršgorin sets.
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)