Algorithms for computing the optimal Geršgorin-type localizations
Filomat, Tome 37 (2023) no. 30, p. 10395
Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
In this paper we provide novel algorithms for computing the minimal Geršgorin set for the localizations of eigenvalues. Two strategies for curve tracing are considered: predictor-corrector and triangular grid approximation. We combine these two strategies with two characterizations (explicit and implicit) of the Minimal Geršgorin set to obtain four new numerical algorithms. We show that these algorithms significantly decrease computational complexity, especially for matrices of large size, and compare them on matrices that arise in practically important eigenvalue problems.
Classification :
65F15, 15A18
Keywords: eigenvalue localization, minimal Geršgorin set, predictor-corrector method, triangular grid
Keywords: eigenvalue localization, minimal Geršgorin set, predictor-corrector method, triangular grid
S Milićević; V R Kostić. Algorithms for computing the optimal Geršgorin-type localizations. Filomat, Tome 37 (2023) no. 30, p. 10395 . doi: 10.2298/FIL2330395M
@article{10_2298_FIL2330395M,
author = {S Mili\'cevi\'c and V R Kosti\'c},
title = {Algorithms for computing the optimal {Ger\v{s}gorin-type} localizations},
journal = {Filomat},
pages = {10395 },
year = {2023},
volume = {37},
number = {30},
doi = {10.2298/FIL2330395M},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.2298/FIL2330395M/}
}
Cité par Sources :