The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
Publication:540337
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
numerical exampleshigh-performance computingfast polynomial arithmeticpolynomial system solvinginteroperability between C and Mapletriangular decomposition algorithms
Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Complexity and performance of numerical algorithms (65Y20) Packaged methods for numerical algorithms (65Y15) Numerical computation of roots of polynomial equations (65H04)
Related Items (8)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
This page was built for publication: The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}