Analysis of some Krylov subspace methods for normal matrices via approximation theory and convex optimization
zbMATH Open1171.65019MaRDI QIDQ836832FDOQ836832
Authors: M. Bellalij, Y. Saad, Hassane Sadok 
Publication date: 8 September 2009
Published in: ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/130615
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Analysis of the convergence of the minimal and the orthogonal residual methods
- Geometric aspects of the theory of Krylov subspace methods
- Convergence Analysis of Krylov Subspace Iterations with Methods from Potential Theory
- Convergence analysis of Krylov subspace methods
- Error Analysis of Krylov Methods In a Nutshell
interpolationconvergenceconvex optimizationKrylov subspace methodsnormal matricesGMRES methodKKT optimality conditionsArnoldi iterationKarush-Kuhn-Tucker (KKT) optimalitymin-Max problempolynomials of best approximation
Numerical mathematical programming methods (65K05) Convex programming (90C25) Iterative numerical methods for linear systems (65F10)
Cited In (6)
- The distance of an eigenvector to a Krylov subspace and the convergence of the Arnoldi method for eigenvalue problems
- New convergence results on the global GMRES method for diagonalizable matrices
- Chebyshev approximation via polynomial mappings and the convergence behaviour of Krylov subspace methods
- On matrix approximation problems with Ky Fan \(k\) norms
- Krylov subspace methods for eigenvalues with special properties and their analysis for normal matrices
- A note on the Davison-Man method for Sylvester matrix equations
This page was built for publication: Analysis of some Krylov subspace methods for normal matrices via approximation theory and convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q836832)
