The levmar package

[Tags:bsd3, library]

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:

All modules are self-contained; i.e. each module re-exports all the things you need to work with it.

Also see the levmar-safe package which adds extra type-safety on top of this package.

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.


Versions 0.1, 0.2, 0.2.1, 0.3, 1.0, 1.1,, 1.2,, 1.2.1,,,,,,
Dependencies base (>=3 && <4.4), base-unicode-symbols (>=0.1.1 && <0.3), bindings-levmar (==0.2.*) [details]
License BSD3
Copyright (c) 2009 - 2010 Roel van Dijk & Bas van Dijk
Author Roel van Dijk <> Bas van Dijk <>
Maintainer Roel van Dijk <> Bas van Dijk <>
Stability experimental
Category Numerical, Math
Source repository head: darcs get
Uploaded Mon Feb 7 09:14:31 UTC 2011 by BasVanDijk
Distributions NixOS:
Downloads 2980 total (12 in the last 30 days)
0 []
Status Docs uploaded by user
Build status unknown [no reports yet]




Maintainer's Corner

For package maintainers and hackage trustees