Explicit Runge-Kutta-Chebyshev methods of second order with monotonic stability polynomial
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910900324139008 |
|---|---|
| author | Faleichik, Boris Moisa, Andrew |
| author_facet | Faleichik, Boris Moisa, Andrew |
| contents | A new Chebyshev-type family of stabilized explicit methods for solving mildly stiff ODEs is presented. Besides conventional conditions of order and stability we impose an additional restriction on the methods: their stability function must be monotonically increasing and positive along the largest possible interval of negative real axis. Although stability intervals of the proposed methods are smaller than those of classic Chebyshev-type methods, their stability functions are more consistent with the exponent, they have more convex stability regions and smaller error constants. These properties allow the monotonic methods to be competitive with contemporary stabilized second-order methods, as the presented results of numerical experiments demonstrate. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_00323 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Explicit Runge-Kutta-Chebyshev methods of second order with monotonic stability polynomial Faleichik, Boris Moisa, Andrew Numerical Analysis 65L04, 65L05, 65L06, 65L20, 65M20 A new Chebyshev-type family of stabilized explicit methods for solving mildly stiff ODEs is presented. Besides conventional conditions of order and stability we impose an additional restriction on the methods: their stability function must be monotonically increasing and positive along the largest possible interval of negative real axis. Although stability intervals of the proposed methods are smaller than those of classic Chebyshev-type methods, their stability functions are more consistent with the exponent, they have more convex stability regions and smaller error constants. These properties allow the monotonic methods to be competitive with contemporary stabilized second-order methods, as the presented results of numerical experiments demonstrate. |
| title | Explicit Runge-Kutta-Chebyshev methods of second order with monotonic stability polynomial |
| topic | Numerical Analysis 65L04, 65L05, 65L06, 65L20, 65M20 |
| url | https://arxiv.org/abs/2504.00323 |