The University of Southampton
University of Southampton Institutional Repository

Homotopy algorithms and properties of systems of polynomial equations

Homotopy algorithms and properties of systems of polynomial equations
Homotopy algorithms and properties of systems of polynomial equations
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.
simplicial algorithm
24-32
Mathematical Programming Society
Forster, Walter
fef01eda-bef4-47b3-892c-39236df17784
Forster, Walter
fef01eda-bef4-47b3-892c-39236df17784

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

Record type: Conference or Workshop Item (Paper)

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.

This record has no associated files available for download.

More information

Published date: 1997
Additional Information: Session: MO3-E-CO21
Venue - Dates: ISMP 97: International Symposium on Mathematical Programming, Lausanne, Switzerland, 1997-08-23 - 1997-08-28
Keywords: simplicial algorithm

Identifiers

Local EPrints ID: 29152
URI: http://eprints.soton.ac.uk/id/eprint/29152
PURE UUID: fb1321f4-47ab-4abc-a600-2d7106a9546b

Catalogue record

Date deposited: 07 Feb 2007
Last modified: 11 Dec 2021 15:12

Export record

Contributors

Author: Walter Forster

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×