Two-level least squares methods in Krylov subspaces

From MaRDI portal





The author presents two-level methods for accelerating the convergence of restarted iterations based on the least squares method (LSM) for decreasing the Euclidean norm of the residual, for large, sparse and ill-conditioned linear systems. In this respect, he also considers applications of less expensive conjugate residual (CR) algorithms and the Chebyshev acceleration. Numerical experiments are presented on a set of model Dirichlet problems for the convection-diffusion equation.











This page was built for publication: Two-level least squares methods in Krylov subspaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662026)