RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Keldysh Institute preprints:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Keldysh Institute preprints, 2013, 069, 36 pages (Mi ipmp1819)  

This article is cited in 3 scientific papers (total in 3 papers)

Evolutional factorization and superfast relaxation count

A. A. Belov, N. N. Kalitkin


Abstract: In finite-difference solution of multi-dimensional elliptic equations the systems of linear algebraic equations with strongly rarefied matrices of enormous sizes appear. They are solved by iteratonal methods with slow convergence. For rectangular nets, variable coefficients and net steps much more fast method is proposed. In case of finite difference schemes for parabolic equations an efficient method, called evolutional factorization, is built. For elliptic equations relaxation count for evolutionally factorized schemes is proposed. This iterational method has logarithmic convergence. A set of steps, that practically optimizes the method's convergence, and Richardson-like procedure of steps regulation are proposed. The procedure delivers an a posteriori asymptotically precise estimation for the iterational process error. Such estimations were not known before.

Keywords: evolutional factorization, logarithmic relaxation count.

Full text: PDF file (2924 kB)
Full text: http:/.../preprint.asp?id=2013-69&lg=r
References: PDF file   HTML file

Citation: A. A. Belov, N. N. Kalitkin, “Evolutional factorization and superfast relaxation count”, Keldysh Institute preprints, 2013, 069, 36 pp.

Citation in format AMSBIB
\Bibitem{BelKal13}
\by A.~A.~Belov, N.~N.~Kalitkin
\paper Evolutional factorization and superfast relaxation count
\jour Keldysh Institute preprints
\yr 2013
\papernumber 069
\totalpages 36
\mathnet{http://mi.mathnet.ru/ipmp1819}


Linking options:
  • http://mi.mathnet.ru/eng/ipmp1819
  • http://mi.mathnet.ru/eng/ipmp/y2013/p69

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
    Cycle of papers

    This publication is cited in the following articles:
    1. A. A. Belov, “Programmy SuFaReC dlya sverkhbystrogo rascheta ellipticheskikh uravnenii v pryamougolnoi oblasti”, Preprinty IPM im. M. V. Keldysha, 2015, 044, 12 pp.  mathnet
    2. A. A. Belov, N. N. Kalitkin, “Sverkhbystryi metod s garantirovannoi tochnostyu dlya ellipticheskikh uravnenii v pryamougolnoi oblasti”, Matem. modelirovanie, 27:7 (2015), 37–43  mathnet  mathscinet  elib
    3. A. A. Belov, N. N. Kalitkin, “Numerical simulations of boundary layer problems”, Math. Models Comput. Simul., 8:4 (2016), 341–347  mathnet  crossref  mathscinet  elib
  • Препринты Института прикладной математики им. М. В. Келдыша РАН
    Number of views:
    This page:257
    Full text:101
    References:43

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020