Methods for bounding the range of a polynomial
From MaRDI portal
Publication:1899952
DOI10.1016/0377-0427(93)E0270-VzbMath0833.65011OpenAlexW2033403483MaRDI QIDQ1899952
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
Numerical computation using splines (65D07) Interval and finite arithmetic (65G30) Computation of special functions and constants, construction of tables (65D20)
Related Items
High-order quadrature on multi-component domains implicitly defined by multivariate polynomials ⋮ Towards rigorous robust optimal control via generalized high-order moment expansion ⋮ Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach ⋮ Interval approximation of higher order to the ranges of functions ⋮ Chebyshev model arithmetic for factorable functions ⋮ Disk Bézier curves ⋮ A connected component labeling algorithm for implicitly defined domains ⋮ OPTIMIZATIONS FOR TENSORIAL BERNSTEIN–BASED SOLVERS BY USING POLYHEDRAL BOUNDS ⋮ Unified framework for the propagation of continuous-time enclosures for parametric nonlinear ODEs ⋮ An integrative approach for analysis of nonlinear electrical circuits using-polynomial B-spline expansion and B-spline Krawczyk operator
Cites Work
