Analysis of some Krylov subspace methods for normal matrices via approximation theory and convex optimization
From MaRDI portal
Publication:836832
zbMath1171.65019MaRDI QIDQ836832
Yousef Saad, Hassane Sadok, Mohammed Bellalij
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
interpolation; convergence; convex optimization; Krylov subspace methods; GMRES method; normal matrices; KKT optimality conditions; Arnoldi iteration; Karush-Kuhn-Tucker (KKT) optimality; min-Max problem; polynomials of best approximation
65K05: Numerical mathematical programming methods
90C25: Convex programming
65F10: Iterative numerical methods for linear systems
Related Items