Preview

Modeling and Analysis of Information Systems

Advanced search

Numerical Methods of Solving Cauchy Problems with Contrast Structures

https://doi.org/10.18255/1818-1015-2016-5-529-538

Abstract

Modern numerical methods allowing to solve contrast structure problems in the most efficient way are described. These methods include explicit-implicit Rosenbrock schemes with complex coefficients and fully implicit backward optimal Runge–Kutta schemes. As an integration argument, it is recommended to choose the length of the integral curve arc. This argument provides high reliability of the calculation and sufficiently decreases the complexity of computations for low-order systems. In order to increase the efficiency, we propose an automatic step selection algorithm based on curvature of the integral curve. This algorithm is as efficient as standard algorithms and has sufficiently larger reliability. We show that along with such an automatic step selection it is possible to calculate a posteriori asymptotically precise error estimation. Standard algorithms do not provide such estimations and their actual error quite often exceeds the user-defined tolerance by several orders. The applicability limitations of numerical methods are investigated. In solving superstiff problems, they sometimes do not provide satisfactory results. In such cases, it is recommended to imply approximate analytical methods. Consequently, numerical and analytical methods are complementary.

About the Authors

A. A. Belov
Lomonosov Moscow State University, 1–2 Leninskie Gory, Moscow 119991, Russia
Russian Federation
graduate student


N. N. Kalitkin
Keldysh Institute of Applied Mathematics RAS, 4 Miusskaya sq., Moscow 125047, Russia
Russian Federation
corresponding member RAS, Dr. Sci. (Phys.–Math.), professor


References

1. Hairer E., Wanner G., Solving ordinary differential equations. Stiff and differentialalgebraic problems, Springer-Verlag, Berlin, Heidelberg, New York, London, Paris, Tolyo, 1999.

2. Vasileva A. B., Butuzov V. F., Nefedov N. N., “Kontrastnye struktury v singuliarno vozmushchennykh zadachakh”, Fundamentalnaia i prikladnaia matematika, 4:3 (1998), 799–851, (in Russian).

3. Rosenbrock H. H., “Some general implicit processes for the numerical solution of differential equations”, Comput. J., 5:4 (1963), 329–330.

4. Shirkov P. D., “Optimalno zatukhaiushchie skhemy s kompleksnymi koeffitsientami dlia zhestkikh ODU”, Matem. Modelirovanie, 4:8 (1992), 47–57, (in Russian).

5. Al’shin A. B., Al’shina E. A., Limonov A. G., “Two-stage complex Rosenbrock schemes for stiff systems”, Comp. Math. and Math. Phys., 49:2 (2009), 261–278.

6. Kalitkin N. N., Poshivaylo I. P., “Inverse Ls-stable Runge-Kutta schemes”, Doklady Math., 85:1 (2012), 139–143.

7. Kalitkin N. N., Poshivaylo I. P., “Computations with inverse Runge–Kutta schemes”, Math. Models and Comp. Simulations, 6:3 (2014), 272–285.

8. Belov A. A., Kalitkin N. N., Poshivaylo I. P., “Geometrically adaptive grids for stiff Cauchy problems”, Doklady Math., 93:1 (2016), 112–116.

9. Kalitkin N. N, Alshin A. B., Alshina E. A., Rogov B. V., Vychisleniia na kvaziravnomernykh setkakh, Fizmatlit, M., 2005, (in Russian).

10. Alshina E. A., Kalitkin N. N., Koryakin P. V., “Diagnosis of singularities of exact solutions by calculation on embedded grids”, Doklady Math., 72:2 (2005), 697–701.

11. Alshina E. A., Kalitkin N. N., Koryakin P. V., “Diagnostics of singularities of exact solutions in computations with error control”, Comp. Math. and Math. Phys., 45:10 (2005), 1769–1779.

12. Belov A. A., “Numerical Detection and Study of Singularities in Solutions of Differential Equations”, Doklady Mathematics, 93:3 (2016), 334–338.


Review

For citations:


Belov A.A., Kalitkin N.N. Numerical Methods of Solving Cauchy Problems with Contrast Structures. Modeling and Analysis of Information Systems. 2016;23(5):529-538. (In Russ.) https://doi.org/10.18255/1818-1015-2016-5-529-538

Views: 1165


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.


ISSN 1818-1015 (Print)
ISSN 2313-5417 (Online)