Quasi-interpolation for high-dimensional function approximation
The paper proposes a general quasi-interpolation scheme for high-dimensional function approximation. To facilitate error analysis, we view our quasi-interpolation as a two-step procedure. In the first step, we approximate a target function by a purpose-built convolution operator (with an error term...
Saved in:
Published in | Numerische Mathematik Vol. 156; no. 5; pp. 1855 - 1885 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.10.2024
Springer Nature B.V |
Subjects | |
Online Access | Get full text |
ISSN | 0029-599X 0945-3245 |
DOI | 10.1007/s00211-024-01435-6 |
Cover
Summary: | The paper proposes a general quasi-interpolation scheme for high-dimensional function approximation. To facilitate error analysis, we view our quasi-interpolation as a two-step procedure. In the first step, we approximate a target function by a purpose-built convolution operator (with an error term referred to as convolution error). In the second step, we discretize the underlying convolution operator using certain quadrature rule at the given sampling data sites (with an error term called discretization error). The final approximation error is obtained as an optimally balanced sum of these two errors, which in turn views our quasi-interpolation as a regularization technique that balances convolution error and discretization error. As a concrete example, we construct a sparse grid quasi-interpolation scheme for high-dimensional function approximation. Both theoretical analysis and numerical implementations provide evidence that our quasi-interpolation scheme is robust and is capable of mitigating the curse of dimensionality for approximating high-dimensional functions. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
ISSN: | 0029-599X 0945-3245 |
DOI: | 10.1007/s00211-024-01435-6 |