On orthogonal reduction to Hessenberg form with small bandwidth
From MaRDI portal
Publication:1027782
DOI10.1007/s11075-008-9242-3zbMath1180.65051OpenAlexW2089546728MaRDI QIDQ1027782
Jörg Liesen, Vance Faber, Petr Tichý
Publication date: 30 June 2009
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-008-9242-3
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
A unitary similarity transform of a normal matrix to complex symmetric form ⋮ A condensed representation of almost normal matrices ⋮ Block tridiagonal reduction of perturbed normal and rank structured matrices
Cites Work
- Unnamed Item
- The Arnoldi process, short recursions, and displacement ranks
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
- On Optimal Short Recurrences for Generating Orthogonal Krylov Subspace Bases
- The Faber–Manteuffel Theorem for Linear Operators
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- The Arnoldi Method for Normal Matrices
- The QR Algorithm Revisited
- Orthogonal Hessenberg Reduction and Orthogonal Krylov Subspace Bases
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
This page was built for publication: On orthogonal reduction to Hessenberg form with small bandwidth