A unified approach to evaluation algorithms for multivariate polynomials

DOI10.1090/S0025-5718-97-00862-4zbMath0886.65005OpenAlexW2058455688MaRDI QIDQ4372657

Suresh Kumar Lodha, Ronald N. Goldman

Publication date: 16 December 1997

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-97-00862-4

zbMATH Keywords

computational complexitymultivariate polynomialsLagrange polynomialBernstein polynomialNewton schemebivariate polynomialsevaluation algorithmsgraphic representationBézier polynomial

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Polynomials in real and complex fields: factorization (12D05) Numerical interpolation (65D05) Computation of special functions and constants, construction of tables (65D20) Real polynomials: location of zeros (26C10) Complexity and performance of numerical algorithms (65Y20)

Related Items (5)

Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form ⋮ Matrix methods for the simplicial Bernstein representation and for the evaluation of multivariate polynomials ⋮ Lattices and algorithms for bivariate Bernstein, Lagrange, Newton, and other related polynomial bases based on duality between \(L\)-bases and \(B\)-bases ⋮ A recursive algorithm for Hermite interpolation over a triangular grid ⋮ On evaluating multivariate polynomials over finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Change of basis algorithms for surfaces in CAGD
• Symmetric recursive algorithms for surfaces: B-patches and the de Boor algorithm for polynomials over triangles
• Blossoms are polar forms
• Efficient evaluation of multivariate polynomials
• An efficient raster evaluation method for univariate polynomials
• On the numerical condition of polynomials in Bernstein form
• Algorithms for polynomials in Bernstein form
• On multivariate interpolation by generalized polynomials on subsets of grids
• The general Neville-Aitken-algorithm and some applications
• On Lagrange and Hermite interpolation in \(R^ k\).
• A general recurrence interpolation formula and its applications to multivariate interpolation
• A practical guide to splines
• A recursive algorithm for Hermite interpolation over a triangular grid
• A recurrence formula for generalized divided differences and some applications
• B-splines, Pólya curves, and duality
• Making the difference interpolation method for splines more stable
• On the stability of transformations between power and Bernstein polynomial forms
• An identity for spline functions with applications to variation diminishing spline approximation
• Modeling steel fiber reinforced concrete: numerical immersed boundary approach and a phenomenological mesomodel for concrete-fiber interaction
• Interpolation in Several Variables
• Making the Oslo Algorithm More Efficient
• Creating multisided rational Bézier surfaces using base points
• Computational Aspects of Polynomial Interpolation in Several Variables
• On Lattices Admitting Unique Lagrange Interpolations
• Evaluation and approximate evaluation of the multivariate Bernstein-Bézier form on a regularly partitioned simplex
• On Interpolation by Iteration of Proportional Parts, without the Use of Differences
• Lagrange and hermite interpolation by bivariate splines
• Evaluation of Multivariate Polynomials and Their Derivatives
• Newton‐ und Hermite‐Interpolation mit Čebyšev‐Systemen

This page was built for publication: A unified approach to evaluation algorithms for multivariate polynomials