Pages that link to "Item:Q1899952"
From MaRDI portal
The following pages link to Methods for bounding the range of a polynomial (Q1899952):
Displaying 16 items.
- An effective bound on the gap between the control polytype and the graph of a real polynomial on a simplex (Q1046529) (← links)
- Disk Bézier curves (Q1128916) (← links)
- Bounds for the range of a bivariate polynomial over a triangle (Q1383742) (← links)
- Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach (Q1652420) (← links)
- Chebyshev model arithmetic for factorable functions (Q1675562) (← links)
- Polynomials with bounds and numerical approximation (Q1681786) (← links)
- Interval approximation of higher order to the ranges of functions (Q1912862) (← links)
- An integrative approach for analysis of nonlinear electrical circuits using-polynomial B-spline expansion and B-spline Krawczyk operator (Q2114513) (← links)
- High-order quadrature on multi-component domains implicitly defined by multivariate polynomials (Q2134493) (← links)
- Bounds-constrained polynomial approximation using the Bernstein basis (Q2168063) (← links)
- Unified framework for the propagation of continuous-time enclosures for parametric nonlinear ODEs (Q2351531) (← links)
- Bounds for the range of a complex polynomial over a rectangular region (Q2656078) (← links)
- Polynomials and Numerical Ranges (Q3031113) (← links)
- Towards rigorous robust optimal control via generalized high-order moment expansion (Q3176438) (← links)
- OPTIMIZATIONS FOR TENSORIAL BERNSTEIN–BASED SOLVERS BY USING POLYHEDRAL BOUNDS (Q4923349) (← links)
- A connected component labeling algorithm for implicitly defined domains (Q6161317) (← links)
