Related papers: Simultaneous spatial-parametric collocation approx…
A novel compressed matrix format is proposed that combines an adaptive hierarchical partitioning of the matrix with low-rank approximation. One typical application is the approximation of discretized functions on rectangular domains; the…
In this paper, we propose and analyze a multiscale method for a class of quasilinear elliptic problems of nonmonotone type with spatially multiscale coefficient. The numerical approach is inspired by the Localized Orthogonal Decomposition…
This paper proposes two efficient approximation methods to solve high-dimensional fully nonlinear partial differential equations (NPDEs) and second-order backward stochastic differential equations (2BSDEs), where such high-dimensional fully…
In this paper we introduce a numerical method for nonlinear parabolic PDEs that combines operator splitting with deep learning. It divides the PDE approximation problem into a sequence of separate learning problems. Since the computational…
In this paper we introduce a multilevel Picard approximation algorithm for general semilinear parabolic PDEs with gradient-dependent nonlinearities whose coefficient functions do not need to be constant. We also provide a full convergence…
We consider the problem of model reduction of parametrized PDEs where the goal is to approximate any function belonging to the set of solutions at a reduced computational cost. For this, the bottom line of most strategies has so far been…
In this article, we present a parallel recursive algorithm based on multi-level domain decomposition that can be used as a precondtioner to a Krylov subspace method to solve sparse linear systems of equations arising from the discretization…
We derive a three-term recurrence relation for computing the polynomial of best approximation in the uniform norm to $x^{-1}$ on a finite interval with positive endpoints. As application, we consider two-level methods for scalar elliptic…
We derive optimal-order homogenization rates for random nonlinear elliptic PDEs with monotone nonlinearity in the uniformly elliptic case. More precisely, for a random monotone operator on $\mathbb{R}^d$ with stationary law (i.e. spatially…
In this paper we establish best approximation property of fully discrete Galerkin solutions of second order parabolic problems on convex polygonal and polyhedral domains in the $L^\infty(I;W^{1,\infty}(\Om))$ norm. The discretization method…
We present a novel uncertainty quantification approach for high-dimensional stochastic partial differential equations that reduces the computational cost of polynomial chaos methods by decomposing the computational domain into…
This paper investigates the approximation of stochastic delay differential equations (SDDEs) via the backward Euler-Maruyama (BEM) method under generalized monotonicity and Khasminskii-type conditions in the infinite horizon. First, by…
We present new convergence analyses for parallel subspace correction methods for unconstrained semicoercive and nearly semicoercive convex optimization problems, generalizing the theory of singular and nearly singular linear problems to a…
Stochastic sampling methods are arguably the most direct and least intrusive means of incorporating parametric uncertainty into numerical simulations of partial differential equations with random inputs. However, to achieve an overall error…
We study maximum likelihood estimation for spatial generalized linear mixed models with Gaussian process approximations using a stochastic Newton-Raphson algorithm. We consider two Gaussian Process approximations in this context: spectral…
We study sparse recovery with structured random measurement matrices having independent, identically distributed, and uniformly bounded rows and with a nontrivial covariance structure. This class of matrices arises from random sampling of…
Operator learning is a recent development in the simulation of Partial Differential Equations (PDEs) by means of neural networks. The idea behind this approach is to learn the behavior of an operator, such that the resulting neural network…
In this paper, we propose a novel algorithm called Neuron-wise Parallel Subspace Correction Method (NPSC) for the finite neuron method that approximates numerical solutions of partial differential equations (PDEs) using neural network…
We derive optimal estimates in stochastic homogenization of linear elliptic equations in divergence form in dimensions $d\ge 2$. In previous works we studied the model problem of a discrete elliptic equation on $\mathbb{Z}^d$. Under the…
The coefficient function of the leading differential operator is estimated from observations of a linear stochastic partial differential equation (SPDE). The estimation is based on continuous time observations which are localised in space.…