Relaxed Krylov subspace approximation
Valeria Simoncini, Daniel B. Szyld · PAMM · 2005
Abstract Recent computational and theoretical studies have shown that the matrix‐vector product occurring at each step of a Krylov subspace method can be relaxed as the iterations proceed, i.e., it can be computed in a less exact manner, without degradation of the overall performance. In the present paper a general operator treatment of this phenomenon is provided and a new result further explaining its behavior is presented. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)