Subresultants as Initialization of the Buchberger Algorithm
Filed under:
TALK
Stephan Ritscher (University Munich), 25 November 2009, 11 a.m., RISC seminar room
Subresultants as Initialization of the Buchberger Algorithm
Gröbner bases are a powerful tool in computer algebra, yet very expensive to compute. The efficiency of the Buchberger algorithm greatly varies for different problem instances. Thus we will investigate whether an initialization can improve the performance.
The tool used is the multivariate subresultant as defined by Chardin, a generalization of the multivariate resultant and the univariate subresultant. An elementary introduction to this technique will be given and an idea will be presented, how the subresultant could help computing Gröbner bases, namely as a kind of initialization of the Buchberger Algorithm.