Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/20371
Title: | An implicit algorithm for computing the minimal Geršgorin set | Authors: | Milićević S. Kostić Vladimir R. Cvetković Ljiljana Miedlar Agnieszka |
Issue Date: | 2019 | Journal: | Filomat | Abstract: | © 2019, University of Nis. All rights reserved. In this paper we present a new algorithm for the computation of the minimal Geršgorin set that can be considered an extension of the results from [5]. While the general approach to calculation of the boundary of the minimal Geršgorin set is kept, the core numerical calculation is changed. Namely, the problem is formulated in such a way that the eigenvalue computations are replaced by LU decompositions, allowing the algorithm to be used for larger matrices more efficiently. To illustrate the benefits, we compare both algorithms on several test matrices. | URI: | https://open.uns.ac.rs/handle/123456789/20371 | ISSN: | 0354-5180 | DOI: | 10.2298/FIL1913229M |
Appears in Collections: | PMF Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
1
checked on May 3, 2024
Page view(s)
15
Last Week
11
11
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.