Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/31815
Nаziv: | An algorithm for computing minimal Geršgorin sets | Аutоri: | Kostić Vladimir Miedlar Agnieszka Cvetković Ljiljana |
Dаtum izdаvаnjа: | 2016 | Čаsоpis: | Numerical Linear Algebra with Applications | Sažetak: | © 2015 John Wiley & Sons, Ltd. Summary: The existing algorithms for computing the minimal Geršgorin set are designed for small and medium size (irreducible) matrices and based on Perron root computations coupled with bisection method and sampling techniques. Here, we first discuss the drawbacks of the existing methods and present a new approach based on the modified Newton's method to find zeros of the parameter dependent left-most eigenvalue of a Z-matrix and a special curve tracing procedure. The advantages of the new approach are presented on several test examples that arise in practical applications. Copyright | URI: | https://open.uns.ac.rs/handle/123456789/31815 | ISSN: | 1070-5325 | DOI: | 10.1002/nla.2024 |
Nаlаzi sе u kоlеkciјаmа: | PMF Publikacije/Publications |
Prikаzаti cеlоkupаn zаpis stаvki
SCOPUSTM
Nаvоđеnjа
1
prоvеrеnо 29.04.2023.
Prеglеd/i stаnicа
18
Prоtеklа nеdеljа
1
1
Prоtеkli mеsеc
0
0
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.