• About
  • Members
  • Seminar
  • Visitors
  • Publications
  • Conferences
  • Magma
  • Login
Computational Algebra Group
Computational Algebra Seminar
  • 2000-2004
  • 2005-2009
  • 2010-2014
  • 2015
  • 2016
  • 2017
  • 2018
  • 2024
  • 2025
  • Agnes Szanto
  • (University of Kent, UK)
  • Solving over-determined systems by the subresultant method
  • 3pm–4pm, Thursday 21st March, 2002
  • Carlaw 535
  • In the talk I introduce the subresultant method to solve over-determined multivariate polynomial systems over C. The main idea is to construct a linear system such that its solutions give either a rational representation of the solution set of the polynomial system or an approximation of it. I will describe several constructions for such linear systems, and sketch an argument why they are equivalent.

The Computational Algebra Group is a research group within the School of Mathematics and Statistics, University of Sydney.
Copyright © 2010-2025 Computational Algebra Group.