Expand description
Polynomial data structures and algorithms for oCAS.
Re-exports§
pub use dense::DenseUnivariatePolynomial;pub use groebner::GroebnerBasis;pub use groebner::buchberger;pub use groebner::f4;pub use matrix::Matrix;pub use matrix::MatrixError;pub use multivariate_gcd::bivariate_gcd;pub use multivariate_gcd::gcd_modular;pub use multivariate_gcd::lift_from_fp;pub use multivariate_gcd::reduce_mod;pub use rational::RationalPolynomial;pub use roots::RootInterval;pub use sparse::Grevlex;pub use sparse::Grlex;pub use sparse::Lex;pub use sparse::MonomialOrder;pub use sparse::SparseMultivariatePolynomial;pub use sparse::monomial_are_coprime;pub use sparse::monomial_divides;pub use sparse::monomial_lcm;
Modules§
- dense
- Dense univariate polynomial implementation.
- factor
- Polynomial factorization algorithms.
- gcd
- Polynomial GCD (greatest common divisor) algorithms.
- groebner
- Gröbner basis computation for multivariate polynomial ideals.
- matrix
- Matrix types and linear algebra over algebraic domains.
- multivariate_
gcd - Multivariate polynomial GCD.
- rational
- Rational polynomials: numerator / denominator pairs with GCD-based reduction.
- rational_
reconstruction - Rational reconstruction algorithms.
- resultant
- Polynomial resultant computation.
- roots
- Real root isolation and numerical root approximation.
- sparse
- Sparse multivariate polynomial implementation.