Computational schemes for subresultant chains

DOI10.1007/978-3-030-85165-1_3OpenAlexW3194639962MaRDI QIDQ831961

Alexander Brandt, Mohammadali Asadi, Marc Moreno Maza

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-85165-1_3

zbMATH Keywords

resultantpolynomial system solvingmodular arithmeticGCDssubresultant chain

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Solving polynomial systems; resultants (13P15)

Related Items (1)

Subresultant chains using Bézout matrices

Uses Software

• gmp
• Maple
• Mathemagix
• NTL
• RegularChains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for computing triangular decomposition of polynomial systems
• Bezout matrices, subresultant polynomials and parameters
• An elementary approach to subresultants theory.
• On the complexity of the Lickteig-Roy subresultant algorithm
• Factoring multivariate polynomials with many factors and huge coefficients
• Optimizations of the subresultant algorithm
• Semi-algebraic complexity of quotients and sign determination of remainders
• Fast computation of continued fraction expansions.
• Modern Computer Algebra
• Algorithme de Bareiss, algorithme des sous-résultants
• Modular Multiplication Without Trial Division
• Big Prime Field FFT on Multi-core Processors
• On the parallelization of triangular decompositions
• Probabilistic algorithms for computing resultants

This page was built for publication: Computational schemes for subresultant chains