cminpack 1.3.0-2 source package in Ubuntu
Changelog
cminpack (1.3.0-2) unstable; urgency=low * Upload to sid * Bump Std-Vers to 3.9.4, no changes needed -- Mathieu Malaterre <email address hidden> Mon, 13 May 2013 11:55:15 +0200
Upload details
- Uploaded by:
- Debian Science Team
- Uploaded to:
- Sid
- Original maintainer:
- Debian Science Team
- Architectures:
- any all
- Section:
- libs
- Urgency:
- Low Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| cminpack_1.3.0-2.dsc | 2.0 KiB | 58ba4acc390fc5cb7e79287cf19aea1d14a2b5f9bd38621735b918747bd27321 |
| cminpack_1.3.0.orig.tar.gz | 296.5 KiB | bd04b1e5b7b4046f37dc4b3221516f36681a1bb35e8b88b091b8b86b0df203fc |
| cminpack_1.3.0-2.debian.tar.gz | 4.4 KiB | 0c7e702fd919dd21c79a94fc61f3019353aa8abbf776eb8fd0fab63602c02552 |
Available diffs
- diff from 1.2.2-1 to 1.3.0-2 (31.9 KiB)
No changes file available.
Binary packages built by this source
- cminpack-doc: 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 documentation files for cminpack.
- libcminpack-dev: No summary available for libcminpack-dev in ubuntu saucy.
No description available for libcminpack-dev in ubuntu saucy.
- 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.
