Efficient evaluation of multivariate polynomials (Q1084832)

From MaRDI portal
Revision as of 11:11, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Efficient evaluation of multivariate polynomials
scientific article

    Statements

    Efficient evaluation of multivariate polynomials (English)
    0 references
    0 references
    0 references
    1986
    0 references
    The authors give an algorithm to evaluate a polynomial of total degree d defined on a triangle T in the plane, \[ p(r,s,t)=\sum^{d}_{i=0}\sum^{i}_{j=0}c_{d-i,i-j,j}\cdot r^{d- i}s^{i-j}t^ j, \] where \(c_{d-i,i-j,j}=(d!/(d-i)!(i-j)!j!)b_{d- i,i-j,j}\), \(0\leq j\leq i\), \(0\leq i\leq d\), and (r,s,t) are the barycentric coordinates of each point in T, and \(b_{ijk}\) are the coefficients in the algorithm of de Casteljau. This algorithm is significantly faster than de Casteljau.
    0 references
    de Casteljau algorithm
    0 references
    data fitting
    0 references
    Bernstein-Bézier methods
    0 references
    surfaces
    0 references
    polynomial evaluation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references