Abstract:
Automatic step selection algorithms are widely used to solve stiff Cauchy problems. The Gear and Dormand–Prince packages are the most popular ones. These methods are well established being used in soft problems but they can malfunction in stiff ones. Moreover, they do not provide guaranteed error estimation. The cases are known where the real error exceeds the user defined one by many orders of magnitude. In that work the new problem examples are found in which standard algorithms lose robustness.
Citation:
A. A. Belov, P. E. Bulatov, N. N. Kalitkin, “Comparative analysis of automatic step selection algorithms for stiff Cauchy problems”, Keldysh Institute preprints, 2019, 146, 34 pp.
\Bibitem{BelBulKal19}
\by A.~A.~Belov, P.~E.~Bulatov, N.~N.~Kalitkin
\paper Comparative analysis of automatic step selection algorithms for stiff Cauchy problems
\jour Keldysh Institute preprints
\yr 2019
\papernumber 146
\totalpages 34
\mathnet{http://mi.mathnet.ru/ipmp2784}
\crossref{https://doi.org/10.20948/prepr-2019-146}
Linking options:
https://www.mathnet.ru/eng/ipmp2784
https://www.mathnet.ru/eng/ipmp/y2019/p146
This publication is cited in the following 2 articles:
M. F. Danilov, “Evaluation of the Influence of Secondary Processes on the Results of the Measurement of Rate Constants of Gas-Phase Chemical Reactions”, Fluid Dyn, 59:5 (2024), 1511
A. A. Belov, A. S. Vergazov, N. N. Kalitkin, “Kontrol tochnosti pri chislennom integrirovanii zhestkikh sistem”, Preprinty IPM im. M. V. Keldysha, 2020, 088, 27 pp.
Citation in format AMSBIB
Contact us: