|
Stability domains of explicit multistep
methods
I. V. Kireevab, A. E. Novikovb, E. A. Novikovba a Institute of Computational Modelling, Siberian Branch of the Russian Academy of Sciences, Krasnoyarsk
b Institute of Mathematics and Computer Science, Siberian Federal University, Krasnoyarsk
Abstract:
A new algorithm is proposed for obtaining stability domains of multistep numerical schemes. The algorithm is based on Bernoulli’s algorithm for computing the greatest in magnitude root of a polynomial with
complex coefficients and the Dandelin–Lobachevsky–Graeffe method for squaring the roots. Numerical results
on the construction of stability domains of Adams–Bashforth methods of order 3–11 are given.
Key words:
Adams–Bashforth method, locus, stability domain, Bernoulli method, Dandelin–Lobachevsky–Graeffe method.
Received: 17.03.2022 Revised: 24.03.2022 Accepted: 18.07.2022
Citation:
I. V. Kireev, A. E. Novikov, E. A. Novikov, “Stability domains of explicit multistep
methods”, Sib. Zh. Vychisl. Mat., 25:4 (2022), 417–428
Linking options:
https://www.mathnet.ru/eng/sjvm821 https://www.mathnet.ru/eng/sjvm/v25/i4/p417
|
Statistics & downloads: |
Abstract page: | 55 | Full-text PDF : | 1 | References: | 21 | First page: | 13 |
|