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

zbMATH Open0857.15009MaRDI QIDQ1920175FDOQ1920175

Alan Krautstengl, Richard S. Varga

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

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

zbMATH Keywords

monotonicityspectral conjecturepartitioned matricesminimal Gerschgorin setssharpness of boundaries

Mathematics Subject Classification ID

Inequalities involving eigenvalues and eigenvectors (15A42)

Cited In (3)

• Minimal Gerschgorin sets for partitioned matrices. II: The spectral conjecture
• Nonsingularity/singularity criteria for nonstrictly block diagonally dominant matrices.
• Title not available (Why is that?)

   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 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A Convex Approach to Minimal Partitions 👍 👎

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)