| Index | index by Group | index by Distribution | index by Vendor | index by creation date | index by Name | Mirrors | Help | Search |
| Name: liblevmar2 | Distribution: Mageia |
| Version: 2.6 | Vendor: Mageia.Org |
| Release: 4.mga9 | Build date: Thu Mar 17 21:02:26 2022 |
| Group: System/Libraries | Build host: localhost |
| Size: 242612 | Source RPM: levmar-2.6-4.mga9.src.rpm |
| Packager: umeabot <umeabot> | |
| Url: http://users.ics.forth.gr/~lourakis/levmar/ | |
| Summary: Levenberg-Marquardt nonlinear least squares algorithm | |
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.
GPLv2+
* Thu Mar 17 2022 umeabot <umeabot> 2.6-4.mga9 + Revision: 1797261 - Mageia 9 Mass Rebuild
/usr/lib/.build-id /usr/lib/.build-id/c7 /usr/lib/.build-id/c7/72aca203ef045b16804bfc65f7cd55789d0626 /usr/lib/liblevmar.so.2 /usr/lib/liblevmar.so.2.2 /usr/share/doc/liblevmar2 /usr/share/doc/liblevmar2/LICENSE /usr/share/doc/liblevmar2/README.txt
Generated by rpm2html 1.8.1
Fabrice Bellet, Sat Dec 21 12:43:43 2024