Arithmetic Algorithms for Extended Precision Using Floating-Point Expansions
From MaRDI portal
Cited in
(13)- Formal verification of a floating-point expansion renormalization algorithm
- Arbitrary precision real arithmetic: design and algorithms
- Detecting unreliable computer simulations of recursive functions with interval extensions
- CAMPARY: CUDA multiple precision arithmetic library and applications
- Handbook of Floating-Point Arithmetic
- Algorithm 722: Functions to support the IEEE standard for binary floating-point arithmetic
- scientific article; zbMATH DE number 1863384 (Why is no real title available?)
- scientific article; zbMATH DE number 2217820 (Why is no real title available?)
- On the Possibility of Increasing the Accuracy of Computations in the Floating-Point Format with Multiple Exponents
- A review note on arbitrary precision arithmetic
- Fast and accurate approximation algorithms for computing floating point square root
- Optimal approximation of the 1/x function using Chebyshev polynomials and magic constants
- Towards a library for straight-line programs
This page was built for publication: Arithmetic Algorithms for Extended Precision Using Floating-Point Expansions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2985528)