The QR Algorithm Revisited
From MaRDI portal
Publication:5450282
DOI10.1137/060659454zbMath1134.65028MaRDI QIDQ5450282
Publication date: 19 March 2008
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/16656bd4486eca740e99327280ad2355a2d7f407
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
Related Items
Numerical solution of linear eigenvalue problems, Computing the Square Root of a Low-Rank Perturbation of the Scaled Identity Matrix, The Joint Bidiagonalization of a Matrix Pair with Inaccurate Inner Iterations, Algorithms for the Geronimus transformation for orthogonal polynomials on the unit circle, A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence, Kernel polynomials from \(L\)-orthogonal polynomials, Using the Cauchy-Binet formula in the convergence proof of the tridiagonal QR algorithm with shifts, Efficient alternating least squares algorithms for low multilinear rank approximation of tensors, On orthogonal reduction to Hessenberg form with small bandwidth, New exact algorithms for planar maximum covering location by ellipses problems, The dynamical functional particle method for multi-term linear matrix equations, An extended QR-solver for large profiled matrices
