Evolutionary factorization and superfast relaxation count

Article

Abstract

Systems of linear algebraic equations with strongly rarefied matrices of enormous size appear in finite-difference solving of multidimensional elliptic equations. These systems are solved by iteration methods that converge rather slowly. For rectangular grids with variable coefficients and net steps, a considerably faster method is proposed. In the case of difference schemes for parabolic equations, a cost effective method called evolutionary factorization is developed. For elliptic equations, a relaxation count by evolutionally factorized schemes is suggested. This iteration method has the logarithmic convergence speed. A set of steps that practically optimizes the convergence of this algorithm and a procedure to regulate the steps that resembles the Richardson method are proposed. The procedure allows one to obtain an a posteriori asymptotically accurate error estimate of the iteration process. Previously such estimates for iteration processes were not known.

Keywords

evolutionary factorization logarithmic relaxation count 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. A. Samarskii and V. B. Andreev, Difference Methods for Elliptic Equations (Nauka, Moscow, 1976) [in Russian].Google Scholar
  2. 2.
    A. A. Samarskii and E. S. Nikolaev, Methods for Solving Network Equations (Nauka, Moscow, 1978) [in Russian].Google Scholar
  3. 3.
    D. K. Faddeev and V. N. Faddeeva, Computational Methods of Linear Algebra (FIZMATGIZ, Moscow, 1963) [in Russian].Google Scholar
  4. 4.
    A. A. Boltnev, N. N. Kalitkin, and O. A. Kacher, “Logarithmically convergent relaxation count,” Dokl. Akad. Nauk 404(2), 177–180 (2005).MathSciNetGoogle Scholar
  5. 5.
    N. N. Yanenko, Fractional Step Method for Solving Multidimensional Problems of Mathematical Fhysics (Nauka, Novosibirsk, 1967) [in Russian].Google Scholar
  6. 6.
    A. A. Samarskii, Theory of Difference Schemes (Nauka, Moscow, 1989) [in Russian].Google Scholar
  7. 7.
    N. N. Kalitkin, “Improved factorization of parabolic schemes,” Dokl. Akad. Nauk 402(4), 467–471 (2005).MATHMathSciNetGoogle Scholar
  8. 8.
    N. N. Kalitkin, Numerical Methods (Nauka, Moscow, 1978) [in Russian].Google Scholar
  9. 9.
    N. N. Kalitkin, L. F. Yukhno, and L. V. Kuz’mina, “Quantitative conditionality criterion of systems of linear algebraic equations,” Dokl. Akad. Nauk 434(4), 464–467 (2010).MathSciNetGoogle Scholar
  10. 10.
    N. N. Kalitkin, L. F. Yukhno, and L. V. Kuz’mina, “Conditionality criterion of systems of linear algebraic equations,” Mat. Model. 23(2), 3–26 (2011).MATHMathSciNetGoogle Scholar

Copyright information

© Pleiades Publishing, Ltd. 2015

Authors and Affiliations

  1. 1.Faculty of PhysicsMoscow State UniversityMoscowRussia
  2. 2.Keldysh Institute of Applied MathematicsRussian Academy of SciencesMoscowRussia

Personalised recommendations