Quasi-interpolation using generalized Gaussian kernels
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917274879787008 |
|---|---|
| author | Gao, Wenwu Hu, Le Sun, Zhengjie Wang, Changwei |
| author_facet | Gao, Wenwu Hu, Le Sun, Zhengjie Wang, Changwei |
| contents | This paper focuses on developing a framework for constructing quasi-interpolation with the highest achievable approximation order from generalized Gaussian kernels with the help of kernel restriction trick and periodization technique. We first demonstrate that when we restrict generalized Gaussian kernels satisfying generalized Strang-Fix conditions of order s over a torus, the corresponding restricted kernels in tensor-product forms fulfill periodic Strang-Fix conditions of the same order s. Then, based on these restricted kernels, we construct a periodic quasi-interpolant in Schoenberg's form and derive its error estimates for periodic function approximation over a torus, which reveals that our quasiinterpolant attains the highest approximation order s. Finally, using the periodization technique, we extend the periodic quasi-interpolant to its nonperiodic counterpart with the highest approximation order s for approximating a general function defined over a cube via a torus-to-cube transformation. This result stands in stark contrast to classical quasi-interpolation counterparts, which often yield much lower approximation orders than those dictated by the generalized Strang-Fix conditions of generalized Gaussian kernels. Furthermore, we propose a sparse grid counterpart for high-dimensional function approximation to alleviate the curse of dimensionality. Numerical simulations confirm that our quasi-interpolation scheme is simple and computationally efficient. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_21283 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Quasi-interpolation using generalized Gaussian kernels Gao, Wenwu Hu, Le Sun, Zhengjie Wang, Changwei Numerical Analysis 41A30, 41A25, 42B05, 65D15 This paper focuses on developing a framework for constructing quasi-interpolation with the highest achievable approximation order from generalized Gaussian kernels with the help of kernel restriction trick and periodization technique. We first demonstrate that when we restrict generalized Gaussian kernels satisfying generalized Strang-Fix conditions of order s over a torus, the corresponding restricted kernels in tensor-product forms fulfill periodic Strang-Fix conditions of the same order s. Then, based on these restricted kernels, we construct a periodic quasi-interpolant in Schoenberg's form and derive its error estimates for periodic function approximation over a torus, which reveals that our quasiinterpolant attains the highest approximation order s. Finally, using the periodization technique, we extend the periodic quasi-interpolant to its nonperiodic counterpart with the highest approximation order s for approximating a general function defined over a cube via a torus-to-cube transformation. This result stands in stark contrast to classical quasi-interpolation counterparts, which often yield much lower approximation orders than those dictated by the generalized Strang-Fix conditions of generalized Gaussian kernels. Furthermore, we propose a sparse grid counterpart for high-dimensional function approximation to alleviate the curse of dimensionality. Numerical simulations confirm that our quasi-interpolation scheme is simple and computationally efficient. |
| title | Quasi-interpolation using generalized Gaussian kernels |
| topic | Numerical Analysis 41A30, 41A25, 42B05, 65D15 |
| url | https://arxiv.org/abs/2407.21283 |