Interpolation on lattices generated by cubic pencils (Q2491238): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10444-004-7638-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1984140507 / rank
 
Normal rank

Revision as of 20:55, 19 March 2024

scientific article
Language Label Description Also known as
English
Interpolation on lattices generated by cubic pencils
scientific article

    Statements

    Interpolation on lattices generated by cubic pencils (English)
    0 references
    0 references
    0 references
    29 May 2006
    0 references
    From the introduction: In bivariate polynomial interpolation it is well known that the Lagrange problem for a set of \((n+2)(n+1)/2\) interpolation points (nodes) is unisolvent in \(\Pi_n(\mathbb R^2)\) if and only if the points do not lie on an algebraic curve of degree \(n\). However, a permanent and nontrivial question is the explicit construction of sets X satisfying this condition. Closely related to this question is the construction of solution in a simple way. Our aim in this paper is to extend the idea of \textit{S. L. Lee} and \textit{G. M. Phillips} [Constructive Approximation 7, 283--297 (1991; Zbl 0733.41011)] by constructing set of \((n+2)(n+1)/2\) points which are intersection of three lines each, in such a form that the Lagrange interpolation problem is unisolvent in \(\Pi_n(\mathbb R^2)\) and can be easily solved by any of three classical formulae.
    0 references
    multivariate interpolation
    0 references
    cubic pencils
    0 references
    principal lattices
    0 references

    Identifiers