Skip Navigation

The Computer Journal 1977 20(1):84-85; doi:10.1093/comjnl/20.1.84
© 1977 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (7)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Akitt, J. W.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Function minimisation using the Nelder and Mead simplex method with limited arithmetic precision: the self regenerative simplex

J. W. Akitt *

School of Chemistry, University of Leeds, Leeds, UK

The behaviour of a curve fitting program is described which uses the Nelder-Mead simplex method to optimise the fit and which works with limited arithmetic precision. Apparent false minima are shown to be due to the creation of various simplex arrays which are regenerated unchanged by the logic of the process. A simple procedure is suggested for detecting the formation of such arrays and initiating restarting the search for the true minimum.


Received July 1975.

* School of Chemistry, University of Leeds, Leeds, LS2 9JT


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.