Seminar in Numerical Analysis: Markus Weimar (Julius-Maximilians-Universität Würzburg)
As a rule of thumb in approximation theory, the asymptotic speed of convergence of numerical algorithms is governed by the regularity of the objects we like to approximate. Besides classical isotropic Sobolev smoothness, in the last decades the notion of so-called dominating- mixed regularity of functions turned out to be an important concept in numerical analysis. Indeed, it naturally arises in high-dimensional real-world applications, e.g., related to the electronic Schrödinger equation. Although optimal approximation rates for embeddings within the scales of isotropic or dominating-mixed Lp-Sobolev spaces are well-understood, not that much is known for embeddings across those scales (break-of-scale embeddings).
In this lecture, we first review the Fourier analytic approach towards by now well-established (Besov and Triebel-Lizorkin) scales of distribution spaces that measure either isotropic or dominating-mixed regularity. In addition, we introduce new function spaces of hybrid smoothness which are able to simultaneously capture both types of regularity at the same time. As a further generalization of the aforementioned scales, they particularly include standard Sobolev spaces on domains. On the other hand, our new spaces yield an appropri- ate framework to study break-of-scale embeddings by means of harmonic analysis. We shall present (non-)adaptive wavelet-based multiscale algorithms that approximate such embed- dings at optimal dimension-independent rates of convergence. Important special cases cover the approximation of functions having dominating-mixed Sobolev smoothness w.r.t. Lp in the norm of the (isotropic) energy space H1.
The talk is based on a recent paper [1] which represents the first part of a joint work with Glenn Byrenheid (FSU Jena), Markus Hansen (PU Marburg), and Janina Hübner (RU Bochum).
References:
[1] G. Byrenheid, J. Hübner, and M. Weimar. Rate-optimal sparse approximation of compact break-of-scale embeddings. Appl. Comput. Harmon. Anal. 65:40–66, 2023 (arXiv:2203.10011).
For further information about the seminar, please visit this webpage.
Export event as
iCal