Andreas Prohl’s research while affiliated with University of Tübingen and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (117)


Numerical Methods for Optimal Control Problems with SPDEs
  • Preprint

November 2024

·

7 Reads

Andreas Prohl

·

Yanqing Wang

This paper investigates numerical methods for solving stochastic linear quadratic (SLQ) optimal control problems governed by stochastic partial differential equations (SPDEs). Two distinct approaches, the open-loop and closed-loop ones, are developed to ensure convergence rates in the fully discrete setting. The open-loop approach, utilizing the finite element method for spatial discretization and the Euler method for temporal discretization, addresses the complexities of coupled forward-backward SPDEs and employs a gradient descent framework suited for high-dimensional spaces. Separately, the closed-loop approach applies a feedback strategy, focusing on Riccati equation for spatio-temporal discretization. Both approaches are rigorously designed to handle the challenges of fully discrete SLQ problems, providing rigorous convergence rates and computational frameworks.


AN EFFICIENT DISCRETIZATION TO SIMULATE THE SOLUTION OF LINEAR-QUADRATIC STOCHASTIC BOUNDARY CONTROL PROBLEM

February 2024

·

35 Reads

We present a fast, implementable discretization for the Dirichlet boundary control problem associated with the stochastic heat equation and show its space-time convergence with rates. After space-time discretization the discrete optimality conditions involve the discretization of a backward SPDE, whose numerical solution is well-known to be costly since it requires the computation of conditional expectations. In this work, we give a reformulation of the discrete optimality conditions which avoids the need to simulate conditional expectations and therefore significantly reduces complexities if compared to regression-based simulation, while keeping the same convergence rate.


Weak error analysis for the stochastic Allen–Cahn equation
  • Article
  • Full-text available

February 2024

·

30 Reads

·

6 Citations

Stochastics and Partial Differential Equations: Analysis and Computations

We prove strong rate resp. weak rate O(τ)O(τ){{\mathcal {O}}}(\tau ) for a structure preserving temporal discretization (with ττ\tau the step size) of the stochastic Allen–Cahn equation with additive resp. multiplicative colored noise in d=1,2,3d=1,2,3 dimensions. Direct variational arguments exploit the one-sided Lipschitz property of the cubic nonlinearity in the first setting to settle first order strong rate. It is the same property which allows for uniform bounds for the derivatives of the solution of the related Kolmogorov equation, and then leads to weak rate O(τ)O(τ){{\mathcal {O}}}(\tau ) in the presence of multiplicative noise. Hence, we obtain twice the rate of convergence known for the strong error in the presence of multiplicative noise.

Download

Convergence with rates for a Riccati-based discretization of SLQ problems with SPDEs

January 2024

·

10 Reads

IMA Journal of Numerical Analysis

We consider a new discretization in space (parameter h>0h>0) and time (parameter τ>0\tau>0) of a stochastic optimal control problem, where a quadratic functional is minimized subject to a linear stochastic heat equation with linear noise. Its construction is based on the perturbation of a generalized difference Riccati equation to approximate the related feedback law. We prove a convergence rate of almost O(h2+τ){\mathcal O}(h^{2}+\tau ) for its solution, and conclude from it a rate of almost O(h2+τ){\mathcal O}(h^{2}+\tau ) resp. O(h2+τ1/2){\mathcal O}(h^{2}+\tau ^{1/2}) for computable approximations of the optimal state and control with additive resp. multiplicative noise.


Error Analysis for 2D Stochastic Navier–Stokes Equations in Bounded Domains with Dirichlet Data

October 2023

·

60 Reads

·

11 Citations

Foundations of Computational Mathematics

We study a finite-element based space-time discretisation for the 2D stochastic Navier–Stokes equations in a bounded domain supplemented with no-slip boundary conditions. We prove optimal convergence rates in the energy norm with respect to convergence in probability, that is convergence of order (almost) 1/2 in time and 1 in space. This was previously only known in the space-periodic case, where higher order energy estimates for any given (deterministic) time are available. In contrast to this, estimates in the Dirichlet-case are only known for a (possibly large) stopping time. We overcome this problem by introducing an approach based on discrete stopping times. This replaces the localised estimates (with respect to the sample space) from earlier contributions.


