×

Numerical solution of the Cauchy problem based on the basic element method. (Russian. English summary) Zbl 1522.65112

Summary: A fundamentally new approach to the numerical solution of the Cauchy problem for ODE based on polynomials in the form of basic elements. In contrast to the explicit methods of Runge-Kutta, Adams and others, proposed approach can solve stiff problems. The approach is based on an explicit “predictor-corrector” scheme. The calculation of the prediction at the next step is carried out using two polynomials of the fifth degree, connected by additional conditions with double reference to the right side of the equation. The error of the method is regulated by the step length \(h\) and the control parameter \(K\), \(0<K<1\). Such a scheme is stable for calculations with extremely small steps \((h=10^{-17}, 10^{-15})\). The fifth order of the method is confirmed by the test for the stiff problem, also by the results of an analysis of an asymptotically precise error estimate according to the Richardson scheme on a sequence of shredding grids.

MSC:

65L04 Numerical methods for stiff equations
65L60 Finite element, Rayleigh-Ritz, Galerkin and collocation methods for ordinary differential equations

Software:

RODAS; pchip; UNCMND

References:

[1] E. Hyrer, S. Norsett, G. Wanner, Solving Ordinary differential equations. Nonstiff problems, Springer-Verlag, Heidelberg-Berlin, 1987, 512 pp. · Zbl 0638.65058
[2] E. Hairer, G. Wanner, Solving Ordinary Differential Equations, v. II, Stiff and Differential-Algebraic Problems, Second Revised Edition, Springer-Verlag, 1991 · Zbl 0729.65051
[3] K. Atkinson, W. Han, D. Stewart, Numerical Solution of Ordinary Differential Equations, John Wiley & Sons, Inc, Hoboken, New Jersey, 2009 · Zbl 1168.65004
[4] E. K. Zholkovskii, A. A. Belov, N. N. Kalitkin, “Solution of stiff Cauchy problems with explicit schemes with geometrical-adaptive step selection”, Keldysh Institute preprints, 2018, 227, 20 pp.
[5] N. D. Dikusar, “The Basic Element Method”, Math. Models and Computer Simulations, 3:4 (2011), 492-507 · Zbl 1240.65077 · doi:10.1134/S2070048211040053
[6] N. D. Dikusar, Polinomialnyj prognoz na trekhtochechnykh setkakh
[7] P. L. Chebyshev, Izbrannye trudy, AN SSSR, M., 1955
[8] N. D. Dikusar, “Piecewise Polynomial Approximation of the Sixth Order with Automatic Knots Detection”, Math. Models & Comput. Simul., 6:5 (2014), 509-522 · Zbl 1313.65259 · doi:10.1134/S2070048214050020
[9] N. D. Dikusar, “Higher Order Polynomial Approximation”, Math. Models & Comput. Simulations, 8:2 (2016), 183-200 · Zbl 1349.65062 · doi:10.1134/S2070048216020058
[10] N. D. Dikusar, “Optimizacija reshenija v zadachakh kusochno-polinomialnoj approksimacii”, Supercomputing and Mathematical Modeling, Proc. of the XVI Inter. Conference, FSUE “RFNC-VNIIEF”, Sarov, 2017, 113-122
[11] D. Kahaner, C. Moler, S. Nash, Numerical Methods and Software, Prentice-Hall Inc, 1989 · Zbl 0744.65002
[12] N. N. Kalitkin, P. V. Korjakin, Chislennye metody, v 2 kn., v. 2, Metody matematicheskoj fiziki, Izdatelskij centr “Akademija”, M., 2013, 304 pp.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.