Information for RPM levmar-2.5-19.fc31.src.rpm
| ID | 391340 | ||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|
| Name | levmar | ||||||||||
| Version | 2.5 | ||||||||||
| Release | 19.fc31 | ||||||||||
| Epoch | |||||||||||
| Arch | src | ||||||||||
| Summary | Levenberg-Marquardt nonlinear least squares algorithm | ||||||||||
| Description | 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. | ||||||||||
| Build Time | 2019-07-27 07:47:39 GMT | ||||||||||
| Size | 87.54 KB | ||||||||||
| 659bf7203ef1e35bda047d9f8e3a2f75 | |||||||||||
| License | GPLv2+ | ||||||||||
| Buildroot | f31-build-58097-28401 | ||||||||||
| Provides | No Provides | ||||||||||
| Obsoletes | No Obsoletes | ||||||||||
| Conflicts | No Conflicts | ||||||||||
| Requires |
|
||||||||||
| Recommends | No Recommends | ||||||||||
| Suggests | No Suggests | ||||||||||
| Supplements | No Supplements | ||||||||||
| Enhances | No Enhances | ||||||||||
| Files |
|
||||||||||
| Component of | No Buildroots | ||||||||||
