levmar: An implementation of the Levenberg-Marquardt algorithm

[ bsd3, library, math, numerical ] [ Propose Tags ]

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.

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.

Versions [faq] 0.1, 0.2, 0.2.1, 0.3, 1.0, 1.1, 1.1.0.1, 1.2, 1.2.0.1, 1.2.1, 1.2.1.1, 1.2.1.2, 1.2.1.3, 1.2.1.4, 1.2.1.5, 1.2.1.6, 1.2.1.7, 1.2.1.8 base (>=3 && <4.10), bindings-levmar (==1.1.*), hmatrix (>=0.12 && <0.18), vector (>=0.8 && <0.12) [details] BSD-3-Clause (c) 2009 - 2014 Roel van Dijk & Bas van Dijk Roel van Dijk Bas van Dijk Roel van Dijk Bas van Dijk Numerical, Math https://github.com/basvandijk/levmar https://github.com/basvandijk/levmar/issues head: git clone git://github.com/basvandijk/levmar.git by BasVanDijk at Sun Jul 17 18:41:00 UTC 2016 NixOS:1.2.1.8 7058 total (196 in the last 30 days) (no votes yet) [estimated by rule of succession] λ λ λ Docs not available All reported builds failed as of 2016-11-22

Modules

• Numeric
• Numeric.LevMar

Maintainer's Corner

For package maintainers and hackage trustees