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

Authors:
Yihua Bai;Robert C. Ward
Affiliations:
University of Tennessee, TN;University of Tennessee, TN
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
2007

Citing 12
Cited 4

A fully parallel algorithm for the symmetric eigenvalue problem

SIAM Journal on Scientific and Statistical Computing
Improving performance of linear algebra algorithms for dense matrices, using algorithmic prefetch

IBM Journal of Research and Development
Studies in numerical linear algebra

Studies in numerical linear algebra
Modeling the benefits of mixed data and task parallelism

Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
The symmetric eigenvalue problem

The symmetric eigenvalue problem
A Parallel Divide and Conquer Algorithm for the Symmetric Eigenvalue Problem on Distributed Memory Architectures

SIAM Journal on Scientific Computing
An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems

ACM Transactions on Mathematical Software (TOMS)
Early evaluation of the IBM p690

Proceedings of the 2002 ACM/IEEE conference on Supercomputing
LAPACK Working Note 69: A Serial Implementation of Cuppen''s Divide and Conquer Algorithm for the Symmetric Eigenvalue Problem

LAPACK Working Note 69: A Serial Implementation of Cuppen''s Divide and Conquer Algorithm for the Symmetric Eigenvalue Problem
Computing Approximate Eigenpairs of Symmetric Block Tridiagonal Matrices

SIAM Journal on Scientific Computing
Block tridiagonalization of "effectively" sparse symmetric matrices

ACM Transactions on Mathematical Software (TOMS)
High performance parallel approximate eigensolver for real symmetric matrices

High performance parallel approximate eigensolver for real symmetric matrices

Parallel block tridiagonalization of real symmetric matrices

Journal of Parallel and Distributed Computing
ScaLAPACK's MRRR algorithm

ACM Transactions on Mathematical Software (TOMS)
Skeletons for divide and conquer algorithms

PDCN '08 Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks
Research note: Revisiting parallel cyclic reduction and parallel prefix-based algorithms for block tridiagonal systems of equations

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

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.