Parallel block tridiagonalization of real symmetric matrices

DOI10.1016/j.jpdc.2007.10.001zbMath1243.65174OpenAlexW2022254525MaRDI QIDQ436780

Yihua Bai, Robert C. Ward

Publication date: 26 July 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2007.10.001

zbMATH Keywords

approximate eigenvaluesblock divide-and-conquerblock-tridiagonal matrixorthogonal block reduction

Mathematics Subject Classification ID

Related Items (1)

An Input/Output Efficient Algorithm for Hessenberg Reduction

Uses Software

• ScaLAPACK
• BLAS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Divide and Conquer method for the symmetric tridiagonal eigenproblem
• Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
• Block reduction of matrices to condensed forms for eigenvalue computations
• Global convergence of tridiagonal QR algorithm with origin shifts
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
• A parallel symmetric block-tridiagonal divide-and-conquer algorithm
• A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
• The WY Representation for Products of Householder Matrices
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem
• A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
• ScaLAPACK Users' Guide
• A framework for symmetric band reduction
• Computing Approximate Eigenpairs of Symmetric Block Tridiagonal Matrices
• Block tridiagonalization of "effectively" sparse symmetric matrices

This page was built for publication: Parallel block tridiagonalization of real symmetric matrices