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

DOI10.1016/J.JSC.2010.08.016MaRDI QIDQ540337zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

numerical exampleshigh-performance computingpolynomial system solvingfast polynomial arithmeticinteroperability between C and Mapletriangular decomposition algorithms

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 1263403 (Why is no real title available?)
• scientific article; zbMATH DE number 517393 (Why is no real title available?)
• scientific article; zbMATH DE number 1057759 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 5041296 (Why is no real title available?)
• modpn
• Separating linear forms and rational univariate representations of bivariate systems
• scientific article; zbMATH DE number 1860708 (Why is no real title available?)
• The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects
• Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
• Fermat benchmarks for rational expressionals in Maple
• The basic polynomial algebra subprograms
• The basic polynomial algebra subprograms
• Bivariate triangular decompositions in the presence of asymptotes
• The RegularChains library in Maple 10
• POLY: a new polynomial data structure for Maple 17
• Basic polynomial algebra subprograms
• Fast arithmetic for triangular sets: from theory to practice

Describes a project that uses

Uses Software

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

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)