Bidiagonalization and diagonalization

DOI10.1016/0898-1221(87)90051-4zbMath0633.65038OpenAlexW2000918303MaRDI QIDQ1096332

William W. Hager

Publication date: 1987

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(87)90051-4

zbMATH Keywords

QR algorithmbidiagonalizationfast Givens transformationshift strategy

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05) Orthogonalization in numerical linear algebra (65F25)

Uses Software

• NAPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
• An Improved Algorithm for Computing the Singular Value Decomposition
• Least Squares Computations by Givens Transformations Without Square Roots
• Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
• Calculating the Singular Values and Pseudo-Inverse of a Matrix
• A Stable, Rational QR Algorithm for the Computation of the Eigenvalues of an Hermitian, Tridiagonal Matrix

This page was built for publication: Bidiagonalization and diagonalization