An implicit algorithm for computing the minimal Geršgorin set

DOI10.2298/FIL1913229MMaRDI QIDQ5863929zbMATH OpenOpenAlexWikidataFDO

Authors S. Milićević, Ljiljana Cvetković, Vladimir Kostić, Agnieszka Miedlar

Publication date 3 June 2022

Published in Filomat (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/fil1913229m

zbMATH Keywords

eigenvalue localizationLU decompositionM-matrixminimal Geršgorin set

Mathematics Subject Classification ID

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

Recommendations

• An algorithm for computing minimal Geršgorin sets.
• Between Geršgorin and minimal Geršgorin sets
• Minimal sets alternative to minimal Geršgorin sets
• Minimal Gerschgorin sets for partitioned matrices. III: Sharpness of boundaries and monotonicity as a function of the partition
• Approximation of the minimal Geršgorin set of a square complex matrix

Cites work

• A Newton-based method for the calculation of the distance to instability
• scientific article; zbMATH DE number 734901 (Why is no real title available?)
• scientific article; zbMATH DE number 2120941 (Why is no real title available?)
• Minimal Gerschgorin sets
• On general principles of eigenvalue localizations via diagonal dominance
• Photonic band structure calculations using nonlinear eigenvalue techniques

Cited in

(4)

• Between Geršgorin and minimal Geršgorin sets
• A Generic Program for Minimal Subsets with Applications
• An algorithm for computing minimal Geršgorin sets.
• On localization of the eigenvalues of matrices "close" to triangular ones

Describes a project that uses

Uses Software

• MatrixMarket

This page was built for publication: An implicit algorithm for computing the minimal Geršgorin set

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