GNU MPFR in the World

Note: To properly cite MPFR in a scientific publication, please cite the ACM TOMS paper and/or the library web page https://www.mpfr.org/. If your publication is related to a particular release of MPFR, for example if you report timings, please also indicate the release number for future reference.

Publications Citing MPFR

If you have published a scientific publication citing MPFR, and you want it to be mentioned here, please tell us.

This list does not include publications specifically on MPFR; such publications can be found on the MPFR algorithms page.

Books

• Modern Computer Arithmetic, Richard Brent and Paul Zimmermann, 2006-2010.
• Handbook of Floating-Point Arithmetic (first edition), Jean-Michel Muller, Nicolas Brisebarre, Florent de Dinechin, Claude-Pierre Jeannerod, Vincent Lefèvre, Guillaume Melquiond, Nathalie Revol, Damien Stehlé and Serge Torres, 2010.
• Handbook of Floating-Point Arithmetic (second edition), Jean-Michel Muller, Nicolas Brunie, Florent de Dinechin, Claude-Pierre Jeannerod, Mioara Joldes, Vincent Lefèvre, Guillaume Melquiond, Nathalie Revol and Serge Torres, 2018.

PhD Theses

• Jean-Guillaume Dumas. Algorithmes parallèles efficaces pour le calcul formel : algèbre linéaire creuse et extensions algébriques (Efficient parallel algorithm for computer algebra: sparce linear algebra and algebraic extensions), 2000.
• David Defour. Fonctions élémentaires : algorithmes et implémentations efficaces pour l'arrondi correct en double précision (Elementary functions: algorithms and efficient implementation for correct rounding for the double precision), 2003.
• Guillaume Melquiond. De l'arithmétique d'intervalles à la certification de programmes (From interval arithmetic to program verification), 2006.
• Laurent Fousse. Intégration numérique avec erreur bornée en précision arbitraire (Arbitrary precision numerical integration with bounded error), 2006.
• Nicolas Louvet. Algorithmes compensés en arithmétique flottante : précision, validation, performances (Compensated algorithms in floating point arithmetic: accuracy, validation, performances), 2007.
• Arnaud Fontaine. Classification d'ARN codants et d'ARN non-codants, 2009.
• Sylvain Chevillard. Évaluation efficace de fonctions numériques - Outils et exemples (Efficient evaluation of numerical functions - Tools and examples), 2009.
• Guillaume Revy. Implementation of binary floating-point arithmetic on embedded integer processors - Polynomial evaluation-based algorithms and certified code generation, 2009.
• Maria Pentcheva. Conversion CSG-BRep de scènes définies par des quadriques (Boundary evaluation of scenes defined by quadrics), 2010.
• Luis Peñaranda. Non-linear computational geometry for planar algebraic curves, 2010.
• Hong Diep Nguyen. Efficient algorithms for verified scientific computing: Numerical linear algebra using interval arithmetic, 2011.
• Bogdan Mihai Pasca. High-performance floating-point computing on reconfigurable circuits, 2011.
• Mioara Joldeş. Rigorous Polynomial Approximations and Applications, 2011.
• Marc Mezzarobba. Autour de l'évaluation numérique des fonctions D-finies (Around the Numerical Evaluation of D-Finite Functions), 2011.
• Christophe Mouilleron. Efficient computation with structured matrices and arithmetic expressions, 2011.
• Christophe Dutang. Étude des marchés d'assurance non-vie à l'aide d'équilibre de Nash et de modèle de risques avec dépendance, 2012.
• Séthy Montan. Sur la validation numérique des codes de calcul industriels (On the numerical verification of industrial codes), 2013.
• Mohammed Saïd Belaid. Résolution de contraintes sur les flottants dédiée à la vérification de programmes (Constraint solver over floating-point numbers designed for program verification), 2013.
• Yacine Bouzidi. Solving bivariate algebraic systems and topology of plane curves, 2014.
• Nicolas Brunie. Contributions to computer arithmetic and applications to embedded systems, 2014.
• Laurent Thévenoux. Synthèse de code avec compromis entre performance et précision en arithmétique flottante IEEE 754 (Code Synthesis to Optimize Accuracy and Speed in Floating-Point Arithmetic), 2014.
• Sébastien Valat. Contribution à l'amélioration des méthodes d'optimisation de la gestion de la mémoire dans le cadre du Calcul Haute Performance (Contribution to developement optimization methods for memory managment in high-performance computing), 2014.
• Philippe Théveny. Numerical Quality and High Performance In Interval Linear Algebra on Multi-Core Processors, 2014.
• Mohamed Amine Najahi. Synthesis of certified programs in fixed-point arithmetic, and its application to linear algebra basic blocks, 2014.
• Étienne Servais. Trajectory planning and control of collaborative systems: Application to trirotor UAVS, 2015.
• Enea Milio. Calcul des polynômes modulaires en dimension 2 (Computing modular polynomials in dimension 2), 2015.
• Olga Kupriianova. Towards a modern floating-point environment, 2015.
• Silviu-Ioan Filip. Robust tools for weighted Chebyshev approximation and applications to digital filter design, 2016.
• Niall Emmart. A study of high performance multiple precision arithmetic on graphics processing units, 2018.
• Andrea Bocco. A variable precision hardware acceleration for scientific computing, 2020.
• Nestor Demeure. Compromise between precision and performance in high-performance computing, 2021.
• Denis Merigoux. Proof-oriented domain-specific language design for high-assurance software, 2021.

