A Geometric Theory for the $QR$, $LU$ and Power Iterations
From MaRDI portal
Publication:5667412
DOI10.1137/0710035zbMath0253.65018OpenAlexW2090859773MaRDI QIDQ5667412
Beresford N. Parlett, William Poole
Publication date: 1973
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0710035
Related Items (17)
Rutishauser’s LR algorithm and Bruhat iteration ⋮ The geometry of matrix eigenvalue methods ⋮ Computational methods of linear algebra ⋮ Exact QR factorizations of rectangular matrices ⋮ An analysis of the HR algorithm for computing the eigenvalues of a matrix ⋮ Perron vector optimization applied to search engines ⋮ A note on the Rayleigh quotient iteration for symmetric eigenvalue problems ⋮ Simultaneous iteration for computing invariant subspaces of non-Hermitian matrices ⋮ Simultaneous iteration for the matrix eigenvalue problem ⋮ The projective power method for the algebraic eigenvalue problem ⋮ A propos de l’algorithme $QZ$ ⋮ Convergence of algorithms of decomposition type for the eigenvalue problem ⋮ \(SR\) and \(SZ\) algorithms for the symplectic (butterfly) eigenproblem ⋮ The equivalence of time-scale decomposition techniques used in the analysis and design of linear systems ⋮ A block QR algorithm for partitioning stiff differential systems ⋮ \(QR\)-like algorithms for eigenvalue problems ⋮ On reducing infinite eigenvalues of regular pencils by a nonequivalence transformation
This page was built for publication: A Geometric Theory for the $QR$, $LU$ and Power Iterations
