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!

References in zbMATH (referenced in 213 articles , 1 standard article )

Showing results 1 to 20 of 213.
Sorted by year (citations)

1 2 3 ... 9 10 11 next

  1. Lange, Marko; Rump, Siegfried M.: Verified inclusions for a nearest matrix of specified rank deficiency via a generalization of Wedin’s (\sin(\theta)) theorem (2021)
  2. Aleksandrov, P. A.; Elenin, G. G.: Testing a new conservative method for solving the Cauchy problem for Hamiltonian systems on test problems (2020)
  3. Arioli, Gianni; Koch, Hans: Traveling wave solutions for the FPU chain: a constructive approach (2020)
  4. Bertsimas, Dimitris; Sturt, Bradley: Computation of exact bootstrap confidence intervals: complexity and deterministic algorithms (2020)
  5. Brini, Andrea: Exterior powers of the adjoint representation and the Weyl ring of (E_8) (2020)
  6. Cirillo, Emiliano; Hormann, Kai; Sidon, Jean: Convergence rates of a Hermite generalization of Floater-Hormann interpolants (2020)
  7. Dahne, Joel; Salvy, Bruno: Computation of tight enclosures for Laplacian eigenvalues (2020)
  8. de Laat, David: Moment methods in energy minimization: new bounds for Riesz minimal energy problems (2020)
  9. Golmakani, A.; Koudjinan, C. E.; Luzzatto, S.; Pilarczyk, P.: Rigorous numerics for critical orbits in the quadratic family (2020)
  10. Iakymchuk, Roman; Barreda, Maria; Wiesenberger, Matthias; Aliaga, José I.; Quintana-Ortí, Enrique S.: Reproducibility strategies for parallel preconditioned conjugate gradient (2020)
  11. Jorba, Àngel; Jorba-Cuscó, Marc; Rosales, José J.: The vicinity of the Earth-Moon (L_1) point in the bicircular problem (2020)
  12. Lange, Marko; Rump, Siegfried M.: Faithfully rounded floating-point computations (2020)
  13. Mukunoki, Daichi; Ogita, Takeshi: Performance and energy consumption of accurate and mixed-precision linear algebra kernels on GPUs (2020)
  14. Orban, Dominique; Siqueira, Abel Soares: A regularization method for constrained nonlinear least squares (2020)
  15. Rump, Siegfried M.: On recurrences converging to the wrong limit in finite precision and some new examples (2020)
  16. Sharma, Janak Raj; Kumar, Deepak: On a reduced cost derivative-free higher-order numerical algorithm for nonlinear systems (2020)
  17. Arioli, Gianni; Koch, Hans: Some breathers and multi-breathers for FPU-type chains (2019)
  18. Arioli, Gianni; Koch, Hans: Non-radial solutions for some semilinear elliptic equations on the disk (2019)
  19. Artz, Johannes; Harlander, Robert V.; Lange, Fabian; Neumann, Tobias; Prausa, Mario: Results and techniques for higher order calculations within the gradient-flow formalism (2019)
  20. Baeza, Antonio; Bürger, Raimund; Mulet, Pep; Zorío, David: Central WENO schemes through a global average weight (2019)

1 2 3 ... 9 10 11 next