Pages that link to "Item:Q633637"
From MaRDI portal
The following pages link to Efficient and accurate computation of upper bounds of approximation errors (Q633637):
Displaying 11 items.
- Proving tight bounds on univariate expressions with elementary functions in Coq (Q331615) (← links)
- Polynomials with bounds and numerical approximation (Q1681786) (← links)
- Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials (Q1733314) (← links)
- A validated real function calculus (Q1949769) (← links)
- On exact Reznick, Hilbert-Artin and Putinar's representations (Q2029015) (← links)
- An algorithm for decomposing a non-negative polynomial as a sum of squares of rational functions (Q2351490) (← links)
- Rigorous uniform approximation of D-finite functions using Chebyshev expansions (Q2967967) (← links)
- Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets (Q5043282) (← links)
- Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients (Q5883314) (← links)
- Floating-point arithmetic (Q6047500) (← links)
- Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares (Q6081964) (← links)
