A Geometric Theory for the QR, LU and Power Iterations
From MaRDI portal
A Geometric Theory for the $QR$, $LU$ and Power Iterations
Cited in
(24)- A block QR algorithm for partitioning stiff differential systems
- On reducing infinite eigenvalues of regular pencils by a nonequivalence transformation
- The geometry of matrix eigenvalue methods
- Computational methods of linear algebra
- An analysis of the HR algorithm for computing the eigenvalues of a matrix
- Simultaneous iteration for computing invariant subspaces of non-Hermitian matrices
- Simultaneous iteration for the matrix eigenvalue problem
- SR and SZ algorithms for the symplectic (butterfly) eigenproblem
- \(QR\)-like algorithms for eigenvalue problems
- A note on the Rayleigh quotient iteration for symmetric eigenvalue problems
- Perron vector optimization applied to search engines
- Rutishauser’s LR algorithm and Bruhat iteration
- The equivalence of time-scale decomposition techniques used in the analysis and design of linear systems
- A propos de l’algorithme QZ
- The projective power method for the algebraic eigenvalue problem
- Exact QR factorizations of rectangular matrices
- Wielandt Iteration
- Power Method
- Inverse Power Method
- Positivity proofs for linear recurrences through contracted cones
- Inverse iteration for Sylvester operators
- Roundoff-error-free QR factorization via integer-preserving Gram Schmidt orthogonalization
- Computing right eigenvalues of non-Hermitian dual quaternion matrices via the power method
- Convergence of algorithms of decomposition type for the eigenvalue problem
This page was built for publication: A Geometric Theory for the $QR$, $LU$ and Power Iterations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5667412)
