Arbitrary precision real arithmetic: design and algorithms
From MaRDI portal
Publication:1779562
DOI10.1016/j.jlap.2004.07.003zbMath1080.03042OpenAlexW2052324986MaRDI QIDQ1779562
Publication date: 1 June 2005
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2004.07.003
Related Items (max. 100)
Mathematical model and implementation of rational processing ⋮ Recursive solution of initial value problems with temporal discretization ⋮ Exact real arithmetic using centred intervals and bounded error terms ⋮ Contractivity of linear fractional transformations ⋮ Some representations of real numbers using integer sequences
Uses Software
Cites Work
- Computing with infinite objects
- Feasible real random access machines
- Contractivity of linear fractional transformations
- Using PVS to validate the algorithms of an exact arithmetic.
- Fast Multiple-Precision Evaluation of Elementary Functions
- Lazy computation with exact real numbers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Arbitrary precision real arithmetic: design and algorithms