A parallel structured divide-and-conquer algorithm for symmetric tridiagonal eigenvalue problems

08/05/2020
by   Xia Liao, et al.
0

In this paper, a parallel structured divide-and-conquer (PSDC) eigensolver is proposed for symmetric tridiagonal matrices based on ScaLAPACK and a parallel structured matrix multiplication algorithm, called PSMMA. Computing the eigenvectors via matrix-matrix multiplications is the most computationally expensive part of the divide-and-conquer algorithm, and one of the matrices involved in such multiplications is a rank-structured Cauchy-like matrix. By exploiting this particular property, PSMMA constructs the local matrices by using generators of Cauchy-like matrices without any communication, and further reduces the computation costs by using a structured low-rank approximation algorithm. Thus, both the communication and computation costs are reduced. Experimental results show that both PSMMA and PSDC are highly scalable and scale to 4096 processes at least. PSDC has better scalability than PHDC that was proposed in [J. Comput. Appl. Math. 344 (2018) 512–520] and only scaled to 300 processes for the same matrices. Comparing with in ScaLAPACK, PSDC is always faster and achieves 1.4x–1.6x speedup for some matrices with few deflations. PSDC is also comparable with ELPA, with PSDC being faster than ELPA when using few processes and a little slower when using many processes.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 6

page 7

page 8

12/22/2016

An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures

In this paper, an efficient divide-and-conquer (DC) algorithm is propose...
11/18/2018

Stark: Fast and Scalable Strassen's Matrix Multiplication using Apache Spark

This paper presents a new fast, highly scalable distributed matrix multi...
02/16/2020

A gradient system approach for Hankel structured low-rank approximation

Rank deficient Hankel matrices are at the core of several applications. ...
06/17/2021

Faster Sparse Matrix Inversion and Rank Computation in Finite Fields

We improve the current best running time value to invert sparse matrices...
01/12/2018

A fast spectral divide-and-conquer method for banded matrices

Based on the spectral divide-and-conquer algorithm by Nakatsukasa and Hi...
10/13/2020

Approximate Simultaneous Diagonalization of Matrices via Structured Low-Rank Approximation

Approximate Simultaneous Diagonalization (ASD) is a problem to find a co...
11/12/2019

Fast Computation of Sep_λ via Interpolation-based Globality Certificates

Given two square matrices A and B, we propose a new algorithm for comput...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.