A parallel symmetric block-tridiagonal divide-and-conquer algorithm

Abstract

We present a parallel implementation of the block-tridiagonal divide-and-conquer algorithm that computes eigensolutions of symmetric block-tridiagonal matrices to reduced accuracy. In our implementation, we use mixed data/task parallelism to achieve data distribution and workload balance. Numerical tests show that our implementation is efficient, scalable and computes eigenpairs to prescribed accuracy. We compare the performance of our parallel eigensolver with that of the ScaLAPACK divide-and-conquer eigensolver on block-tridiagonal matrices.

Keywords

This publication has 14 references indexed in Scilit:

Block tridiagonalization of "effectively" sparse symmetric matrices
ACM Transactions on Mathematical Software, 2004
Computing Approximate Eigenpairs of Symmetric Block Tridiagonal Matrices
SIAM Journal on Scientific Computing, 2003
An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems
ACM Transactions on Mathematical Software, 2002
A Parallel Divide and Conquer Algorithm for the Symmetric Eigenvalue Problem on Distributed Memory Architectures
SIAM Journal on Scientific Computing, 1999
Improving performance of linear algebra algorithms for dense matrices, using algorithmic prefetch
IBM Journal of Research and Development, 1994
A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
SIAM Journal on Scientific and Statistical Computing, 1987
Soliton excitations in polyacetylene
Physical Review B, 1980
A divide and conquer method for the symmetric tridiagonal eigenproblem
Numerische Mathematik, 1980
Ground states of molecules. 38. The MNDO method. Approximations and parameters
Journal of the American Chemical Society, 1977
Self-Consistent Equations Including Exchange and Correlation Effects
Physical Review B, 1965

Cited by 8 articles