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 条

[41] On eigenvalue problems of real symmetric tensors
Chang, K. C.
Pearson, Kelly
Zhang, Tan
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 2009, 350 (01) : 416 - 422
[42] AN ALGORITHM FOR THE BANDED SYMMETRICAL GENERALIZED MATRIX EIGENVALUE PROBLEM
KAUFMAN, L
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1993, 14 (02) : 372 - 389
[43] ROBUST PARALLEL IMPLEMENTATION OF A LANCZOS-BASED ALGORITHM FOR AN STRUCTURED ELECTROMAGNETIC EIGENVALUE PROBLEM
Bernabeu, Miguel O.
Taroncher, Mariam
Garcia, Victor M.
Vidal, Ana
SCALABLE COMPUTING-PRACTICE AND EXPERIENCE, 2007, 8 (03): : 263 - 270
[44] Optimizing the Rayleigh quotient with symmetric constraints and its application to perturbations of structured polynomial eigenvalue problems
Prajapati, Anshul
Sharma, Punit
LINEAR ALGEBRA AND ITS APPLICATIONS, 2022, 645 : 256 - 277
[45] On the structured backward error of inexact Arnoldi methods for (skew)-Hermitian and (skew)-symmetric eigenvalue problems
Liu, Ching-Sung
Lee, Che-Rung
BIT NUMERICAL MATHEMATICS, 2017, 57 (04) : 1083 - 1108
[46] On the structured backward error of inexact Arnoldi methods for (skew)-Hermitian and (skew)-symmetric eigenvalue problems
Ching-Sung Liu
Che-Rung Lee
BIT Numerical Mathematics, 2017, 57 : 1083 - 1108
[47] On some structured inverse eigenvalue problems
Robert Erra
Bernard Philippe
Numerical Algorithms, 1997, 15 : 15 - 35
[48] On some structured inverse eigenvalue problems
Erra, R
Philippe, B
NUMERICAL ALGORITHMS, 1997, 15 (01) : 15 - 35
[49] Structured pseudospectra for nonlinear eigenvalue problems
Wagenknecht, T.
Michiels, W.
Green, K.
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2008, 212 (02) : 245 - 259
[50] AN ALGORITHM FOR THE SYMMETRIC GENERALIZED EIGENVALUE PROBLEM
BUNSEGERSTNER, A
LINEAR ALGEBRA AND ITS APPLICATIONS, 1984, 58 (APR) : 43 - 68

← 1 2 3 4 5 →