Result for 6F43AD2FF37A3C3D351BA35DE03F9B8C2F0F5EC2

Query result

Key Value
FileName./usr/lib64/liblevmar.so.2
FileSize16
MD5D59AA48343CBE5C5CF295D710BEC4AE7
SHA-16F43AD2FF37A3C3D351BA35DE03F9B8C2F0F5EC2
SHA-256B0ED1682AF7ABF8BF64BA12BF9E0ABD04AA873B39F7D61E528FAA81F3DD9CACE
SSDEEP3:EJK:Eo
TLSH
hashlookup:parent-total140
hashlookup:trust100

Network graph view

Parents (Total: 140)

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
MD591956BF3EECE6A35C587E3CFEA8B04D6
PackageArchi586
PackageDescriptionlevmar 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.
PackageMaintainerumeabot <umeabot>
PackageNameliblevmar2
PackageRelease3.mga8
PackageVersion2.6
SHA-1010905BB070C2FD141F9A8A81DEE5E2CA1832946
SHA-2562499251F157218E033EB685EFF3723E768938C2C248869FE4A8CA395A139E3E4
Key Value
MD5E940A63C7329BD0565578AF6DE5DDAAC
PackageArchaarch64
PackageDescriptionlevmar 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.
PackageMaintainerumeabot <umeabot>
PackageNamelib64levmar2
PackageRelease2.mga7
PackageVersion2.6
SHA-1086AC87C37AD753A705CDE221A87AF21C31C78DE
SHA-256785A451B9681AE2A46FF9DBDD1D9E5D492CA6403C18432589684A1D63C6B3491
Key Value
MD56CCE01D98B0D936431A1AA42A0865D06
PackageArcharmv5tel
PackageDescriptionlevmar 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.
PackageMaintainerFedora Project
PackageNamelevmar
PackageRelease4.fc13
PackageVersion2.5
SHA-10A44124FA01A5609C01F3AC009003C84489F69BC
SHA-256990D3FD54BEEC055A25ECD08D584BC12D1B0FE4737A37D1C1A591345D3763A63
Key Value
MD5756DCAF2C978C7A5EE6D3C7598C55012
PackageArchppc64
PackageDescriptionlevmar 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.
PackageMaintainerFedora Project
PackageNamelevmar
PackageRelease8.fc19
PackageVersion2.5
SHA-10C7F47A1024F457B31C09C3D8326B755D3D51490
SHA-256723C3F11356EB119F0E7AD21D49ED76778F8E94E3FEEF84755653EEF58927460
Key Value
MD5EC4F7C8013E18A93625777B7594A5052
PackageArchppc64
PackageDescriptionlevmar 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.
PackageMaintainerKoji
PackageNamelevmar
PackageRelease7.fc18
PackageVersion2.5
SHA-111272D8A6F4E09BE98077D128BF43C507B1D8BE9
SHA-25628C21E430ED024143C601A0A09AD09FF2065B0F6340FFD3A2A360808E3BA1C4B
Key Value
MD5199CCF9038AB522C3A7F7D77763932AE
PackageArchppc64
PackageDescriptionlevmar 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.
PackageMaintainerFedora Project
PackageNamelevmar
PackageRelease6.el6
PackageVersion2.5
SHA-1117C2A887E82CC1D73AAE2AC51DA7058D2355F2E
SHA-2568F6BB7F0D2BE51183C80F241816265A6570C8547F00581E8F58CD188DA21E801
Key Value
MD5D1F897F55B440C3DD1DCE7029ACCD9AB
PackageArchppc64
PackageDescriptionDevelopment files for the levmar library, and demo program.
PackageMaintainerKoji
PackageNamelevmar-devel
PackageRelease5.fc15
PackageVersion2.5
SHA-1138923725C7B00CFF070A142917D728A24933781
SHA-2569439DE3E7B273BF4D8DDF6C142C03ABDD767BC46EECCA73F8081B9E062DE2ECD
Key Value
MD54D99717FE273740D10651689BB3B63CD
PackageArchppc64le
PackageDescriptionlevmar 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.
PackageMaintainerFedora Project
PackageNamelevmar
PackageRelease12.fc23
PackageVersion2.5
SHA-1151B843F98A44D5FFEDFEA9BEEFFE0FD277C685D
SHA-256AC8A47E46BE8E23D75B14C19E76A9D46F83BB65DE0C36D9F7CF40D9C5E47B1FB
Key Value
MD5FAA1F514464C57F5153FF80A0E81C079
PackageArchppc64
PackageDescriptionDevelopment files for the levmar library, and demo program.
PackageMaintainerKoji
PackageNamelevmar-devel
PackageRelease7.fc18
PackageVersion2.5
SHA-118E5808BC696D6D6DCE45D2F708F98FB5F121B28
SHA-256BD53E8147F5F30C093281593C28EC159091E98A9EB0DA5C5C5021CDDD75FBC3E
Key Value
MD50D97DC53ACC8D291EDD9FEE15AD29F9D
PackageArchs390x
PackageDescriptionDevelopment files for the levmar library, and demo program.
PackageMaintainerFedora Project
PackageNamelevmar-devel
PackageRelease7.fc18
PackageVersion2.5
SHA-1197E9457E81A4C22234499A4EA5C049B4D4BAE46
SHA-25627D4108CE2C9392D2F0248AE96AF4C51352EBE32426D215A9386D11915BA6164