An implicit algorithm for computing the minimal Gersgorin set

DOI10.2298/FIL1913229MzbMath1499.65128OpenAlexW3008811877WikidataQ122781498 ScholiaQ122781498MaRDI QIDQ5863929

S. Milićević, Ljiljana Cvetković, Vladimir R. 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

M-matrixeigenvalue localizationLU decompositionminimal Geršgorin set

Mathematics Subject Classification ID

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

Related Items (1)

On localization of the eigenvalues of matrices "close" to triangular ones

Uses Software

• MatrixMarket

Cites Work

• A Newton-based method for the calculation of the distance to instability
• Photonic band structure calculations using nonlinear eigenvalue techniques
• On general principles of eigenvalue localizations via diagonal dominance
• Minimal Gerschgorin sets
• Unnamed Item
• Unnamed Item

This page was built for publication: An implicit algorithm for computing the minimal Gersgorin set