Two approaches using coarse grid correction in the course of a certain Krylov iterative process are presented. The aim of the correction is to accelerate the iterations. These approaches are based on an approximation of the function sought for by simple basis functions having finite supports. Additional acceleration can be achieved if the iterative process is restarted and the approximate solution is refined. In this case, the resulting process turns out to be a two-level preconditioned method. The influence of different parameters of the iterative process on its convergence is demonstrated by numerical results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Y. L. Gurieva, V. P. Il’in, and D. V. Perevozkin, “Algebro-geometric and information structures of domain decomposition methods,” Vychisl. Met. Program., 17, 132–146 (2016).
Y. Saad, Iterative Methods for Sparse Linear Systems, PWS Publ., New York (1996)
Y. L. Gurieva and V. P. Il’in, “On technologies of acceleration of parallel domain decomposition methods,” Vychisl. Met. Program., 16, 146–154 (2015).
V. P. Il’in, “Least squares methods in Krylov subspaces,” Zap. Nauchn. Semin. POMI, 453, 131–147 (2016).
Y. Saad, M. Yeung, J. Erhel, and F. Guyomarc’h, “A deflated version of the conjugate gradient algorithm,” SIAM J. Sci. Comput., 21, No. 5, 1909–1926 (2000).
V. P. Il’in, Methods and Technologies of Finite Element Methods [in Russian], IVMMG Publ., Novosibirsk (2007).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 463, 2017, pp. 44–57.
Rights and permissions
About this article
Cite this article
Gurieva, Y.L., Il’in, V.P. On Coarse Grid Correction Methods in Krylov Subspaces. J Math Sci 232, 774–782 (2018). https://doi.org/10.1007/s10958-018-3907-9
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-018-3907-9