Minimal Gerschgorin sets for partitioned matrices. III: Sharpness of boundaries and monotonicity as a function of the partition

MaRDI QIDQ1920175zbMATH OpenFDO

Authors Richard S. Varga, Alan Krautstengl

Publication date 11 March 1997

Published in ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/119045, http://www.emis.de/journals/ETNA/vol.3.1995/

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

minimal Gerschgorin setsmonotonicitypartitioned matricessharpness of boundariesspectral conjecture

Mathematics Subject Classification ID

Inequalities involving eigenvalues and eigenvectors (15A42)

Review text

The authors use the affirmative solution of the spectral conjecture presented in part II [ibid. 3, 66-82 (1995; reviewed above)] to show that the general boundaries of the minimal Gerschgorin sets for partitioned matrices are sharp and these minimal Gerschgorin sets as a function of the partitionings are monotonic.

Recommendations

• Minimal Gerschgorin sets for partitioned matrices. II: The spectral conjecture
• A minimal Gerschgorin set for eigenvalues of matrices
• A Minimax Theorem and a Dulmage–Mendelsohn Type Decomposition for a Class of Generic Partitioned Matrices
• Minimal partitions for \(p\)-norms of eigenvalues
• Sharper bounds and structural results for minimally nonlinear 0-1 matrices
• Approximation of the minimal Geršgorin set of a square complex matrix
• \(\Gamma\)-convergence and numerical analysis: An application to the minimal partition problem
• Gershgorin type sets for eigenvalues of matrix polynomials
• scientific article; zbMATH DE number 4146961
• A Convex Approach to Minimal Partitions

Cited in

(4)

• Nonsingularity/singularity criteria for nonstrictly block diagonally dominant matrices.
• Minimal Gerschgorin sets for partitioned matrices. II: The spectral conjecture
• scientific article; zbMATH DE number 1829551 (Why is no real title available?)
• An implicit algorithm for computing the minimal Geršgorin set

This page was built for publication: Minimal Gerschgorin sets for partitioned matrices. III: Sharpness of boundaries and monotonicity as a function of the partition

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