The Mathematical-Function Computation Handbook

  title={The Mathematical-Function Computation Handbook},
  author={Nelson H. F. Beebe},
  booktitle={Springer International Publishing},
  • N. H. Beebe
  • Published in
    Springer International…
  • Computer Science

Figures, Tables, and Topics from this paper

Algorithmic determination of a large integer in the two-term Machin-like formula for pi
In our earlier publication we have shown how to compute by iteration a rational number u2,k in the two-term Machin-like formula for π of the kind π 4 = 2 arctan ( 1 u1,k ) + arctan ( 1 u2,k ) , k ∈Expand
Arbitrary-precision computation of the gamma function
We discuss the best methods available for computing the gamma function Γ(z) in arbitrary-precision arithmetic with rigorous error bounds. We address different cases: rational, algebraic, real orExpand
Generating Random Floating-Point Numbers by Dividing Integers: A Case Study
A method widely used to obtain IEEE 754 binary floating-point numbers with a standard uniform distribution involves drawing an integer uniformly at random and dividing it by another larger integer.Expand
Design and Implementation Hardware Architecture for Four–Quadratic Arctangent
An FPGA based architecture design and the implementation of the Four-Quadratic Arctangent function, used in transformation from Cartesian to polar coordinates is presented. Expand


The Story of a Number
  • pp. LCCN QA247.5.M33
  • 1994
International Organization for Standardization, Geneva
  • Switzerland, September
  • 1998
To Infinity And Beyond A Cultural History Of The Infinite
Thank you for downloading to infinity and beyond a cultural history of the infinite. As you may know, people have look numerous times for their favorite readings like this to infinity and beyond aExpand
Continuous Multivariate Distributions, Volume 1: Models and Applications
Thank you for downloading continuous multivariate distributions vol 1 models and applications. Maybe you have knowledge that, people have look hundreds times for their favorite readings like thisExpand
The Pythagorean Theorem: A 4,000-Year History
Algorithm 969
The algorithm combines the use of series expansions, Poincaré-type expansions, uniform asymptotic expansions, and recurrence relations, depending on the parameter region, for computing the incomplete gamma function γ*(a, z). Expand
Chopping a Chebyshev Series
This paper describes the chopping algorithm introduced in Chebfun Version 5.3 in 2015 after many years of discussion and the considerations that led to this design. Expand
Correctly Rounded Arbitrary-Precision Floating-Point Summation
  • V. Lefèvre
  • Computer Science
  • IEEE Transactions on Computers
  • 2017
A fast algorithm together with its low-level implementation of correctly rounded arbitrary-precision floating-point summation and the worst-case complexity of this algorithm is given. Expand
Error bounds on complex floating-point multiplication with an FMA
It is proved that the term $2u$ is asymptotically optimal not only for this naive FMA-based algorithm, but also for two other algorithms, which use the FMA operation as an efficient way of implementing rounding error compensation. Expand
KISS: A bit too simple
  • G. Rose
  • Computer Science
  • Cryptography and Communications
  • 2017
A number of reasons why the generator does not meet some of the KISS authors’ claims are shown, why it is not suitable for use as a stream cipher, and that it isNot cryptographically secure are shown. Expand