Rates of robust superlinear convergence of preconditioned Krylov methods for elliptic FEM problems.

This paper considers the iterative solution of finite element discretizations of second-order elliptic boundary value problems. Mesh independent estimations are given for the rate of superlinear convergence of preconditioned Krylov methods, involving the connection between the convergence rate and the Lebesgue exponent of the data. Numerical examples demonstrate the theoretical results. [ABSTRACT FROM AUTHOR]