Journals / Constructive Mathematical Analysis / 2022 / Cilt: 5 - Sayı: 1

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

Pages
14–36
Publication Date
2022-03-14
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

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.

📌 3 Key Takeaways

🎯
Objective & Hypothesis: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.
📊
Key Findings & Data: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.
💡
Conclusion & Impact: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.
🔬Design:Research Article
📍Scope:2005 Verileri
⚙️Variables:Padua points · Lissajous curves and points · mapped polynomial basis.

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 arein two dimensions, Padua points are a WAM for interpolation and for extracting approximate Fekete points and discrete Leja sequences.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.

🔖

Cite This Article

MARCHI, S. D. (2022). Padua points and fake nodes for polynomial approximation: old, new and open problems. Constructive Mathematical Analysis, Cilt: 5 - Sayı: 1, 14–36. https://ajindex.com/articles/748922

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (13)

  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. L. Bos: On certain configurations of points in R^n which are unisolvent for polynomial interpolation, J. Approx. Theory, 64 (3) (1991), 271–280. L. Bos: Multivariate interpolation and polynomial inequalities, Ph.D. course held at the University of Padua (2001), unpublished. 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.
  5. 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.
  6. L. Bos, J.-P. Calvi, N. Levenberg, A. Sommariva and M. Vianello: Geometric Weakly Admissible Meshes, Discrete Least Squares Approximations and Approximate Fekete Points, Math. Comp., 80 (2011), 1601–1621.
  7. L. Bos, S. De Marchi, M. Vianello and Y. Xu: Bivariate Lagrange interpolation at the Padua points: the ideal theory approach, Numer. Math., 108 (1) (2007), 43–57.
  8. L. Bos, S. De Marchi and S. Waldron: On the Vandermonde Determinant of Padua-like Points (on Open Problems section), Dolomites Res. Notes on Approx., 2 (2009), 1–15.
  9. L. Bos, S. De Marchi, A. Sommariva and M. Vianello: Weakly Admissible Meshes and Discrete Extremal Sets, Numer. Math. Theory Methods Appl., 4 (2011), 1–12.
  10. L. Bos, S. De Marchi, A. Sommariva and M. Vianello: Computing multivariate Fekete and Leja points by numerical linear algebra, SIAM J. Num. Anal., 48 (5) (2010), 1984–1999.
  11. L. Bos, N. Levenberg: On the Approximate Calculation of Fekete Points: the Univariate Case, Elec. Trans. Numer. Anal., 30 (2008), 377–397.
  12. L. Bos, A. Sommariva and M. Vianello: Least-squares polynomial approximation on weakly admissible meshes: disk and triangle, J. Comput. Appl. Math., 235 (2010), 660–668.
  13. L. Bos, M. A. Taylor and B. A. Wingate: Tensor product Gauss-Lobatto points are Fekete points for