|
This article is cited in 2 scientific papers (total in 2 papers)
Elementary differentals, their graphs and codes
A. V. Tygliyan, S. S. Filippov Keldysh Institute of Applied Mathematics of the Russian Academy of Sciences
Abstract:
Many tens or hundreds of elementary differentials must be taken into account in constructing one-step numerical methods for solving ODE (like Runge–Kutta methods, Rosenbrock methods, ABC-schemes) of high order accuracy. Their graphical representation in use nowadays does not allow to computerize the huge amount of manual labor. We propose a simple and intuitive way for digital encoding of them and algorithms for generation, analysis and synthesis of these codes. These algorithms are implemented in a computer program that computes tables of codes for elementary differentials up to arbitrary order, together with their multiplicities and gamma-factors.
Received: 20.12.2007
Citation:
A. V. Tygliyan, S. S. Filippov, “Elementary differentals, their graphs and codes”, Matem. Mod., 21:8 (2009), 37–43; Math. Models Comput. Simul., 2:2 (2010), 156–161
Linking options:
https://www.mathnet.ru/eng/mm2865 https://www.mathnet.ru/eng/mm/v21/i8/p37
|
Statistics & downloads: |
Abstract page: | 369 | Full-text PDF : | 131 | References: | 48 | First page: | 7 |
|