MPFR
The MPFR library is a C library for multiple-precision floating-point computations with correct rounding. MPFR has continuously been supported by the INRIA and the current main authors come from the Caramel and AriC project-teams at Loria (Nancy, France) and LIP (Lyon, France) respectively; see more on the credit page. MPFR is based on the GMP multiple-precision library. The main goal of MPFR is to provide a library for multiple-precision floating-point computation which is both efficient and has a well-defined semantics. It copies the good ideas from the ANSI/IEEE-754 standard for double-precision floating-point arithmetic (53-bit significand). MPFR is free. It is distributed under the GNU Lesser General Public License (GNU Lesser GPL), version 3 or later (2.1 or later for MPFR versions until 2.4.x). The library has been registered in France by the Agence de Protection des Programmes under the number IDDN FR 001 120020 00 R P 2000 000 10800, on 15 March 2000. This license guarantees your freedom to share and change MPFR, to make sure MPFR is free for all its users. Unlike the ordinary General Public License, the Lesser GPL enables developers of non-free programs to use MPFR in their programs. If you have written a new function for MPFR or improved an existing one, please share your work!
Keywords for this software
References in zbMATH (referenced in 110 articles , 1 standard article )
Showing results 1 to 20 of 110.
Sorted by year (- Bezanson, Jeff; Edelman, Alan; Karpinski, Stefan; Shah, Viral B.: Julia: a fresh approach to numerical computing (2017)
- Claus Fieker, William Hart, Tommy Hofmann, Fredrik Johansson: Nemo/Hecke: Computer Algebra and Number Theory Packages for the Julia Programming Language (2017) arXiv
- de Camargo, André Pierro; Mascarenhas, Walter F.: The stability of extended Floater-Hormann interpolants (2017)
- Suñé, Víctor: Computing the expected Markov reward rates with stationarity detection and relative error control (2017)
- Beliakov, Gleb; Matiyasevich, Yuri: A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic (2016)
- Brauße, Franz; Korovina, Margarita; Müller, Norbert: Using Taylor models in exact real arithmetic (2016)
- Brauße, Franz; Korovina, Margarita; Müller, Norbert Th.: Towards using exact real arithmetic for initial value problems (2016)
- Carrasco, Juan A.: Numerically stable methods for the computation of exit rates in Markov chains (2016)
- Filip, Silviu-Ioan: A robust and scalable implementation of the Parks-McClellan algorithm for designing FIR filters (2016)
- Joldes, Mioara; Muller, Jean-Michel; Popescu, Valentina; Tucker, Warwick: CAMPARY: cuda multiple precision arithmetic library and applications (2016)
- Muller, Jean-Michel: Elementary functions. Algorithms and implementation (2016)
- Petković, Miodrag S.; Sharma, Janak Raj: On some efficient derivative-free iterative methods with memory for solving systems of nonlinear equations (2016)
- Sharma, Janak Raj; Arora , Himani: Efficient derivative-free numerical methods for solving systems of nonlinear equations (2016)
- Sharma, Janak Raj; Arora, Himani: A simple yet efficient derivative free family of seventh order methods for systems of nonlinear equations (2016)
- Sharma, Janak Raj; Guha, Rangan K.: Simple yet efficient Newton-like method for systems of nonlinear equations (2016)
- Sousbie, Thierry; Colombi, Stéphane: ColDICE: A parallel Vlasov-Poisson solver using moving adaptive simplicial tessellation (2016)
- Walter F. Mascarenhas: Moore: Interval Arithmetic in Modern C++ (2016) arXiv
- Xiao, X.Y.; Yin, H.W.: Increasing the order of convergence for iterative methods to solve nonlinear systems (2016)
- Arioli, Gianni; Koch, Hans: Existence and stability of traveling pulse solutions of the FitzHugh-Nagumo equation (2015)
- Bantle, Markus; Funken, Stefan: Efficient and accurate implementation of $hp$-BEM for the Laplace operator in 2D (2015)