Higher order time discretization for the stochastic semilinear wave equation with multiplicative noise

May 2023

·

49 Reads

·

4 Citations

IMA Journal of Numerical Analysis

In this paper, a higher order time-discretization scheme is proposed, where the iterates approximate the solution of the stochastic semilinear wave equation driven by multiplicative noise with general drift and diffusion. We employ variational method for its error analysis and prove an improved convergence order of 32\frac 32 for the approximates of the solution. The core of the analysis is Hölder continuity in time and moment bounds for the solutions of the continuous and the discrete problem. Computational experiments are also presented.


Mean Square Temporal error estimates for the 2D stochastic Navier-Stokes equations with transport noise

May 2023

·

22 Reads

·

1 Citation

We study the 2D Navier-Stokes equation with transport noise subject to periodic boundary conditions. Our main result is an error estimate for the time-discretisation showing a convergence rate of order (up to) 1/2. It holds with respect to mean square error convergence, whereas previously such a rate for the stochastic Navier-Stokes equations was only known with respect to convergence in probability. Our result is based on uniform-in-probability estimates for the continuous as well as the time-discrete solution exploiting the particular structure of the noise.


Realizations which A contribute to G1(j)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathfrak {G}}_{1}^{(j)}$$\end{document}, B to G2(j)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathfrak {G}}_{2}^{(j)}$$\end{document}, and C to G3(j)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathfrak {G}}_{3}^{(j)}$$\end{document}
Example 1.2 for L=2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L=2$$\end{document}: temporal evolution of positions of samples in D¯\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\overline{\pmb {{\mathcal {D}}}}$$\end{document}: samples in the interior of D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\pmb {{\mathcal {D}}}$$\end{document}; samples in the corresponding boundary strips; □\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\square }$$\end{document} samples on ∂D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\pmb {\partial {\mathcal {D}}}$$\end{document}
A Semi-Log plot of the (adaptive) step sizes generated via Algorithm 5.1. B Shape of the distribution of tJ∗\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t_{J^{*}}$$\end{document} illustrated via a histogram plot. C Temporal evolution of (sample-)iterates in the interior of D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\pmb {{\mathcal {D}}}$$\end{document}. D Convergence rate (error) Log-log plot via Algorithm 5.1 (M=105\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\texttt {M}}=10^5$$\end{document}, x=0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{x}}={\textbf{0}}$$\end{document})
A Semi-Log plot of the (adaptive) step sizes generated via Algorithm 5.3. B Shape of the distribution of tJ∗\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t_{J^{*}}$$\end{document} illustrated via a histogram plot. C Temporal evolution of (sample-)iterates in the interior of D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\pmb {{\mathcal {D}}}$$\end{document}. D Convergence rate (error) Log-log plot via Algorithm 5.3 (M=105\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\texttt {M}}=10^5$$\end{document}, (t,x)=(0,0)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(t,{\textbf{x}})=(0,{\textbf{0}})$$\end{document})
a Exit of the continuified Euler process YX\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\pmb {{\mathcal {Y}}}^{{\textbf{X}}}$$\end{document} in (4.30). b Projection resp. bouncing back mechanism in Scheme 2

+4

A posteriori error analysis and adaptivity for high-dimensional elliptic and parabolic boundary value problems

April 2023

·

198 Reads

·

3 Citations

Numerische Mathematik

