Search

We prove rigorous bounds on the errors resulting from the approximation of the incompressible Navier–Stokes equations with (extended) physics-informed neural networks. We show that the underlying partial differential equation residual can be made arbitrarily small for tanh neural networks with two hidden layers. Moreover, the total error can be estimated in terms of the training error, network size and number of quadrature points. The theory is illustrated with numerical experiments. [ABSTRACT FROM AUTHOR]

Celestial Pole Offsets (CPO), denoted by dX and dY, describe the differences in the observed position of the pole in the celestial frame with respect to a certain precession-nutation model. Precession and nutation components are part of the transformation matrix between terrestrial and celestial systems. Therefore, various applications in geodetic science such as high-precision spacecraft navigation require information regrading precession and nutation. For this purpose, CPO can be added to the precession-nutation model to precisely describe the motion of the celestial pole. However, as Very Long Baseline Interferometry (VLBI)—currently the only technique providing CPO—requires long data processing times resulting in several weeks of latency, predictions of CPO become necessary. Here we present a new methodology named Deep Ensemble Geophysics-Informed Neural Networks (DEGINNs) to provide accurate CPO predictions. The methodology has three main elements: (1) deep ensemble learning to provide the prediction uncertainty; (2) broad-band Liouville equation as a geophysical constraint connecting the rotational dynamics of CPO to the atmospheric and oceanic Effective Angular Momentum (EAM) functions and (3) coupled oscillatory recurrent neural networks to model the sequential characteristics of CPO time-series, also capable of handling irregularly sampled time-series. To test the methodology, we use the newest version of the final CPO time-series of International Earth Rotation and Reference Systems Service (IERS), namely IERS 20 C04. We focus on a forecasting horizon of 90 days, the practical forecasting horizon needed in space-geodetic applications. Furthermore, for validation purposes we generate an independent global VLBI solution for CPO since 1984 up to the end of 2022 and analyse the series. We draw the following conclusions. First, the prediction performance of DEGINNs demonstrates up to 25 and 33 percent improvement, respectively, for dX and dY, with respect to the rapid data provided by IERS. Secondly, predictions made with the help of EAM are more accurate compared to those without EAM, thus providing a clue to the role of atmosphere and ocean on the excitation of CPO. Finally, free core nutation period shows temporal variations with a dominant periodicity of around one year, partially excited by EAM. [ABSTRACT FROM AUTHOR]

Physics-informed neural networks (PINNs) have recently been widely used for robust and accurate approximation of partial differential equations (PDEs). We provide upper bounds on the generalization error of PINNs approximating solutions of the forward problem for PDEs. An abstract formalism is introduced and stability properties of the underlying PDE are leveraged to derive an estimate for the generalization error in terms of the training error and number of training samples. This abstract framework is illustrated with several examples of nonlinear PDEs. Numerical experiments, validating the proposed theory, are also presented. [ABSTRACT FROM AUTHOR]

Physics-informed neural networks (PINNs) have recently been very successfully applied for efficiently approximating inverse problems for partial differential equations (PDEs). We focus on a particular class of inverse problems, the so-called data assimilation or unique continuation problems, and prove rigorous estimates on the generalization error of PINNs approximating them. An abstract framework is presented and conditional stability estimates for the underlying inverse problem are employed to derive the estimate on the PINN generalization error, providing rigorous justification for the use of PINNs in this context. The abstract framework is illustrated with examples of four prototypical linear PDEs. Numerical experiments, validating the proposed theory, are also presented. [ABSTRACT FROM AUTHOR]

DeepONets have recently been proposed as a framework for learning nonlinear operators mapping between infinite-dimensional Banach spaces. We analyze DeepONets and prove estimates on the resulting approximation and generalization errors. In particular, we extend the universal approximation property of DeepONets to include measurable mappings in non-compact spaces. By a decomposition of the error into encoding, approximation and reconstruction errors, we prove both lower and upper bounds on the total error, relating it to the spectral decay properties of the covariance operators, associated with the underlying measures. We derive almost optimal error bounds with very general affine reconstructors and with random sensor locations as well as bounds on the generalization error, using covering number arguments. We illustrate our general framework with four prototypical examples of nonlinear operators, namely those arising in a nonlinear forced ordinary differential equation, an elliptic partial differential equation (PDE) with variable coefficients and nonlinear parabolic and hyperbolic PDEs. While the approximation of arbitrary Lipschitz operators by DeepONets to accuracy |$\epsilon $| is argued to suffer from a 'curse of dimensionality' (requiring a neural networks of exponential size in |$1/\epsilon $|⁠), in contrast, for all the above concrete examples of interest, we rigorously prove that DeepONets can break this curse of dimensionality (achieving accuracy |$\epsilon $| with neural networks of size that can grow algebraically in |$1/\epsilon $|⁠).Thus, we demonstrate the efficient approximation of a potentially large class of operators with this machine learning framework. [ABSTRACT FROM AUTHOR]