Correctly Rounded Multiplication by Arbitrary Precision Constants
From MaRDI portal
Publication:4589537
DOI10.1109/TC.2007.70813zbMATH Open1388.65201OpenAlexW1984670676MaRDI QIDQ4589537FDOQ4589537
Nicolas Brisebarre, Jean-Michel Muller
Publication date: 10 November 2017
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.2007.70813
Recommendations
- Correctly Rounded Arbitrary-Precision Floating-Point Summation
- Computing correctly rounded integer powers in floating-point arithmetic
- Faithfully rounded floating-point computations
- Correct rounding and a hybrid approach to exact floating-point summation
- Accurate Floating-Point Product and Exponentiation
- On the Computation of Correctly Rounded Sums
- Algorithms for Calculating Correctly Rounded Exponential Function in Double-Precision Arithmetic
- Decimal Floating-Point Multiplication
- Foundations of Exact Rounding
- An algorithm for multiple-precision floating-point multiplication
Cited In (8)
- Title not available (Why is that?)
- Floating-point arithmetic
- Computing correctly rounded integer powers in floating-point arithmetic
- On the Computation of Correctly Rounded Sums
- About accuracy increase of fractional order derivative and integral computations by applying the Grünwald-Letnikov formula
- Correct rounding of algebraic functions
- Title not available (Why is that?)
- Innocuous Double Rounding of Basic Arithmetic Operations
This page was built for publication: Correctly Rounded Multiplication by Arbitrary Precision Constants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589537)
