On the numerical condition of polynomials in Bernstein form

DOI10.1016/0167-8396(87)90012-4zbMath0636.65012OpenAlexW1998916693MaRDI QIDQ1098225

V. T. Rajan, Rida T. Farouki

Publication date: 1987

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8396(87)90012-4

zbMATH Keywords

computer aided designBernstein basisBernstein-Bézier curve and surface formscondition numbers of polynomialsoptimal root conditioning

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Approximation by polynomials (41A10)

Related Items

Numerical solutions of high-order differential equations with polynomial coefficients using a Bernstein polynomial basis, On the accuracy of de Casteljau-type algorithms and Bernstein representations, The new characterization of ruled surfaces corresponding dual Bézier curves, Computation of optimal composite re-parameterizations, Optimal slicing of free-form surfaces, Linearizations of matrix polynomials in Bernstein bases, \(LS(3)\)-equivalence conditions of control points and application to spatial Bézier curves and surfaces, Agent-based modelling of sports riots, Robust plotting of generalized lemniscates, A test, based on conversion to the Bernstein polynomial basis, for an interval to be free of zeros applicable to polynomials in Chebyshev form and to transcendental functions approximated by Chebyshev series, A rational cubic clipping method for computing real roots of a polynomial, Revisiting the problem of zeros of univariate scalar Béziers, Pythagorean-hodograph space curves, On the numerical condition of polynomials in Bernstein form, Jacobi polynomials in Bernstein form, Certified approximate univariate GCDs, Algorithms for polynomials in Bernstein form, Construction of orthogonal bases for polynomials in Bernstein form on triangular and simplex domains, Linear perturbation methods for topologically consistent representations of free-form surface intersections, Topologically consistent trimmed surface approximations based on triangular patches, Recursive de Casteljau bisection and rounding errors, A new recurrence relation and related determinantal form for binomial type polynomial sequences, Backward Error of Polynomial Eigenvalue Problems Solved by Linearization of Lagrange Interpolants, Piecewise parametric approximations for algebraic curves, Running error for the evaluation of rational Bézier surfaces, The numerical problem of using Bézier curves and surfaces in the power basis, Computing the roots of sparse high-degree polynomials that arise from the study of random simplicial complexes, Accurate polynomial interpolation by using the Bernstein basis, Multiplication-free evaluation of polynomials via a stochastic Bernstein representation, Polynomial basis conversion made stable by truncated singular value decomposition, Tikhonov regularisation in standard form for polynomial basis conversion, Accurate evaluation of a polynomial and its derivative in Bernstein form, The calculation of the degree of an approximate greatest common divisor of two polynomials, Algebraic pruning: a fast technique for curve and surface intersection, The dual basis functions for the generalized Ball basis of odd degree, Optimal parameterizations, Real-time rendering of algebraic B-spline surfaces via Bézier point insertion, Uniform approximation and Bernstein polynomials with coefficients in the unit interval, Running error for the evaluation of rational Bézier surfaces through a robust algorithm, Generalized Standard Triples for Algebraic Linearizations of Matrix Polynomials, Polytope-based computation of polynomial ranges, Extremal and optimal properties of B-bases collocation matrices, A statistical analysis of the numerical condition of multiple roots of polynomials., On the evaluation of rational triangular Bézier surfaces and the optimal stability of the basis, The Bernstein polynomial basis: a centennial retrospective, Solutions of 2nd-order linear differential equations subject to Dirichlet boundary conditions in a Bernstein polynomial basis, On the numerical condition of algebraic curves and surfaces. I: Implicit equations, Unnamed Item, Design of rational rotation–minimizing rigid body motions by Hermite interpolation, A new determinant form of Bessel polynomials and applications, Computing with barycentric polynomials, Spline Representation of Connected Surfaces with Custom-Shaped Holes, Real-time CNC interpolators for Pythagorean-hodograph curves, Point and tangent computation of tensor product rational Bézier surfaces, A unified approach to evaluation algorithms for multivariate polynomials, B-splines and optimal stability, On the stability of polynomial transformations between Taylor, Bernstein and Hermite forms, Numerical solution of fractional differential equations with a Tau method based on Legendre and Bernstein polynomials, The computation of the degree of the greatest common divisor of three Bernstein basis polynomials, On a tolerance problem of parametric curves and surfaces, A comparison of the average case numerical condition of the power and bernstein polynomial bases, A resultant matrix for scaled Bernstein polynomials, Bernstein-polynomials-based highly accurate methods for one-dimensional interface problems, Explicit solution of the finite time \(L_{2}\)-norm polynomial approximation problem, Compensated de Casteljau algorithm in \(K\) times the working precision, A 2-norm condition number for Bézier curve intersection, The numerical condition of univariate and bivariate degree elevated Bernstein polynomials, A note on the optimal stability of bases of univariate functions, On the generalized Ball bases, On the degree elevation of Bernstein polynomial representation, Intersection test and blossoming perturbation for disk parametric curves and ball parametric surfaces, Efficient Algorithms for Periodic Hermite Spline Interpolation, On the stability of transformations between power and Bernstein polynomial forms, Guaranteed consistency of surface intersections and trimmed surfaces using a coupled topology resolution and domain decomposition scheme, Bivariate generalized shifted Gegenbauer orthogonal system, Predictive Control for Path-Following. From Trajectory Generation to the Parametrization of the Discrete Tracking Sequences, On a generalization of Bernstein polynomials and Bézier curves based on umbral calculus, Dual basis functions for the NS-power basis and their applications, Hermite Interpolation by Pythagorean Hodograph Quintics, Division algorithms for Bernstein polynomials, Subdivision methods for solving polynomial equations, The Runge Example for Interpolation and Wilkinson's Examples for Rootfinding, A dimensionality paradigm for surface interrogations, On the optimal stability of the Bernstein basis, Contour machining of free-form surfaces with real-time PH curve CNC interpolators, Algorithm 952, Minimal height companion matrices for Euclid polynomials, Biorthogonal spline wavelets on the interval -- stability and moment conditions, An efficient algorithm for range computation of polynomials using the Bernstein form, Least squares problems involving generalized Kronecker products and application to bivariate polynomial regression, Legendre-Bernstein basis transformations, Numerical solutions of Korteweg-de Vries and Korteweg-de Vries-Burger's equations in a Bernstein polynomial basis, Polynomial sequences: elementary basic methods and application hints. A survey, Evaluation of the derivative of a polynomial in Bernstein form, On the Bertrand pairs of open non-uniform rational B-spline curves, Voronoi diagram and medial axis algorithm for planar domains with curved boundaries. II: Detailed algorithm description, The Bézout matrix for Hermite interpolants, Contouring a bivariate quadratic polynomial over a triangle, \(q\)-Bernstein polynomials and Bézier curves, Computation of the solutions of nonlinear polynomial systems, A companion matrix resultant for Bernstein polynomials, Detecting symmetries in polynomial Bézier curves, Specified–Precision Computation of Curve/Curve Bisectors, Algorithm 960, Comparison of interval methods for plotting algebraic curves

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Error analysis of floating-point computation
• A survey of curve and surface methods in CAGD
• On the numerical condition of polynomials in Bernstein form
• Bounds on a polynomial
• Some new characterizations of the Chebyshev polynomials
• On the condition of algebraic equations
• On the conditioning of polynomial and rational forms
• The evaluation of the zeros of ill-conditioned polynomials. I, II
• Markov chains and computer-aided geometric design: part I - problems and constraints
• Polya’s Urn Model and Computer Aided Geometric Design
• The characterization of parametric surface sections
• A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces
• Principles for Testing Polynomial Zerofinding Programs
• The Condition of Polynomials in Power Form
• Bernstein-Bézier Methods for the Computer-Aided Design of Free-Form Curves and Surfaces
• On the Problem of Runs
• Bernstein form of a polynomial
• A Theory of Condition
• Bounds on a polynomial
• Bounds for the Horner Sums
• Stable evaluation of polynomials
• Practical Problems Arising in the Solution of Polynomial Equations
• Interactive Interpolation and Approximation by Bezier Polynomials
• The Condition of Orthogonal Polynomials