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

1997

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.
.

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.

Full text not available from this repository.

## More information

Published date: 1997

Additional Information:
Session: MO3-E-CO21

Venue - Dates:
ISMP 97: International Symposium on Mathematical Programming, 1997-08-24 - 1997-08-29

Keywords:
simplicial algorithm

## Identifiers

Local EPrints ID: 29152

URI: https://eprints.soton.ac.uk/id/eprint/29152

PURE UUID: fb1321f4-47ab-4abc-a600-2d7106a9546b

## Catalogue record

Date deposited: 07 Feb 2007

Last modified: 18 Oct 2018 16:31

## Export record

## Contributors

Author:
Walter Forster

## University divisions

## 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