A parallel structured banded DC algorithm for symmetric eigenvalue problems

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 struct...

Full description

Saved in:
Bibliographic Details
Published in:CCF transactions on high performance computing (Online) Vol. 5; no. 2; pp. 116 - 128
Main Authors: Li, Shengguo, Liao, Xia, Lu, Yutong, Roman, Jose E., Yue, Xiaoqiang
Format: Journal Article
Language:English
Published: Singapore Springer Nature Singapore 01.06.2023
Springer Nature B.V
Subjects:
Algorithms
Computer Hardware
Computer Science
Computer Systems Organization and Communication Networks
Eigenvalues
Eigenvectors
Regular Paper
Software
Structured matrices
PSMMA
ScaLAPACK
PBSDC
68W10
Distributed-memory parallel algorithm
65F15
Divide-and-conquer
ISSN:2524-4922, 2524-4930
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2524-4922
2524-4930
DOI:10.1007/s42514-022-00117-9