I am currently working on a proposal of the google summer of code, for the solver component. I already have some ideas, but I want to know if there is anything else that I should do. First I broke the problem down into four categories and I will use a different set of algorithms for each. If you know of other good algorithms that I am missing I would like to hear from you.
1 var Minimization: Golden Section, Brent 1 var Root Solver: Bisection, False position, and Brent-Dekker, Newton Secant and Stefferson N var Minimization: Conjugate Gradient, Broyden-Fletcher-Goldfarb-Shanno, Newton, Simulated Annealing, and Simplex N var Root Solver: Powell's Hybrid, Newton I also plan to have the user set the epsilon or precision, max number of iterations, upper and lower bounds for each independent variable, and where applicable, cells that contain the derivative or slope of the function. Is there anything I am missing here or do you think I might be making this too complex? Harry Bullen --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
