Homotopy algorithms and properties of systems of polynomial equations


Forster, Walter (1997) Homotopy algorithms and properties of systems of polynomial equations. In, Proceedings of ISMP 97: International Symposium on Mathematical Programming. ISMP 97: International Symposium on Mathematical Programming Philadelphia, USA, Mathematical Programming Society, 24-32.

Download

Full text not available from this repository.

Description/Abstract

Homotopy algorithms combine beautiful mathematics with the capability to solve complicated nonlinear systems. Developed over the last 30 years, these algorithms have shown to be capable of solving problems where other algorithms fail. The algorithm given by Kuhn for a polynomial in one variable finds all the roots of a polynomial of degree n . A problem encountered in the convergence proof for the case of multiple roots was resolved by W.Forster in 1992 by using material from Nielsen fixed point theory. This then opened the way for the determinination of the number of solution classes for systems of polynomial equations in more than one variable. In the talk the number of solution classes for systems of polynomial equations will be discussed. We will also discuss the influence this has on the solution of the Kuhn-Tucker equations by homotopy methods.

Item Type: Book Section
Additional Information: Session: MO3-E-CO21
Related URLs:
Keywords: simplicial algorithm
Subjects: Q Science > QA Mathematics
Divisions: University Structure - Pre August 2011 > School of Mathematics > Applied Mathematics
ePrint ID: 29152
Date Deposited: 07 Feb 2007
Last Modified: 27 Mar 2014 18:17
Publisher: Mathematical Programming Society
URI: http://eprints.soton.ac.uk/id/eprint/29152

Actions (login required)

View Item View Item