File: control

package info (click to toggle)
iml 1.0.3-4
  • links: PTS
  • area: main
  • in suites: squeeze
  • size: 2,020 kB
  • ctags: 180
  • sloc: sh: 8,654; ansic: 6,206; makefile: 70
file content (45 lines) | stat: -rw-r--r-- 2,031 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
Source: iml
Section: math
Priority: optional
Maintainer: Tim Abbott <tabbott@mit.edu>
Homepage: http://www.cs.uwaterloo.ca/~z4chen/iml.html
Build-Depends: cdbs (>= 0.4.23-1.1), autotools-dev, debhelper (>= 5), libtool, automake1.10, autoconf, quilt, patchutils (>= 0.2.25), cdbs (>= 0.4.27), libgmp3-dev, libgsl0-dev, libatlas-base-dev
Standards-Version: 3.8.0

Package: libiml0
Section: libs
Architecture: any
Depends: ${shlibs:Depends}, ${misc:Depends}
Description: Integer Matrix Library, runtime files
 IML is a library for exact, dense linear algebra over the integers.
 IML contains algorithms for nonsingular rational system solving,
 computing the right nullspace of an integer matrix, and certified
 linear system solving.
 .
 In addition, IML provides some low level routines for a variety of
 mod p matrix operations: computing the row-echelon form, determinant,
 rank profile, and inverse of a mod p matrix.  These mod p routines
 are not general purpose; they require that p satisfy some
 preconditions based on the dimension of the input matrix (usually p
 should be prime and should be no more than about 20 bits long).
 .
 This package contains runtime files for IML.

Package: libiml-dev
Section: libdevel
Architecture: any
Depends: ${shlibs:Depends}, ${misc:Depends}, libiml0
Description: Integer Matrix Library, development files
 IML is a library for exact, dense linear algebra over the integers.
 IML contains algorithms for nonsingular rational system solving,
 computing the right nullspace of an integer matrix, and certified
 linear system solving.
 .
 In addition, IML provides some low level routines for a variety of
 mod p matrix operations: computing the row-echelon form, determinant,
 rank profile, and inverse of a mod p matrix.  These mod p routines
 are not general purpose; they require that p satisfy some
 preconditions based on the dimension of the input matrix (usually p
 should be prime and should be no more than about 20 bits long).
 .
 This package contains development files for IML.