Universal Scalable Robust Solvers from Computational Information Games and fast eigenspace adapted Multiresolution Analysis

03/31/2017
by   Houman Owhadi, et al.
0

We show how the discovery of robust scalable numerical solvers for arbitrary bounded linear operators can be automated as a Game Theory problem by reformulating the process of computing with partial information and limited resources as that of playing underlying hierarchies of adversarial information games. When the solution space is a Banach space B endowed with a quadratic norm ·, the optimal measure (mixed strategy) for such games (e.g. the adversarial recovery of u∈ B, given partial measurements [ϕ_i, u] with ϕ_i∈ B^*, using relative error in ·-norm as a loss) is a centered Gaussian field ξ solely determined by the norm ·, whose conditioning (on measurements) produces optimal bets. When measurements are hierarchical, the process of conditioning this Gaussian field produces a hierarchy of elementary bets (gamblets). These gamblets generalize the notion of Wavelets and Wannier functions in the sense that they are adapted to the norm · and induce a multi-resolution decomposition of B that is adapted to the eigensubspaces of the operator defining the norm ·. When the operator is localized, we show that the resulting gamblets are localized both in space and frequency and introduce the Fast Gamblet Transform (FGT) with rigorous accuracy and (near-linear) complexity estimates. As the FFT can be used to solve and diagonalize arbitrary PDEs with constant coefficients, the FGT can be used to decompose a wide range of continuous linear operators (including arbitrary continuous linear bijections from H^s_0 to H^-s or to L^2) into a sequence of independent linear systems with uniformly bounded condition numbers and leads to O(N polylog N) solvers and eigenspace adapted Multiresolution Analysis (resulting in near linear complexity approximation of all eigensubspaces).

READ FULL TEXT

page 23

page 25

page 26

page 32

research
03/11/2015

Multigrid with rough coefficients and Multiresolution operator decomposition from Hierarchical Information Games

We introduce a near-linear complexity (geometric and meshless/algebraic)...
research
05/28/2018

De-noising by thresholding operator adapted wavelets

Donoho and Johnstone proposed a method from reconstructing an unknown sm...
research
06/24/2016

Gamblets for opening the complexity-bottleneck of implicit schemes for hyperbolic and parabolic ODEs/PDEs with rough coefficients

Implicit schemes are popular methods for the integration of time depende...
research
02/08/2021

An octagon containing the numerical range of a bounded linear operator

A polygon is derived that contains the numerical range of a bounded line...
research
12/23/2022

Physics-Informed Gaussian Process Regression Generalizes Linear PDE Solvers

Linear partial differential equations (PDEs) are an important, widely ap...
research
07/13/2020

Algebraic error analysis for mixed-precision multigrid solvers

This paper establishes the first theoretical framework for analyzing the...

Please sign up or login with your details

Forgot password? Click here to reset