Skip to main content
SpringerLink
Log in

Multigrid Incomplete Factorization Methods in Krylov Subspaces

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

The paper studies multigrid methods for solving systems of linear algebraic equations resulting from the seven-point discretization of the three-dimensional Dirichlet problem for an elliptic differential equation of the second order in a parallepipedal domain on a regular grid. The algorithms suggested are presented as special iteration processes of incomplete factorization in Krylov subspaces with a hierarchical recursive vector structure that corresponds to a sequence of embedded grids and gives rise to a block tridiagonal recursive representation of the coefficient matrix of the original linear algebraic system. The convergence of iterations is enhanced by using the principle of compensation of the row sums and also the symmetric successive block overrelaxation. An arbitrary m-grid method is defined recursively, based on the two-grid method. For simplicity, the algorithms are considered for linear systems with Stieltjes coefficient matrices. Issues related to generalization of the algorithms to larger classes of problems and, in particular, those with unsymmetric matrices are discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. P. Fedorenko, “About Convergence Rate for An Interational Process,” Zh. Vychisl. Mat. Mat. Fiz., 4, No. 3, 559–564 (1964).

    Google Scholar 

  2. N. S. Bakhvalov, “On the convergence of a relaxation method with natural restrictions on an elliptic operator,” Zh. Vychisl. Mat. Mat. Fiz., 5, No. 5, 861–893 (1965).

    MATH  Google Scholar 

  3. F. A. Bornemann and P. Deuflhard, “The cascadic multigrid methods for elliptic problems,” Numer. Math., 75, No. 2, 135–152 (1996).

    Article  MathSciNet  MATH  Google Scholar 

  4. V. P. Il’in, “A variant of the multigrid method,” Sib. Mat. Zh., 26, No. 2, 102–107 (1985).

  5. V. V. Shaidurov, “Some estimates of the rate of convergence for the cascadic conjugategradient method,” J. Comput. Math. Appl., 31, No. 4/5, 161–171 (1996).

    Article  MATH  Google Scholar 

  6. A. Brandt, “Algebraic multigrid theory: The Symmetric Case,” J. Appl. Math. Comput., 19, 23–56 (1986).

    Article  MathSciNet  MATH  Google Scholar 

  7. Y. Saad, Iterative Methods for Sparse Linear Systems, 2nd ed., SIAM (2003).

  8. M. A. Olshanksii, “Analysis of a multi-grid method for convection-diffusion equations with Direchlet boundary conditions,” Zh. Vychisl. Mat. Mat. Fiz., 44, No. 8., 1450–1479 (2004).

    MathSciNet  Google Scholar 

  9. Y. Notay, “Algebraic multigrid and algebraic multilevel methods: A theoretical comparison,” Numer. Linear Algebra Appl., 12, 419–451 (2005).

    Article  MathSciNet  MATH  Google Scholar 

  10. R. Bank, R. Falgout, T. Jones, T. Manteuffel, S. McCormick, and J. Ruge, “Algebraic multigrid domain and range decomposition (AMG-DD/AMG-RD),” SIAM J. Sci. Comput., 37, 113–136 (2015).

  11. Y. V. Vassilevski and M. A. Olshanskii, Short Course on Multi-Grid and Domain Decomposition Methods [in Russian], Moscow, MAKS Press Publ. (2007).

  12. P. Vanek, “Smoothed prolongation multigrid with rapid coarsening and massive smoothing,” Appl. Math., 57, No. l, 1–10 (2012).

  13. M. Brezina, R. Falgout, S. Maclachlani, T. Manteuffel, S. Mccormjcki, and J. Rugei, “Adaptive smoothed aggregation (ASA),” SIAM J. Sci. Comput., 25, No. 6, 1896–1920 (2004).

    Article  MathSciNet  Google Scholar 

  14. Y. Notay, “Analysis of two-grid methods: The nonnormal case,” Report GANMN 18-01 (2018).

  15. Y. Notay and A. Napov, “A massively parallel solver for discrete Poisson-like problems,” J. Comp. Phys., 231, 237–250 (2015).

    Article  MathSciNet  MATH  Google Scholar 

  16. Y. Notay and A. Napov, “An efficient multigrid method for graph Laplacian systems II: Robust aggregation,” SIAM J. Sci. Comput., 39, No. 5, 379–403 (2017).

    Article  MathSciNet  MATH  Google Scholar 

  17. J. Xu and L. Zikatanov, Algebraic Multigrid Methods, Cambridge University Press (2017).

  18. Y. L. Gugieva, V. P. Il’in, and A. V. Petukhov, “On multigrid methods for solving twodimensional boundary value problems,” Zap. Nauchn. Semin. POMI, 482, 14–27 (2019); English transl., J. Math. Sci., 249, No. 2, 118–127 (2020).

  19. D. Demidov, “AMGCL: An efficient, flexible, and extensible algebraic multigrid implementation,” Lobachevskii J. Math., 40, No. 5, 535–546 (2019).

    Article  MathSciNet  MATH  Google Scholar 

  20. V. P. Il’in, “Iterative preconditioned methods in Krylov subpaces: Trends of the 21st Century,” Zh. Vychisl. Mat. Mat. Fiz., 61, No. 11, 1786–1813 (2021).

  21. V. P. Il’in, Mathematical Modeling. Part I. Continuous and Discrete Models [in Russian], SB RAS Publ., Novosibirsk (2017).

  22. V. P. Il’in, Finite Element Methods and Technologies [in Russian], ICMMG SB RAS Publ., Novosibirsk (2007).

Download references

Author information

Authors and Affiliations

  1. Institute of Computational Mathematics and Mathematical Geophysics SB RAS, Novosibirsk, Russia

    V. P. Il’in

Authors
  1. V. P. Il’in
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. P. Il’in.

Additional information

Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 514, 2022, pp. 61–76.

Translated by the author.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Il’in, V.P. Multigrid Incomplete Factorization Methods in Krylov Subspaces. J Math Sci 272, 523–532 (2023). https://doi.org/10.1007/s10958-023-06446-6

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-023-06446-6

Search

Navigation