Methods for bounding the range of a polynomial
From MaRDI portal
Publication:1899952
DOI10.1016/0377-0427(93)E0270-VzbMath0833.65011MaRDI QIDQ1899952
Publication date: 14 March 1996
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
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, 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, 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