Articles and Other Papers

• Paul Zimmermann. MPFR : vers un calcul flottant correct ?, Interstices, 2005.
• David H. Bailey. High-Precision Floating-Point Arithmetic in Scientific Computation, Computing in Science and Engineering, 2005.
• Florent de Dinechin, Alexey V. Ershov and Nicolas Gast. Towards the Post-Ultimate libm, 17th IEEE Symposium on Computer Arithmetic (ARITH), 2005.
• Vincent Lefèvre. New Results on the Distance Between a Segment and Z². Application to the Exact Rounding, 17th IEEE Symposium on Computer Arithmetic (ARITH), 2005.
• Andrej Bauer and Iztok Kavkler. Implementing Real Numbers With RZ, 4th International Conference on Computability and Complexity in Analysis (CCA 2007), 2008.
• Vincent Lefèvre, Damien Stehlé and Paul Zimmermann. Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format, Reliable Implementation of Real Number Algorithms: Theory and Practice, 2008.
• Christoph Quirin Lauter and Vincent Lefèvre. An Efficient Rounding Boundary Test for pow(x,y) in Double Precision, IEEE Transactions on Computers, 2008 (Volume 58, Issue 2, February 2009).
• Chee K. Yap and Jihun Yu. Foundations of Exact Rounding, 3rd Workshop on Algorithms and Computation (WALCOM), 2009.
• Fumihiro Chiba and Teruo Ushijima. Exponential decay of errors of a fundamental solution method applied to a reduced wave problem in the exterior region of a disc, Journal of Computational and Applied Mathematics, 2009.
• Fumihiro Chiba and Teruo Ushijima. Computation of the scattering amplitude for a scattering wave produced by a disc, Journal of Computational and Applied Mathematics, 2009.
• Kaveh R. Ghazi, Vincent Lefèvre, Philippe Théveny and Paul Zimmermann. Why and How to Use Arbitrary Precision, Computing in Science and Engineering, 2010.
• Vincent Lefèvre, Philippe Théveny, Florent de Dinechin, Claude-Pierre Jeannerod, Christophe Mouilleron, David Pfannholzer and Nathalie Revol. LEMA: towards a language for reliable arithmetic, PLMMS 2010. Published in ACM Communications in Computer Algebra, Volume 44, Issue 1/2 (link to article), 2010.
• Burçin Eröcal and William Stein. The Sage Project: Unifying Free Mathematical Software to Create a Viable Alternative to Magma, Maple, Mathematica and MATLAB, 3rd International Congress on Mathematical Software (ICMS), 2010.
• Paul Zimmermann. Reliable Computing with GNU MPFR, 3rd International Congress on Mathematical Software (ICMS), 2010.
• Marc Mörig. Deferring Dag Construction by Storing Sums of Floats Speeds-Up Exact Decision Computations Based on Expression Dags, 3rd International Congress on Mathematical Software (ICMS), 2010.
• Jihun Yu, Chee Yap, Zilin Du, Sylvain Pion and Hervé Brönnimann. The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra, 3rd International Congress on Mathematical Software (ICMS), 2010.
• Grégoire Lecerf. Mathemagix: Towards Large Scale Programming for Symbolic and Certified Numeric Computations, 3rd International Congress on Mathematical Software (ICMS), 2010.
• Guillaume Hanrot, Bruno Martin and Gérald Tenenbaum. Constantes de Turán-Kubilius friables: une étude numérique, Experiment. Math., Volume 19, Issue 3, pages 345-361, 2010.
• Claude-Pierre Jeannerod, Hervé Knochel, Christophe Monat and Guillaume Revy. Computing Floating-Point Square Roots via Bivariate Polynomial Evaluation, IEEE Transactions on Computers, 2010 (Volume 60, Issue 2, February 2011).
• Peter Kornerup, Vincent Lefèvre, Nicolas Louvet and Jean-Michel Muller. On the Computation of Correctly-Rounded Sums, 19th IEEE Symposium on Computer Arithmetic (ARITH), 2009. On the Computation of Correctly Rounded Sums, IEEE Transactions on Computers, 2011 (Volume 61, Issue 3, March 2012).
• Hong Diep Nguyen and Nathalie Revol. Solving and Certifying the Solution of a Linear System, Reliable Computing, 2011.
• Florent de Dinechin, Jean-Michel Muller, Bogdan Pasca and Alexandru Plesco. An FPGA architecture for solving the Table Maker's Dilemma, IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP), 2011.
• Eric Wajnberg. Multi-objective behavioural mechanisms are adopted by foraging animals to achieve several optimality goals simultaneously, Journal of Animal Ecology, Volume 81, Issue 2, pages 503-511, 2012.
• David H. Bailey, Roberto Barrio and Jonathan M. Borwein. High-precision computation: Mathematical physics and dynamics [preprint], Applied Mathematics and Computation, Volume 218, 2012.
• Tomonori Kouya. A Highly Efficient Implementation of Multiple Precision Sparse Matrix-Vector Multiplication and its Application to Product-Type Krylov Subspace Methods, International Journal of Numerical Methods and Applications, Volume 7, Issue 2, pages 107-119, 2012.
• Guillaume Melquiond. Floating-point arithmetic in the Coq system, Information and Computation, Volume 216, pages 14-23, 2012.
• Stef Graillat and Valérie Ménissier-Morain. Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic, Information and Computation, Volume 216, pages 57-71, 2012.
• Miquel Grau-Sánchez and Miquel Noguera. A technique to choose the most efficient method between secant method and some variants, Applied Mathematics and Computation, Volume 218, Issue 11, pages 6415-6426, 2012.
• Walter Krämer. Multiple/arbitrary precision interval computations in C-XSC, Computing, Volume 94, Issue 2-4, pages 229-241, 2012.
• Joshua L. Willis. Acceleration of generalized hypergeometric functions through precise remainder asymptotics, Numerical Algorithms, Volume 59, Issue 3, pages 447-485, 2012.
• Christoph Spandl. Computational complexity of iterated maps on the interval, Mathematics and Computers in Simulation, Volume 82, Issue 8, pages 1459-1477, 2012.
• Joris van der Hoeven and Grégoire Lecerf. On the complexity of multivariate blockwise polynomial multiplication, ISSAC'12, 2012.
• Alberto Abad, Roberto Barrio, Fernando Blesa and Marcos Rodríguez. Algorithm 924: TIDES, a Taylor series Integrator for Differential EquationS, ACM Transactions on Mathematical Software, Volume 39, Issue 1, Article 5, 2012.
• Gregory Nuel and Jean-Guillaume Dumas. Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source, Theoretical Computer Science, Volume 479, pages 22-42, 2013.
• Pavlos Pavlidis, Daniel Zivkovic, Alexandros Stamatakis and Nikolaos Alachiotis. SweeD: Likelihood-based detection of selective sweeps in thousands of genomes, Molecular Biology and Evolution, 2013.
• Fredrik Johansson. Rigorous high-precision computation of the Hurwitz zeta function and its derivatives, 2013. Published in Numerical Algorithms, 2014.
• Jon Wilkening and Vishal Vasan. Comparison of five methods of computing the Dirichlet-Neumann operator for the water wave problem, 2014. Published in Contemporary Mathematics, Volume 635, 2015.
• Freddie D. Witherden and Peter E. Vincent. On the Identification of Symmetric Quadrature Rules for Finite Element Methods, 2014.
• Neil Toronto and Jay McCarthy. Practically Accurate Floating-Point Math, CiSE, 2014.
• Fredrik Johansson. Efficient implementation of elementary functions in the medium-precision range, 2014.
• R.H. Moretti, M.F. Borges, J.M. Machado and C. Brandão. Entropy effect in quantum computing and information: An open-source environment simulation, International Journal of Pure and Applied Mathematics, 2014.
• Karthik S. Gurumoorthy and Anand Rangarajan. A new variational principle for the Euclidean distance function: Linear approach to the non-linear eikonal problem, 2015.
• David H. Bailey and Jonathan M. Borwein. High-precision arithmetic in mathematical physics, Mathematics, Volume 3, pages 337-367, 2015.
• Pavel Panchekha, Alex Sanchez-Stern, James R. Wilcox and Zachary Tatlock. Automatically Improving the Accuracy of Floating-Point Expressions, Programming Language Design and Implementation (PLDI) 2015.
• Anastasia Volkova, Thibault Hilaire and Christoph Lauter. Reliable Evaluation of the Worst-Case Peak Gain Matrix in Multiple Precision, 22nd IEEE Symposium on Computer Arithmetic (ARITH), 2015.
• Ryan McCleeary, Martin Brain and Aaron Stump. A lazy approach to adaptive exact real arithmetic using floating-point operations, ACM Communications in Computer Algebra, 2015.
• A. Abad, R. Barrio, M. Marco-Buzunariz and M. Rodríguez. Automatic implementation of the numerical Taylor series method: A Mathematica and Sage approach, Applied Mathematics and Computation, Volume 268, 2015.
• Hiroshi Daisaka, Naohito Nakasato, Tadashi Ishikawa and Fukuko Yuasa. Application of GRAPE9-MPX for High Precision Calculation in Particle Physics and Performance Results, Procedia Computer Science, Volume 51 (ICCS 2015), pages 1323-1332, 2015.
• Samuel Leweke and Eric von Lieres. Fast arbitrary order moments and arbitrary precision solution of the general rate model of column liquid chromatography with linear isotherm, Computers & Chemical Engineering, 2016.
• Charles F. F. Karney. Sampling exactly from the normal distribution, published in ACM Transactions on Mathematical Software, Volume 42, Issue 1, Article 3, 2016.
• Bruno Lévy. Robustness and efficiency of geometric programs: The Predicate Construction Kit (PCK), Computer-Aided Design, Volume 72, 2016.
• Gabriel Caffarena and Daniel Menard. Quantization Noise Power Estimation for Floating-Point DSP Circuits, IEEE Transactions on Circuits and Systems II: Express Briefs, Volume 63, Issue 6, 2016.
• David H. Bailey and Jonathan M. Borwein. Computer discovery and analysis of large Poisson polynomials (preprint), 2016.
• Fredrik Johansson. Computing hypergeometric functions rigorously, 2016, published in ACM Transactions on Mathematical Software, Volume 45, Issue 3, Article 30, 2019.
• Martin Norling, Oskar E. Karlsson-Lindsjö, Hadrien Gourlé and Juliette Hayer. MetLab: An In Silico Experimental Design, Simulation and Analysis Tool for Viral Metagenomics Studies, PLOS ONE, 2016.
• David H. Bailey. A thread-safe arbitrary precision package (full documentation), 2016.
• Laurent Thévenoux, Philippe Langlois and Matthieu Martel. Automatic source-to-source error compensation of floating-point programs: code synthesis to optimize accuracy and time, Concurrency and Computation: Practice and Experience, 2016.
• David de Laat. Moment methods in energy minimization: New bounds for Riesz minimal energy problems, 2016.
• Fredrik Johansson. Arb: Efficient Arbitrary-Precision Midpoint-Radius Interval Arithmetic, 2016.
• Walter F. Mascarenhas. Moore: Interval Arithmetic in Modern C++, 2016.
• Stef Graillat, Clothilde Jeangoudoux and Christoph Lauter. MPDI: A Decimal Multiple-Precision Interval Arithmetic Library, Reliable Computing, 2017.
• Víctor Suñé. Computing the Expected Markov Reward Rates with Stationarity Detection and Relative Error Control, Methodology and Computing in Applied Probability, Volume 19, Issue 2, 2017.
• Dariusz W. Brzeziński. Comparison of Fractional Order Derivatives Computational Accuracy - Right Hand vs Left Hand Definition, Applied Mathematics and Nonlinear Sciences, Volume 2, Issue 1, 2017.
• Yves Bertot, Laurence Rideau and Laurent Théry. Distant decimals of π: Formal proofs of some algorithms computing them and guarantees of exact computation, 2017.
• Joachim von zur Gathen and Daniel Loebenberger. Why One Cannot Estimate the Entropy of English by Sampling, Journal of Quantitative Linguistics, 2017.
• Günther Schindler, Manfred Mücke and Holger Fröning. Linking Application Description with Efficient SIMD Code Generation for Low-Precision Signed-Integer GEMM, Euro-Par 2017, Lecture Notes in Computer Science, Volume 10659. Version on Semantic Scholar.
• Emiliano Cirillo and Kai Hormann. An iterative approach to barycentric rational Hermite interpolation, Numerische Mathematik, 2018.
• Pietro Donà and Giorgio Sarno. Numerical methods for EPRL spin foam transition amplitudes and Lorentzian recouping theory, 2018.
• Luca Donati and Bettina G. Keller. Girsanov reweighting for metadynamics simulations, The Journal of Chemical Physics, Volume 149, Issue 7, 2018.
• Florent Bréhard, Nicolas Brisebarre and Mioara Joldes. Validated and numerically efficient Chebyshev spectral methods for linear ordinary differential equations, ACM Transactions on Mathematical Software, 2018.
• Alex Sanchez-Stern, Pavel Panchekha, Sorin Lerner and Zachary Tatlock. Finding Root Causes of Floating Point Error, 2018. Published in Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2018).
• Hugues De Lassus Saint-Geniès, Nicolas Brunie and Guillaume Revy. Meta-implementation of vectorized logarithm function in binary floating-point arithmetic, 29th IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP), 2018.
• George Tokarsky, Jacob Garber, Boyan Marinov and Kenneth Moore. One Hundred and Twelve Point Three Degree Theorem, 2018.
• Ugur G. Abdulla and Roby Poteau. Identification of Parameters in Systems Biology, Mathematical Biosciences, 2018.
• Javier Gómez-Serrano. Computer-assisted proofs in PDE: a survey, 2018.
• Simon A. Louis, Tim R. Marchant and Noel F. Smyth. 2-D solitary waves in thermal media with nonsymmetric boundary conditions, Studies in Applied Mathematics, 2018.
• Debasmita Lohar, Eva Darulova, Sylvie Putot and Eric Goubault. Discrete Choice in the Presence of Numerical Uncertainties, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Volume 37, Issue 11, 2018.
• Greger Torgrimsson. Perturbative methods for assisted nonperturbative pair production, 2018.
• Xin Yi, Liqian Chen, Xiaoguang Mao and Tao Ji. Efficient automated repair of high floating-point errors in numerical libraries, Proceedings of the ACM on Programming Languages, 2019.
• Fredrik Johansson. Faster arbitrary-precision dot product and matrix multiplication, 2019.
• Nicolas Fabiano, Jean-Michel Muller and Joris Picot. Algorithms for triple-word arithmetic, 2019. Published in IEEE Transactions on Computers.
• Tiago T. Jost, Andrea Bocco, Yves Durand, Christian Fabre, Florent de Dinechin and Albert Cohen. Variable Precision Floating-Point RISC-V Coprocessor Evaluation using Lightweight Software and Compiler Support, 3rd Workshop on Computer Architecture Research with RISC-V (CARRV 2019).
• Naoki Shibata and Francesco Petrogalli. SLEEF: A Portable Vectorized Library of C Standard Mathematical Functions, 2019. Published in IEEE Transactions on Parallel and Distributed Systems, Volume 31, Issue 6, 2020.
• David H. Bailey. A catalogue of mathematical formulas involving π, with analysis, 2020.
• Sangeeta Chowdhary, Jay P. Lim and Santosh Nagarakatte. Debugging and Detecting Numerical Errors in Computation with Posits, Programming Language Design and Implementation (PLDI) 2020.
• Jay P. Lim, Mridul Aanjaneya, John Gustafson and Santosh Nagarakatte. A Novel Approach to Generate Correctly Rounded Math Libraries for New Floating Point Representations, 2020.
• Benjamin Sherman, Jesse Michel and Michael Carbin. λₛ: computable semantics for differentiable programming with higher-order functions and datatypes, Proceedings of the ACM on Programming Languages (POPL), 2021.
• Jay P. Lim and Santosh Nagarakatte. RLIBM-32: High Performance Correctly Rounded Math Libraries for 32-bit Floating Point Representations, 2021.
• James Paul Turner and Thomas Nowotny. Arpra: An Arbitrary Precision Range Analysis Library, Frontiers in Neuroinformatics, 2021.
• Jiangwei Hao, Jinchen Xu, Shaozhong Guo and YuanYuan Xia. Design of variable precision transcendental function automatic generator, The Journal of Supercomputing, 2021.
• Thomas Plantard, Arnaud Sipasseuth, Willy Susilo and Vincent Zucca. Tight Bound on NewHope Failure Probability, IEEE Transactions on Emerging Topics in Computing, 2022 (older version on Cryptology ePrint Archive).
• Jay P. Lim and Santosh Nagarakatte. One Polynomial Approximation to Produce Correctly Rounded Results of an Elementary Function for Multiple Representations and Rounding Modes, Proceedings of the ACM on Programming Languages, 2022.
• Marco Cè, Tim Harris, Ardit Krasniqi, Harvey B. Meyer and Csaba Török. Photon emissivity of the quark-gluon plasma: a lattice QCD analysis of the transverse channel, 2022.
• Peter Dinda, Nick Wanninger, Jiacheng Ma, Alex Bernat, Charles Bernat, Souradip Ghosh, Christopher Kraemer and Yehya Elmasry. FPVM: Towards a Floating Point Virtual Machine, Proceedings of the 31st International Symposium on High-Performance Parallel and Distributed Computing (HPDC), 2022. Video of the talk.
• Deevashwer Rathee, Anwesh Bhattacharya, Rahul Sharma, Divya Gupta, Nishanth Chandran and Aseem Rastogi. SecFloat: Accurate Floating-Point meets Secure 2-Party Computation, 43rd IEEE Symposium on Security and Privacy (SP), 2022 (older version on Cryptology ePrint Archive).
• Alexei Sibidanov, Paul Zimmermann and Stéphane Glondu. The CORE-MATH Project, 29th IEEE Symposium on Computer Arithmetic (ARITH), 2022.
• Alexander Rothkopf. Bayesian inference of real-time dynamics from lattice QCD, Frontiers in Physics, 2022 (older arXiv version).
• David H. Bailey. Large Poisson polynomials: Computation, results and analysis, 2023. Talk at FPTalks 2023 workshop.
• Oliver Flatt and Pavel Panchekha. Making Interval Arithmetic Robust to Overflow, 30th IEEE Symposium on Computer Arithmetic (ARITH), 2023.
• Tom Hubrecht, Claude-Pierre Jeannerod and Paul Zimmermann. Towards a correctly-rounded and fast power function in double precision, 30th IEEE Symposium on Computer Arithmetic (ARITH), 2023.
• Orégane Desrentes, Benoît Dupont de Dinechin and Florent de Dinechin. Exact Fused Dot-Product Add Operators, 30th IEEE Symposium on Computer Arithmetic (ARITH), 2023.
• Youssef Fakhreddine and Guillaume Revy. Using loop transformations for precision tuning in iterative programs, 30th IEEE Symposium on Computer Arithmetic (ARITH), 2023.
• Janez Komelj. The Bivariate Normal Integral via Owen's T Function as a Modified Euler's Arctangent Series, 2023. Published in American Journal of Computational Mathematics.
• Anton Rydahl, Joseph Huber, Ethan Luis Mcdonough and Johannes Doerfert. Precision and Performance Analysis of C Standard Math Library Functions on GPUs, Proceedings of the SC '23 Workshops of The International Conference on High Performance Computing, Network, Storage, and Analysis, 2023.
• Ian Briggs, Yash Lad and Pavel Panchekha. Implementation and Synthesis of Math Library Functions, Proceedings of the ACM on Programming Languages, 2024.

Other Information About MPFR

Note: This section does not contain links to MPFR interfaces and to software using MPFR as they are already on the MPFR home page.

• GNU MPFR on Wikipedia.
• In January 2009, using MPFR, Keith Briggs found a new worst approximable pair (new record) in the problem of constructing an explicit pair of irrationals with sup-norm simultaneous approximation constant as large as possible.
• In July 2010, J. Buethe, J. Franke, A. Jost and T. Kleinjung found that the number of primes below 10²⁴ is 18435599767349200867866, using MPFR amongst various libraries.
• In 2011, with a new algorithm implemented in FLINT, which uses among others MPFR, Fredrik Johansson was able to compute p(10¹⁹), the number of partitions of 10¹⁹: slides.
  And in 2014, Fredrik Johansson computed p(10²⁰).

Back to the MPFR page.