Abstract
In this paper we derive new explicit two-stage peer methods for the numerical solution of ordinary differential equations by using the technique introduced in [2] for Runge-Kutta methods. This technique allows to re-determine the order conditions of classical methods, obtaining new coefficients values. The coefficients of new methods are no longer constant, but depend on the Jacobian function of the ordinary differential equation. The new methods preserve the order of classical peer methods, and are more accurate and with better stability properties. Numerical tests highlight the advantage of new methods especially for stiff problems.
The authors Conte, Pagano and Paternoster are members of the GNCS group. This work is supported by GNCS-INDAM project and by PRIN2017-MIUR project.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Weiner, R., Biermann, K., Schmitt, B., Podhaisky, H.: Explicit two-step peer methods. Comput. Math. Appl. 55, 609–619 (2008). https://doi.org/10.1016/j.camwa.2007.04.026
Ixaru, L.: Runge-Kutta methods with equation dependent coefficients. Comput. Phys. Commun. 183, 63–69 (2012). https://doi.org/10.1016/j.cpc.2011.08.017
Conte, D., D’Ambrosio, R., Pagano, G., Paternoster, B.: Jacobian-dependent vs Jacobian-free discretizations for nonlinear differential problems. Comput. Appl. Math. 39(3), 1–12 (2020). https://doi.org/10.1007/s40314-020-01200-z
Fang, Y., Yang, Y., You, X., Wang, B.: A new family of A-stable Runge-Kutta methods with equation-dependent coefficients for stiff problems. Numer. Algorithms 81(4), 1235–1251 (2018). https://doi.org/10.1007/s11075-018-0619-7
Ixaru, L.: Operations on oscillatory functions. Comput. Phys. Commun. 105, 1–19 (1997). https://doi.org/10.1016/S0010-4655(97)00067-2
Ixaru, L., Berghe, G.: Exponential Fitting (2004). https://doi.org/10.1007/978-1-4020-2100-8
Kulikov, G., Weiner, R.: Doubly quasi-consistent parallel explicit peer methods with built-in global error estimation. J. Comput. Appl. Math. 233, 2351–2364 (2010). https://doi.org/10.1016/j.cam.2009.10.020
Schmitt, B., Wiener, R.: Parallel start for explicit parallel two-step peer methods. Numer. Algorithms 53, 363–381 (2010). https://doi.org/10.1007/s11075-009-9267-2
Schmitt, B., Weiner, R., Jebens, S.: Parameter optimization for explicit parallel peer two-step methods. Appl. Numer. Math. 59, 769–782 (2009). https://doi.org/10.1016/j.apnum.2008.03.013
Weiner, R., Kulikov, G.Y., Podhaisky, H.: Variable-stepsize doubly quasi-consistent parallel explicit peer methods with global error control. J. Comput. Appl. Math. 62, 2351–2364 (2012). https://doi.org/10.1016/j.apnum.2012.06.018
Horváth, Z., Podhaisky, H., Weiner, R.: Strong stability preserving explicit peer methods. J. Comput. Appl. Math. 296, 776–788 (2015). https://doi.org/10.1016/j.cam.2015.11.005
Jebens, S., Weiner, R., Podhaisky, H., Schmitt, B.: Explicit multi-step peer methods for special second-order differential equations. Appl. Math. Comput. 202, 803–813 (2008). https://doi.org/10.1016/j.amc.2008.03.025
Klinge, M., Weiner, R.: Strong stability preserving explicit peer methods for discontinuous Galerkin discretizations. J. Sci. Comput. 75(2), 1057–1078 (2017). https://doi.org/10.1007/s10915-017-0573-x
Klinge, M., Weiner, R., Podhaisky, H.: Optimally zero stable explicit peer methods with variable nodes. BIT Numer. Math. 58(2), 331–345 (2017). https://doi.org/10.1007/s10543-017-0691-8
Montijano, J.I., Rández, L., Van Daele, M., Calvo, M.: Functionally fitted explicit two step peer methods. J. Sci. Comput. 64(3), 938–958 (2014). https://doi.org/10.1007/s10915-014-9951-9
Weiner, R., Schmitt, B., Podhaisky, H., Jebens, S.: Superconvergent explicit two-step peer methods. J. Comput. Appl. Math. 223, 753–764 (2009). https://doi.org/10.1016/j.cam.2008.02.014
Jebens, S., Knoth, O., Weiner, R.: Linearly implicit peer methods for the compressible Euler equations. J. Comput. Phys. 230, 4955–4974 (2011). https://doi.org/10.1016/j.jcp.2011.03.015
Kulikov, G.Y., Weiner, R.: Doubly quasi-consistent fixed-stepsize numerical integration of stiff ordinary differential equations with implicit two-step peer methods. J. Comput. Appl. Math. 340, 256–275 (2018). https://doi.org/10.1016/j.cam.2018.02.037
Lang, J., Hundsdorfer, W.: Extrapolation-based implicit-explicit peer methods with optimised stability regions. J. Comput. Phys. 337, 203–215 (2016). https://doi.org/10.1016/j.jcp.2017.02.034
Schneider, M., Lang, J., Hundsdorfer, W.: Extrapolation-based super-convergent implicit-explicit peer methods with A-stable implicit part. J. Comput. Phys. 367, 121–133 (2017). https://doi.org/10.1016/j.jcp.2018.04.006
Schneider, M., Lang, J., Weiner, R.: Super-convergent implicit-explicit Peer methods with variable step sizes. J. Comput. Appl. Math. 387, 112501 (2019). https://doi.org/10.1016/j.cam.2019.112501
Conte, D., D’Ambrosio, R., Moccaldi, M., Paternoster, B.: Adapted explicit two-step peer methods. J. Numer. Math. 27, 69–83 (2018). https://doi.org/10.1515/jnma-2017-0102
Conte, D., Mohammadi, F., Moradi, L., Paternoster, B.: Exponentially fitted two-step peer methods for oscillatory problems. Comput. Appl. Math. 39(3), 1–19 (2020). https://doi.org/10.1007/s40314-020-01202-x
Conte, D., Paternoster, B., Moradi, L., Mohammadi, F.: Construction of exponentially fitted explicit peer methods. Int. J. Circuits 13, 501–506 (2019)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Conte, D., Pagano, G., Paternoster, B. (2021). Jacobian-Dependent Two-Stage Peer Method for Ordinary Differential Equations. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2021. ICCSA 2021. Lecture Notes in Computer Science(), vol 12949. Springer, Cham. https://doi.org/10.1007/978-3-030-86653-2_23
Download citation
DOI: https://doi.org/10.1007/978-3-030-86653-2_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-86652-5
Online ISBN: 978-3-030-86653-2
eBook Packages: Computer ScienceComputer Science (R0)