Polynomial approximation from diffused data: unisolvence and stability
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908547181182976 |
|---|---|
| author | Bruno, Ludovico Bruni De Marchi, Stefano Elefante, Giacomo |
| author_facet | Bruno, Ludovico Bruni De Marchi, Stefano Elefante, Giacomo |
| contents | In this work, we address the problem of polynomial interpolation of non-pointwise data. More specifically, we assume that our input information comes from measurements obtained on diffuse compact domains. Although the nodal and the diffused problems are related by the mean value theorem, such an approach does not provide any concrete insights in terms of well-posedness and stability. We hence develop a different framework in which {\it unisolvence} can be again recovered from nodal results, for which a wide literature is available. To analyze the stability of the so-obtained diffused interpolation procedure, we characterize the norm of the interpolation operator in terms of a Lebesgue constant-like quantity. After analyzing some of its features, such as invariance properties and sensitivity to support overlapping, we numerically verify the theoretical findings. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_15813 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Polynomial approximation from diffused data: unisolvence and stability Bruno, Ludovico Bruni De Marchi, Stefano Elefante, Giacomo Numerical Analysis In this work, we address the problem of polynomial interpolation of non-pointwise data. More specifically, we assume that our input information comes from measurements obtained on diffuse compact domains. Although the nodal and the diffused problems are related by the mean value theorem, such an approach does not provide any concrete insights in terms of well-posedness and stability. We hence develop a different framework in which {\it unisolvence} can be again recovered from nodal results, for which a wide literature is available. To analyze the stability of the so-obtained diffused interpolation procedure, we characterize the norm of the interpolation operator in terms of a Lebesgue constant-like quantity. After analyzing some of its features, such as invariance properties and sensitivity to support overlapping, we numerically verify the theoretical findings. |
| title | Polynomial approximation from diffused data: unisolvence and stability |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2509.15813 |