We derive a posteriori error estimates for the (stopped) weak Euler method to discretize SDE systems which emerge from the probabilistic reformulation of elliptic and parabolic (initial) boundary value problems. The a posteriori estimate exploits the use of a scaled random walk to represent noise, and distinguishes between realizations in the interior of the domain and those close to the boundary. We verify an optimal rate of (weak) convergence for the a posteriori error estimate on deterministic meshes. Based on this estimate, we then set up an adaptive method which automatically selects local deterministic mesh sizes, and prove its optimal convergence in terms of given tolerances. Provided with this theoretical backup, and since corresponding Monte-Carlo based realizations are simple to implement, these methods may serve to efficiently approximate solutions of high-dimensional (initial-)boundary value problems.


Weak error analysis for the stochastic Allen-Cahn equation

October 2022

·

28 Reads

We prove strong rate resp. weak rate O(τ){\mathcal O}(\tau) for a structure preserving temporal discretization (with τ\tau the step size) of the stochastic Allen-Cahn equation with additive resp. multiplicative colored noise in d=1,2,3 dimensions. Direct variational arguments exploit the one-sided Lipschitz property of the cubic nonlinearity in the first setting to settle first order strong rate. It is the same property which allows for uniform bounds for the derivatives of the solution of the related Kolmogorov equation, and then leads to weak rate O(τ){\mathcal O}(\tau) in the presence of multiplicative noise. Hence, we obtain twice the rate of convergence known for the strong error in the presence of multiplicative noise.


Piecewise constant uhτ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$u_{h\tau }$$\end{document} and piecewise affine interpolation u^hτ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\hat{u}}_{h\tau }$$\end{document} of {uhτn}n=0N\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{u^n_{h\tau }\}_{n=0}^N$$\end{document}
Indexing of piecewise constant càglàd functions uhτ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$u_{h\tau }$$\end{document} and Bochner functions fhτ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$f_{h\tau }$$\end{document}
Translates in Theorem 5.3, (t~-s,t~)⊂(tn,tn+1)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$({\tilde{t}}-s, {\tilde{t}}) \subset (t^n, t^{n+1})$$\end{document}(left) and tn∈(t~-s,t~)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t^n \in ({\tilde{t}}-s, {\tilde{t}})$$\end{document}(right)
Numerical approximation of nonlinear SPDE’s

September 2022

·

108 Reads

·

13 Citations

Stochastics and Partial Differential Equations: Analysis and Computations

The numerical analysis of stochastic parabolic partial differential equations of the form du+A(u)dt=fdt+gdW,\begin{aligned} du + A(u)\, dt = f \,dt + g \, dW, \end{aligned} d u + A ( u ) d t = f d t + g d W , is surveyed, where A is a nonlinear partial operator and W a Brownian motion. This manuscript unifies much of the theory developed over the last decade into a cohesive framework which integrates techniques for the approximation of deterministic partial differential equations with methods for the approximation of stochastic ordinary differential equations. The manuscript is intended to be accessible to audiences versed in either of these disciplines, and examples are presented to illustrate the applicability of the theory.


Citations (79)


... A comparison is made with traditional PCA and KPCA, as well as the iterative scheme with the non-iterative one. In our future research, we aim to consider stochastic AC equation [32], and explore various types of kernel functions that may offer more effective performance compared to the Gaussian kernel, for both deterministic and stochastic AC equations. ...

Reference:

Kernel Principal Component Analysis for Allen–Cahn Equations
Weak error analysis for the stochastic Allen–Cahn equation

Stochastics and Partial Differential Equations: Analysis and Computations

... • To the best of our knowledge, Breit and Prohl [9] were the first to report strong convergence rates in probability for a fully discrete scheme applied to two-dimensional SNSEs with multiplicative noise, yielding the following convergence result: ...

Error Analysis for 2D Stochastic Navier–Stokes Equations in Bounded Domains with Dirichlet Data

Foundations of Computational Mathematics

