A parallel structured banded DC algorithm for symmetric eigenvalue problems

被引：2
|
作者：
Li, Shengguo [1 ]
Liao, Xia [1 ]
Lu, Yutong [2 ,3 ]
Roman, Jose E. [4 ]
Yue, Xiaoqiang [5 ]
机构：
[1] Natl Univ Def Technol, Coll Comp Sci, Changsha 410073, Peoples R China
[2] Sun Yatsen Univ, Natl Supercomp Ctr Guangzhou, Guangzhou 510006, Peoples R China
[3] Sun Yatsen Univ, Sch Data & Comp Sci, Guangzhou 510006, Peoples R China
[4] Univ Politecn Valencia, D Sistemes Informat & Comp, Cami Vera S-N, Valencia 46022, Spain
[5] Xiangtan Univ, Hunan Key Lab Computat & Simulat Sci & Engn, Key Lab Intelligent Comp & Informat Proc, Minist Educ, Xiangtan 411105, Peoples R China
来源：
CCF TRANSACTIONS ON HIGH PERFORMANCE COMPUTING | 2023年 / 5卷 / 02期
关键词：
ScaLAPACK; Divide-and-conquer; PSMMA; PBSDC; Distributed-memory parallel algorithm; RANK-ONE MODIFICATION; CONQUER ALGORITHM; DIVIDE; FRAMEWORK;
D O I：
10.1007/s42514-022-00117-9
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, a novel parallel structured divide-and-conquer (DC) algorithm is proposed for symmetric banded eigenvalue problems, denoted by PBSDC, which modifies the classical parallel banded DC (PBDC) algorithm by reducing its computational cost. The main tool that PBSDC uses is a parallel structured matrix multiplication algorithm (PSMMA), which can be much faster than the general dense matrix multiplication ScaLAPACK routine PDGEMM. Numerous experiments have been performed on Tianhe-2 supercomputer to compare PBSDC with PBDC and ELPA. For matrices with few deflations, PBSDC can be much faster than PBDC since computations are saved. For matrices with many deflations and/or small bandwidths, PBSDC can be faster than the tridiagonalization-based DC implemented in LAPACK and ELPA. However, PBSDC would become slower than ELPA for matrices with relatively large bandwidths.
引用
收藏
页码：116 / 128
页数：13
相关论文
共 50 条
  • [1] A parallel structured banded DC algorithm for symmetric eigenvalue problems
    Shengguo Li
    Xia Liao
    Yutong Lu
    Jose E. Roman
    Xiaoqiang Yue
    CCF Transactions on High Performance Computing, 2023, 5 : 116 - 128
  • [2] A Parallel Structured Divide-and-Conquer Algorithm for Symmetric Tridiagonal Eigenvalue Problems
    Liao, Xia
    Li, Shengguo
    Lu, Yutong
    Roman, Jose E.
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2021, 32 (02) : 367 - 378
  • [3] Parallel eigenvalue computation for banded generalized eigenvalue problems
    Rippl, Michael
    Lang, Bruno
    Huckle, Thomas
    PARALLEL COMPUTING, 2019, 88
  • [4] A parallel algorithm for the symmetric eigenvalue problem
    Pavani, R
    DeRos, U
    ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND MECHANIK, 1996, 76 : 495 - 496
  • [5] Parallel algorithm for the symmetric eigenvalue problem
    Pavani, R.
    De Ros, U.
    Zeitschrift fuer Angewandte Mathematik und Mechanik, ZAMM, Applied Mathematics and Mechanics, 76 (Suppl 1):
  • [6] HOMOTOPY ALGORITHM FOR SYMMETRIC EIGENVALUE PROBLEMS
    LI, TY
    RHEE, NH
    NUMERISCHE MATHEMATIK, 1989, 55 (03) : 265 - 280
  • [7] A Nonlinear QR Algorithm for Banded Nonlinear Eigenvalue Problems
    Garrett, C. Kristopher
    Bai, Zhaojun
    Li, Ren-Cang
    ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2016, 43 (01):
  • [8] A parallel numerical algorithm for near symmetric and banded systems
    Garey, LE
    APPLIED MATHEMATICS AND COMPUTATION, 2001, 119 (01) : 99 - 108
  • [9] SIMULTANEOUS ITERATION ALGORITHM FOR SYMMETRIC EIGENVALUE PROBLEMS
    CORR, RB
    JENNINGS, A
    INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 1976, 10 (03) : 647 - 663
  • [10] An algorithm for symmetric generalized inverse eigenvalue problems
    Dai, H
    LINEAR ALGEBRA AND ITS APPLICATIONS, 1999, 296 (1-3) : 79 - 98
12345