gmp
GMP is a free library for arbitrary precision arithmetic, operating on signed integers, rational numbers, and floating point numbers. There is no practical limit to the precision except the ones implied by the available memory in the machine GMP runs on. GMP has a rich set of functions, and the functions have a regular interface. The main target applications for GMP are cryptography applications and research, Internet security applications, algebra systems, computational algebra research, etc. GMP is carefully designed to be as fast as possible, both for small operands and for huge operands. The speed is achieved by using fullwords as the basic arithmetic type, by using fast algorithms, with highly optimised assembly code for the most common inner loops for a lot of CPUs, and by a general emphasis on speed. The first GMP release was made in 1991. It is continually developed and maintained, with a new release about once a year. GMP is distributed under the GNU LGPL. This license makes the library free to use, share, and improve, and allows you to pass on the result. The license gives freedoms, but also sets firm restrictions on the use with non-free programs. GMP is part of the GNU project. For more information about the GNU project, please see the official GNU web site. GMP’s main target platforms are Unix-type systems, such as GNU/Linux, Solaris, HP-UX, Mac OS X/Darwin, BSD, AIX, etc. It also is known to work on Windows in both 32-bit and 64-bit mode.
Keywords for this software
References in zbMATH (referenced in 261 articles )
Showing results 1 to 20 of 261.
Sorted by year (- Alexander Raß: High Precision Particle Swarm Optimization Algorithm (HiPPSO) (2020) not zbMATH
- Brini, Andrea: Exterior powers of the adjoint representation and the Weyl ring of (E_8) (2020)
- Delanoue, Nicolas; Lhommeau, Mehdi; Lagrange, Sébastien: Nonlinear optimal control: a numerical scheme based on occupation measures and interval analysis (2020)
- Falcón, Raúl M.; Stones, Rebecca J.: Enumerating partial Latin rectangles (2020)
- Fernandez, Bastien: Computer-assisted proof of loss of ergodicity by symmetry breaking in expanding coupled maps (2020)
- Bijnens, Johan; Hermansson-Truedsson, Nils; Wang, Si: The order (p^8) mesonic chiral Lagrangian (2019)
- Boissonnat, Jean-Daniel; Maria, Clément: Computing persistent homology with various coefficient fields in a single pass (2019)
- Booker, Andrew R.: Cracking the problem with 33 (2019)
- Carbone, Maurizio; Iovieno, Michele: Application of the nonuniform fast Fourier transform to the direct numerical simulation of two-way coupled particle laden flows (2019)
- Covanov, Svyatoslav; Thomé, Emmanuel: Fast integer multiplication using generalized Fermat primes (2019)
- Harvey, David; van der Hoeven, Joris: Faster integer multiplication using plain vanilla FFT primes (2019)
- Jorgenson, Jay; Smajlović, Lejla; Then, Holger: The Hauptmodul at elliptic points of certain arithmetic groups (2019)
- Kiam Tan, Yong; Myreen, Magnus O.; Kumar, Ramana; Fox, Anthony; Owens, Scott; Norrish, Michael: The verified CakeML compiler backend (2019)
- Lourenco, Christopher; Escobedo, Adolfo R.; Moreno-Centeno, Erick; Davis, Timothy A.: Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work (2019)
- Ogita, Takeshi; Aishima, Kensuke: Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues (2019)
- Sanders, Peter; Mehlhorn, Kurt; Dietzfelbinger, Martin; Dementiev, Roman: Sequential and parallel algorithms and data structures. The basic toolbox (2019)
- Teşeleanu, George: Subliminal hash channels (2019)
- Then, Holger: An explicit evaluation of the hauptmoduli at elliptic points for certain arithmetic groups (2019)
- Weber, Tobias; Sager, Sebastian; Gleixner, Ambros: Solving quadratic programs to high precision using scaled iterative refinement (2019)
- Asadi, Mohammadali; Brandt, Alexander; Moir, Robert H. C.; Moreno Maza, Marc: Sparse polynomial arithmetic with the BPAS library (2018)