April 27, 2006
Padua points is a family of points on the square $[-1,1]^2$ given by explicit formulas that admits unique Lagrange interpolation by bivariate polynomials. The interpolation polynomials and cubature formulas based on the Padua points are studied from an ideal theoretic point of view, which leads to the discovery of a compact formula for the interpolation polynomials. The $L^p$ convergence of the interpolation polynomials is also studied.
Similar papers 1
March 3, 2015
In this article, we study bivariate polynomial interpolation on the node points of degenerate Lissajous figures. These node points form Chebyshev lattices of rank $1$ and are generalizations of the well-known Padua points. We show that these node points allow unique interpolation in appropriately defined spaces of polynomials and give explicit formulas for the Lagrange basis polynomials. Further, we prove mean and uniform convergence of the interpolating schemes. For the unif...
November 27, 2014
Motivated by an application in Magnetic Particle Imaging, we study bivariate Lagrange interpolation at the node points of Lissajous curves. The resulting theory is a generalization of the polynomial interpolation theory developed for a node set known as Padua points. With appropriately defined polynomial spaces, we will show that the node points of non-degenerate Lissajous curves allow unique interpolation and can be used for quadrature rules in the bivariate setting. An expl...
November 1, 2017
The goal of this article is to provide a general multivariate framework that synthesizes well-known non-tensorial polnomial interpolation schemes on the Padua points, the Morrow-Patterson-Xu points and the Lissajous node points into a single unified theory. The interpolation nodes of these schemes are special cases of the general Lissajous-Chebyshev points studied in this article. We will characterize these Lissajous-Chebyshev points in terms of Lissajous curves and Chebyshev...
September 3, 2017
The nodes of certain minimal cubature rule are real common zeros of a set of orthogonal polynomials of degree $n$. They often consist of a well distributed set of points and interpolation polynomials based on them have desired convergence behavior. We report what is known and the theory behind by explaining the situation when the domain of integrals is a square.
July 25, 2011
In this paper, we consider the particular case of the general rational Hermite interpolation problem where only the value of the function is interpolated at some points, and where the function and its first derivatives agree at the origin. Thus, the interpolants constructed in this way possess a Pad\'e--type property at 0. Numerical examples show the interest of the procedure. The interpolation procedure can be easily modified to introduce a partial knowledge on the poles and...
July 13, 2021
In this paper, we derive an explicit formula for the bivariate Lagrange basis polynomials of a general set of checkerboard nodes. This formula generalizes existing results of bivariate Lagrange basis polynomials at the Padua nodes, Chebyshev nodes, Morrow-Patterson nodes, and Geronimus nodes. We also construct a subspace spanned by linearly independent bivariate vanishing polynomials that vanish at the checkerboard nodes and prove the uniqueness of the set of bivariate Lagran...
February 1, 2011
Minimal cubature rules of degree $4n-1$ for the weight functions $$ W_{\a,\b,\pm \frac12}(x,y) = |x+y|^{2\a+1} |x-y|^{2\b+1} ((1-x^2)(1-y^2))^{\pm \frac12} $$ on $[-1,1]^2$ are constructed explicitly and are shown to be closed related to the Gaussian cubature rules in a domain bounded by two lines and a parabola. Lagrange interpolation polynomials on the nodes of these cubature rules are constructed and their Lebesgue constants are determined.
October 5, 2020
This paper considers the extension of classical Lagrange interpolation in one real or complex variable to "polynomials of one quaternionic variable". To do this we develop some aspects of the theory of such polynomials. We then give a number of related multivariate polynomial interpolation schemes for ${\mathbb{R}}^4$ and ${\mathbb{C}}^2$ with good geometric properties, and some aspects of least interpolation and of Kergin interpolation.
January 8, 2010
For the last almost three decades, since the famous Buchberger-M\"oller(BM) algorithm emerged, there has been wide interest in vanishing ideals of points and associated interpolation polynomials. Our paradigm is based on the theory of bivariate polynomial interpolation on cartesian point sets that gives us related degree reducing interpolation monomial and Newton bases directly. Since the bases are involved in the computation process as well as contained in the final output o...
March 27, 2016
As a complement to \cite{X12}, minimal cubature rules of degree $4m+1$ for the weight functions $$ \mathcal{W}_{\alpha,\beta ,\pm \frac12}(x,y) = |x+y|^{2\alpha+1} |x-y|^{2\beta+1} ((1-x^2)(1-y^2))^{\pm \frac12} $$ on $[-1,1]^2$ are shown to exist and near minimal cubature rules of the same degree with one node more than minimal are constructed explicitly. The Lagrange interpolation polynomials on the nodes of the near minimal cubature rules are also studied.