cminpack 1.1.3-1build1 source package in Ubuntu
Changelog
cminpack (1.1.3-1build1) precise; urgency=low
* No-change rebuild against current pkgbinarymangler to fix broken
md5sums. (see LP #875466)
-- Martin Pitt <email address hidden> Wed, 29 Feb 2012 08:29:05 +0100
Upload details
- Uploaded by:
- Martin Pitt
- Uploaded to:
- Precise
- Original maintainer:
- Debian Science Team
- Architectures:
- any
- Section:
- libs
- Urgency:
- Low Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Precise | release | universe | libs |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| cminpack_1.1.3.orig.tar.gz | 184.8 KiB | eb319ad3eeb9e54076b2ac484058540dbd5db4a45928302a5fd1469aad5d4467 |
| cminpack_1.1.3-1build1.debian.tar.gz | 3.1 KiB | 945db89ebad6c32cfcf0a0b3fcd00959e1fe48fb766ded3b351a61e4947b61dc |
| cminpack_1.1.3-1build1.dsc | 2.1 KiB | e4762e8e624a4047a832c2ad76d69c540dd70e35ca7e5543140b045ce3366689 |
Available diffs
- diff from 1.1.3-1 to 1.1.3-1build1 (380 bytes)
Binary packages built by this source
- libcminpack-dev: Nonlinear equations and nonlinear least squares problems - development
Minpack includes software for solving nonlinear equations and nonlinear least
squares problems. Five algorithmic paths each include a core subroutine and an
easy-to-use driver. The algorithms proceed either from an analytic
specification of the Jacobian matrix or directly from the problem functions.
The paths include facilities for systems of equations with a banded Jacobian
matrix, for least squares problems with a large amount of data, and for
checking the consistency of the Jacobian matrix with the functions.
.
This is the C re-write of the original fortran minpack implementation.
.
This package contains development files needed to build cminpack applications.
- libcminpack1.0.90: Nonlinear equations and nonlinear least squares problems - runtime
Minpack includes software for solving nonlinear equations and nonlinear least
squares problems. Five algorithmic paths each include a core subroutine and an
easy-to-use driver. The algorithms proceed either from an analytic
specification of the Jacobian matrix or directly from the problem functions.
The paths include facilities for systems of equations with a banded Jacobian
matrix, for least squares problems with a large amount of data, and for
checking the consistency of the Jacobian matrix with the functions.
.
This is the C re-write of the original fortran minpack implementation.
.
This package contains the libraries needed to run cminpack applications.
