

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. © 2023, University of Nis. All rights reserved.
| Funding sponsor | Funding number | Acronym |
|---|---|---|
| 174019 |
The work of S. Milicevi\u0107 and V. R. Kosti\u0107 has been partially supported by the Ministry of Science, Research Grant 174019, Provincial Secretariat for Science of Vojvodina, Research Grants 1136, 1850 and 2010.
2020 Mathematics Subject Classification. Primary 65F15; Secondary 15A18 Keywords. eigenvalue localization, minimal Gers\u02C7gorin set, predictor-corrector method, triangular grid Received: 05 June 2021; Accepted: 10 June 2023 Communicated by Marko Petkovi\u0107 Research supported the Ministry of Science, Research Grant 174019, Provincial Secretariat for Science of Vojvodina, Research Grants 1136, 1850 and 2010. Email addresses: [email protected] (S. Mili\u0107evi\u0107), [email protected], [email protected] (V. R. Kosti\u0107)
© Copyright 2024 Elsevier B.V., All rights reserved.