DIVIDE-AND-CONQUER ALGORITHMS FOR THE BANDSYMMETRIC EIGENVALUE PROBLEM

被引:20
|
作者
ARBENZ, P
机构
[1] ETH Zentrum, Institut für Wissenschaftliches Rechnen
关键词
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 条
  • [22] Space-efficient geometric divide-and-conquer algorithms
    Bose, Prosenjit
    Maheshwari, Anil
    Morin, Pat
    Morrison, Jason
    Smid, Michiel
    Vahrenhold, Jan
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2007, 37 (03): : 209 - 227
  • [23] JuliusC: A practical approach for the analysis of divide-and-conquer algorithms
    D'Alberto, P
    Nicolau, A
    [J]. LANGUAGES AND COMPILERS FOR HIGH PERFORMANCE COMPUTING, 2005, 3602 : 117 - 131
  • [24] A sample implementation for parallelizing Divide-and-Conquer algorithms on the GPU
    Mei, Gang
    Zhang, Jiayin
    Xu, Nengxiong
    Zhao, Kunyang
    [J]. HELIYON, 2018, 4 (01):
  • [25] Modeling and simulation of parallel adaptive divide-and-conquer algorithms
    Barros, Fernando J.
    [J]. JOURNAL OF SUPERCOMPUTING, 2008, 43 (03): : 241 - 255
  • [27] Divide-and-conquer algorithms for graph-layout problems
    Swaminathan, R
    [J]. NETWORKS, 1996, 28 (02) : 69 - 85
  • [28] Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems
    Okumoto, Kazumasa
    Fukunaga, Takuro
    Nagamochi, Hiroshi
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 55 - +
  • [29] Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems
    Okumoto, Kazumasa
    Fukunaga, Takuro
    Nagamochi, Hiroshi
    [J]. ALGORITHMICA, 2012, 62 (3-4) : 787 - 806
  • [30] Massive parallelization of divide-and-conquer algorithms over powerlists
    Achatz, K
    Schulte, W
    [J]. SCIENCE OF COMPUTER PROGRAMMING, 1996, 26 (1-3) : 59 - 78