Levenberg-Marquardt nonlinear least squares algorithm

Edit Package levmar

levmar is a native ANSI C implementation of the Levenberg-Marquardt optimization algorithm. Both unconstrained and constrained (under linear equations, inequality and box constraints) Levenberg-Marquardt variants are included. The LM 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 on, 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

Refresh
Refresh
Source Files (show merged sources derived from linked package)
Filename Size Changed
levmar-2.6.tgz 0000081143 79.2 KB
levmar.changes 0000002159 2.11 KB
levmar.spec 0000004399 4.3 KB
Latest Revision
buildservice-autocommit accepted request 1004447 from Stefan Brüns's avatar Stefan Brüns (StefanBruens) (revision 10)
baserev update by copy to link target
Comments 0
openSUSE Build Service is sponsored by