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.

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.


Versions0.1, 0.2, 0.2.1, 0.3, 1.0, 1.1,, 1.2,, 1.2.1,,,,,
Change logNone available
Dependenciesbase (>=3 && <4.9), bindings-levmar (==1.1.*), hmatrix (>=0.12 && <0.17), vector (>=0.8 && <0.11)
Copyright(c) 2009 - 2014 Roel van Dijk & Bas van Dijk
AuthorRoel van Dijk <> Bas van Dijk <>
MaintainerRoel van Dijk <> Bas van Dijk <>
CategoryNumerical, Math
Home page
Bug tracker
Source repositoryhead: git clone git://
UploadedTue Jan 6 06:13:50 UTC 2015 by BasVanDijk
Downloads1897 total (141 in last 30 days)
StatusDocs available [build log]
Last success reported on 2015-01-06 [all 1 reports]




Maintainers' corner

For package maintainers and hackage trustees