Strong convergence rates for numerical approximations of the stochastic Burgers equation with additive rough noise
math.NA, cs.NA
Submitted: 2026-11-06
Updated: 2026-11-15
Terminology
Sources
- Strong convergence rates on the whole probability space for space-time discrete numerical approximation schemes for stochastic Burgers equations
- Strong convergence rates for full-discrete approximations of stochastic Burgers equations with multiplicative noise
Related papers
- Do physics-informed neural networks (PINNs) need to be deep? Shallow PINNs using the Levenberg-Marquardt algorithm
- A Neural-preconditioned Poisson Solver for Mixed Dirichlet and Neumann Boundary Conditions
- Advanced Linear Algebra with Applications - Part I (Numerical linear algebra for PDEs, machine learning, and data assimilation)
- Operator learning meets inverse problems: A probabilistic perspective
- Second-order consistency for learning chaotic dynamics via randomized Jacobian matching
- Windowed thinning and query complexity for the bouncy particle and Zigzag samplers