A Stable, Rational QR Algorithm for the Computation of the Eigenvalues of an Hermitian, Tridiagonal Matrix

DOI10.2307/2005222zbMath0222.65044OpenAlexW4250050345MaRDI QIDQ5627571

Christian H. Reinsch

Publication date: 1971

Full work available at URL: https://doi.org/10.2307/2005222

Mathematics Subject Classification ID

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

Related Items

Recursive Bayesian algorithm with covariance resetting for identification of Box-Jenkins systems with non-uniformly sampled input data, A fast and stable parallel QR algorithm for symmetric tridiagonal matrices, Bidiagonalization and diagonalization, Notes on TQR algorithms, Computational methods of linear algebra, Perturbations in eigenvalues, Parallel direct linear system solvers - a survey, An algorithm for Gaussian quadrature given modified moments, A fully stable rational version of the QR algorithm for tridiagonal matrices

Cites Work

• Unnamed Item
• Unnamed Item
• The QR and QL algorithms for symmetric matrices
• Householder's tridiagonalization of a symmetric matrix
• Householder's method for complex matrices and eigensystems of Hermitian matrices
• Global convergence of tridiagonal QR algorithm with origin shifts
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
• The LLT and QR methods for symmetric tridiagonal matrices
• Correspondence
• Calculation of the eigenvalues of a symmetric tridiagonal matrix by the method of bisection