A fast and stable parallel QR algorithm for symmetric tridiagonal matrices

DOI10.1016/0024-3795(93)00360-CzbMath0827.65038MaRDI QIDQ1893081

Ilan Bar-On, Bruno Codenotti

Publication date: 3 July 1995

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

zbMATH Keywords

numerical exampleseigenvaluesnumerical stabilityparallel algorithmQR algorithmsymmetric tridiagonal matrixdivide and conquer method

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• Matrix eigensystem routines - EISPACK guide
• Balancing a matrix for calculation of eigenvalues and eigenvectors
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
• Solving the Symmetric Tridiagonal Eigenvalue Problem on the Hypercube
• A Multiprocessor Algorithm for the Symmetric Tridiagonal Eigenvalue Problem
• Forward Instability of Tridiagonal QR
• A Parallel QR Algorithm for Symmetric Tridiagonal Matrices
• A Stable, Rational QR Algorithm for the Computation of the Eigenvalues of an Hermitian, Tridiagonal Matrix

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