Classification of bivariate configurations with simple Lagrange interpolation formulae
From MaRDI portal
The authors study bivariate Lagrange interpolation with polynomials of degree \(n \leq 4\). They discuss and describe completely all the geometric configurations of sets of nodes which satisfy the so-called geometric characterization condition. For such configurations, the corresponding Lagrange polynomials are products of polynomials of first degree. The number of lines containing more nodes than the degree \(n\) is used for the classification of the configurations.
Recommendations
- On geometric characterization and regular node configurations for bivariate Lagrange interpolation
- Planar configurations with simple Lagrange interpolation formulae
- scientific article; zbMATH DE number 1284023
- Bivariate Lagrange interpolation at the Chebyshev nodes
- scientific article; zbMATH DE number 1867926
Cited in
(11)- Classification of sets satisfying the geometric characterization
- Observations on interpolation by total degree polynomials in two variables
- Extensions of planar GC sets and Syzygy matrices
- Radon's construction and matrix relations generating syzygies
- Some researches on trivariate Lagrange interpolation
- Configurations of nodes with defects greater than three
- scientific article; zbMATH DE number 1161033 (Why is no real title available?)
- scientific article; zbMATH DE number 1867926 (Why is no real title available?)
- On regular node configurations of quadratic curves for bivariate graded Lagrange interpolation
- Geometric characterization and generalized principal lattices
- The work of Mariano Gasca
This page was built for publication: Classification of bivariate configurations with simple Lagrange interpolation formulae
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1424941)
