Implementation of homotopy algorithms
Forster, Walter (1997) Implementation of homotopy algorithms. In, Proceedings of ISMP 97: International Symposium on Mathematical Programming. ISMP 97: International Symposium on Mathematical Programming Philadelphia, USA, Mathematical Programming Society., 24-32.
Full text not available from this repository.
Herbert Scarf's constructive proof of the Brouwer fixed point theorem in 1967 started the new field of homotopy algorithms. Many such algorithms have now been published and many examples of complex nonlinear problems which have been solved by homotopy algorithms have been given in the literature. Nevertheless, the dissemination of knowledge about homotopy algorithms into the wider research community is progressing only slowly. The discussion in this session will try to highlight problems in computer-implementations, difficulties in applications, and why despite superior capabilities of homotopy algorithms we have not seen a faster and wider spread of these techniques.
|Item Type:||Book Section|
|Additional Information:||Session TH1-E-CO11|
|Subjects:||Q Science > QA Mathematics|
|Divisions:||University Structure - Pre August 2011 > School of Mathematics > Applied Mathematics
|Date Deposited:||10 Jan 2007|
|Last Modified:||27 Mar 2014 18:17|
|Publisher:||Mathematical Programming Society.|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)