... Because there are no closed-form solutions in general, numerical approximations of the above stochastic wave equation, which is the only means of solving the stochastic PDEs, have garnered a lot of attention in recent years and various numerical methods were proposed and analyzed. The case of additive noise (i.e., σ(u) is independent of u) was well addressed in [13,15,24,25,28] and the case of multiplicative noise was intensively investigated in [2,12,14,21,26,27,32]. Among those results, we note that the strong convergence of order O(τ 1 2 ) (τ > 0 stands for the time mesh size) in the L 2 -norm was obtained in [32,36] for time approximations of the displacement u in the case of functional-type multiplicative noise (i.e., σ only depends on u) and in [27] where polynomial drift F , which is not globally Lipschitz continuous, was considered. ...

Higher order time discretization for the stochastic semilinear wave equation with multiplicative noise
  • Citing Article
  • May 2023

IMA Journal of Numerical Analysis

... For numerical testing of strong convergence rates, we have employed the idea of pairwise coupling of non-nested adaptive simulations of SDE developed in Giles et al. (2016), which is an approach that also could be useful for combining our method with MLMC in the future. See also Merle & Prohl (2023) for a recent contribution on a posteriori adaptive methods for weak approximations of exit times and states of SDE, and Hoel et al. (2012); Katsiolides et al. (2018); Fang & Giles (2020) for other partly state-dependent adaptive MLMC methods for weak approximations of SDE in finite-and infinite-time settings. ...

A posteriori error analysis and adaptivity for high-dimensional elliptic and parabolic boundary value problems

Numerische Mathematik

... • Ondreját et al. [40] achieved convergence for a class of finite element approximations to a weak martingale solution in three dimensions. ...

Numerical approximation of nonlinear SPDE’s

Stochastics and Partial Differential Equations: Analysis and Computations

... Further recent efforts in the field of numerical analysis were focused on incorporating stochastic noise into deterministic flow models to improve the regularity and provide a more realistic modeling of turbulence effects. These studies employ more general solution concepts, such as dissipative measure-valued martingale solutions or weak pathwise solutions, demonstrating their existence through the convergence of consistent numerical schemes and/or providing error estimates; see [10,11,16] and references cited therein. A common feature of existing proof techniques for deterministic and stochastic models is the use of divergence-free test functions. ...

Numerical analysis of two-dimensional Navier–Stokes equations with additive stochastic forcing

IMA Journal of Numerical Analysis

... Mathematical theory of the LLS equation is at an early stage. For the coupled system in [41], the existence and uniqueness of solutions were analysed in [16,19,32], and a related optimal control problem was investigated in [5]. We mention that in these papers, the estimates of (approximations of) s and m could be decoupled, with bounds depending only on the current density. ...

Optimal control for a coupled spin-polarized current and magnetization system

Advances in Computational Mathematics

... The derivation of (1.7) in Sect. 4.1 conceptually follows the guideline of [35,Thm. 3.1], where an a posteriori (weak) error estimate is presented for the (semiimplicit) Euler method, which uses (unbounded) Wiener increments; in fact, G (·) 1 in (1.7) is conceptually close to the estimator in [35, (3.1)]; see also item 3. Remark 4.1. ...

An adaptive time-stepping method based on a posteriori weak error analysis for large SDE systems

Numerische Mathematik

... Alternatively, the Pontryagin-type maximum principle offers another approach by transforming the SLQ problem's solvability into that of forward-backward stochastic differential equations, facilitating numerical computation of optimal controls. Various numerical schemes leveraging the Pontryagin-type maximum principle have been developed, such as those by [3], [4], [6], [10], [12], [13], and [9], among others. In [15], a time-implicit discretization for stochastic linear quadratic problems subject to SDE with control-dependence noises is proposed, and the convergence rate of this discretization is proved. ...

Strong error estimates for a space-time discretization of the linear-quadratic control problem with the stochastic heat equation with linear noise
  • Citing Article
  • September 2021

IMA Journal of Numerical Analysis

... For the Ericksen-Leslie model, some analysis results are pointed out in the literature on the existence, uniqueness, regularity, and long time asymptotic behavior of the solution [6][7][8][9][10][11][12][13][14]. There also exist abundant works on the numerical methods. ...

Existence, uniqueness and regularity for the stochastic Ericksen–Leslie equation