The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
DOI10.1016/J.JSC.2010.08.016zbMATH Open1217.65092OpenAlexW2091909596MaRDI QIDQ540337FDOQ540337
Authors: Xin Li, Marc Moreno Maza, Raqeeb Rasheed, É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
Recommendations
- Fast arithmetic for triangular sets: from theory to practice
- Fast arithmetic for triangular sets: from theory to practice
- POLY: a new polynomial data structure for Maple 17
- Sparse polynomial multiplication and division in Maple 14
- Algorithms for computing triangular decompositions of polynomial systems
numerical exampleshigh-performance computingpolynomial system solvingfast polynomial arithmeticinteroperability between C and Mapletriangular decomposition algorithms
Complexity and performance of numerical algorithms (65Y20) Packaged methods for numerical algorithms (65Y15) Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Numerical computation of roots of polynomial equations (65H04)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Comprehensive Triangular Decomposition
- Computing parametric geometric resolutions
- Efficient implementation of polynomial arithmetic in a multiple-level programming environment
- Fast arithmetic for triangular sets: from theory to practice
- Lifting techniques for triangular decompositions
- On the security of a practical identification scheme
- On the theories of triangular sets
- Optimizations of the subresultant algorithm
- The Magma algebra system. I: The user language
- The RegularChains library in Maple 10
- The truncated fourier transform and applications
Cited In (18)
- An application of regular chain theory to the study of limit cycles
- Solving bivariate systems using rational univariate representations
- Fast arithmetic for triangular sets: from theory to practice
- CUMODP
- Title not available (Why is that?)
- Title not available (Why is that?)
- modpn
- Separating linear forms and rational univariate representations of bivariate systems
- The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects
- Fermat benchmarks for rational expressionals in Maple
- Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
- The basic polynomial algebra subprograms
- The basic polynomial algebra subprograms
- Bivariate triangular decompositions in the presence of asymptotes
- The RegularChains library in Maple 10
- Basic polynomial algebra subprograms
- POLY: a new polynomial data structure for Maple 17
- Fast arithmetic for triangular sets: from theory to practice
Uses Software
This page was built for publication: The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540337)
