The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}

DOI10.1016/j.jsc.2010.08.016zbMath1217.65092OpenAlexW2091909596MaRDI QIDQ540337

Xin Li, Raqeeb Rasheed, Marc Moreno Maza, Éric Schost

Publication date: 1 June 2011

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2010.08.016

zbMATH Keywords

numerical exampleshigh-performance computingfast polynomial arithmeticpolynomial system solvinginteroperability between C and Mapletriangular decomposition algorithms

Mathematics Subject Classification ID

Related Items (8)

Solving bivariate systems using rational univariate representations ⋮ Separating linear forms and rational univariate representations of bivariate systems ⋮ Bivariate triangular decompositions in the presence of asymptotes ⋮ Basic Polynomial Algebra Subprograms ⋮ modpn ⋮ Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one ⋮ AN APPLICATION OF REGULAR CHAIN THEORY TO THE STUDY OF LIMIT CYCLES ⋮ The basic polynomial algebra subprograms

Uses Software

• FGb
• Magma
• Maple
• NTL
• RegularChains
• CUMODP

Cites Work

• The Magma algebra system. I: The user language
• Computing parametric geometric resolutions
• On the theories of triangular sets
• Optimizations of the subresultant algorithm
• On the Security of a Practical Identification Scheme
• Comprehensive Triangular Decomposition
• The truncated fourier transform and applications
• Lifting techniques for triangular decompositions
• Efficient Implementation of Polynomial Arithmetic in a Multiple-Level Programming Environment
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}