Mean-Square Convergence Analysis of a Three-Level MGRIT Method for Linear Stochastic Evolution Equations with Additive Noise

We investigate the mean-square convergence of a three-level multigrid reduction-in-time (MGRIT) method based on F-relaxation for linear stochastic evolution equations driven by additive Gaussian noise. The method combines exponential Euler time stepping on the finest grid with implicit Euler discretizations on the two coarser grids. The inexact solution of the intermediate-level full approximation scheme problem gives rise to coupled error recursions involving two interlevel propagator discrepancies. Under a common spectral decomposition of the drift and noise covariance operators, we establish a geometric contraction estimate in a modal mean-square norm, with a contraction factor uniform in the temporal grids and both coarsening factors. We further derive fixed-iteration temporal error bounds that are uniform in the first coarsening factor and explicitly quantify the dependence on the second. For a fixed iteration count $k$ and a fixed second coarsening factor, we prove an $O(ΔT_1^r)$ error bound relative to the finest-grid reference solution for $0

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-10-29
DOI
https://doi.org/10.48550/arxiv.2610.39962
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Mean-Square Convergence Analysis of a Three-Level MGRIT Method for Linear Stochastic Evolution Equations with Additive Noise

Zhiheng Xu, Liying Zhang
arXiv (Cornell University)
Advanced Numerical Methods in Computational Mathematics
preprint

Mean-Square Convergence Analysis of a Three-Level MGRIT Method for Linear Stochastic Evolution Equations with Additive Noise

Zhiheng Xu, Liying Zhang
preprint en

Abstract

We investigate the mean-square convergence of a three-level multigrid reduction-in-time (MGRIT) method based on F-relaxation for linear stochastic evolution equations driven by additive Gaussian noise. The method combines exponential Euler time stepping on the finest grid with implicit Euler discretizations on the two coarser grids. The inexact solution of the intermediate-level full approximation scheme problem gives rise to coupled error recursions involving two interlevel propagator discrepancies. Under a common spectral decomposition of the drift and noise covariance operators, we establish a geometric contraction estimate in a modal mean-square norm, with a contraction factor uniform in the temporal grids and both coarsening factors. We further derive fixed-iteration temporal error bounds that are uniform in the first coarsening factor and explicitly quantify the dependence on the second. For a fixed iteration count $k$ and a fixed second coarsening factor, we prove an $O(ΔT_1^r)$ error bound relative to the finest-grid reference solution for $0

arXiv (Cornell University)
Advanced Numerical Methods in Computational Mathematics
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.

Laika access coming soon