• Corpus ID: 238582753

Sparse recovery of elliptic solvers from matrix-vector products

@article{Schfer2021SparseRO,
  title={Sparse recovery of elliptic solvers from matrix-vector products},
  author={Florian Sch{\"a}fer and Houman Owhadi},
  journal={ArXiv},
  year={2021},
  volume={abs/2110.05351}
}
In this work, we show that solvers of elliptic boundary value problems in d dimensions can be approximated to accuracy ǫ from only O ( 

Figures from this paper

Learning Green's functions associated with parabolic partial differential equations

TLDR
The low-rank theory of Bebendorf and Hackbusch is extended from elliptic PDEs in dimension 1 ≤ n ≤ 3 to parabolic PDE's in any dimensions, which shows that Green’s functions associated with parabolicPDEs admit a low-Rank structure on well-separated domains.

Learning Green's functions associated with time-dependent partial differential equations

TLDR
This work derives the first theoretically rigorous scheme for learning the associated solution operator of Green’s functions associated with time-dependent PDEs, which takes the form of a convolution with a Green's function G.

Learning elliptic partial differential equations with randomized linear algebra

TLDR
It is shown that one can construct an approximant to G that converges almost surely and achieves a relative error of Jats:inline-formula.

References

SHOWING 1-10 OF 13 REFERENCES

Estimation of sparse jacobian matrices and graph coloring problems

TLDR
It is proved that two of the algorithms investigated are optimal for band graphs, andumerical evidence indicates that these two algorithms are nearly optimal on practical problems.

A survey of direct methods for sparse linear systems

TLDR
The goal of this survey article is to impart a working knowledge of the underlying theory and practice of sparse direct methods for solving linear systems and least-squares problems, and to provide an overview of the algorithms, data structures, and software available to solve these problems.

SelInv---An Algorithm for Selected Inversion of a Sparse Symmetric Matrix

We describe an efficient implementation of an algorithm for computing selected elements of a general sparse symmetric matrix A that can be decomposed as A = LDLT, where L is lower triangular and D is

An analysis of a class of variational multiscale methods based on subspace decomposition

TLDR
A class ofumerical homogenization methods that are very closely related to the method of M{\aa}lqvist and Peterseim, but do not make explicit or implicit use of a scale separation.

Localization of elliptic multiscale problems

This paper constructs a local generalized finite element basis for elliptic problems with heterogeneous and highly varying coefficients. The basis functions are solutions of local problems on vertex

Multigrid with Rough Coefficients and Multiresolution Operator Decomposition from Hierarchical Information Games

TLDR
Although the method is deterministic it has a natural Bayesian interpretation under the measure of probability emerging from the information game formulation and multiresolution approximations form a martingale with respect to the filtration induced by the hierarchy of nested measurements.

A Game Theoretic Approach to Numerical Approximation and Algorithm Design

TLDR
In this talk, Professor Owhadi will examine the interplay between game theory, numerical approximation, and Gaussian process regression via multiscale analysis problems, fast solvers design, operator adapted wavelet identification, and computations with dense kernel matrices.

Fast algorithm for extracting the diagonal of the inverse matrix with application to the electronic structure analysis of metallic systems

We propose an algorithm for extracting the diagonal of the inverse matrices arising from electronic structure calculation. The proposed algorithm uses a hierarchical decomposition of the

The Random Feature Model for Input-Output Maps between Banach Spaces

TLDR
The random feature model is viewed as a non-intrusive data-driven emulator, a mathematical framework for its interpretation is provided, and its ability to efficiently and accurately approximate the nonlinear parameter-to-solution maps of two prototypical PDEs arising in physical science and engineering applications is demonstrated.