R-universe search: gmp

antoinelucas64

gmp:Multiple Precision Arithmetic

Multiple Precision Arithmetic (big integers and rationals, prime number tests, matrix computation), "arithmetic without limitations" using the C library GMP (GNU Multiple Precision Arithmetic).

Maintained by Antoine Lucas. Last updated 7 months ago.

gmp cpp

94.3 match 7.69 score 530 scripts 317 dependents

r-forge

Rmpfr:Interface R to MPFR - Multiple Precision Floating-Point Reliable

Arithmetic (via S4 classes and methods) for arbitrary precision floating point numbers, including transcendental ("special") functions. To this end, the package interfaces to the 'LGPL' licensed 'MPFR' (Multiple Precision Floating-Point Reliable) Library which itself is based on the 'GMP' (GNU Multiple Precision) Library.

Maintained by Martin Maechler. Last updated 4 months ago.

mpfr4 gmp

35.4 match 11.30 score 316 scripts 141 dependents

jwood000

RcppAlgos:High Performance Tools for Combinatorics and Computational Mathematics

Provides optimized functions and flexible iterators implemented in C++ for solving problems in combinatorics and computational mathematics. Handles various combinatorial objects including combinations, permutations, integer partitions and compositions, Cartesian products, unordered Cartesian products, and partition of groups. Utilizes the RMatrix class from 'RcppParallel' for thread safety. The combination and permutation functions contain constraint parameters that allow for generation of all results of a vector meeting specific criteria (e.g. finding all combinations such that the sum is between two bounds). Capable of ranking/unranking combinatorial objects efficiently (e.g. retrieve only the nth lexicographical result) which sets up nicely for parallelization as well as random sampling. Gmp support permits exploration where the total number of results is large (e.g. comboSample(10000, 500, n = 4)). Additionally, there are several high performance number theoretic functions that are useful for problems common in computational mathematics. Some of these functions make use of the fast integer division library 'libdivide'. The primeSieve function is based on the segmented sieve of Eratosthenes implementation by Kim Walisch. It is also efficient for large numbers by using the cache friendly improvements originally developed by Tomás Oliveira. Finally, there is a prime counting function that implements Legendre's formula based on the work of Kim Walisch.

Maintained by Joseph Wood. Last updated 1 months ago.

combinations combinatorics factorization number-theory parallel permutation prime-factorizations primesieve gmp cpp

36.3 match 45 stars 10.04 score 153 scripts 12 dependents

symengine

symengine:Interface to the 'SymEngine' Library

Provides an R interface to 'SymEngine' <https://github.com/symengine/>, a standalone 'C++' library for fast symbolic manipulation. The package has functionalities for symbolic computation like calculating exact mathematical expressions, solving systems of linear equations and code generation.

Maintained by Jialin Ma. Last updated 1 years ago.

mpfr4 gmp cpp

33.0 match 26 stars 8.20 score 33 scripts 10 dependents

randy3k

arrangements:Fast Generators and Iterators for Permutations, Combinations, Integer Partitions and Compositions

Fast generators and iterators for permutations, combinations, integer partitions and compositions. The arrangements are in lexicographical order and generated iteratively in a memory efficient manner. It has been demonstrated that 'arrangements' outperforms most existing packages of similar kind. Benchmarks could be found at <https://randy3k.github.io/arrangements/articles/benchmark.html>.

Maintained by Randy Lai. Last updated 2 years ago.

gmp

33.0 match 52 stars 7.89 score 118 scripts 23 dependents

jkim82133

TDA:Statistical Tools for Topological Data Analysis

Tools for Topological Data Analysis. The package focuses on statistical analysis of persistent homology and density clustering. For that, this package provides an R interface for the efficient algorithms of the C++ libraries 'GUDHI' <https://project.inria.fr/gudhi/software/>, 'Dionysus' <https://www.mrzv.org/software/dionysus/>, and 'PHAT' <https://bitbucket.org/phat-code/phat/>. This package also implements methods from Fasy et al. (2014) <doi:10.1214/14-AOS1252> and Chazal et al. (2015) <doi:10.20382/jocg.v6i2a8> for analyzing the statistical significance of persistent homology features.

