Range Functions of Any Convergence Order and Their Amortized Complexity Analysis
From MaRDI portal
Publication:6496602
DOI10.1007/978-3-031-41724-5_9MaRDI QIDQ6496602
Chee Meng Yap, Unnamed Author, Kai Hormann
Publication date: 3 May 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- SqFreeEVAL: An (almost) optimal real-root isolation algorithm
- Computing the range of values of real functions with accuracy higher than second order
- Error bounds for Lagrange interpolation
- \(L_p\)-error bounds for Hermite interpolation and the associated Wirtinger inequalities
- Motivations for an arbitrary precision interval arithmetic and the MPFI library
- MPFR
- Centered Forms
- Interval Methods for Systems of Equations
- Accuracy and Stability of Numerical Algorithms
- Hypergeometric Functions in Exact Geometric Computation
- Computing Hypergeometric Functions Rigorously
- Effective Subdivision Algorithm for Isolating Zeros of Real Systems of Equations, with Complexity Analysis
- Near optimal tree size bounds on a simple real root isolation algorithm
- The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra
This page was built for publication: Range Functions of Any Convergence Order and Their Amortized Complexity Analysis
