<--- Back to Details
First PageDocument Content
Mathematics / Computer arithmetic / Software / Algebra / Paul Zimmermann / Division algorithm / GNU Multiple Precision Arithmetic Library / GNU MPFR / Rounding / Division / Integer / Remainder
Date: 2016-06-13 15:37:32
Mathematics
Computer arithmetic
Software
Algebra
Paul Zimmermann
Division algorithm
GNU Multiple Precision Arithmetic Library
GNU MPFR
Rounding
Division
Integer
Remainder

Short Division of Long Integers (joint work with David Harvey) Paul Zimmermann October 6, 2011

Add to Reading List

Source URL: caramba.loria.fr

Download Document from Source Website

File Size: 1,72 MB

Share Document on Facebook

Similar Documents

GNU MP The GNU Multiple Precision Arithmetic Library EditionDecemberby Torbj¨

GNU MP The GNU Multiple Precision Arithmetic Library EditionDecemberby Torbj¨

DocID: 1ubTr - View Document

MPFR: A Multiple-Precision Binary Floating-Point Library With Correct Rounding Laurent Fousse, Guillaume Hanrot, Vincent Lef`evre, Patrick P´elissier, Paul Zimmermann LORIA, 615 rue du jardin botanique, FVillers-

MPFR: A Multiple-Precision Binary Floating-Point Library With Correct Rounding Laurent Fousse, Guillaume Hanrot, Vincent Lef`evre, Patrick P´elissier, Paul Zimmermann LORIA, 615 rue du jardin botanique, FVillers-

DocID: 1rtij - View Document

Benchmark of an MPFR emulation of Binary128 arithmetic September 13, 2013 Abstract  are displayed in Table 2. The compiler options were

Benchmark of an MPFR emulation of Binary128 arithmetic September 13, 2013 Abstract are displayed in Table 2. The compiler options were

DocID: 1rpEh - View Document

Introduction to the GNU MPFR Library Vincent LEFÈVRE AriC, INRIA Grenoble – Rhône-Alpes / LIP, ENS-Lyon GdT AriC,

Introduction to the GNU MPFR Library Vincent LEFÈVRE AriC, INRIA Grenoble – Rhône-Alpes / LIP, ENS-Lyon GdT AriC,

DocID: 1rbcb - View Document

Generating a Minimal Interval Arithmetic Based on GNU MPFR (in the context of the search for hard-to-round cases) Vincent LEFÈVRE Arénaire, INRIA Grenoble – Rhône-Alpes / LIP, ENS-Lyon

Generating a Minimal Interval Arithmetic Based on GNU MPFR (in the context of the search for hard-to-round cases) Vincent LEFÈVRE Arénaire, INRIA Grenoble – Rhône-Alpes / LIP, ENS-Lyon

DocID: 1qtUE - View Document