Maintained by Jisu Kim. Last updated 1 months ago.

gmp cpp

33.0 match 9 stars 7.18 score 204 scripts 5 dependents

stla

qspray:Multivariate Polynomials with Rational Coefficients

Symbolic calculation and evaluation of multivariate polynomials with rational coefficients. This package is strongly inspired by the 'spray' package. It provides a function to compute Gröbner bases (reference <doi:10.1007/978-3-319-16721-3>). It also includes some features for symmetric polynomials, such as the Hall inner product. The header file of the C++ code can be used by other packages. It provides the templated class 'Qspray' that can be used to represent and to deal with multivariate polynomials with another type of coefficients.

Maintained by Stéphane Laurent. Last updated 7 months ago.

gmp polynomials cpp

33.0 match 4 stars 6.89 score 152 scripts 5 dependents

cran

rcdd:Computational Geometry

R interface to (some of) cddlib (<https://github.com/cddlib/cddlib>). Converts back and forth between two representations of a convex polytope: as solution of a set of linear equalities and inequalities and as convex hull of set of points and rays. Also does linear programming and redundant generator elimination (for example, convex hull in n dimensions). All functions can use exact infinite-precision rational arithmetic.

Maintained by Charles J. Geyer. Last updated 1 years ago.

gmp

38.7 match 4.63 score 35 dependents

jaganmn

flint:Fast Library for Number Theory

An R interface to 'FLINT' <https://flintlib.org/>, a C library for number theory. 'FLINT' extends GNU 'MPFR' <https://www.mpfr.org/> and GNU 'MP' <https://gmplib.org/> with support for operations on standard rings (the integers, the integers modulo n, finite fields, the rational, p-adic, real, and complex numbers) as well as matrices and polynomials over rings. 'FLINT' implements midpoint-radius interval arithmetic, also known as ball arithmetic, in the real and complex numbers, enabling computation in arbitrary precision with rigorous propagation of rounding errors; see Johansson (2017) <doi:10.1109/TC.2017.2690633>. Finally, 'FLINT' provides ball arithmetic implementations of many special mathematical functions, with high coverage of reference works such as the NIST Digital Library of Mathematical Functions <https://dlmf.nist.gov/>. The R interface defines S4 classes, generic functions, and methods for representation and basic operations as well as plain R functions mirroring and vectorizing entry points in the C library.

Maintained by Mikael Jagan. Last updated 2 days ago.

flint mpfr4 gmp

33.0 match 6 stars 5.18 score 20 scripts

corels

corels:R Binding for the 'Certifiably Optimal RulE ListS (Corels)' Learner

The 'Certifiably Optimal RulE ListS (Corels)' learner by Angelino et al described in <doi:10.48550/arXiv.1704.01701> provides interpretable decision rules with an optimality guarantee, and is made available to R with this package. See the file 'AUTHORS' for a list of copyright holders and contributors.

Maintained by Dirk Eddelbuettel. Last updated 3 months ago.

gmp cpp

33.0 match 48 stars 5.10 score 13 scripts

stla

ratioOfQsprays:Fractions of Multivariate Polynomials with Rational Coefficients

Based on the 'qspray' package, this package introduces the new type 'ratioOfQsprays'. An object of type 'qspray' represents a multivariate polynomial with rational coefficients while an object of type 'ratioOfQsprays', defined by two 'qspray' objects, represents a fraction of two multivariate polynomials with rational coefficients. Arithmetic operations for these objects are available, and they always return irreducible fractions. Other features include: differentiation, evaluation, conversion to a function, and fine control of the way to print a 'ratioOfQsprays' object. The 'C++' library 'CGAL' is used to make the fractions irreducible.

Maintained by Stéphane Laurent. Last updated 7 months ago.

multivariate-polynomials polynomials rational-functions gmp cpp

33.0 match 4.73 score 20 scripts 2 dependents

stla

jack:Jack, Zonal, Schur, and Other Symmetric Polynomials

Schur polynomials appear in combinatorics and zonal polynomials appear in random matrix theory. They are particular cases of Jack polynomials. This package allows to compute these polynomials and other symmetric multivariate polynomials: flagged Schur polynomials, factorial Schur polynomials, t-Schur polynomials, Hall-Littlewood polynomials, Green polynomials, Macdonald polynomials, and modified Macdonald polynomials. In addition, it can compute the Kostka-Jack numbers, the Kostka-Foulkes polynomials, the Kostka-Macdonald polynomials, and the Hall polynomials. Mainly based on Demmel & Koev's paper (2006) <doi:10.1090/S0025-5718-05-01780-1> and Macdonald's book (1995) <doi:10.1093/oso/9780198534891.003.0001>.

Maintained by Stéphane Laurent. Last updated 7 months ago.

jack-polynomials schur-polynomials symmetric-polynomials zonal-polynomials gmp cpp

33.0 match 1 stars 4.71 score 41 scripts

jwood000

RcppBigIntAlgos:Factor Big Integers with the Parallel Quadratic Sieve

Features the multiple polynomial quadratic sieve (MPQS) algorithm for factoring large integers and a vectorized factoring function that returns the complete factorization of an integer. The MPQS is based off of the seminal work of Carl Pomerance (1984) <doi:10.1007/3-540-39757-4_17> along with the modification of multiple polynomials introduced by Peter Montgomery and J. Davis as outlined by Robert D. Silverman (1987) <doi:10.1090/S0025-5718-1987-0866119-8>. Utilizes the C library GMP (GNU Multiple Precision Arithmetic). For smaller integers, a simple Elliptic Curve algorithm is attempted followed by a constrained version of Pollard's rho algorithm. The Pollard's rho algorithm is the same algorithm used by the factorize function in the 'gmp' package.

Maintained by Joseph Wood. Last updated 9 months ago.

algorithm gmp integer-factorization mpqs prime-factorizations primes quadratic-sieve quadratic-sieve-algorithm cpp

37.5 match 13 stars 3.81 score 8 scripts

stla

symbolicQspray:Multivariate Polynomials with Symbolic Parameters in their Coefficients

Introduces the 'symbolicQspray' objects. Such an object represents a multivariate polynomial whose coefficients are fractions of multivariate polynomials with rational coefficients. The package allows arithmetic on such polynomials. It is based on the 'qspray' and 'ratioOfQsprays' packages. Some functions for 'qspray' polynomials have their counterpart for 'symbolicQspray' polynomials. A 'symbolicQspray' polynomial should not be seen as a polynomial on the field of fractions of rational polynomials, but should rather be seen as a polynomial with rational coefficients depending on some parameters, symbolically represented, with a dependence given by fractions of rational polynomials.

Maintained by Stéphane Laurent. Last updated 8 months ago.

multivariate-polynomials symbolic-computation gmp cpp

33.0 match 4.33 score 18 scripts 1 dependents

stla

resultant:Utilities for Multivariate Polynomials with Rational Coefficients

Computation of resultant, subresultants, greatest common divisor, integral division (aka division without remainder) of two multivariate polynomials with rational coefficients, Sturm-Habicht sequence and square-free factorization of a multivariate polynomial with rational coefficients. The computations are performed by the 'C++' library 'CGAL' (<https://www.cgal.org/>). Resultants have applications in polynomial systems solving, number theory, and algebraic geometry. The package also contains some functions computing the number of real roots of a univariate polynomial with rational coefficients, and a function computing the division with remainder of two univariate polynomials with rational coefficients.

Maintained by Stéphane Laurent. Last updated 8 months ago.

cgal multivariate-polynomials gmp cpp

33.0 match 4.23 score 42 scripts

stla

RationalMatrix:Exact Matrix Algebra for Rational Matrices

Provides functions to deal with matrix algebra for matrices with rational entries: determinant, rank, image and kernel, inverse, Cholesky decomposition. All computations are exact.

Maintained by Stéphane Laurent. Last updated 2 years ago.

eigen gmp rcpp cpp

33.0 match 4.03 score 12 scripts 6 dependents

prioritizr

prepr:Automatic Repair of Spatial Polygons

Automatically repair broken spatial polygons using constrained triangulation. The computational methodology is derived from Ledoux et al. (2014) <doi:10.1016/j.cageo.2014.01.009>.

Maintained by Jeffrey O Hanson. Last updated 3 months ago.

gis spatial gdal gmp cpp

33.0 match 6 stars 4.01 score 17 scripts

zhuxr11

hypergeo2:Generalized Hypergeometric Function with Tunable High Precision

Computation of generalized hypergeometric function with tunable high precision in a vectorized manner, with the floating-point datatypes from 'mpfr' or 'gmp' library. The computation is limited to real numbers.

Maintained by Xiurui Zhu. Last updated 5 months ago.

mpfr4 gmp cpp

33.5 match 3.65 score 3 scripts 1 dependents

stla

interpolation:Interpolation of Bivariate Functions

Provides two different methods, linear and nonlinear, to interpolate a bivariate function, scalar-valued or vector-valued. The interpolated data are not necessarily gridded. The algorithms are performed by the 'C++' library 'CGAL' (<https://www.cgal.org/>).

Maintained by Stéphane Laurent. Last updated 1 years ago.

cgal interpolation gmp cpp

33.0 match 2 stars 3.48 score 5 scripts 1 dependents

j-ll

GeoFIS:Spatial Data Processing for Decision Making

Methods for processing spatial data for decision-making. This package is an R implementation of methods provided by the open source software GeoFIS <https://www.geofis.org> (Leroux et al. 2018) <doi:10.3390/agriculture8060073>. The main functionalities are the management zone delineation (Pedroso et al. 2010) <doi:10.1016/j.compag.2009.10.007> and data aggregation (Mora-Herrera et al. 2020) <doi:10.1016/j.compag.2020.105624>.

Maintained by Jean-Luc Lablée. Last updated 3 months ago.

mpfr4 gmp cpp

33.0 match 3.30 score 8 scripts

stla

Apollonius:2D Apollonius Graphs

Computation of the Apollonius diagram of given 2D points and its dual the Apollonius graph, also known as the additively weighted Voronoï diagram, and which is a generalization of the classical Voronoï diagram. For references, see the bibliography in the CGAL documentation at <https://doc.cgal.org/latest/Apollonius_graph_2/citelist.html>.

Maintained by Stéphane Laurent. Last updated 1 years ago.

cgal computational-geometry rcpp voronoi-diagram gmp cpp

33.0 match 3 stars 3.18 score 5 scripts

hongyuy

sbrl:Scalable Bayesian Rule Lists Model

An efficient implementation of Scalable Bayesian Rule Lists Algorithm, a competitor algorithm for decision tree algorithms; see Hongyu Yang, Cynthia Rudin, Margo Seltzer (2017) <https://proceedings.mlr.press/v70/yang17h.html>. It builds from pre-mined association rules and have a logical structure identical to a decision list or one-sided decision tree. Fully optimized over rule lists, this algorithm strikes practical balance between accuracy, interpretability, and computational speed.

Maintained by Hongyu Yang. Last updated 11 months ago.

gsl gmp cpp

33.0 match 4 stars 2.11 score 16 scripts

whateverliu

FLSSS:Mining Rigs for Problems in the Subset Sum Family

Specialized solvers for combinatorial optimization problems in the Subset Sum family. The solvers differ from the mainstream in the options of (i) restricting subset size, (ii) bounding subset elements, (iii) mining real-value multisets with predefined subset sum errors, (iv) finding one or more subsets in limited time. A novel algorithm for mining the one-dimensional Subset Sum induced algorithms for the multi-Subset Sum and the multidimensional Subset Sum. The multi-threaded framework for the latter offers exact algorithms to the multidimensional Knapsack and the Generalized Assignment problems. Historical updates include (a) renewed implementation of the multi-Subset Sum, multidimensional Knapsack and Generalized Assignment solvers; (b) availability of bounding solution space in the multidimensional Subset Sum; (c) fundamental data structure and architectural changes for enhanced cache locality and better chance of SIMD vectorization; (d) option of mapping floating-point instance to compressed 64-bit integer instance with user-controlled precision loss, which could yield substantial speedup due to the dimension reduction and efficient compressed integer arithmetic via bit-manipulations; (e) distributed computing infrastructure for multidimensional subset sum; (f) arbitrary-precision zero-margin-of-error multidimensional Subset Sum accelerated by a simplified Bloom filter. The package contains a copy of xxHash from <https://github.com/Cyan4973/xxHash>. Package vignette (<doi:10.48550/arXiv.1612.04484>) detailed a few historical updates. Functions prefixed with 'aux' (auxiliary) are independent implementations of published algorithms for solving optimization problems less relevant to Subset Sum.

Maintained by Charlie Wusuo Liu. Last updated 2 months ago.

gmp cpp

33.0 match 1 stars 1.78 score 20 scripts

stla

gmpoly:Multivariate Polynomials with Rational Coefficients

Symbolic calculation (addition or multiplication) and evaluation of multivariate polynomials with rational coefficients.

Maintained by Stéphane Laurent. Last updated 3 years ago.

gmp multivariate-polynomials

11.0 match 2.85 score 14 scripts

rameshram96

plantphysioR:Fundamental Formulas for Plant Physiology

Functions tailored for scientific and student communities involved in plant science research. Functionalities encompass estimation chlorophyll content according to Arnon (1949) <doi:10.1104/pp.24.1.1>, determination water potential of Polyethylene glycol(PEG)6000 as in Michel and Kaufmann (1973) <doi:10.1104/pp.51.5.914> and functions related to estimation of yield related indices like Abiotic tolerance index as given by Moosavi et al.(2008)<doi:10.22059/JDESERT.2008.27115>, Geometric mean productivity (GMP) by Fernandez (1992) <ISBN:92-9058-081-X>, Golden Mean by Moradi et al.(2012)<doi:10.14207/ejsd.2012.v1n3p543>, HAM by Schneider et al.(1997)<doi:10.2135/cropsci1997.0011183X003700010007x>,MPI and TOL by Hossain etal., (1990)<doi:10.2135/cropsci1990.0011183X003000030030x>, RDI by Fischer et al. (1979)<doi:10.1071/AR9791001>,SSI by Fisher et al.(1978)<doi:10.1071/AR9780897>, STI by Fernandez (1993)<doi:10.22001/wvc.72511>,YSI by Bouslama & Schapaugh (1984)<doi:10.2135/cropsci1984.0011183X002400050026x>, Yield index by Gavuzzi et al.(1997)<doi:10.4141/P96-130>.

Maintained by Ramesh Ramasamy. Last updated 4 months ago.

5.6 match 3.40 score 2 scripts

mdbahadur

rhcoclust:Robust Hierarchical Co-Clustering to Identify Significant Co-Cluster

Here we performs robust hierarchical co-clustering between row and column entities of a data matrix in absence and presence of outlying observations. It can be used to explore important co-clusters consisting of important samples and their regulatory significant features. Please see Hasan, Badsha and Mollah (2020) <doi:10.1101/2020.05.13.094946>.

Maintained by Md. Bahadur Badsha. Last updated 2 years ago.

3.4 match 2.70 score 9 scripts

r-forge

DPQmpfr:DPQ (Density, Probability, Quantile) Distribution Computations using MPFR

An extension to the 'DPQ' package with computations for 'DPQ' (Density (pdf), Probability (cdf) and Quantile) functions, where the functions here partly use the 'Rmpfr' package and hence the underlying 'MPFR' and 'GMP' C libraries.

Maintained by Martin Maechler. Last updated 1 months ago.

0.5 match 3.04 score 1 scripts

kisungyou

Zseq:Integer Sequence Generator

Generates well-known integer sequences. 'gmp' package is adopted for computing with arbitrarily large numbers. Every function has hyperlink to its corresponding item in OEIS (The On-Line Encyclopedia of Integer Sequences) in the function help page. For interested readers, see Sloane and Plouffe (1995, ISBN:978-0125586306).

Maintained by Kisung You. Last updated 3 years ago.

0.5 match 2.62 score 42 scripts