Here is a list of all documented files with brief descriptions:
| blackbox/archetype.h | NO DOC |
| element/archetype.h | NO DOC |
| field/archetype.h | NO DOC |
| matrix/archetype.h | NO DOC |
| randiter/archetype.h | NO DOC |
| ring/archetype.h | Specification and archetypic instance for the ring interface |
| bbcharpoly.h | No doc |
| benchmark-crafixed.C | Benchmarking fixed CRA routines |
| benchmark-fgemm.C | Benchmarking dense matrix multiplication on finite fields |
| benchmark-fields.C | No doc |
| benchmark-ftrXm.C | Benchmarking triangular matrix multiplication on finite fields |
| benchmark.h | Common header to ease benchmarking routines |
| bitonic-sort.h | Implement bitonic sorting network |
| blackbox-block-container-base.h | NO DOC |
| blackbox-block-container.h | No doc |
| blas-domain.h | NO DOC |
| blas-matrix-multimod.h | A BlasMatrix< represents a matrix as an array of _Field::Elements |
| blas-matrix.h | A BlasMatrix< represents a matrix as an array of _Field::Elements |
| butterfly.h | |
| charpoly.C | |
| checker.C | Script to run LinBox tests |
| checksolve.C | |
| commentator.h | Reports information to the user |
| cra-domain-omp.h | Parallel (OMP) version of Chinese Remaindering Algorithm |
| cra-domain-seq.h | Sequencial version of Chinese Remaindering Algorithm |
| cra-domain.h | Wrapper around OMP/SEQ version of ChineseRemainder |
| cra-early-multip.h | NO DOC |
| cra-early-single.h | NO DOC |
| cra-full-multip-fixed.h | CRA for multi-residues |
| cra-full-multip.h | NO DOC |
| cra-givrnsfixed.h | NO DOC |
| cra-kaapi.h | NO DOC |
| debug.h | Various utilities for debugging |
| default.h | Define some const |
| dense-nullspace.h | We provide the right or left nullspace (kernel or cokernel) of a dense matrix |
| det.C | Examples/det.C |
| det.h | NO DOC |
| diagonal-gf2.h | Random diagonal matrices and diagonal matrices Class especially meant for diagonal precondtionners |
| diagonal.h | Random diagonal matrices and diagonal matrices Class especially meant for diagonal precondtionners |
| dot-product.C | |
| doubledet.C | |
| echelon-form.h | NO DOC |
| echelon.C | |
| ex-fields-archetype.C | On using the field archetype to avoid code bloat |
| ex-fields.C | Using a template function with two distinct fields |
| frobenius.h | NO DESC |
| gauss-gf2.h | Gauss elimination and applications for sparse matrices on  |
| gauss.h | Gauss elimination and applications for sparse matrices |
| givaro-extension.h | NO DOC |
| givaro-gfq.h | |
| givaro-polynomial.h | NO DOC |
| randiter/gmp-rational.h | Generate a random rational with prescribed size |
| graph-charpoly.C | |
| hilbert.h | NO DESC |
| iml_wrapper.h | Wraper for IML routines and puts them in a dedicated namespace |
| integer.h | This is a representation of arbitrary integers |
| lattice.h | LLL reductionThis is an interface to NTL/FPLLL |
| field/lidia-gfq.h | LiDIA : NO DOC |
| lifting-container.h | Lifting from mod p^n to rationals NO DOC |
| linbox-tags.h | Provides tags for various algorithms/solutions, à la FFLAS |
| matrix-hom.h | Matrix Homomorphism A map function converts a matrix on a field/ring to its natural image in another field/ring |
| matrix-rank.h | Computes the rank of a matrix by Gaussian Elimination, in place |
| matrix-stream-readers.h | Here is where all the formats (each of which is a subclass of MatrixStreamReader) are defined, in two places: |
| methods.h | NO DOC |
| minpoly-integer.h | Compute the minpoly of a matrix over an integer ring using modular arithmetic |
| minpoly.C | |
| modular-balanced-double.h | Balanced representation of Z/mZ over double |
| modular-balanced-float.h | Balanced representation of Z/mZ over float |
| modular-balanced-int32.h | Balanced representation of Z/mZ over int32_t |
| modular-balanced-int64.h | Balanced representation of Z/mZ over int64_t |
| field/modular-balanced.h | Common header for any modular-balanced field |
| modular-byte.h | Representation of Z/mZ over byte |
| modular-crooked-double.h | Crooked representation of Z/mZ over double |
| modular-double.h | Standard representation of Z/mZ over double |
| modular-float.h | Representation of Z/mZ over float |
| modular-int.C | Example of arithmetic in the Modular<int> finite field |
| modular-int32.h | Representation of Z/mZ over int32_t |
| modular-int64.h | Representation of Z/mZ over int64_t |
| modular-short.h | Representation of Z/mZ over short |
| field/modular.h | A Modular field is a representations of Z/mZ |
| mul.h | BLAS3 multiplication algorithms |
| ntl-GF2E.h | NO DOC |
| ntl-lzz_p.h | NO DOC |
| ntl-lzz_pE.h | NO DOC |
| ntl-lzz_pX.h | NO DOC |
| ntl-RR.h | NO DOC |
| field/NTL/ntl-ZZ.h | NO DOC |
| ntl-ZZ_p.h | NO DOC |
| ntl-ZZ_pE.h | NO DOC |
| nullspace.h | Nullspace solutions |
| permutation-matrix.h | A permutation class for operations on permutations, their representations and matrix row/column permuting |
| PID-double.h | NO DOC |
| PID-integer.h | NO DOC |
| random-integer.h | Generates random Integers |
| matrix/random-matrix.h | Implementation of random matrices |
| random-matrix.inl | Implementation of random matrices |
| random-prime.h | Generates random positive prime Integers |
| rank.C | |
| rational-reconstruction.h | NO DOC |
| rational-solver.h | Rational solving (Dixon, Wiedemann,...) |
| rational-solver2.h | NO DOC |
| rns.h | Residue Number System tools |
| rns.inl | Residue Number System implementation |
| scompose.h | Implemenatation of EGV and EGV+ algorithm |
| short-vector.h | NO DOCNO DOC |
| sigma-basis.h |  -basis (minimal basis) |
| smith-form-adaptive.h | Implement the adaptive algorithm for Smith form computation |
| smith-form-binary.h | Implementation of EGV and EGV+ algorithm |
| smith.C | |
| smithvalence.C | |
| smithvalence.h | |
| sms.h | MatrixStreamReader for sms matrix format |
| solve.C | Blackbox solvers |
| solve.h | System Solving |
| sparseelimdet.C | |
| sparseelimrank.C | |
| stream.h | Generation of sequences of random vectors |
| test-bitonic-sort.C | No doc |
| test-blackbox-block-container.C | No doc |
| test-blas-domain.C | No doc |
| test-block-ring.C | No doc |
| test-butterfly.C | No doc |
| test-charpoly.C | Tests the characteristic polynomial of sparse and special matrices |
| test-commentator.C | No doc |
| test-common.C | No doc |
| test-companion.C | No doc |
| test-cra.C | We test the various CRA algorithms here |
| test-cradomain.C | Tests LinBox::ChineseRemainer |
| test-dense-zero-one.C | No doc |
| test-dense.C | No doc |
| test-det.C | No doc |
| test-diagonal.C | No doc |
| test-dif.C | No doc |
| test-direct-sum.C | No doc |
| test-echelon-form.C | No doc |
| test-ffpack.C | Tests for the ffpack set of routines |
| test-field.h | Tests field operations |
| test-frobenius.C | No doc |
| test-ftrmm.C | Tests all variants of applyP, ftrmm, ftrsm and fgemm for varions m,k,n and leading dimensions combinations |
| test-getentry.C | No doc |
| test-gf2.C | No doc |
| test-givaro-fields.C | Test fields build on Givaro |
| test-gmp-rational.C | No doc |
| test-hilbert.C | No doc |
| test-hom.C | No doc |
| test-inverse.C | No doc |
| test-isposdef.C | No doc |
| test-ispossemidef.C | No doc |
| test-la-block-lanczos.C | No doc |
| test-last-invariant-factor.C | No doc |
| test-lidia-gfq.C | No doc |
| test-matrix-domain.C | No real doc |
| test-matrix-stream.C | No doc |
| test-mg-block-lanczos.C | No doc |
| test-minpoly.C | No doc |
| test-modular-balanced-double.C | Tests only runFieldTests on modular-balanced-double |
| test-modular-balanced-float.C | Tests only runFieldTests on modular-balanced-float |
| test-modular-balanced-int.C | Tests only runFieldTests on modular-balanced-int32_t |
| test-modular-byte.C | Run runFieldTests and testRandomIterator on modular-byte |
| test-modular-double.C | Tests only runFieldTests for modular-double |
| test-modular-float.C | |
| test-modular-int.C | Run runFieldTests testRandomIterator tests on modular-int32_t |
| test-modular-short.C | Run runFieldTests testRandomIterator tests on modular-short |
| test-modular.C | RunFieldTests on various Modular<XXX> fields |
| test-moore-penrose.C | No doc |
| test-ntl-hankel.C | No doc |
| test-ntl-lzz_p.C | No doc |
| test-ntl-RR.C | No doc |
| test-ntl-sylvester.C | No doc |
| test-ntl-toeplitz.C | No doc |
| test-ntl-ZZ_p.C | No doc |
| test-nullspace.C | Tests the dense nullspace functions for Zp |
| test-optimization.C | No doc |
| test-param-fuzzy.C | No doc |
| test-PID-integer.C | Run runFieldTests testRandomIterator tests on PID_integer |
| test-qlup.C | Tests LQUP decomposition, solve, and nullspace of a random sparse matrice |
| test-randiter-nonzero.C | No doc |
| test-rank.C | No doc |
| test-rat-minpoly.C | No doc |
| test-rat-solve.C | No doc |
| test-rational-matrix-factory.C | No doc |
| test-rational-reconstruction-base.C | Tests rational reconstruction using rational-cra2.h |
| test-rational-solver-adaptive.C | No doc |
| test-rational-solver.C | No doc |
| test-scalar-matrix.C | No doc |
| test-smith-form-adaptive.C | No doc |
| test-smith-form-binary.C | No doc |
| test-smith-form-iliopoulos.C | No doc |
| test-smith-form-local.C | No doc |
| test-smith-form.C | No doc |
| test-solve.C | No doc |
| test-sparse.C | No doc |
| test-subiterator.C | No doc |
| test-submatrix.C | No doc |
| test-subvector.C | No doc |
| test-sum.C | No doc |
| test-toeplitz-det.C | No doc |
| test-toom-cook.C | Toom-cook multiplication routine |
| test-trace.C | No doc |
| test-triplesbb.C | No doc |
| test-unparametric-field.C | No doc |
| test-vector-domain.C | No doc |
| test-zero-one.C | No doc |
| test-zo.C | No doc |
| timer.h | LinBox timer is Givaro's |
| toeplitz.h | Partial Specialization of Toeplitz for Dense vectors from an FFT based on Shoup's NTL library |
| triplesbb.h | NO DOC |
| valence.C | Valence of sparse matrix over Z or Zp |
| vector-traits.h | Vector traits |
| wiedemann.h | Minpoly computation and Wiedeman solvers |
| zero-one.inl | NO DOC |
| zo-gf2.inl | NO DOC |
| zo.h | We define a blackbox class of the same name as that in zero-one.h, hence we use the same name here |
