On an economic Arnoldi method for BML-matrices
From MaRDI portal
Publication:4643328
DOI10.1137/17M1114363zbMATH Open1392.65044OpenAlexW2801276118MaRDI QIDQ4643328FDOQ4643328
Authors: Clara Mertens, Bernhard Beckermann, Raf Vandebril
Publication date: 24 May 2018
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/17m1114363
Recommendations
- The Faber–Manteuffel Theorem for Linear Operators
- On Optimal Short Recurrences for Generating Orthogonal Krylov Subspace Bases
- The Arnoldi Process and GMRES for Nearly Symmetric Matrices
- GMRES/CR and Arnoldi/Lanczos as Matrix Approximation Problems
- The Arnoldi process, short recursions, and displacement ranks
Iterative numerical methods for linear systems (65F10) Orthogonalization in numerical linear algebra (65F25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle
- Matrix computations and semiseparable matrices. Vol. 1: Linear systems.
- The QR algorithm for unitary Hessenberg matrices
- Numerical methods for the QCDd overlap operator. I: Sign-function and error bounds
- Quadrature Rules Based on the Arnoldi Process
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
- The Faber–Manteuffel Theorem for Linear Operators
- Multiple Recursion Conjugate Gradient Algorithms Part I: Sufficient Conditions
- Discrete orthogonal polynomials and superlinear convergence of Krylov subspace methods in numerical linear algebra
- Short-term recurrence Krylov subspace methods for nearly Hermitian matrices
- Title not available (Why is that?)
- Classifications of recurrence relations via subclasses of \((H, m)\)-quasiseparable matrices
- On the construction of Szegő polynomials
- The Arnoldi Process and GMRES for Nearly Symmetric Matrices
- Orthogonal polyanalytic polynomials and normal matrices
- When is the Adjoint of a Matrix a Low Degree Rational Function in the Matrix?
- A Hermitian Lanczos method for normal matrices
- A fast minimal residual algorithm for shifted unitary matrices
- A useful form of unitary matrix obtained from any sequence of unit 2-norm \(n\)-vectors
- Multiple recurrences and the associated matrix structures stemming from normal matrices
This page was built for publication: On an economic Arnoldi method for \(BML\)-matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4643328)