A unified approach to evaluation algorithms for multivariate polynomials
From MaRDI portal
Bernstein polynomialbivariate polynomialsBézier polynomialcomputational complexityevaluation algorithmsgraphic representationLagrange polynomialmultivariate polynomialsNewton scheme
Polynomials in real and complex fields: factorization (12D05) Real polynomials: location of zeros (26C10) Numerical interpolation (65D05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computation of special functions and constants, construction of tables (65D20) Complexity and performance of numerical algorithms (65Y20)
Recommendations
- Efficient evaluation of multivariate polynomials
- A unified method for multivariate polynomial factorizations
- scientific article; zbMATH DE number 850292
- Evaluation algorithms for multivariate polynomials in Bernstein-Bézier form
- On the parallel evaluation of multivariate polynomials
- Algorithms for accurate, validated and fast polynomial evaluation
- Evaluation of Multivariate Polynomials and Their Derivatives
- Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants
- Algorithms – ESA 2004
- An efficient algorithm for the multivariable Adomian polynomials
Cites work
- A general recurrence interpolation formula and its applications to multivariate interpolation
- A practical guide to splines
- A recurrence formula for generalized divided differences and some applications
- A recursive algorithm for Hermite interpolation over a triangular grid
- Algorithms for polynomials in Bernstein form
- An efficient raster evaluation method for univariate polynomials
- An identity for spline functions with applications to variation diminishing spline approximation
- B-splines, Pólya curves, and duality
- Blossoms are polar forms
- Change of basis algorithms for surfaces in CAGD
- Computational Aspects of Polynomial Interpolation in Several Variables
- Creating multisided rational Bézier surfaces using base points
- Efficient evaluation of multivariate polynomials
- Evaluation and approximate evaluation of the multivariate Bernstein-Bézier form on a regularly partitioned simplex
- Evaluation of Multivariate Polynomials and Their Derivatives
- scientific article; zbMATH DE number 432872 (Why is no real title available?)
- scientific article; zbMATH DE number 4136664 (Why is no real title available?)
- scientific article; zbMATH DE number 3986514 (Why is no real title available?)
- scientific article; zbMATH DE number 4069483 (Why is no real title available?)
- scientific article; zbMATH DE number 3703310 (Why is no real title available?)
- scientific article; zbMATH DE number 3782281 (Why is no real title available?)
- scientific article; zbMATH DE number 194260 (Why is no real title available?)
- scientific article; zbMATH DE number 3014499 (Why is no real title available?)
- scientific article; zbMATH DE number 885419 (Why is no real title available?)
- Interpolation in Several Variables
- Lagrange and hermite interpolation by bivariate splines
- Making the difference interpolation method for splines more stable
- Making the Oslo Algorithm More Efficient
- Modeling steel fiber reinforced concrete: numerical immersed boundary approach and a phenomenological mesomodel for concrete-fiber interaction
- Newton‐ und Hermite‐Interpolation mit Čebyšev‐Systemen
- On Interpolation by Iteration of Proportional Parts, without the Use of Differences
- On Lagrange and Hermite interpolation in R^ k.
- On Lattices Admitting Unique Lagrange Interpolations
- On multivariate interpolation by generalized polynomials on subsets of grids
- On the numerical condition of polynomials in Bernstein form
- On the stability of transformations between power and Bernstein polynomial forms
- Symmetric recursive algorithms for surfaces: B-patches and the de Boor algorithm for polynomials over triangles
- The general Neville-Aitken-algorithm and some applications
Cited in
(14)- An efficient raster evaluation method for univariate polynomials
- Lattices and algorithms for bivariate Bernstein, Lagrange, Newton, and other related polynomial bases based on duality between L-bases and B-bases
- Matrix methods for the simplicial Bernstein representation and for the evaluation of multivariate polynomials
- A recursive algorithm for Hermite interpolation over a triangular grid
- Multiplication-free evaluation of polynomials via a stochastic Bernstein representation
- scientific article; zbMATH DE number 5608928 (Why is no real title available?)
- scientific article; zbMATH DE number 6520921 (Why is no real title available?)
- scientific article; zbMATH DE number 4136665 (Why is no real title available?)
- Evaluation of Multivariate Polynomials and Their Derivatives
- scientific article; zbMATH DE number 850292 (Why is no real title available?)
- On evaluating multivariate polynomials over finite fields
- Algorithms – ESA 2004
- Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form
- Algorithms for accurate, validated and fast polynomial evaluation
This page was built for publication: A unified approach to evaluation algorithms for multivariate polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4372657)
