| commit | df8cdd72f63e269140e193017ba52b644db5fbe0 | |
| author | Robert Dodier <robert_dodier@users.sourceforge.net> | |
| Thu, 28 Jul 2022 16:11:36 +0000 (28 09:11 -0700) | ||
| committer | Robert Dodier <robert_dodier@users.sourceforge.net> | |
| Thu, 28 Jul 2022 16:56:41 +0000 (28 09:56 -0700) | ||
| tree | 109378651d7d0390af176c39f9c945ea50fb18da | treesnapshot (tar.gz zip) |
| parent | 5660522424affddaa96630d4d70f80330362db5a | commitdiff |
Commit new share package nelder_mead: Nelder-Mead algorithm for minimization without derivatives.
Common Lisp implementation by Mario S. Mommer, Maxima interface by Andrej Vodopivec.
Zip file retrieved from the old Maxima wiki many years ago.
This commit includes the package as composed by Vodopivec verbatim,
in addition to a basic Texinfo documentation file and regression test script.
Also update build machinery to execute make in share/nelder_mead to
run makeinfo and generate documentation index.
Common Lisp implementation by Mario S. Mommer, Maxima interface by Andrej Vodopivec.
Zip file retrieved from the old Maxima wiki many years ago.
This commit includes the package as composed by Vodopivec verbatim,
in addition to a basic Texinfo documentation file and regression test script.
Also update build machinery to execute make in share/nelder_mead to
run makeinfo and generate documentation index.
18 files changed: