Corpus ID: 14809551

Fast Algorithms for High-Precision Computation of Elementary Functions

@inproceedings{Brent2006FastAF,
  title={Fast Algorithms for High-Precision Computation of Elementary Functions},
  author={R. Brent},
  year={2006}
}
  • R. Brent
  • Published 2006
  • Computer Science
  • Open problem: Is γ or exp(γ) rational ? Since the regular continued fraction gives best rational approximations, continued fraction computations can give theorems of the form: If x is rational, say x = p/q, then |q| > B for some (very large) bound B. To obtain a result like this with given bound B, we need to compute x with absolute error O(1/B2). Using this method we know that, if γ or exp(γ) is rational, say p/q, then |q| must be very large. Thus, in some sense these numbers are “unlikely” to… CONTINUE READING
    Modern Computer Arithmetic
    • 176
    • Open Access
    Matters Computational: Ideas, Algorithms, Source Code
    • 64
    • Open Access
    Efficient evaluation methods of elementary functions suitable for SIMD computation
    • 15
    • Open Access
    Modern Computer Arithmetic (version 0.5.1)
    • 5
    • Open Access
    Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography
    • 5
    • Open Access
    978-0-521-19469-3-Modern Computer Arithmetic

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 21 REFERENCES
    Multiple-precision zero-finding methods and the complexity of elementary function evaluation
    • R. Brent
    • Mathematics, Computer Science
    • 2010
    • 147
    • Open Access
    Fast Algorithms for Manipulating Formal Power Series
    • 264
    • Open Access
    On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
    • 225
    • Open Access
    Fast Multiple-Precision Evaluation of Elementary Functions
    • R. Brent
    • Mathematics, Computer Science
    • 1976
    • 340
    • Open Access
    High-precision floating-point arithmetic in scientific computation
    • 116
    • Open Access
    REMOVING REDUNDANCY IN HIGH-PRECISION NEWTON ITERATION
    • DANIEL J. BERNSTEINf
    • 2004
    • 23
    • Open Access
    Efficient multiple-precision evaluation of elementary functions
    • 41
    • Open Access
    Algorithm 524: MP
    • 1978
    English translation in Problems of Information Transmission
    • 1991