Range Functions of Any Convergence Order and Their Amortized Complexity Analysis
From MaRDI portal
Publication:6496602
DOI10.1007/978-3-031-41724-5_9MaRDI QIDQ6496602FDOQ6496602
Authors: Kai Hormann, Chee Meng Yap 
Publication date: 3 May 2024
Cites Work
- The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra
- SqFreeEVAL: An (almost) optimal real-root isolation algorithm
- MPFR
- Interval Methods for Systems of Equations
- Accuracy and Stability of Numerical Algorithms
- Title not available (Why is that?)
- Near optimal tree size bounds on a simple real root isolation algorithm
- Motivations for an arbitrary precision interval arithmetic and the MPFI library
- Title not available (Why is that?)
- Error bounds for Lagrange interpolation
- Centered Forms
- Title not available (Why is that?)
- \(L_p\)-error bounds for Hermite interpolation and the associated Wirtinger inequalities
- Effective subdivision algorithm for isolating zeros of real systems of equations, with complexity analysis
- Computing hypergeometric functions rigorously
- Computing the range of values of real functions with accuracy higher than second order
- Hypergeometric functions in exact geometric computation
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)
