Range Functions of Any Convergence Order and Their Amortized Complexity Analysis
From MaRDI portal
Publication:6496602
Cites work
- scientific article; zbMATH DE number 3936378 (Why is no real title available?)
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 2247480 (Why is no real title available?)
- Accuracy and Stability of Numerical Algorithms
- Centered Forms
- Computing hypergeometric functions rigorously
- Computing the range of values of real functions with accuracy higher than second order
- Effective subdivision algorithm for isolating zeros of real systems of equations, with complexity analysis
- Error bounds for Lagrange interpolation
- Hypergeometric functions in exact geometric computation
- Interval Methods for Systems of Equations
- MPFR
- Motivations for an arbitrary precision interval arithmetic and the MPFI library
- Near optimal tree size bounds on a simple real root isolation algorithm
- SqFreeEVAL: An (almost) optimal real-root isolation algorithm
- The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra
- \(L_p\)-error bounds for Hermite interpolation and the associated Wirtinger inequalities
This page was built for publication: Range Functions of Any Convergence Order and Their Amortized Complexity Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496602)
