Search arXivSearch

arXiv · 2209.08341

Scheme-Induced Minimum Action Methods for SPDEs: A Variational Framework for Convergence Analysis

Abstract

The minimum action method (MAM) is an important numerical tool for computing the most probable transition paths and the leading exponential rates of rare-event probabilities for stochastic systems with small noise. To the best of our knowledge, no rigorous convergence analysis is available for fully discrete MAMs for stochastic partial differential equations (SPDEs). This paper establishes the convergence of the constrained minima of fully discrete scheme-induced action functionals for terminal observations of scalar semilinear SPDEs. A main difficulty is that a consistent discrete approximation of an admissible control generally fails to satisfy the discrete terminal constraint exactly. To overcome this difficulty, we construct an asymptotically negligible correction that restores the constraint, and incorporate this argument into an abstract variational framework. We then propose a criterion that reduces the assumptions of this framework to verifiable conditions involving the continuous and discrete Green functions. Applying this criterion to fully discrete schemes for a stochastic wave equation and a fourth-order parabolic equation, we prove convergence of the constrained minima along arbitrary spatial and temporal refinement sequences, without a mesh-ratio condition.

Explore related subjects

Keep this discovery

BibTeXRIS

Jialin Hong, Diancong Jin, Derui Sheng. 2026-09-01. Scheme-Induced Minimum Action Methods for SPDEs: A Variational Framework for Convergence Analysis. https://arxiv.org/abs/2209.08341

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Numerical experiments on the Hardy conjecture for the Gauss circle problem

The classical unsolved Gauss circle problem concerns estimating the error between the number of lattice points inside a circle and the area of the circle as its radius tends to infinity. About a century ago, Hardy proposed a conjecture concerning this problem. In this paper, we attempt to provide numerical evidence in support of the Hardy conjecture through large-scale numerical computations.

math.NT

Advancements in Spectral Collocation Methods for High-Order Eigenvalue Problems

This paper focuses on computing spectral solutions for high-order eigenvalue problems using an efficient discretization method based on Chebfun spectral discretization algorithms and domain truncation. We solve several numerical eigenvalue problems, demonstrating both the accuracy and computational efficiency of the proposed approach.

math.NA

$L^p$-Convergence Rate of Backward Euler Schemes for Monotone SDEs

We give a unified method to derive the strong convergence rate of the backward Euler scheme for monotone SDEs in $L^p(Ω)$-norm, with general $p \ge 4$. The results are applied to the backward Euler scheme of SODEs with polynomial growth coefficients. We also generalize the argument to the Galerkin-based backward Euler scheme of SPDEs with polynomial growth coefficients driven by multiplicative trace-class noise.

math.NA