Algorithms for computing the optimal Gersgorin-type localizations-Reference-Cited by-同舟云学术

Algorithms for computing the optimal Gersgorin-type localizations

Published:2023 Issue:30 Volume:37 Page:10395-10413
ISSN:0354-5180
Container-title:Filomat
language:en
Short-container-title:Filomat

Author:

Milicevic S.¹,Kostic V.R.²

Affiliation:

1. Department for Applied fundamental disciplines, Faculty of Technical Sciences, University of Novi Sad, Novi Sad, Serbia

2. Istituto Italiano di Tecnologia, Genova, Italy + Department of Mathematics and Informatics, Faculty of Science, University of Novi Sad, Novi Sad, Serbia

Abstract

In this paper we provide novel algorithms for computing the minimal Gersgorin 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 Gersgorin 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.

Publisher

National Library of Serbia

Reference13 articles.

1. E. L. Allgower and K. Georg, Continuation and path following, Acta numerica, 1-64, 1993.

2. E. L. Allgower and K. Georg, Numerical path following, Colorado State University, 1994.

3. A. Berman and R. Plemmons, Nonnegative Matrices in the Mathematical Sciences, 2014.

4. B. Boisvert, R. Pozzo, K. Remington, B. Miller and R. Lipman, Matrix Market repository, http://math.nist.gov/MatrixMarket/.

5. M. A. Freitag and A. Spence, A Newton-based method for the calculation of the distance to instability, Linear Algebra Appl., 435(12):3189-3205, 2011.