An efficient discretization to simulate the solution of linear–quadratic stochastic boundary control problem

Abstract 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 with regression-based simulation while keeping the same convergence rate.

Authors

Institutions

Publication Details

Journal
IMA Journal of Numerical Analysis
Published
2025-06-05
DOI
https://doi.org/10.1093/imanum/draf060
Primary Topic
Stochastic processes and financial applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An efficient discretization to simulate the solution of linear–quadratic stochastic boundary control problem

Fabian Merle, Andreas Prohl, Yanqing Wang, Abhishek Chaudhary
IMA Journal of Numerical Analysis
Stochastic processes and financial applications
article

An efficient discretization to simulate the solution of linear–quadratic stochastic boundary control problem

Fabian Merle, Andreas Prohl, Yanqing Wang, Abhishek Chaudhary
article en

Abstract

Abstract 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 with regression-based simulation while keeping the same convergence rate.

IMA Journal of Numerical Analysis
Southwest University (CN), University of Tübingen (DE)
Openalex Percentile: Top 74%
Stochastic processes and financial applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.