Research Article

Padua points and fake nodes for polynomial approximation: old, new and open problems

Volume: 5 Number: 1 March 14, 2022
EN

Padua points and fake nodes for polynomial approximation: old, new and open problems

Abstract

Padua points, discovered in 2005 at the University of Padua, are the first set of points on the square [1,1]2[−1,1]2 that are explicitly known, unisolvent for total degree polynomial interpolation and with Lebesgue constant increasing like log2(n)log2⁡(n) of the degree. One of the key features of the Padua points is that they lie on a particular Lissajous curve. Other important properties of Padua points are

  1. in two dimensions, Padua points are a WAM for interpolation and for extracting approximate Fekete points and discrete Leja sequences.
  2. in three dimensions, Padua points can be used for constructing tensor product WAMs on different compacts.

Unfortunately, their extension to higher dimensions is still the biggest open problem. 

The concept of mapped bases has been widely studied (cf. e.g. [35] and references therein), which turns out to be equivalent to map the interpolating nodes and then construct the approximant in the classical form without the need of resampling. The mapping technique is general, in the sense that works with any basis and can be applied to continuous, piecewise or discontinuous functions or even images.
All the proposed methods show convergence to the interpolant provided that the function is resampled at the mapped nodes. In applications, this is often physically unfeasible. An effective method for interpolating via mapped bases in the multivariate setting, referred as Fake Nodes Approach (FNA), has been presented in [37]. In this paper, some interesting connection of the FNA with Padua points and families of relatives nodes, that can be used as fake nodes for multivariate approximation, are presented and we conclude with some open problems.

Keywords

References

  1. B. Adcock, R. B. Platte: A mapped polynomial method for high-accuracy approximations on arbitrary grids, SIAM J. Numer. Anal., 54 (2016), 2256–2281.
  2. R. Archibald, A. Gelb and J. Yoon: Polynomial Fitting for Edge Detection in Irregularly Sampled Signals and Images, SIAM J. Numer. Analysis, 43 (1) (2005), 259–279.
  3. J. Baglama, D. Calvetti and L. Reichel: Fast Leja points, Electron. Trans. Numer. Anal., 7 (1998), 124–140.
  4. J.-P. Berrut, S. De Marchi, G. Elefante and F. Marchetti: Treating the Gibbs phenomenon in barycentric rational interpolation and approximationvia the S-Gibbs algorithm, Appl. Math. Letters, 103 (2020), 106196.
  5. L. Bos: On certain configurations of points in R^n which are unisolvent for polynomial interpolation, J. Approx. Theory, 64 (3) (1991), 271–280.
  6. L. Bos: Multivariate interpolation and polynomial inequalities, Ph.D. course held at the University of Padua (2001), unpublished.
  7. L. Bos, M. Caliari, S. De Marchi and M. Vianello: A numerical study of the Xu interpolation formula, Computing, 76 (3-4) (2006), 311–324.
  8. L. Bos, M. Caliari, S. De Marchi, M. Vianello and Y. Xu: Bivariate Lagrange interpolation at the Padua points: the generating curve approach, J. Approx. Theory, 143 (1) (2006), 15–25.

Details

Primary Language

English

Subjects

Mathematical Sciences

Journal Section

Research Article

Publication Date

March 14, 2022

Submission Date

February 8, 2022

Acceptance Date

March 1, 2022

Published in Issue

Year 2022 Volume: 5 Number: 1

APA
De Marchı, S. (2022). Padua points and fake nodes for polynomial approximation: old, new and open problems. Constructive Mathematical Analysis, 5(1), 14-36. https://doi.org/10.33205/cma.1070020
AMA
1.De Marchı S. Padua points and fake nodes for polynomial approximation: old, new and open problems. CMA. 2022;5(1):14-36. doi:10.33205/cma.1070020
Chicago
De Marchı, Stefano. 2022. “Padua Points and Fake Nodes for Polynomial Approximation: Old, New and Open Problems”. Constructive Mathematical Analysis 5 (1): 14-36. https://doi.org/10.33205/cma.1070020.
EndNote
De Marchı S (March 1, 2022) Padua points and fake nodes for polynomial approximation: old, new and open problems. Constructive Mathematical Analysis 5 1 14–36.
IEEE
[1]S. De Marchı, “Padua points and fake nodes for polynomial approximation: old, new and open problems”, CMA, vol. 5, no. 1, pp. 14–36, Mar. 2022, doi: 10.33205/cma.1070020.
ISNAD
De Marchı, Stefano. “Padua Points and Fake Nodes for Polynomial Approximation: Old, New and Open Problems”. Constructive Mathematical Analysis 5/1 (March 1, 2022): 14-36. https://doi.org/10.33205/cma.1070020.
JAMA
1.De Marchı S. Padua points and fake nodes for polynomial approximation: old, new and open problems. CMA. 2022;5:14–36.
MLA
De Marchı, Stefano. “Padua Points and Fake Nodes for Polynomial Approximation: Old, New and Open Problems”. Constructive Mathematical Analysis, vol. 5, no. 1, Mar. 2022, pp. 14-36, doi:10.33205/cma.1070020.
Vancouver
1.Stefano De Marchı. Padua points and fake nodes for polynomial approximation: old, new and open problems. CMA. 2022 Mar. 1;5(1):14-36. doi:10.33205/cma.1070020

Cited By