- Journal Home
- Volume 36 - 2024
- Volume 35 - 2024
- Volume 34 - 2023
- Volume 33 - 2023
- Volume 32 - 2022
- Volume 31 - 2022
- Volume 30 - 2021
- Volume 29 - 2021
- Volume 28 - 2020
- Volume 27 - 2020
- Volume 26 - 2019
- Volume 25 - 2019
- Volume 24 - 2018
- Volume 23 - 2018
- Volume 22 - 2017
- Volume 21 - 2017
- Volume 20 - 2016
- Volume 19 - 2016
- Volume 18 - 2015
- Volume 17 - 2015
- Volume 16 - 2014
- Volume 15 - 2014
- Volume 14 - 2013
- Volume 13 - 2013
- Volume 12 - 2012
- Volume 11 - 2012
- Volume 10 - 2011
- Volume 9 - 2011
- Volume 8 - 2010
- Volume 7 - 2010
- Volume 6 - 2009
- Volume 5 - 2009
- Volume 4 - 2008
- Volume 3 - 2008
- Volume 2 - 2007
- Volume 1 - 2006
Commun. Comput. Phys., 36 (2024), pp. 1262-1306.
Published online: 2024-12
Cited by
- BibTex
- RIS
- TXT
In this work, we propose to learn time integration schemes based on neural networks which satisfy three distinct sets of mathematical constraints, i.e., unconstrained, semi-constrained with the root condition, and fully-constrained with both root and consistency conditions. We focus on the learning of 3-step linear multistep methods, which we subsequently applied to solve three model PDEs, i.e., the heat equation, the wave equation, and the Burgers’ equation. The results show that the prediction error of the learned fully-constrained scheme is close to that of the Runge-Kutta method and Adams-Bashforth method. Compared to the traditional methods, the learned unconstrained and semi-constrained schemes significantly reduce the prediction error on coarse grids, with an overall better performance for the semi-constrained model. On a grid $4×$ coarser than the reference, the mean square error (MSE) shows a reduction of up to two order of magnitude for some heat equation cases, and a substantial improvement in phase prediction for the wave equation. On a $32×$ coarser grid, the MSE for the Burgers’ equation can be reduced by up to 40% to 45%. Tests on the two-dimensional heat equation and wave equation show a good generalization capability for the constant optimized coefficients.
}, issn = {1991-7120}, doi = {https://doi.org/10.4208/cicp.OA-2023-0266}, url = {http://global-sci.org/intro/article_detail/cicp/23609.html} }In this work, we propose to learn time integration schemes based on neural networks which satisfy three distinct sets of mathematical constraints, i.e., unconstrained, semi-constrained with the root condition, and fully-constrained with both root and consistency conditions. We focus on the learning of 3-step linear multistep methods, which we subsequently applied to solve three model PDEs, i.e., the heat equation, the wave equation, and the Burgers’ equation. The results show that the prediction error of the learned fully-constrained scheme is close to that of the Runge-Kutta method and Adams-Bashforth method. Compared to the traditional methods, the learned unconstrained and semi-constrained schemes significantly reduce the prediction error on coarse grids, with an overall better performance for the semi-constrained model. On a grid $4×$ coarser than the reference, the mean square error (MSE) shows a reduction of up to two order of magnitude for some heat equation cases, and a substantial improvement in phase prediction for the wave equation. On a $32×$ coarser grid, the MSE for the Burgers’ equation can be reduced by up to 40% to 45%. Tests on the two-dimensional heat equation and wave equation show a good generalization capability for the constant optimized coefficients.