In this work, we present a new high order Discontinuous Galerkin time integration scheme for second-order (in time) differential systems that typically arise from the space discretization of the elastodynamics equation. By rewriting the original equation as a system of first order differential equations we introduce the method and show that the resulting discrete formulation is well-posed, stable and retains super-optimal rate of convergence with respect to the discretization parameters, namely the time step and the polynomial approximation degree. A set of two- and three-dimensional numerical experiments confirm the theoretical bounds. Finally, the method is applied to real geophysical applications.
The numerical solution of partial differential equations (PDEs) is difficult, having led to a century of research so far. Recently, there have been pushes to build neural--numerical hybrid solvers, which piggy-backs the modern trend towards fully end-to-end learned systems. Most works so far can only generalize over a subset of properties to which a generic solver would be faced, including: resolution, topology, geometry, boundary conditions, domain discretization regularity, dimensionality, etc. In this work, we build a solver, satisfying these properties, where all the components are based on neural message passing, replacing all heuristically designed components in the computation graph with backprop-optimized neural function approximators. We show that neural message passing solvers representationally contain some classical methods, such as finite differences, finite volumes, and WENO schemes. In order to encourage stability in training autoregressive models, we put forward a method that is based on the principle of zero-stability, posing stability as a domain adaptation problem. We validate our method on various fluid-like flow problems, demonstrating fast, stable, and accurate performance across different domain topologies, discretization, etc. in 1D and 2D. Our model outperforms state-of-the-art numerical solvers in the low resolution regime in terms of speed and accuracy.
We consider an elliptic linear-quadratic parameter estimation problem with a finite number of parameters. A novel a priori bound for the parameter error is proved and, based on this bound, an adaptive finite element method driven by an a posteriori error estimator is presented. Unlike prior results in the literature, our estimator, which is composed of standard energy error residual estimators for the state equation and suitable co-state problems, reflects the faster convergence of the parameter error compared to the (co)-state variables. We show optimal convergence rates of our method; in particular and unlike prior works, we prove that the estimator decreases with a rate that is the sum of the best approximation rates of the state and co-state variables. Experiments confirm that our method matches the convergence rate of the parameter error.
In this paper we are concerned with Trefftz discretizations of the time-dependent linear wave equation in anisotropic media in arbitrary space dimensional domains $\Omega \subset \mathbb{R}^d~ (d\in \mathbb{N})$. We propose two variants of the Trefftz DG method, define novel plane wave basis functions based on rigorous choices of scaling transformations and coordinate transformations, and prove that the corresponding approximate solutions possess optimal-order error estimates with respect to the meshwidth $h$ and the condition number of the coefficient matrices, respectively. Besides, we propose the global Trefftz DG method combined with local DG methods to solve the time-dependent linear nonhomogeneous wave equation in anisotropic media. In particular, the error analysis holds for the (nonhomogeneous) Dirichlet, Neumann, and mixed boundary conditions from the original PDEs. Furthermore, a strategy to discretize the model in heterogeneous media is proposed. The numerical results verify the validity of the theoretical results, and show that the resulting approximate solutions possess high accuracy.
The full history recursive multilevel Picard approximation method for semilinear parabolic partial differential equations (PDEs) is the only method which provably overcomes the curse of dimensionality for general time horizons if the coefficient functions and the nonlinearity are globally Lipschitz continuous and the nonlinearity is gradient-independent. In this article we extend this result to locally monotone coefficient functions. Our results cover a range of semilinear PDEs with polynomial coefficient functions.
In the present paper, we study the analyticity of the leftmost eigenvalue of the linear elliptic partial differential operator with random coefficient and analyze the convergence rate of the quasi-Monte Carlo method for approximation of the expectation of this quantity. The random coefficient is assumed to be represented by an affine expansion $a_0(\boldsymbol{x})+\sum_{j\in \mathbb{N}}y_ja_j(\boldsymbol{x})$, where elements of the parameter vector $\boldsymbol{y}=(y_j)_{j\in \mathbb{N}}\in U^\infty$ are independent and identically uniformly distributed on $U:=[-\frac{1}{2},\frac{1}{2}]$. Under the assumption $ \|\sum_{j\in \mathbb{N}}\rho_j|a_j|\|_{L_\infty(D)} <\infty$ with some positive sequence $(\rho_j)_{j\in \mathbb{N}}\in \ell_p(\mathbb{N})$ for $p\in (0,1]$ we show that for any $\boldsymbol{y}\in U^\infty$, the elliptic partial differential operator has a countably infinite number of eigenvalues $(\lambda_j(\boldsymbol{y}))_{j\in \mathbb{N}}$ which can be ordered non-decreasingly. Moreover, the spectral gap $\lambda_2(\boldsymbol{y})-\lambda_1(\boldsymbol{y})$ is uniformly positive in $U^\infty$. From this, we prove the holomorphic extension property of $\lambda_1(\boldsymbol{y})$ to a complex domain in $\mathbb{C}^\infty$ and estimate mixed derivatives of $\lambda_1(\boldsymbol{y})$ with respect to the parameters $\boldsymbol{y}$ by using Cauchy's formula for analytic functions. Based on these bounds we prove the dimension-independent convergence rate of the quasi-Monte Carlo method to approximate the expectation of $\lambda_1(\boldsymbol{y})$. In this case, the computational cost of fast component-by-component algorithm for generating quasi-Monte Carlo $N$-points scales linearly in terms of integration dimension.
The aim of this work is to provide the first strong convergence result of numerical approximation of a general time-fractional second order stochastic partial differential equation involving a Caputo derivative in time of order $\alpha\in(\frac 12; 1)$ and driven simultaneously by a multiplicative standard Brownian motion and additive fBm with Hurst parameter $H\in(\frac 12, 1)$, more realistic to model the random effects on transport of particles in medium with thermal memory. We prove the existence and uniqueness results and perform the spatial discretization using the finite element and the temporal discretization using a fractional exponential integrator scheme. We provide the temporal and spatial convergence proofs for our fully discrete scheme and the result shows that the convergence orders depend on the regularity of the initial data, the power of the fractional derivative, and the Hurst parameter $H$.
We consider a space-time fractional parabolic problem. Combining a sinc-quadrature based method for discretizing the Riesz-Dunford integral with $hp$-FEM in space yields an exponentially convergent scheme for the initial boundary value problem with homogeneous right-hand side. For the inhomogeneous problem, an $hp$-quadrature scheme is implemented. We rigorously prove exponential convergence with focus on small times $t$, proving robustness with respect to startup singularities due to data incompatibilities.
We consider a singularly perturbed time dependent problem with a shift term in space. On appropriately defined layer adapted meshes of Dur\'an- and S-type we derive a-priori error estimates for the stationary problem. Using a discontinuous Galerkin method in time we obtain error estimates for the full discretisation. Introduction of a weighted scalar products and norms allows us to estimate the time-dependent problem in energy and balanced norm. So far it was open to prove such a result. Some numerical results are given to confirm the predicted theory and to show the effect of shifts on the solution.
Maximal parabolic $L^p$-regularity of linear parabolic equations on an evolving surface is shown by pulling back the problem to the initial surface and studying the maximal $L^p$-regularity on a fixed surface. By freezing the coefficients in the parabolic equations at a fixed time and utilizing a perturbation argument around the freezed time, it is shown that backward difference time discretizations of linear parabolic equations on an evolving surface along characteristic trajectories can preserve maximal $L^p$-regularity in the discrete setting. The result is applied to prove the stability and convergence of time discretizations of nonlinear parabolic equations on an evolving surface, with linearly implicit backward differentiation formulae characteristic trajectories of the surface, for general locally Lipschitz nonlinearities. The discrete maximal $L^p$-regularity is used to prove the boundedness and stability of numerical solutions in the $L^\infty(0,T;W^{1,\infty})$ norm, which is used to bound the nonlinear terms in the stability analysis. Optimal-order error estimates of time discretizations in the $L^\infty(0,T;W^{1,\infty})$ norm is obtained by combining the stability analysis with the consistency estimates.
A general class of KdV-type wave equations regularized with a convolution-type nonlocality in space is considered. The class differs from the class of the nonlinear nonlocal unidirectional wave equations previously studied by the addition of a linear convolution term involving third-order derivative. To solve the Cauchy problem we propose a semi-discrete numerical method based on a uniform spatial discretization, that is an extension of a previously published work of the present authors. We prove uniform convergence of the numerical method as the mesh size goes to zero. We also prove that the localization error resulting from localization to a finite domain is significantly less than a given threshold if the finite domain is large enough. To illustrate the theoretical results, some numerical experiments are carried out for the Rosenau-KdV equation, the Rosenau-BBM-KdV equation and a convolution-type integro-differential equation. The experiments conducted for three particular choices of the kernel function confirm the error estimates that we provide.