Bounds on a polynomial

DOI10.1007/BF01934076zbMath0472.65041OpenAlexW2025810010MaRDI QIDQ1157879

Jeffrey M. Lane, Richard F. Riesenfeld

Publication date: 1981

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01934076

zbMATH Keywords

minimapolynomialmaximareal roots21, 112-117 (1981)recursive bisection technique

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)

Related Items (36)

Computing the range of values of real functions using B-spline form ⋮ Finding intersections of B-spline represented geometries using recursive subdivision techniques ⋮ Continuous amortization and extensions: with applications to bisection-based root isolation ⋮ Detection of critical points of multivariate piecewise polynomial systems ⋮ Revisiting the problem of zeros of univariate scalar Béziers ⋮ Constructing a Polynomial Method in the State Space for a Nonlinear Optimal Control Problem ⋮ Recursive subdivision without the convex hull property ⋮ Surface algorithms using bounds on derivatives ⋮ Bernstein form is inclusion monotone ⋮ On the numerical condition of polynomials in Bernstein form ⋮ Methods for bounding the range of a polynomial ⋮ Algorithms for polynomials in Bernstein form ⋮ Linear perturbation methods for topologically consistent representations of free-form surface intersections ⋮ On multiple roots in Descartes' rule and their distance to roots of higher derivatives ⋮ A New Approach Based on Interval Analysis and B-splines Properties for Solving Bivariate Nonlinear Equations Systems ⋮ Computational issues in solid boundary evaluation ⋮ Interval approximation of higher order to the ranges of functions ⋮ Computing zeroes of spline functions ⋮ Real-time rendering of algebraic B-spline surfaces via Bézier point insertion ⋮ Interval-Krawczyk Approach for Solving Nonlinear Equations Systems in B-spline Form ⋮ The Bernstein polynomial basis: a centennial retrospective ⋮ GPU-based parallel solver via the Kantorovich theorem for the nonlinear Bernstein polynomial systems ⋮ New bounds for the Descartes method ⋮ Computing with barycentric polynomials ⋮ A new method of evaluating compact geometric bounds for use in subdivision algorithms ⋮ On a tolerance problem of parametric curves and surfaces ⋮ Circle reproduction with interpolatory curves at local maximal curvature points ⋮ Construction and shape analysis of PH quintic Hermite interpolants ⋮ Optimal slicing of free-form surfaces ⋮ Guaranteed consistency of surface intersections and trimmed surfaces using a coupled topology resolution and domain decomposition scheme ⋮ Subdivision methods for solving polynomial equations ⋮ The Computation of Multiple Roots of a Bernstein Basis Polynomial ⋮ Contour machining of free-form surfaces with real-time PH curve CNC interpolators ⋮ Voronoi diagram and medial axis algorithm for planar domains with curved boundaries. II: Detailed algorithm description ⋮ Computation of the solutions of nonlinear polynomial systems ⋮ Specified–Precision Computation of Curve/Curve Bisectors

Cites Work

• Unnamed Item
• Bounds for an interval polynomial
• A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces
• The Minimum Root Separation of a Polynomial
• Bernstein form of a polynomial
• Interactive Interpolation and Approximation by Bezier Polynomials
• On the location of the zeros of a polynomial

This page was built for publication: Bounds on a polynomial