English

On the Lebesgue constant of the Morrow-Patterson points

Numerical Analysis 2024-12-20 v1 Numerical Analysis Classical Analysis and ODEs

Abstract

The study of interpolation nodes and their associated Lebesgue constants are central to numerical analysis, impacting the stability and accuracy of polynomial approximations. In this paper, we will explore the Morrow-Patterson points, a set of interpolation nodes introduced to construct cubature formulas of a minimum number of points in the square for a fixed degree nn. We prove that their Lebesgue constant growth is O(n2){\cal O}(n^2) as was conjectured based on numerical evidence about twenty years ago in the paper by Caliari, M., De Marchi, S., Vianello, M., {\it Bivariate polynomial interpolation on the square at new nodal sets}, Appl. Math. Comput. 165(2) (2005), 261--274.

Keywords

Cite

@article{arxiv.2412.14595,
  title  = {On the Lebesgue constant of the Morrow-Patterson points},
  author = {Tomasz Beberok and Leokadia Białas-Cież and Stefano De Marchi},
  journal= {arXiv preprint arXiv:2412.14595},
  year   = {2024}
}