On orthogonal reduction to Hessenberg form with small bandwidth
From MaRDI portal
Publication:1027782
DOI10.1007/S11075-008-9242-3zbMATH Open1180.65051OpenAlexW2089546728MaRDI QIDQ1027782FDOQ1027782
Authors: Vance Faber, Jörg Liesen, 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
Recommendations
- Orthogonal Hessenberg Reduction and Orthogonal Krylov Subspace Bases
- On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms
- scientific article; zbMATH DE number 1330401
- Reduction to Tridiagonal Form and Minimal Realizations
- Reduction of a General Matrix to Tridiagonal Form
Computational methods for sparse matrices (65F50) Canonical forms, reductions, classification (15A21)
Cites Work
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Title not available (Why is that?)
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Orthogonal Hessenberg Reduction and Orthogonal Krylov Subspace Bases
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
- The Faber–Manteuffel Theorem for Linear Operators
- The QR Algorithm Revisited
- On Optimal Short Recurrences for Generating Orthogonal Krylov Subspace Bases
- The Arnoldi Method for Normal Matrices
- The Arnoldi process, short recursions, and displacement ranks
Cited In (4)
- A unitary similarity transform of a normal matrix to complex symmetric form
- Necessary and sufficient conditions for orthogonal similarity transformations to obtain the Arnoli(Lanczos)-Ritz values
- Block tridiagonal reduction of perturbed normal and rank structured matrices
- A condensed representation of almost normal matrices
This page was built for publication: On orthogonal reduction to Hessenberg form with small bandwidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1027782)
