Minimal sets alternative to minimal Geršgorin sets
Localization regions for the real eigenvalues or the real parts of the eigenvalues of a given real matrix \(A\) were studied by \textit{J. M. Penã} [SIAM J. Matrix Anal. Appl. 22, No.~4, 1027--1037 (2001; Zbl 0986.15015)], who introduced the notions of row \(\mathcal B\)-set and \(\mathcal B\)-set. In the present paper the notions of minimal row \(\mathcal B\)-set and minimal \(\mathcal B\)-set are introduced. Comparison is made between the notions with the minimal Geršgorin set. Some properties of the minimal \(\mathcal B\)-set are obtained via a new function.
- \(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
- 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)