| ID | 49524 | ||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Build | levmar-2.6-15.fc41 | ||||||||||||||||||||
| Name | levmar | ||||||||||||||||||||
| Version | 2.6 | ||||||||||||||||||||
| Release | 15.fc41 | ||||||||||||||||||||
| Epoch | |||||||||||||||||||||
| Arch | riscv64 | ||||||||||||||||||||
| Draft | False | ||||||||||||||||||||
| 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 | 2024-05-01 21:18:06 GMT | ||||||||||||||||||||
| Size | 65.32 KB | ||||||||||||||||||||
| 4f140b5d9b80340229f97236f2a6e0f1 | |||||||||||||||||||||
| License | GPLv2+ | ||||||||||||||||||||
| Buildroot | f41-build-39856-1784 | ||||||||||||||||||||
| Provides |
|
||||||||||||||||||||
| Obsoletes | No Obsoletes | ||||||||||||||||||||
| Conflicts | No Conflicts | ||||||||||||||||||||
| Requires |
|
||||||||||||||||||||
| Recommends | No Recommends | ||||||||||||||||||||
| Suggests | No Suggests | ||||||||||||||||||||
| Supplements | No Supplements | ||||||||||||||||||||
| Enhances | No Enhances | ||||||||||||||||||||
| Files |
|
||||||||||||||||||||
| Component of | |||||||||||||||||||||
