Skip to content
Research Article Open access CC BY 4.0

On Bivariate Fundamental Polynomials

Vahagn Vardanyan

Journal of Advances in Mathematics and Computer Science · pp. 1–17 · Published 30 Jul 2015

10.9734/BJMCS/2015/18816

Abstract

An n-independent set in two dimensions is a set of nodes admitting (not necessary unique) bivariate interpolation with polynomials of total degree at most n: For an arbitrary n-independent node set X we are interested with the property that each node possesses an n-fundamental polynomial in form of products of linear or quadratic factors. In the present paper we show that each node of X has an n-fundamental polynomial, which is a product of lines, if #X ≤ 2n + 1: Next we prove that each node of X has an n-fundamental polynomial, which is a product of lines or conics, if #X ≤ 2n+[n/2]+1. We bring a counterexample in each case to show that the results are not valid in general if #X ≥ 2n + 2 and #X ≥ 2n + [n/2] + 2; respectively. At the end we bring an algorithm for the construction of above mentioned fundamental polynomials. This, in view of the Lagrange formula, can be used to obtain readily also the interpolation polynomials.

Bivariate polynomial interpolation fundamental polynomial conic n-poised nodes n-independent nodes

Cited by 1

On a correction of a property of GCn sets

Hakop Hakopian, Vahagn Vardanyan · Advances in Computational Mathematics · 2018

Article metrics

Real usage data collected on this platform.

0

Page views

0

PDF downloads

0

Outbound clicks

1

Citations

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

No views recorded yet.

Traffic sources

Referring site, by host.

No traffic recorded yet.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.