An algorithm for multiple-precision floating-point multiplication
From MaRDI portal
Recommendations
Cites work
- Algorithm 719: Multiprecision translation and execution of FORTRAN programs
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Fast multiplication of large numbers
- scientific article; zbMATH DE number 1099195 (Why is no real title available?)
- More on squaring and multiplying large integers
- On short multiplications and divisions
- Ramanujan, Modular Equations, and Approximations to Pi or How to Compute One Billion Digits of Pi
- The Computation of π to 29,360,000 Decimal Digits Using Borweins' Quartically Convergent Algorithm
Cited in
(10)- Multiprecision floating point addition
- scientific article; zbMATH DE number 40800 (Why is no real title available?)
- scientific article; zbMATH DE number 1086539 (Why is no real title available?)
- A dual precision IEEE floating-point multiplier
- scientific article; zbMATH DE number 1543309 (Why is no real title available?)
- Correctly Rounded Multiplication by Arbitrary Precision Constants
- scientific article; zbMATH DE number 1860705 (Why is no real title available?)
- Binary Integer Decimal-Based Floating-Point Multiplication
- 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
This page was built for publication: An algorithm for multiple-precision floating-point multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2485630)