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 - Rhône-Alpes - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2015-06-18 06:12:50 Computer arithmetic Software Computing Mathematics GNU MPFR Rounding Interval arithmetic GNU Multiple Precision Arithmetic Library Maple Fixed-point arithmetic IEEE floating point TeX		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 Add to Reading List Source URL: www.vinc17.org Download Document from Source Website File Size: 164,45 KB Share Document on Facebook

	Y a-t-il des bugs dans GNU MPFR ? (proposition de stage M2) Lieu. INRIA/LORIA, Nancy, www.loria.fr. Encadrant. Paul Zimmermann, directeur de recherche, équipe Caramba, . Contexte. Le calcul flott DocID: 1tEaC - View Document
	Introduction to the GNU MPFR Library Vincent LEFÈVRE INRIA Grenoble – Rhône-Alpes / LIP, ENS-Lyon CNC’2, LORIA, DocID: 1sbxh - 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- 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 DocID: 1rpEh - View Document
	Hardest-to-Round Cases – Part 2 Vincent LEFÈVRE AriC, INRIA Grenoble – Rhône-Alpes / LIP, ENS-Lyon Journées TaMaDi, Lyon, DocID: 1rccC - View Document