The levmar package
The Levenberg-Marquardt algorithm is an iterative technique that finds a local minimum of a function that is expressed as the sum of squares of nonlinear functions. It has become a standard technique for nonlinear least-squares problems and can be thought of as a combination of steepest descent and the Gauss-Newton method. When the current solution is far from the correct one, the algorithm behaves like a steepest descent method: slow, but guaranteed to converge. When the current solution is close to the correct solution, it becomes a Gauss-Newton method.
Optional box- and linear constraints can be given. Both single and double precision floating point types are supported.
The actual algorithm is implemented in a C library which is bundled with bindings-levmar which this package depends on. See: http://www.ics.forth.gr/~lourakis/levmar/.
A note regarding the license:
This library depends on bindings-levmar which is bundled together with a C library which falls under the GPL. Please be aware of this when distributing programs linked with this library. For details see the description and license of bindings-levmar.
- No changelog available
|Versions||0.1, 0.2, 0.2.1, 0.3, 1.0, 1.1, 22.214.171.124, 1.2, 126.96.36.199, 1.2.1, 188.8.131.52, 184.108.40.206, 220.127.116.11, 18.104.22.168|
|Dependencies||base (>=3 && <4.4), base-unicode-symbols (>=0.1.1 && <0.3), bindings-levmar (==1.0.*), hmatrix (==0.11.*), vector (==0.7.*)|
|Copyright||(c) 2009 - 2011 Roel van Dijk & Bas van Dijk|
|Author||Roel van Dijk <email@example.com> Bas van Dijk <firstname.lastname@example.org>|
|Maintainer||Roel van Dijk <email@example.com> Bas van Dijk <firstname.lastname@example.org>|
|Source repository||head: git clone git://github.com/basvandijk/levmar.git|
|Upload date||Mon May 23 13:40:55 UTC 2011|
|Downloads||886 total (49 in last 30 days)|
For package maintainers and hackage trustees