- Journal Home
- Volume 21 - 2024
- Volume 20 - 2023
- Volume 19 - 2022
- Volume 18 - 2021
- Volume 17 - 2020
- Volume 16 - 2019
- Volume 15 - 2018
- Volume 14 - 2017
- Volume 13 - 2016
- Volume 12 - 2015
- Volume 11 - 2014
- Volume 10 - 2013
- Volume 9 - 2012
- Volume 8 - 2011
- Volume 7 - 2010
- Volume 6 - 2009
- Volume 5 - 2008
- Volume 4 - 2007
- Volume 3 - 2006
- Volume 2 - 2005
- Volume 1 - 2004
Cited by
- BibTex
- RIS
- TXT
The midpoint method can be implemented as a sequence of Backward Euler and Forward Euler solves with half time steps, allowing for improved performance of existing solvers for PDEs. We highlight the advantages of this refactorization by considering some specifics of implementation, conservation, error estimation, adaptivity, stability, and performance on several test problems.
}, issn = {2617-8710}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/ijnam/20482.html} }The midpoint method can be implemented as a sequence of Backward Euler and Forward Euler solves with half time steps, allowing for improved performance of existing solvers for PDEs. We highlight the advantages of this refactorization by considering some specifics of implementation, conservation, error estimation, adaptivity, stability, and performance on several test problems.