Analysis of some Krylov subspace methods for normal matrices via approximation theory and convex optimization

zbMath1171.65019MaRDI QIDQ836832

Mohammed Bellalij, Yousef 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

zbMATH Keywords

interpolationconvergenceconvex optimizationKrylov subspace methodsGMRES methodnormal matricesKKT optimality conditionsArnoldi iterationKarush-Kuhn-Tucker (KKT) optimalitymin-Max problempolynomials of best approximation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Iterative numerical methods for linear systems (65F10)

Related Items (2)

New convergence results on the global GMRES method for diagonalizable 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