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
来源：
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS | 2016年 / 23卷 / 02期
关键词：
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 条
  • [31] Computing minimal hitting sets with CHS-tree method
    Wang, Xiao
    Zhao, Xiang-Fu
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2014, 20 (02): : 401 - 406
  • [32] Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets
    Júlio Araújo
    Marin Bougeret
    Victor A. Campos
    Ignasi Sau
    Algorithmica, 2023, 85 : 444 - 491
  • [33] Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets
    Araujo, Julio
    Bougeret, Marin
    Campos, Victor A.
    Sau, Ignasi
    ALGORITHMICA, 2023, 85 (02) : 444 - 491
  • [34] Extraction of minimal decision algorithm using rough sets and genetic algorithm
    Hirokane, Michiyuki
    Konishi, Hideyuki
    Miyamoto, Ayaho
    Nishimura, Fumihiro
    Systems and Computers in Japan, 2007, 38 (04) : 39 - 51
  • [35] Algorithm for finding minimal cut sets in a fault tree
    Rosenberg, L
    RELIABILITY ENGINEERING & SYSTEM SAFETY, 1996, 53 (01) : 67 - 71
  • [36] Novel Algorithm to Solve the Minimal Hitting Sets in MBD
    Xu, Jianfang
    Liu, Zhigang
    2014 IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS (FUZZ-IEEE), 2014, : 1150 - 1155
  • [37] Algorithm for finding minimal cut sets in a fault tree
    Comenius Univ, Bratistava, Slovakia
    Reliab Eng Syst Saf, 1 (67-71):
  • [38] Probabilistic Algorithm for Computing the Dimension of Real Algebraic Sets
    Bannwarth, Ivan
    El Din, Mohab Safey
    PROCEEDINGS OF THE 2015 ACM ON INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION (ISSAC'15), 2015, : 37 - 44
  • [39] Polynomial-time algorithm for computing bound sets
    Krenz, R.
    Dubrova, E.
    IEE PROCEEDINGS-CIRCUITS DEVICES AND SYSTEMS, 2006, 153 (02): : 179 - 184
  • [40] AN ALGORITHM FOR COMPUTING THE NUMBER OF THE MINIMAL PATHS IN DIGITAL IMAGES
    DAS, PP
    PATTERN RECOGNITION LETTERS, 1989, 9 (02) : 107 - 116
12345