A fast and stable parallel QR algorithm for symmetric tridiagonal matrices

DOI10.1016/0024-3795(93)00360-CMaRDI QIDQ1893081zbMATH OpenFDO

Authors Ilan Bar-On, Bruno Codenotti

Publication date 3 July 1995

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0024-3795(93)00360-C

zbMATH Keywords

divide and conquer methodeigenvaluesnumerical examplesnumerical stabilityparallel algorithmQR algorithmsymmetric tridiagonal matrix

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05)

Review text

A parallel algorithm based on a divide and conquer method is proposed for computing a few eigenvalues of a symmetric tridiagonal matrix. No common memory is assumed. The authors discuss the numerical stability properties of their algorithm and provide numerical examples.

Recommendations

• scientific article; zbMATH DE number 1330403
• A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix
• scientific article; zbMATH DE number 27309
• A Parallel Inertia Method for Finding Eigenvalues on Vector and SIMD Architectures
• A Parallel Divide and Conquer Algorithm for the Symmetric Eigenvalue Problem on Distributed Memory Architectures

Cites work

• A Multiprocessor Algorithm for the Symmetric Tridiagonal Eigenvalue Problem
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• A Parallel QR Algorithm for Symmetric Tridiagonal Matrices
• A Stable, Rational QR Algorithm for the Computation of the Eigenvalues of an Hermitian, Tridiagonal Matrix
• Balancing a matrix for calculation of eigenvalues and eigenvectors
• Forward Instability of Tridiagonal QR
• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 3183375 (Why is no real title available?)
• scientific article; zbMATH DE number 51361 (Why is no real title available?)
• scientific article; zbMATH DE number 192975 (Why is no real title available?)
• scientific article; zbMATH DE number 3199190 (Why is no real title available?)
• Matrix eigensystem routines - EISPACK guide
• Solving the Symmetric Tridiagonal Eigenvalue Problem on the Hypercube
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1

Cited in

(18)

• Parallel algorithm for solving some spectral problems of linear algebra
• A new efficient parallelization strategy for the QR algorithm
• Efficent computation of eigenvalues of randomly generated matrices
• The design and implementation of the MRRR algorithm
• scientific article; zbMATH DE number 27309 (Why is no real title available?)
• QR-Like Algorithms for Symmetric Arrow Matrices
• Accelerated bisection techniques for tri‐ and quindiagonal matrices
• Implementing the Parallel Quasi-Laguerre's Algorithm for Symmetric Tridiagonal Eigenproblems
• scientific article; zbMATH DE number 1330403 (Why is no real title available?)
• A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
• A Fast Parallel Cholesky Decomposition Algorithm for Tridiagonal Symmetric Matrices
• A Parallel Algorithm for the Nonsymmetric Eigenvalue Problem
• A Parallel Divide and Conquer Algorithm for the Symmetric Eigenvalue Problem on Distributed Memory Architectures
• On Tridiagonalizing and Diagonalizing Symmetric Matrices with Repeated Eigenvalues
• TRIDIAGONALIZING A REAL SYMMETRIC MATRIX: A PARALLEL DIRECT APPROACH USING GIVENS’TRANSFORMATION
• A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix
• Computing the smallest eigenvalue of large ill-conditioned Hankel matrices
• Tridiagonalization of band symmetric matrices for vector computers

This page was built for publication: A fast and stable parallel QR algorithm for symmetric tridiagonal matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1893081)