Dear all,
sorry if this is a trivial question.
I'm interested in details of how the simplex algorithm as implemented in ELEGANT works.
Is it absolutely standard i.e. can be looked up in any book, or are there perhaps some variations and ELEGANT uses one of them?
In the latter case, could you please point me to the relevant reference(s)?
Thanks a lot!
Cheers,
Slava
Details on Simplex Algorithm in ELEGANT
Moderators: cyao, michael_borland
-
michael_borland
- Posts: 1933
- Joined: 19 May 2008, 09:33
- Location: Argonne National Laboratory
- Contact:
Re: Details on Simplex Algorithm in ELEGANT
Slava,
It's pretty much what you'll find in Numerical Recipes, as far as I can recall. We also added the idea of restarting the simplex algorithm from the previous best result, which can help convergence. This was copied from MAD8.
The code is available for download (part of the SDDS package) if you want to look at the details.
--Michael
It's pretty much what you'll find in Numerical Recipes, as far as I can recall. We also added the idea of restarting the simplex algorithm from the previous best result, which can help convergence. This was copied from MAD8.
The code is available for download (part of the SDDS package) if you want to look at the details.
--Michael