Probabilistic algorithms for computing resultants

DOI10.1145/1073884.1073919zbMATH Open1360.68946OpenAlexW2039221798MaRDI QIDQ5262771FDOQ5262771

Authors: Michael Monagan 

Publication date: 16 July 2015

Published in: Proceedings of the 2005 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.5440

Recommendations

• On computing the resultant of generic bivariate polynomials
• Fast computation of generic bivariate resultants
• Multipolynomial resultant algorithms
• Optimizations of the subresultant algorithm
• Improved algorithms for computing determinants and resultants

zbMATH Keywords

probabilistic algorithmsSylvester's resultantmodular algorithmspolynomial resultants

Mathematics Subject Classification ID

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

Cited In (10)

• Multipolynomial resultant algorithms
• Space saving calculation of symbolic resultants
• Computational schemes for subresultant chains
• Fast norm computation in smooth-degree abelian number fields
• Linear recurring sequences for computing the resultant of multivariate polynomials
• Improved algorithms for computing determinants and resultants
• Title not available (Why is that?)
• A Modular Algorithm for Computing the Intersection of a One-Dimensional Quasi-Component and a Hypersurface
• Title not available (Why is that?)
• Parallelization of triangular decompositions: techniques and implementation

Uses Software

• Maple

This page was built for publication: Probabilistic algorithms for computing resultants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262771)