Information for RPM levmar-2.6-16.fc41.riscv64.rpm
| ID | 1413636 | |||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Name | levmar | |||||||||||||||||||||
| Version | 2.6 | |||||||||||||||||||||
| Release | 16.fc41 | |||||||||||||||||||||
| Epoch | ||||||||||||||||||||||
| Arch | riscv64 | |||||||||||||||||||||
| 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-08-08 16:55:45 GMT | |||||||||||||||||||||
| Size | 65.40 KB | |||||||||||||||||||||
| 3079b4fa4bb1520e6ce707e762aab804 | ||||||||||||||||||||||
| License | GPLv2+ | |||||||||||||||||||||
| Buildroot | f41-build-833577-157877 | |||||||||||||||||||||
| Provides |
|
|||||||||||||||||||||
| Obsoletes | No Obsoletes | |||||||||||||||||||||
| Conflicts | No Conflicts | |||||||||||||||||||||
| Requires |
|
|||||||||||||||||||||
| Recommends | No Recommends | |||||||||||||||||||||
| Suggests | No Suggests | |||||||||||||||||||||
| Supplements | No Supplements | |||||||||||||||||||||
| Enhances | No Enhances | |||||||||||||||||||||
| Files |
|
|||||||||||||||||||||
| Component of |
|
|||||||||||||||||||||
