SearcharxivSearch

arXiv subjects

Andreas Petersson

Publications and source records attributed to Andreas Petersson.

13 recordsLinked to original sources

Latent-Variable Learning of SPDEs via Wiener Chaos

We study the problem of learning the law of linear stochastic partial differential equations (SPDEs) with additive Gaussian forcing from spatiotemporal observations. Most existing deep learning approaches either assume access to the driving noise or initial condition, or rely on deterministic surrogate models that fail to capture intrinsic stochasticity. We propose a structured latent-variable formulation that requires only observations of solution realizations and learns the underlying randomly forced dynamics. Our approach combines a spectral Galerkin projection with a truncated Wiener chaos expansion, yielding a principled separation between deterministic evolution and stochastic forcing. This reduces the infinite-dimensional SPDE to a finite system of parametrized ordinary differential equations governing latent temporal dynamics. The latent dynamics and stochastic forcing are jointly inferred through variational learning, allowing recovery of stochastic structure without explicit observation or simulation of noise during training. Empirical evaluation on synthetic data demonstrates state-of-the-art performance under comparable modeling assumptions across bounded and unbounded one-dimensional spatial domains.

cs.LG

Nonparametric Inference for Noise Covariance Kernels in Parabolic SPDEs using Space-Time Infill-Asymptotics

We develop an asymptotic limit theory for nonparametric estimation of the noise covariance kernel in linear parabolic stochastic partial differential equations (SPDEs) with additive colored noise, using space-time infill asymptotics. The method employs discretized infinite-dimensional realized covariations and requires only mild regularity assumptions on the kernel to ensure consistent estimation and asymptotic normality of the estimator. On this basis, we construct omnibus goodness-of-fit tests for the noise covariance that are independent of the SPDE's differential operator. Our framework accommodates a variety of spatial sampling schemes and allows for reliable inference even when spatial resolution is coarser than temporal resolution.

math.ST

The multi-index Monte Carlo method for semilinear stochastic partial differential equations

Stochastic partial differential equations (SPDEs) are often difficult to solve numerically due to their low regularity and high dimensionality. These challenges limit the practical use of computer-aided studies and pose significant barriers to statistical analysis of SPDEs. In this work, we introduce a highly efficient multi-index Monte Carlo method (MIMC) designed to approximate statistics of mild solutions to semilinear parabolic SPDEs. Key to our approach is the proof of a multiplicative convergence property for coupled solutions generated by an exponential integrator numerical solver, which we incorporate with MIMC. We further describe theoretically how the asymptotic computational cost of MIMC can be bounded in terms of the input accuracy tolerance, as the tolerance goes to zero. Notably, our methodology illustrates that for an SPDE with low regularity, MIMC offers substantial performance improvements over other viable methods. Numerical experiments comparing the performance of MIMC with the multilevel Monte Carlo method on relevant test problems validate our theoretical findings. These results also demonstrate that MIMC significantly outperforms state-of-the-art multilevel Monte Carlo, thereby underscoring its potential as a robust and tractable tool for solving semilinear parabolic SPDEs.

math.NA

SPDE bridges with observation noise and their spatial approximation

This paper introduces SPDE bridges with observation noise and contains an analysis of their spatially semidiscrete approximations. The SPDEs are considered in the form of mild solutions in an abstract Hilbert space framework suitable for parabolic equations. They are assumed to be linear with additive noise in the form of a cylindrical Wiener process. The observational noise is also cylindrical and SPDE bridges are formulated via conditional distributions of Gaussian random variables in Hilbert spaces. A general framework for the spatial discretization of these bridge processes is introduced. Explicit convergence rates are derived for a spectral and a finite element based method. It is shown that for sufficiently rough observation noise, the rates are essentially the same as those of the corresponding discretization of the original SPDE.

math.NA

Piecewise linear interpolation of noise in finite element approximations of parabolic SPDEs

