Notes on TQR algorithms

DOI10.1016/S0377-0427(97)00155-6zbMath0892.65023OpenAlexW2075968637MaRDI QIDQ1379001

J. Ning

Publication date: 15 July 1998

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-0427(97)00155-6

zbMATH Keywords

stabilitynumerical experimentsLAPACKsymmetric tridiagonal eigenvalue problemEISPACKrational TQR algorithm

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (3)

Accurate recovery of recursion coefficients from Gaussian quadrature formulas ⋮ Computation of Gauss-type quadrature formulas ⋮ The restarted QR-algorithm for eigenvalue computation of structured matrices

Uses Software

• LAPACK
• EISPACK
• LINPACK

Cites Work

• 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. 2nd ed
• Rational QR transformation with Newton shift for symmetric tridiagonal matrices
• The implicit QL algorithm
• A short note on the implicit QL algorithm for symmetric tridiagonal matrices
• A fully stable rational version of the QR algorithm for tridiagonal matrices
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
• Forward Instability of Tridiagonal QR
• Forward Stability and Transmission of Shifts in the $QR$ Algorithm
• A Stable, Rational QR Algorithm for the Computation of the Eigenvalues of an Hermitian, Tridiagonal Matrix
• The LLT and QR methods for symmetric tridiagonal matrices
• Correspondence

This page was built for publication: Notes on TQR algorithms