A fully stable rational version of the QR algorithm for tridiagonal matrices

DOI10.1007/BF01406680zbMATH Open0221.65064MaRDI QIDQ2547445FDOQ2547445

Authors: R. A. Sack 

Publication date: 1972

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132122

Mathematics Subject Classification ID

Cites Work

• Calculation of Gauss Quadrature Rules
• Title not available (Why is that?)
• A Stable, Rational QR Algorithm for the Computation of the Eigenvalues of an Hermitian, Tridiagonal Matrix
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
• Rational QR transformation with Newton shift for symmetric tridiagonal matrices
• The QR and QL algorithms for symmetric matrices
• The LLT and QR methods for symmetric tridiagonal matrices

Cited In (3)

• Computational methods of linear algebra
• An algorithm for Gaussian quadrature given modified moments
• Notes on TQR algorithms

This page was built for publication: A fully stable rational version of the QR algorithm for tridiagonal matrices

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