Efficient simulation of stochastic partial differential equations (SPDE) on general domains requires noise discretization. This paper employs piecewise linear interpolation of noise in a fully discrete finite element approximation of a semilinear stochastic reaction-advection-diffusion equation on a convex polyhedral domain. The Gaussian noise is white in time, spatially correlated, and modeled as a standard cylindrical Wiener process on a reproducing kernel Hilbert space. This paper provides the first rigorous analysis of the resulting noise discretization error for a general spatial covariance kernel. The kernel is assumed to be defined on a larger regular domain, allowing for sampling by the circulant embedding method. The error bound under mild kernel assumptions requires non-trivial techniques like Hilbert--Schmidt bounds on products of finite element interpolants, entropy numbers of fractional Sobolev space embeddings and an error bound for interpolants in fractional Sobolev norms. Examples with kernels encountered in applications are illustrated in numerical simulations using the FEniCS finite element software. Key findings include: noise interpolation does not introduce additional errors for Mat\'ern kernels in $d\ge2$; there exist kernels that yield dominant interpolation errors; and generating noise on a coarser mesh does not always compromise accuracy.

math.NA

The heat modulated infinite dimensional Heston model and its numerical approximation

The HEat modulated Infinite DImensional Heston (HEIDIH) model and its numerical approximation are introduced and analyzed. This model falls into the general framework of infinite dimensional Heston stochastic volatility models of (F.E. Benth, I.C. Simonsen '18), introduced for the pricing of forward contracts. The HEIDIH model consists of a one-dimensional stochastic advection equation coupled with a stochastic volatility process, defined as a Cholesky-type decomposition of the tensor product of a Hilbert-space valued Ornstein-Uhlenbeck process, the mild solution to the stochastic heat equation on the real half-line. The advection and heat equations are driven by independent space-time Gaussian processes which are white in time and colored in space, with the latter covariance structure expressed by two different kernels. First, a class of weight-stationary kernels are given, under which regularity results for the HEIDIH model in fractional Sobolev spaces are formulated. In particular, the class includes weighted Mat\'ern kernels. Second, numerical approximation of the model is considered. An error decomposition formula, pointwise in space and time, for a finite-difference scheme is proven. For a special case, essentially sharp convergence rates are obtained when this is combined with a fully discrete finite element approximation of the stochastic heat equation. The analysis takes into account a localization error, a pointwise-in-space finite element discretization error and an error stemming from the noise being sampled pointwise in space. The rates obtained in the analysis are higher than what would be obtained using a standard Sobolev embedding technique. Numerical simulations illustrate the results.

math.PR

Finite element approximation of Lyapunov equations related to parabolic stochastic PDEs

A numerical analysis for the fully discrete approximation of an operator Lyapunov equation related to linear SPDEs (stochastic partial differential equations) driven by multiplicative noise is considered. The discretization of the Lyapunov equation in space is given by finite elements and in time by a semiimplicit Euler scheme. The main result is the derivation of the rate of convergence in operator norm. Moreover, it is shown that the solution of the equation provides a representation of a quadratic and path dependent functional of the SPDE solution. This fact yields a deterministic numerical method to compute such functionals. As a secondary result, weak error rates are established for a fully discrete finite element approximation of the SPDE with respect to this functional. This is obtained as a consequence of the approximation analysis of the Lyapunov equation. It is the first weak convergence analysis for fully discrete finite element approximations of SPDEs driven by multiplicative noise that obtains double the strong rate of convergence, especially for path dependent functionals and smooth spatial noise. Numerical experiments illustrate the results empirically and it is demonstrated that the deterministic method has advantages over Monte Carlo sampling in a stability context.

math.NA

Approximation of SPDE covariance operators by finite elements: A semigroup approach

The problem of approximating the covariance operator of the mild solution to a linear stochastic partial differential equation is considered. An integral equation involving the semigroup of the mild solution is derived and a general error decomposition is proven. This formula is applied to approximations of the covariance operator of a stochastic advection-diffusion equation and a stochastic wave equation, both on bounded domains. The approximations are based on finite element discretizations in space and rational approximations of the exponential function in time. Convergence rates are derived in the trace class and Hilbert--Schmidt norms with numerical simulations illustrating the results.

math.NA

Hilbert--Schmidt regularity of symmetric integral operators on bounded domains with applications to SPDE approximations

Regularity estimates for an integral operator with a symmetric continuous kernel on a convex bounded domain are derived. The covariance of a mean-square continuous random field on the domain is an example of such an operator. The estimates are of the form of Hilbert--Schmidt norms of the integral operator and its square root, composed with fractional powers of an elliptic operator equipped with homogeneous boundary conditions of either Dirichlet or Neumann type. These types of estimates, which couple the regularity of the driving noise with the properties of the differential operator, have important implications for stochastic partial differential equations on bounded domains as well as their numerical approximations. The main tools used to derive the estimates are properties of reproducing kernel Hilbert spaces of functions on bounded domains along with Hilbert--Schmidt embeddings of Sobolev spaces. Both non-homogeneous and homogeneous kernels are considered. In the latter case, results in a general Schatten class norm are also provided. Important examples of homogeneous kernels covered by the results of the paper include the class of Matérn kernels.

math.PR

Weak convergence of fully discrete finite element approximations of semilinear hyperbolic SPDE with additive noise

We consider the numerical approximation of the mild solution to a semilinear stochastic wave equation driven by additive noise. For the spatial approximation we consider a standard finite element method and for the temporal approximation, a rational approximation of the exponential function. We first show strong convergence of this approximation in both positive and negative order norms. With the help of Malliavin calculus techniques this result is then used to deduce weak convergence rates for the class of twice continuously differentiable test functions with polynomially bounded derivatives. Under appropriate assumptions on the parameters of the equation, the weak rate is found to be essentially twice the strong rate. This extends earlier work by one of the authors to the semilinear setting. Numerical simulations illustrate the theoretical results.

math.NA

Rapid covariance-based sampling of linear SPDE approximations in the multilevel Monte Carlo method

The efficient simulation of the mean value of a non-linear functional of the solution to a linear stochastic partial differential equation (SPDE) with additive Gaussian noise is considered. A Galerkin finite element method is employed along with an implicit Euler scheme to arrive at a fully discrete approximation of the mild solution to the equation. A scheme is presented to compute the covariance of this approximation, which allows for rapid sampling in a Monte Carlo method. This is then extended to a multilevel Monte Carlo method, for which a scheme to compute the cross-covariance between the approximations at different levels is presented. In contrast to traditional path-based methods it is not assumed that the Galerkin subspaces at these levels are nested. The computational complexities of the presented schemes are compared to traditional methods and simulations confirm that, under suitable assumptions, the costs of the new schemes are significantly lower.

math.PR

Mean-square stability analysis of approximations of stochastic differential equations in infinite dimensions

The (asymptotic) behaviour of the second moment of solutions to stochastic differential equations is treated in mean-square stability analysis. This property is discussed for approximations of infinite-dimensional stochastic differential equations and necessary and sufficient conditions ensuring mean-square stability are given. They are applied to typical discretization schemes such as combinations of spectral Galerkin, finite element, Euler-Maruyama, Milstein, Crank-Nicolson, and forward and backward Euler methods. Furthermore, results on the relation to stability properties of corresponding analytical solutions are provided. Simulations of the stochastic heat equation illustrate the theory.

math.NA

Monte Carlo versus multilevel Monte Carlo in weak error simulations of SPDE approximations

The simulation of the expectation of a stochastic quantity E[Y] by Monte Carlo methods is known to be computationally expensive especially if the stochastic quantity or its approximation Y_n is expensive to simulate, e.g., the solution of a stochastic partial differential equation. If the convergence of Y_n to Y in terms of the error |E[Y - Y_n]| is to be simulated, this will typically be done by a Monte Carlo method, i.e., |E[Y] - E_N[Y_n]| is computed. In this article upper and lower bounds for the additional error caused by this are determined and compared to those of |E_N[Y - Y_n]|, which are found to be smaller. Furthermore, the corresponding results for multilevel Monte Carlo estimators, for which the additional sampling error converges with the same rate as |E[Y - Y_n]|, are presented. Simulations of a stochastic heat equation driven by multiplicative Wiener noise and a geometric Brownian motion are performed which confirm the theoretical results and show the consequences of the presented theory for weak error simulations.

math.PR