An algorithm for computing minimal Geršgorin sets

DOI10.1002/nla.2024zbMath1413.65098OpenAlexW1946680893MaRDI QIDQ5739761

Ljiljana Cvetković, Vladimir R. Kostić, Agnieszka Miedlar

Publication date: 19 July 2016

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.2024

zbMATH Keywords

eigenvalue localizationminimal Geršgorin setcurve tracing

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (1)

On the Geršgorin-type localizations for nonlinear eigenvalue problems

Uses Software

• Matlab
• MatrixMarket

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple generalization of Geršgorin's theorem
• On general principles of eigenvalue localizations via diagonal dominance
• On eigenvalues of matrices dependent on a parameter
• Between Geršgorin and minimal Geršgorin sets
• Minimal Gerschgorin sets
• Bounds for characteristic roots of matrices
• Feedback Systems

This page was built for publication: An algorithm for computing minimal Geršgorin sets