LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Johansson , Fredrik (2015)
Publisher: HAL CCSD
Languages: English
Types: Conference object
Subjects: [ INFO.INFO-AO ] Computer Science [cs]/Computer Arithmetic, Computer Science - Numerical Analysis, Computer Science - Mathematical Software, [ INFO.INFO-MS ] Computer Science [cs]/Mathematical Software [cs.MS], [ INFO.INFO-NA ] Computer Science [cs]/Numerical Analysis [cs.NA]

Classified by OpenAIRE into

ACM Ref: ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION, MathematicsofComputing_NUMERICALANALYSIS
arxiv: Computer Science::Mathematical Software
International audience; We describe a new implementation of the elementary transcendental functions exp, sin, cos, log and atan for variable precision up to approximately 4096 bits. Compared to the MPFR library, we achieve a maximum speedup ranging from a factor 3 for cos to 30 for atan. Our implementation uses table-based argument reduction together with rectangular splitting to evaluate Taylor series. We collect denominators to reduce the number of divisions in the Taylor series, and avoid overhead by doing all multiprecision arithmetic using the mpn layer of the GMP library. Our implementation provides rigorous error bounds.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] D. H. Bailey, R. Barrio, and J. M. Borwein. High-precision computation: Mathematical physics and dynamics. Applied Mathematics and Computation, 218(20):10106{ 10121, 2012.
    • [2] Y. Bertot, N. Magaud, and P. Zimmermann. A proof of GMP square root. Journal of Automated Reasoning, 29(3-4):225{252, 2002.
    • [3] R. P. Brent. The complexity of multiple-precision arithmetic. The Complexity of Computational Problem Solving, pages 126{165, 1976.
    • [4] R. P. Brent and P. Zimmermann. Modern Computer Arithmetic. Cambridge University Press, 2011.
    • [5] C. Daramy, D. Defour, F. de Dinechin, and J. M. Muller. CR-LIBM: a correctly rounded elementary function library. In Optical Science and Technology, SPIE's 48th Annual Meeting, pages 458{464. International Society for Optics and Photonics, 2003.
    • [6] F. de Dinechin, D. Defour, and C. Lauter. Fast correct rounding of elementary functions in double precision using double-extended arithmetic. Research Report RR-5137, 2004.
    • [7] D. Defour and F. de Dinechin. Software carry-save: A case study for instruction-level parallelism. In V. E. Malyshkin, editor, Parallel Computing Technologies, volume 2763 of Lecture Notes in Computer Science, pages 207{214. Springer Berlin Heidelberg, 2003.
    • [11] M. Dukhan and R. Vuduc. Methods for high-throughput computation of elementary functions. In Parallel Processing and Applied Mathematics, pages 86{95. Springer, 2014.
    • [12] L. Fousse, G. Hanrot, V. Lefevre, P. Pelissier, and P. Zimmermann. MPFR: A multiple-precision binary oating-point library with correct rounding. ACM Transactions on Mathematical Software, 33(2):13:1{13:15, June 2007. http://mpfr.org.
    • [13] J. Harrison, T. Kubaska, S. Story, and P. T. P. Tang. The computation of transcendental functions on the IA-64 architecture. In Intel Technology Journal. Citeseer, 1999.
    • [14] Y. Hida, X. S. Li, and D. H. Bailey. Library for double-double and quad-double arithmetic. NERSC Division, Lawrence Berkeley National Laboratory, 2007. http: //crd-legacy.lbl.gov/~dhbailey/mpdist/.
    • [15] F. Johansson. Arb, version 2.4.0 or later (git repository). https://github.com/ fredrik-johansson/arb.
    • [16] F. Johansson. Arb: A C library for ball arithmetic. ACM Communications in Computer Algebra, 47(3/4):166{169, January 2014.
    • [17] F. Johansson. Evaluating parametric holonomic sequences using rectangular splitting. In Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, ISSAC `14, pages 256{263, New York, NY, USA, 2014. ACM.
    • [18] O. Kupriianova and C. Lauter. Metalibm: A mathematical functions code generator. In Hoon Hong and Chee Yap, editors, Mathematical Software { ICMS 2014, volume 8592 of Lecture Notes in Computer Science, pages 713{717. Springer Berlin Heidelberg, 2014.
    • [19] Y. Lei, Y. Dou, L. Shen, J. Zhou, and S. Guo. Special-purposed VLIW architecture for IEEE-754 quadruple precision elementary functions on FPGA. In 2011 IEEE 29th International Conference on Computer Design (ICCD), pages 219{225, Oct 2011.
    • [20] J. M. Muller. Elementary functions: algorithms and implementation. Springer Science & Business Media, 2006.
    • [21] M. J. Schulte and J. E. Stine. Approximating elementary functions with symmetric bipartite tables. IEEE Transactions on Computers, 48(8):842{847, 1999.
    • [22] D. M. Smith. E cient multiple-precision evaluation of elementary functions. Mathematics of Computation, 52:131{134, 1989.
    • [23] A. Steel. Reduce everything to multiplication. In Computing by the Numbers: Algorithms, Precision, and Complexity. 2006. http://www.mathematik.hu-berlin.de/ ~gaggle/EVENTS/2006/BRENT60/.
    • [24] J. E. Stine and M. J. Schulte. The symmetric table addition method for accurate function approximation. Journal of VLSI signal processing systems for signal, image and video technology, 21(2):167{177, 1999.
    • [25] The MPFR team. The MPFR library: algorithms and proofs. http://www.mpfr. org/algo.html. Retrieved 2013.
    • [26] A. Thall. Extended-precision oating-point numbers for GPU computation. In ACM SIGGRAPH 2006 Research posters, page 52. ACM, 2006.
    • [27] J. van der Hoeven, G. Lecerf, and G. Quintin. Modular SIMD arithmetic in Mathemagix. arXiv preprint arXiv:1407.3383, 2014.
  • No related research data.
  • No similar publications.

Share - Bookmark

Funded by projects

  • EC | ANTICS

Cite this article