Gamblets for opening the complexity-bottleneck of implicit schemes for hyperbolic and parabolic ODEs/PDEs with rough coefficients
arXiv:1606.07686 · doi:10.1016/j.jcp.2017.06.037
Abstract
Implicit schemes are popular methods for the integration of time dependent PDEs such as hyperbolic and parabolic PDEs. However the necessity to solve corresponding linear systems at each time step constitutes a complexity bottleneck in their application to PDEs with rough coefficients. We present a generalization of gamblets introduced in \cite{OwhadiMultigrid:2015} enabling the resolution of these implicit systems in near-linear complexity and provide rigorous a-priori error bounds on the resulting numerical approximations of hyperbolic and parabolic PDEs. These generalized gamblets induce a multiresolution decomposition of the solution space that is adapted to both the underlying (hyperbolic and parabolic) PDE (and the system of ODEs resulting from space discretization) and to the time-steps of the numerical scheme.
55 pages. 26 figures
References in corpus (4)
- Inferring solutions of differential equations using noisy multi-fidelity data
- Probability Measures for Numerical Solutions of Differential Equations
- Probabilistic ODE Solvers with Runge-Kutta Means
- Universal Scalable Robust Solvers from Computational Information Games and fast eigenspace adapted Multiresolution Analysis
Cited by in corpus (9)
- A Modern Retrospective on Probabilistic Numerics
- Universal Scalable Robust Solvers from Computational Information Games and fast eigenspace adapted Multiresolution Analysis
- Solving and Learning Nonlinear PDEs with Gaussian Processes
- A probabilistic finite element method based on random meshes: Error estimators and Bayesian inverse problems
- Numerical upscaling of perturbed diffusion problems
- Randomised one-step time integration methods for deterministic operator differential equations
- Fast eigenpairs computation with operator adapted wavelets and hierarchical subspace correction
- Sparse operator compression of higher-order elliptic operators with rough coefficients
- Sampling Methods for Bayesian Inference Involving Convergent Noisy Approximations of Forward Maps