- Journal Home
- Volume 18 - 2025
- Volume 17 - 2024
- Volume 16 - 2023
- Volume 15 - 2022
- Volume 14 - 2021
- Volume 13 - 2020
- Volume 12 - 2019
- Volume 11 - 2018
- Volume 10 - 2017
- Volume 9 - 2016
- Volume 8 - 2015
- Volume 7 - 2014
- Volume 6 - 2013
- Volume 5 - 2012
- Volume 4 - 2011
- Volume 3 - 2010
- Volume 2 - 2009
- Volume 1 - 2008
Numer. Math. Theor. Meth. Appl., 18 (2025), pp. 31-65.
Published online: 2025-04
Cited by
- BibTex
- RIS
- TXT
When DeepONet approximates solution operators of partial differential equations (PDEs) with discontinuous solutions, it poses a foundational approximation lower bound due to its linear reconstruction property. Inspired by the moving mesh method, we propose an R-adaptive DeepONet method, which consists of: (1) the output data representation is transformed from the physical domain to the computational domain using the equidistribution principle; (2) the maps from input parameters to the solution and the coordinate transformation function over the computational domain are learned using DeepONets separately; (3) the solution over the physical domain is obtained via post-processing methods such as the interpolation method. Additionally, we introduce a solution-dependent weighting strategy in the training process to reduce the error. We establish an upper bound for the reconstruction error based on piecewise linear interpolation and show that the introduced R-adaptive DeepONet can reduce this bound. Moreover, for two prototypical PDEs with sharp gradients or discontinuities, we prove that the approximation error decays at a superlinear rate with respect to the trunk basis size, unlike the linear decay observed in vanilla DeepONets. Numerical experiments on several PDEs with discontinuous solutions are conducted to verify the advantages of the R-adaptive DeepONet over available variants of DeepONet.
}, issn = {2079-7338}, doi = {https://doi.org/10.4208/nmtma.OA-2024-0124}, url = {http://global-sci.org/intro/article_detail/nmtma/23941.html} }When DeepONet approximates solution operators of partial differential equations (PDEs) with discontinuous solutions, it poses a foundational approximation lower bound due to its linear reconstruction property. Inspired by the moving mesh method, we propose an R-adaptive DeepONet method, which consists of: (1) the output data representation is transformed from the physical domain to the computational domain using the equidistribution principle; (2) the maps from input parameters to the solution and the coordinate transformation function over the computational domain are learned using DeepONets separately; (3) the solution over the physical domain is obtained via post-processing methods such as the interpolation method. Additionally, we introduce a solution-dependent weighting strategy in the training process to reduce the error. We establish an upper bound for the reconstruction error based on piecewise linear interpolation and show that the introduced R-adaptive DeepONet can reduce this bound. Moreover, for two prototypical PDEs with sharp gradients or discontinuities, we prove that the approximation error decays at a superlinear rate with respect to the trunk basis size, unlike the linear decay observed in vanilla DeepONets. Numerical experiments on several PDEs with discontinuous solutions are conducted to verify the advantages of the R-adaptive DeepONet over available variants of DeepONet.