Group :: Sistema/Bibliotecas
RPM: liblevmar
Principal Changelog Spec Patches Sources Download Gear Bugs e FR Repocop
A versão atual: 2.6-alt1_12
Data da compilação: 25 fevereiro 2023, 11:30 ( 59.9 weeks ago )
Tamanho:: 86.36 Kb
Home page: http://www.ics.forth.gr/~lourakis/levmar/
Licença: GPLv2+
Sumário: Levenberg-Marquardt nonlinear least squares algorithm
Descrição:
Lista dos contribuidores Lista dos rpms provida por esta srpm:
ACL:
Data da compilação: 25 fevereiro 2023, 11:30 ( 59.9 weeks ago )
Tamanho:: 86.36 Kb
Home page: http://www.ics.forth.gr/~lourakis/levmar/
Licença: GPLv2+
Sumário: Levenberg-Marquardt nonlinear least squares algorithm
Descrição:
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.
Mantenedor currente: Igor Vlasenko 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.
Lista dos contribuidores Lista dos rpms provida por esta srpm:
- liblevmar
- liblevmar-debuginfo
- liblevmar-devel
- liblevmar-devel-debuginfo