Foundations of Exact Rounding
From MaRDI portal
Publication:3605482
DOI10.1007/978-3-642-00202-1_2zbMATH Open1211.65054OpenAlexW2117337629MaRDI QIDQ3605482FDOQ3605482
Publication date: 24 February 2009
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00202-1_2
Recommendations
Cites Work
- MPFR
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interval arithmetic yields efficient dynamic filters for computational geometry
- Fast Multiple-Precision Evaluation of Elementary Functions
- Theory of Real Computation According to EGC
- Fast evaluation of elementary mathematical functions with correctly rounded last bit
- Recent progress in exact geometric computation
- Title not available (Why is that?)
- How to recognize zero?
- Title not available (Why is that?)
- Algorithms – ESA 2005
- An accurate elementary mathematical library for the IEEE floating point standard
- Proposal for a standardization of mathematical function implementation in floating-point arith\-metic
- Hypergeometric Functions in Exact Geometric Computation
- Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format
Cited In (10)
- In Praise of Numerical Computation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounds on the objective value of feasible roundings
- Correctly Rounded Multiplication by Arbitrary Precision Constants
- Correct rounding of algebraic functions
- Adaptive isotopic approximation of nonsingular curves: The parameterizability and nonlocal isotopy approach
- Title not available (Why is that?)
- Innocuous Double Rounding of Basic Arithmetic Operations
- Proofs of conjectures on machine arithmetic lying at the base of localizing computations
Uses Software
This page was built for publication: Foundations of Exact Rounding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605482)
