Preconditioning for the time-dependent Stokes equations: stage-weighted Radau IIA and weighted discontinuous Galerkin time-stepping
math.NA, cs.NA
Submitted: 2026-11-05
Updated: 2026-11-05
Code: https://github.com/JuliaGNI/RungeKutta.jl
License: http://creativecommons.org/licenses/by/4.0/
The gist: We determine field-of-values equivalent preconditioners for the time-dependent Stokes equations discretized in time by stage-weighted Radau IIA Runge--Kutta time-stepping and discontinuous Galerkin…
Terminology
Abstract
We determine field-of-values equivalent preconditioners for the time-dependent Stokes equations discretized in time by stage-weighted Radau IIA Runge--Kutta time-stepping and discontinuous Galerkin time-stepping methods. By weighing each stage of the Radau IIA Runge--Kutta method differently we obtain preconditioners that are field-of-values equivalent, with constants independent of viscosity, timestep, and mesh size, to the system matrix. Similarly, by using weighted inner products in time to define the discontinuous Galerkin time-stepping method, we again obtain field-of-values equivalent preconditioners for the resulting system matrix. Numerical experiments are performed in two and three-dimensions which demonstrate robustness of the proposed preconditioners.
Sources
- Efficient Order-Optimal Preconditioners for Implicit Runge-Kutta and Runge-Kutta-Nystr\"om Methods Applicable to a Large Class of Parabolic and Hyperbolic PDEs
- Robust preconditioning for an HDG discretization of the time-dependent Stokes equations
- On the weighted Gau{\ss}--Radau Quadrature
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