<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">Discrete and Continuous Models and Applied Computational Science</journal-id><journal-title-group><journal-title xml:lang="en">Discrete and Continuous Models and Applied Computational Science</journal-title><trans-title-group xml:lang="ru"><trans-title>Discrete and Continuous Models and Applied Computational Science</trans-title></trans-title-group></journal-title-group><issn publication-format="print">2658-4670</issn><issn publication-format="electronic">2658-7149</issn><publisher><publisher-name xml:lang="en">Peoples' Friendship University of Russia named after Patrice Lumumba (RUDN University)</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">27531</article-id><article-id pub-id-type="doi">10.22363/2658-4670-2021-29-3-271-284</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Articles</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>Статьи</subject></subj-group><subj-group subj-group-type="article-type"><subject>Research Article</subject></subj-group></article-categories><title-group><article-title xml:lang="en">Richardson-Kalitkin method in abstract description</article-title><trans-title-group xml:lang="ru"><trans-title>Метод Ричардсона-Калиткина в абстрактном изложении</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-8950-1781</contrib-id><name-alternatives><name xml:lang="en"><surname>Baddour</surname><given-names>Ali</given-names></name><name xml:lang="ru"><surname>Баддур</surname><given-names>Али</given-names></name></name-alternatives><bio xml:lang="en"><p>PhD student of Department of Applied Probability and Informatics</p></bio><email>alibddour@gmail.com</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-6541-6603</contrib-id><name-alternatives><name xml:lang="en"><surname>Malykh</surname><given-names>Mikhail D.</given-names></name><name xml:lang="ru"><surname>Малых</surname><given-names>М. Д.</given-names></name></name-alternatives><bio xml:lang="en"><p>Doctor of Physical and Mathematical Sciences, Assistant professor of Department of Applied Probability and Informatics of Peoples’ Friendship University of Russia (RUDN University); Researcher in Meshcheryakov Laboratory of Information Technologies, Joint Institute for Nuclear Research</p></bio><email>malykh_md@pfur.ru</email><xref ref-type="aff" rid="aff1"/><xref ref-type="aff" rid="aff2"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Peoples’ Friendship University of Russia (RUDN University)</institution></aff><aff><institution xml:lang="ru">Российский университет дружбы народов</institution></aff></aff-alternatives><aff-alternatives id="aff2"><aff><institution xml:lang="en">Meshcheryakov Laboratory of Information Technologies Joint Institute for Nuclear Research</institution></aff><aff><institution xml:lang="ru">Объединённый институт ядерных исследований</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2021-09-30" publication-format="electronic"><day>30</day><month>09</month><year>2021</year></pub-date><volume>29</volume><issue>3</issue><issue-title xml:lang="en">VOL 29, NO3 (2021)</issue-title><issue-title xml:lang="ru">ТОМ 29, №3 (2021)</issue-title><fpage>271</fpage><lpage>284</lpage><history><date date-type="received" iso-8601-date="2021-09-30"><day>30</day><month>09</month><year>2021</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2021, Baddour A., Malykh M.D.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2021, Али Б., Малых М.Д.</copyright-statement><copyright-year>2021</copyright-year><copyright-holder xml:lang="en">Baddour A., Malykh M.D.</copyright-holder><copyright-holder xml:lang="ru">Али Б., Малых М.Д.</copyright-holder><ali:free_to_read xmlns:ali="http://www.niso.org/schemas/ali/1.0/"/><license><ali:license_ref xmlns:ali="http://www.niso.org/schemas/ali/1.0/">http://creativecommons.org/licenses/by/4.0</ali:license_ref></license></permissions><self-uri xlink:href="https://journals.rudn.ru/miph/article/view/27531">https://journals.rudn.ru/miph/article/view/27531</self-uri><abstract xml:lang="en"><p style="text-align: justify;">An abstract description of the Richardson–Kalitkin method is given for obtaining a posteriori estimates for the proximity of the exact and found approximate solution of initial problems for ordinary differential equations (ODE). The problem <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mi>Ρ</mi><annotation encoding="LaTeX">{{\Rho}}</annotation></semantics></math> is considered, the solution of which results in a real number <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mi>u</mi><annotation encoding="LaTeX">u</annotation></semantics></math>. To solve this problem, a numerical method is used, that is, the set <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>H</mi><mo>⊂</mo><mi mathvariant="normal">ℝ</mi></mrow><annotation encoding="LaTeX">{H\subset \mathbb{R}}</annotation></semantics></math> and the mapping <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>u</mi><mi>h</mi></msub><mo>:</mo><mi>H</mi><mo>→</mo><mi mathvariant="normal">ℝ</mi></mrow><annotation encoding="LaTeX">{u_h:H\to\mathbb{R}}</annotation></semantics></math> are given, the values of which can be calculated constructively. It is assumed that 0 is a limit point of the set <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mi>H</mi><annotation encoding="LaTeX">H</annotation></semantics></math> and <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><msub><mi>u</mi><mi>h</mi></msub><annotation encoding="LaTeX">{u_h}</annotation></semantics></math> can be expanded in a convergent series in powers of <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>h</mi><mo>:</mo><msub><mi>u</mi><mi>h</mi></msub><mo>=</mo><mi>u</mi><mo>+</mo><msub><mi>c</mi><mn>1</mn></msub><msup><mi>h</mi><mi>k</mi></msup><mo>+</mo><mo>.</mo><mo>.</mo><mo>.</mo></mrow><annotation encoding="LaTeX">{h:u_h=u+c_1h^k+...}</annotation></semantics></math>. In this very general situation, the Richardson–Kalitkin method is formulated for obtaining estimates for <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mi>u</mi><annotation encoding="LaTeX">u</annotation></semantics></math> and <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mi>c</mi><annotation encoding="LaTeX">c</annotation></semantics></math> from two values of <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><msub><mi>u</mi><mi>h</mi></msub><annotation encoding="LaTeX">{u_h}</annotation></semantics></math>. The question of using a larger number of <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><msub><mi>u</mi><mi>h</mi></msub><annotation encoding="LaTeX">{u_h}</annotation></semantics></math> values to obtain such estimates is considered. Examples are given to illustrate the theory. It is shown that the Richardson–Kalitkin approach can be successfully applied to problems that are solved not only by the finite difference method.</p></abstract><trans-abstract xml:lang="ru"><p style="text-align: justify;">Дано абстрактное описание метода Ричардсона-Калиткина для получения апостериорных оценок близости точного и найденного приближённого решения начальных задач для обыкновенных дифференциальных уравнений (ОДУ). Рассматривается задача <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mi>Ρ</mi><annotation encoding="LaTeX">{{\Rho}}</annotation></semantics></math>, результатом решения которой является вещественное число <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mi>u</mi><annotation encoding="LaTeX">u</annotation></semantics></math>. Для решения этой задачи используется численный метод, то есть заданы множество <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>H</mi><mo>⊂</mo><mi mathvariant="normal">ℝ</mi></mrow><annotation encoding="LaTeX">{H\subset \mathbb{R}}</annotation></semantics></math> и отображение <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>u</mi><mi>h</mi></msub><mo>:</mo><mi>H</mi><mo>→</mo><mi mathvariant="normal">ℝ</mi></mrow><annotation encoding="LaTeX">{u_h:H\to\mathbb{R}}</annotation></semantics></math>, значения которого имеется возможность вычислять конструктивно. При этом предполагается, что 0 является предельной точкой множества <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mi>H</mi><annotation encoding="LaTeX">H</annotation></semantics></math>, <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><msub><mi>u</mi><mi>h</mi></msub><annotation encoding="LaTeX">{u_h}</annotation></semantics></math> можно разложить в сходящийся ряд по степеням <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>h</mi><mo>:</mo><msub><mi>u</mi><mi>h</mi></msub><mo>=</mo><mi>u</mi><mo>+</mo><msub><mi>c</mi><mn>1</mn></msub><msup><mi>h</mi><mi>k</mi></msup><mo>+</mo><mo>.</mo><mo>.</mo><mo>.</mo></mrow><annotation encoding="LaTeX">{h:u_h=u+c_1h^k+...}</annotation></semantics></math>. В этой весьма общей ситуации сформулирован метод Ричардсона–Калиткина получения оценок для <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mi>u</mi><annotation encoding="LaTeX">u</annotation></semantics></math> и <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mi>c</mi><annotation encoding="LaTeX">c</annotation></semantics></math> по двум значениям <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><msub><mi>u</mi><mi>h</mi></msub><annotation encoding="LaTeX">{u_h}</annotation></semantics></math> . Рассмотрен вопрос об использовании большего числа значений <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><msub><mi>u</mi><mi>h</mi></msub><annotation encoding="LaTeX">{u_h}</annotation></semantics></math> для получения такого рода оценок. Приведены примеры, иллюстрирующие теорию. Показано, что подход Ричардсона–Калиткина с успехом может быть применён к задачам, которые решаются не только методом конечных разностей.</p></trans-abstract><kwd-group xml:lang="en"><kwd>finite difference method</kwd><kwd>ordinary differential equations</kwd><kwd>a posteriori errors</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>метод конечных разностей</kwd><kwd>обыкновенные дифференциальные уравнения</kwd><kwd>апостериорные ошибки</kwd></kwd-group><funding-group><funding-statement xml:lang="en">This work is supported by the Russian Science Foundation (grant no. 2011-20257).</funding-statement></funding-group></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>E. Hairer, G. Wanner, and S. P. Nørsett, Solving Ordinary Differential Equations, 3rd ed. New York: Springer, 2008, vol. 1.</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>L. F. Richardson and J. A. Gaunt, “The deferred approach to the limit,” Phil. Trans. A, vol. 226, pp. 299-349, 1927. DOI: 10.1098/rsta.1927.0008.</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>N. N. Kalitkin, A. B. Al’shin, E. A. Al’shina, and B. V. Rogov, Calculations on quasi-uniform grids. Moscow: Fizmatlit, 2005, In Russian.</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>N. N. Kalitkin, Numerical methods [Chislennyye metody]. Moscow: Nauka, 1979, In Russian.</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>A. A. Belov, N. N. Kalitkin, and I. P. Poshivaylo, “Geometrically adaptive grids for stiff Cauchy problems,” Doklady Mathematics, vol. 93, no. 1, pp. 112-116, 2016. DOI: 10.1134/S1064562416010129.</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>A. A. Belov and N. N. Kalitkin, “Nonlinearity problem in the numerical solution of superstiff Cauchy problems,” Mathematical Models and Computer Simulations, vol. 8, no. 6, pp. 638-650, 2016. DOI: 10.1134/S2070048216060065.</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>A. A. Belov, N. N. Kalitkin, P. E. Bulatov, and E. K. Zholkovskii, “Explicit methods for integrating stiff Cauchy problems,” Doklady Mathematics, vol. 99, no. 2, pp. 230-234, 2019. DOI: 10.1134/S1064562419020273.</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>L. N. Trefethen and J. A. C. Weideman, “The exponentially convergent trapezoidal rule,” SIAM Review, vol. 56, pp. 385-458, 3 2014. DOI: 10.1137/130932132.</mixed-citation></ref><ref id="B9"><label>9.</label><mixed-citation>A. A. Belov and V. S. Khokhlachev, “Asymptotically accurate error estimates of exponential convergence for the trapezoid rule,” Discrete and Continuous Models and Applied Computational Science, vol. 3, pp. 251- 259, 2021. DOI: 10.22363/2658-4670-2021-29-3-251-259.</mixed-citation></ref><ref id="B10"><label>10.</label><mixed-citation>A. Baddour, M. D. Malykh, A. A. Panin, and L. A. Sevastianov, “Numerical determination of the singularity order of a system of differential equations,” Discrete and Continuous Models and Applied Computational Science, vol. 28, no. 5, pp. 17-34, 2020. DOI: 10.22363/2658-46702020-28-1-17-34.</mixed-citation></ref><ref id="B11"><label>11.</label><mixed-citation>The Sage Developers. “SageMath, the Sage Mathematics Software System (Version 7.4).” (2016), [Online]. Available: https://www.sagemath.org.</mixed-citation></ref><ref id="B12"><label>12.</label><mixed-citation>O. C. Zienkiewicz, R. L. Taylor, and J. Z. Zhu, The finite element method: its basis and fundamentals, 7th ed. Elsiver, 2013.</mixed-citation></ref><ref id="B13"><label>13.</label><mixed-citation>F. Hecht, “New development in FreeFem++,” Journal of Numerical Mathematics, vol. 20, no. 3-4, pp. 251-265, 2012. DOI: 10.1515/jnum2012-0013.</mixed-citation></ref><ref id="B14"><label>14.</label><mixed-citation>A. A. Panin, “Estimates of the accuracy of approximate solutions and their application in the problems of mathematical theory of waveguides [Otsenki tochnosti priblizhonnykh resheniy i ikh primeneniye v zadachakh matematicheskoy teorii volnovodov],” in Russian, Ph.D. dissertation, MSU, Moscow, 2009.</mixed-citation></ref></ref-list></back></article>
