The DQR algorithm, basic theory, convergence, and conditional stability

DOI10.1007/s002110050275zbMath0883.65029OpenAlexW264482033MaRDI QIDQ1360724

Frank Uhlig

Publication date: 23 July 1997

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

Full work available at URL: https://doi.org/10.1007/s002110050275

zbMATH Keywords

stabilityconvergencenumerical examplesQR algorithmunsymmetric eigenvalue problemorthogonal reduction

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items

Efficient polynomial root-refiners: a survey and new record efficiency estimates ⋮ Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. ⋮ General polynomial roots and their multiplicities inO(N)memory andO(N²)Time^∗ ⋮ Constructive ways for generating (generalized) real orthogonal matrices as products of (generalized) symmetries ⋮ Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations ⋮ For tridiagonals \(T\) replace \(T\) with \(LDL\)