DIVIDE-AND-CONQUER ALGORITHMS FOR THE BANDSYMMETRIC EIGENVALUE PROBLEM

被引：20
|
作者：
ARBENZ, P
机构：
[1] ETH Zentrum, Institut für Wissenschaftliches Rechnen
来源：
PARALLEL COMPUTING | 1992年 / 18卷 / 10期
关键词：
EIGENVALUE PROBLEM; SYMMETRICAL BAND MATRIX; DIVIDE AND CONQUER ALGORITHM;
D O I：
10.1016/0167-8191(92)90059-G
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Divide and conquer algorithms are formulated for the solution of the eigenvalue Problem for symmetric band matrices. The new algorithms are compared to the traditional solution paths offered by EISPACK, tridiagonalization of the band matrix followed by the tridiagonal QR algorithm.
引用
收藏
页码：1105 / 1128
页数：24
相关论文
共 50 条
  • [41] A Parallel Structured Divide-and-Conquer Algorithm for Symmetric Tridiagonal Eigenvalue Problems
    Liao, Xia
    Li, Shengguo
    Lu, Yutong
    Roman, Jose E.
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2021, 32 (02) : 367 - 378
  • [42] AN ACCELERATED DIVIDE-AND-CONQUER ALGORITHM FOR THE BIDIAGONAL SVD PROBLEM
    Li, Shengguo
    Gu, Ming
    Cheng, Lizhi
    Chi, Xuebin
    Sun, Meng
    [J]. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2014, 35 (03) : 1038 - 1057
  • [43] A divide-and-conquer strategy in shape from shading problem
    Cho, SI
    Saito, H
    Ozawa, S
    [J]. 1997 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, PROCEEDINGS, 1997, : 413 - 419
  • [44] SUPERFAST DIVIDE-AND-CONQUER METHOD AND PERTURBATION ANALYSIS FOR STRUCTURED EIGENVALUE SOLUTIONS
    Vogel, James
    Xia, Jianlin
    Cauley, Stephen
    Balakrishnan, Venkataramanan
    [J]. SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2016, 38 (03): : A1358 - A1382
  • [45] A PRACTICAL DIVIDE-AND-CONQUER ALGORITHM FOR THE RECTANGLE INTERSECTION PROBLEM
    GUTING, RH
    SCHILLING, W
    [J]. INFORMATION SCIENCES, 1987, 42 (02) : 95 - 112
  • [46] Provably Good Multicore Cache Performance for Divide-and-Conquer Algorithms
    Blelloch, Guy E.
    Chowdhury, Rezaul A.
    Gibbons, Phillip B.
    Ramachandran, Vijaya
    Chen, Shimin
    Kozuch, Michael
    [J]. PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2008, : 501 - +
  • [47] RANDOMIZED DIVIDE-AND-CONQUER: IMPROVED PATH, MATCHING, AND PACKING ALGORITHMS
    Chen, Jianer
    Kneis, Joachim
    Lu, Songjian
    Moelle, Daniel
    Richter, Stefan
    Rossmanith, Peter
    Sze, Sing-Hoi
    Zhang, Fenghui
    [J]. SIAM JOURNAL ON COMPUTING, 2009, 38 (06) : 2526 - 2547
  • [48] Automated transformation of sequential divide-and-conquer algorithms into parallel programs
    Freisleben, B
    Kielmann, T
    [J]. COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1995, 14 (06): : 579 - 596
  • [49] Tree-Based Hardware Recursion for Divide-and-Conquer Algorithms
    Morrison, Braeden
    Lukowiak, Marcin
    [J]. PROCEEDINGS OF THE 28TH INTERNATIONAL CONFERENCE MIXED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS (MIXDES 2021), 2021, : 147 - 152
  • [50] ON THE BALANCED DIVIDE-AND-CONQUER EQUATION
    BATAGELJ, V
    [J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1986, 19 (3-4) : 259 - 266
12345