The Arnoldi process, short recursions, and displacement ranks
From MaRDI portal
Publication:2564905
DOI10.1016/S0024-3795(97)82725-5zbMath0862.65025MaRDI QIDQ2564905
Publication date: 25 May 1997
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Related Items
On orthogonal reduction to Hessenberg form with small bandwidth, Revisiting \((k,\ell)\)-step methods
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Displacement structure for Hankel, Vandermonde, and related (derived) matrices
- Necessary and sufficient conditions for the simplification of generalized conjugate-gradient algorithms
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
- Bestimmung der Eigenwerte orthogonaler Matrizen
- Displacement ranks of a matrix
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
- Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
- Orthogonal Error Methods
- A fast minimal residual algorithm for shifted unitary matrices
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
