Stochastic Transport with L\'evy Noise -- Fully Discrete Numerical Approximation
Andrea Barth, Andreas Stein

TL;DR
This paper develops a fully discrete numerical scheme for semilinear hyperbolic SPDEs driven by Le9vy noise, combining a discontinuous Galerkin spatial discretization with noise approximation via Karhunen-Loe8ve expansions, ensuring optimal convergence.
Contribution
It introduces a novel fully discrete approximation method for Le9vy-driven SPDEs, including a discontinuous Galerkin scheme and noise truncation techniques, addressing regularity and infinite-dimensional challenges.
Findings
Proves optimal convergence of the proposed scheme.
Demonstrates controlled bias in noise simulation.
Ensures stability and accuracy in numerical approximations.
Abstract
Semilinear hyperbolic stochastic partial differential equations (SPDEs) find widespread applications in the natural and engineering sciences. However, the traditional Gaussian setting may prove too restrictive, as phenomena in mathematical finance, porous media, and pollution models often exhibit noise of a different nature. To capture temporal discontinuities and accommodate heavy-tailed distributions, Hilbert space-valued L\'evy processes or L\'evy fields are employed as driving noise terms. The numerical discretization of such SPDEs presents several challenges. The low regularity of the solution in space and time leads to slow convergence rates and instability in space/time discretization schemes. Furthermore, the L\'evy process can take values in an infinite-dimensional Hilbert space, necessitating projections onto finite-dimensional subspaces at each discrete time point.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and financial applications · Hydrology and Drought Analysis
