Key | Value |
---|---|
FileName | ./usr/lib64/liblevmar.so.2 |
FileSize | 16 |
MD5 | D59AA48343CBE5C5CF295D710BEC4AE7 |
SHA-1 | 6F43AD2FF37A3C3D351BA35DE03F9B8C2F0F5EC2 |
SHA-256 | B0ED1682AF7ABF8BF64BA12BF9E0ABD04AA873B39F7D61E528FAA81F3DD9CACE |
SSDEEP | 3:EJK:Eo |
TLSH | |
hashlookup:parent-total | 140 |
hashlookup:trust | 100 |
The searched file hash is included in 140 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
MD5 | 91956BF3EECE6A35C587E3CFEA8B04D6 |
PackageArch | i586 |
PackageDescription | 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. |
PackageMaintainer | umeabot <umeabot> |
PackageName | liblevmar2 |
PackageRelease | 3.mga8 |
PackageVersion | 2.6 |
SHA-1 | 010905BB070C2FD141F9A8A81DEE5E2CA1832946 |
SHA-256 | 2499251F157218E033EB685EFF3723E768938C2C248869FE4A8CA395A139E3E4 |
Key | Value |
---|---|
MD5 | E940A63C7329BD0565578AF6DE5DDAAC |
PackageArch | aarch64 |
PackageDescription | 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. |
PackageMaintainer | umeabot <umeabot> |
PackageName | lib64levmar2 |
PackageRelease | 2.mga7 |
PackageVersion | 2.6 |
SHA-1 | 086AC87C37AD753A705CDE221A87AF21C31C78DE |
SHA-256 | 785A451B9681AE2A46FF9DBDD1D9E5D492CA6403C18432589684A1D63C6B3491 |
Key | Value |
---|---|
MD5 | 6CCE01D98B0D936431A1AA42A0865D06 |
PackageArch | armv5tel |
PackageDescription | 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. |
PackageMaintainer | Fedora Project |
PackageName | levmar |
PackageRelease | 4.fc13 |
PackageVersion | 2.5 |
SHA-1 | 0A44124FA01A5609C01F3AC009003C84489F69BC |
SHA-256 | 990D3FD54BEEC055A25ECD08D584BC12D1B0FE4737A37D1C1A591345D3763A63 |
Key | Value |
---|---|
MD5 | 756DCAF2C978C7A5EE6D3C7598C55012 |
PackageArch | ppc64 |
PackageDescription | 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. |
PackageMaintainer | Fedora Project |
PackageName | levmar |
PackageRelease | 8.fc19 |
PackageVersion | 2.5 |
SHA-1 | 0C7F47A1024F457B31C09C3D8326B755D3D51490 |
SHA-256 | 723C3F11356EB119F0E7AD21D49ED76778F8E94E3FEEF84755653EEF58927460 |
Key | Value |
---|---|
MD5 | EC4F7C8013E18A93625777B7594A5052 |
PackageArch | ppc64 |
PackageDescription | 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. |
PackageMaintainer | Koji |
PackageName | levmar |
PackageRelease | 7.fc18 |
PackageVersion | 2.5 |
SHA-1 | 11272D8A6F4E09BE98077D128BF43C507B1D8BE9 |
SHA-256 | 28C21E430ED024143C601A0A09AD09FF2065B0F6340FFD3A2A360808E3BA1C4B |
Key | Value |
---|---|
MD5 | 199CCF9038AB522C3A7F7D77763932AE |
PackageArch | ppc64 |
PackageDescription | 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. |
PackageMaintainer | Fedora Project |
PackageName | levmar |
PackageRelease | 6.el6 |
PackageVersion | 2.5 |
SHA-1 | 117C2A887E82CC1D73AAE2AC51DA7058D2355F2E |
SHA-256 | 8F6BB7F0D2BE51183C80F241816265A6570C8547F00581E8F58CD188DA21E801 |
Key | Value |
---|---|
MD5 | D1F897F55B440C3DD1DCE7029ACCD9AB |
PackageArch | ppc64 |
PackageDescription | Development files for the levmar library, and demo program. |
PackageMaintainer | Koji |
PackageName | levmar-devel |
PackageRelease | 5.fc15 |
PackageVersion | 2.5 |
SHA-1 | 138923725C7B00CFF070A142917D728A24933781 |
SHA-256 | 9439DE3E7B273BF4D8DDF6C142C03ABDD767BC46EECCA73F8081B9E062DE2ECD |
Key | Value |
---|---|
MD5 | 4D99717FE273740D10651689BB3B63CD |
PackageArch | ppc64le |
PackageDescription | 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. |
PackageMaintainer | Fedora Project |
PackageName | levmar |
PackageRelease | 12.fc23 |
PackageVersion | 2.5 |
SHA-1 | 151B843F98A44D5FFEDFEA9BEEFFE0FD277C685D |
SHA-256 | AC8A47E46BE8E23D75B14C19E76A9D46F83BB65DE0C36D9F7CF40D9C5E47B1FB |
Key | Value |
---|---|
MD5 | FAA1F514464C57F5153FF80A0E81C079 |
PackageArch | ppc64 |
PackageDescription | Development files for the levmar library, and demo program. |
PackageMaintainer | Koji |
PackageName | levmar-devel |
PackageRelease | 7.fc18 |
PackageVersion | 2.5 |
SHA-1 | 18E5808BC696D6D6DCE45D2F708F98FB5F121B28 |
SHA-256 | BD53E8147F5F30C093281593C28EC159091E98A9EB0DA5C5C5021CDDD75FBC3E |
Key | Value |
---|---|
MD5 | 0D97DC53ACC8D291EDD9FEE15AD29F9D |
PackageArch | s390x |
PackageDescription | Development files for the levmar library, and demo program. |
PackageMaintainer | Fedora Project |
PackageName | levmar-devel |
PackageRelease | 7.fc18 |
PackageVersion | 2.5 |
SHA-1 | 197E9457E81A4C22234499A4EA5C049B4D4BAE46 |
SHA-256 | 27D4108CE2C9392D2F0248AE96AF4C51352EBE32426D215A9386D11915BA6164 |