An algorithm for computing minimal Gergorin sets

被引:1
|
作者
Kostic, Vladimir R. [1 ]
Miedlar, Agnieszka [2 ]
Cvetkovic, Ljiljana [1 ]
机构
[1] Univ Novi Sad, Fac Sci, Dept Math & Informat, Trg D Obradovica 4, Novi Sad 21000, Serbia
[2] Tech Univ Berlin, Inst Math, MA 4-5,Str 17 Juni, D-10625 Berlin, Germany
关键词
minimal Gergorin set; eigenvalue localization; curve tracing; GERSGORIN;
D O I
10.1002/nla.2024
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The existing algorithms for computing the minimal Gergorin 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 (c) 2015 John Wiley & Sons, Ltd.
引用
收藏
页码:272 / 290
页数:19
相关论文
共 50 条
  • [41] An Algorithm for Computing Minimal Bidirectional Linear Recurrence Relations
    Salagean, Ana
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (10) : 4695 - 4700
  • [42] Computing minimal elements of upward-closed sets for Petri nets
    Yen, Hsu-Chun
    Chen, Chien-Liang
    PETRI NETS AND OTHER MODELS OF CONCURRENCY - ICATPN 2007, 2007, 4546 : 465 - +
  • [43] An optimization algorithm for computing the minimal test set of circuits
    Wang, YY
    Lu, CH
    ICEMI 2005: CONFERENCE PROCEEDINGS OF THE SEVENTH INTERNATIONAL CONFERENCE ON ELECTRONIC MEASUREMENT & INSTRUMENTS, VOL 3, 2005, : 707 - 711
  • [44] An algorithm for computing a Pade approximant with minimal degree denominator
    Ibryaeva, O. L.
    Adukov, V. M.
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2013, 237 (01) : 529 - 541
  • [45] Fast Algorithm for Computing the Minimal Polynomials of Gaussian Periods
    He Debiao
    Chen Jianhua
    Hu Zhjin
    SECOND INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN, VOL 1, PROCEEDINGS, 2009, : 166 - 169
  • [46] An Optimization Algorithm for Computing the Minimal Test Set of Circuits
    Lu, Changhua
    Deng, Xiaokang
    Liu, Chun
    Wang, Yong
    2008 INTERNATIONAL SYMPOSIUM ON INTELLIGENT INFORMATION TECHNOLOGY APPLICATION WORKSHOP: IITA 2008 WORKSHOPS, PROCEEDINGS, 2008, : 717 - +
  • [47] Computing minimal extending sets by relation-algebraic modeling and development
    Berghammer, Rudolf
    JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, 2014, 83 (02) : 103 - 119
  • [48] An Algorithm for Computing Minimal Bidirectional Linear Recurrence Relations
    Salagean, Ana
    2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 1746 - 1750
  • [49] An algorithm for computing the diagnoses with minimal cardinality in a distributed system
    Biteus, Jonas
    Nyberg, Mattias
    Frisk, Erik
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2008, 21 (02) : 269 - 276
  • [50] Minimal sets alternative to minimal Gersgorin sets
    Cvetkovic, Lj.
    Pena, J. M.
    APPLIED NUMERICAL MATHEMATICS, 2010, 60 (04) : 442 - 451