Quasi-interpolation for high-dimensional function approximation
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909322108207104 |
|---|---|
| author | Gao, Wenwu Wang, Jiecheng Sun, Zhengjie Fasshauer, Gregory E. |
| author_facet | Gao, Wenwu Wang, Jiecheng Sun, Zhengjie Fasshauer, Gregory E. |
| contents | 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 rules 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 capable of mitigating the curse of dimensionality for approximating high-dimensional functions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_14278 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Quasi-interpolation for high-dimensional function approximation Gao, Wenwu Wang, Jiecheng Sun, Zhengjie Fasshauer, Gregory E. Numerical Analysis 41A05, 41A25, 41A30, 41A63, 42B05, 65D15, 65D40 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 rules 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 capable of mitigating the curse of dimensionality for approximating high-dimensional functions. |
| title | Quasi-interpolation for high-dimensional function approximation |
| topic | Numerical Analysis 41A05, 41A25, 41A30, 41A63, 42B05, 65D15, 65D40 |
| url | https://arxiv.org/abs/2409.14278 |