Science Fair Project Encyclopedia
Downhill simplex
Downhill simplex is a numerical method for solving many-dimensional problems. It belongs to the more general class of search algorithms.
An example can be found in Numerical Recipes in C, Press et al.
Last updated: 06-23-2005 02:36:14
10-26-2009 08:16:03
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details


