Methods for bounding the range of a polynomial

DOI10.1016/0377-0427(93)E0270-VzbMath0833.65011MaRDI QIDQ1899952

Qun Lin, Jon G. Rokne

Publication date: 14 March 1996

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(93)e0270-v

zbMATH Keywords

Bernstein polynomials; \(B\)-splines; range of a polynomial

Mathematics Subject Classification ID

65D07: Numerical computation using splines

65G30: Interval and finite arithmetic

65D20: Computation of special functions and constants, construction of tables

Related Items

OPTIMIZATIONS FOR TENSORIAL BERNSTEIN–BASED SOLVERS BY USING POLYHEDRAL BOUNDS, A connected component labeling algorithm for implicitly defined domains, Disk Bézier curves, Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach, Chebyshev model arithmetic for factorable functions, Interval approximation of higher order to the ranges of functions, An integrative approach for analysis of nonlinear electrical circuits using-polynomial B-spline expansion and B-spline Krawczyk operator, High-order quadrature on multi-component domains implicitly defined by multivariate polynomials, Unified framework for the propagation of continuous-time enclosures for parametric nonlinear ODEs, Towards rigorous robust optimal control via generalized high-order moment expansion

Cites Work

• Bounds on a polynomial
• Bounds for an interval polynomial
• On calculating with B-splines
• Bernstein form of a polynomial
• Bounds on a polynomial
• Unnamed Item