GNU MPC is a C library for the arithmetic of complex numbers with arbitrarily high precision and correct rounding of the result. It extends the principles of the IEEE-754 standard for fixed precision real floating point numbers to complex numbers, providing well-defined semantics for every operation. At the same time, speed of operation at high precision is a major design goal. The library is built upon and follows the same principles as GNU MPFR. It is distributed under the GNU Lesser General Public License, either version 3 of the licence, or (at your option) any later version.

References in zbMATH (referenced in 14 articles )

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

  1. Brini, Andrea: Exterior powers of the adjoint representation and the Weyl ring of (E_8) (2020)
  2. Johansson, Fredrik: Computing hypergeometric functions rigorously (2019)
  3. Fernández, Francisco M.; Garcia, Javier: Highly accurate calculation of the resonances in the Stark effect in hydrogen (2018)
  4. Labrande, Hugo: Computing Jacobi’s theta in quasi-linear time (2018)
  5. Chen, Hongbin; Hussong, Charles; Kaplan, Jared; Li, Daliang: A numerical approach to Virasoro blocks and the information paradox (2017)
  6. Bangay, Shaun; Beliakov, Gleb: On the fast Lanczos method for computation of eigenvalues of Hankel matrices using multiprecision arithmetics. (2016)
  7. Bantle, Markus; Funken, Stefan: Efficient and accurate implementation of (hp)-BEM for the Laplace operator in 2D (2015)
  8. Dupont, Régis: Fast evaluation of modular functions using Newton iterations and the AGM (2011)
  9. Neher, Markus: Complex inclusion functions in the CoStLy C++ class library (2010)
  10. Enge, Andreas: The complexity of class polynomial computation via floating point approximations (2009)
  11. Enge, Andreas: Computing modular polynomials in quasi-linear time (2009)
  12. Morain, F.: Implementing the asymptotically fast version of the elliptic curve primality proving algorithm (2007)
  13. Enge, Andreas; Schertz, Reinhard: Constructing elliptic curves over finite fields using double eta-quotients (2004)
  14. Enge, Andreas; Morain, François: Fast decomposition of polynomials with known Galois group (2003)

Further publications can be found at: