Robust arithmetic for multivariate Bernstein-form polynomials
From MaRDI portal
Recommendations
Cited in
(15)- On the degree elevation of Bernstein polynomial representation
- An efficient algorithm for range computation of polynomials using the Bernstein form
- Division algorithms for Bernstein polynomials
- On the numerical condition of polynomials in Bernstein form
- Algorithms for polynomials in Bernstein form
- Robust plotting of generalized lemniscates
- Comparison of interval methods for plotting algebraic curves
- Multiplication-free evaluation of polynomials via a stochastic Bernstein representation
- Uniform approximation and Bernstein polynomials with coefficients in the unit interval
- Gauss map computation for free-form surfaces
- Approximation of multivariate function by using new multivariate Bernstein -polynomials
- The Bernstein polynomial basis: a centennial retrospective
- The mixed directional difference-summation algorithm for generating the Bézier net of a trivariate four-direction box-spline
- scientific article; zbMATH DE number 1571498 (Why is no real title available?)
- On multivariate polynomials in Bernstein-Bézier form and tensor algebra
This page was built for publication: Robust arithmetic for multivariate Bernstein-form polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628010)