linbox
File List
Here is a list of all documented files with brief descriptions:
o*abnormal-helpers.h/
o*abnormal-matrix.h
o*apply-domain.hNO DOC
o*blackbox/archetype.hNO DOC
o*element/archetype.hNO DOC
o*field/archetype.hNO DOC
o*matrix/archetype.hNO DOC
o*randiter/archetype.hNO DOC
o*ring/archetype.hSpecification and archetypic instance for the ring interface
o*athadet.C
o*bbcharpoly.hNo doc
o*benchmark-example.CBenchmarking example
o*benchmark-fields.CNo doc
o*benchmark-metadata.CMetadata
o*benchmark-metadata.hMetadata
o*benchmark-utils.hUtils
o*benchmark.hCommon header to ease benchmarking routines
o*benchmark.inlCommon header to ease benchmarking routines
o*BenchmarkFile.h
o*BenchmarkFile.inl
o*bigmat.C
o*bitonic-sort.hImplement bitonic sorting network
o*blackbox-block-container-base.hNO DOC
o*blackbox-block-container.hNo doc
o*blackbox.hFile including all of LinBox blackboxes
o*blas-matrix.hA BlasMatrix<_Field > represents a matrix as an array of _Field::Elements
o*blas-vector.hA BlasVector<_Field > represents a vector as an array of _Field::Elements
o*block-minpoly.CNo doc
o*butterfly.h
o*butterfly.inlFirst linbox block: butterfly method implementations Second LinBox block: butterfly switch and switch factory impls
o*charpoly.C
o*checker.CScript to run LinBox tests
o*checksolve.C
o*commentator.hReports information to the user
o*cra-domain-omp.hParallel (OMP) version of Chinese Remaindering Algorithm
o*cra-domain-seq.hSequencial version of Chinese Remaindering Algorithm
o*cra-domain.hWrapper around OMP/SEQ version of ChineseRemainder
o*cra-early-multip.hNO DOC
o*cra-early-single.hNO DOC
o*cra-full-multip-fixed.hCRA for multi-residues
o*cra-full-multip.hNO DOC
o*cra-givrnsfixed.hNO DOC
o*cra-kaapi.hNO DOC
o*CSValue.h
o*debug.hVarious utilities for debugging
o*default.hDefine some const
o*dense-matrix.hNODOC
o*dense-nullspace.hWe provide the right or left nullspace (kernel or cokernel) of a dense matrix
o*det.CExamples/det.C
o*det.hNO DOC
o*diagonal-gf2.hRandom diagonal matrices and diagonal matrices Class especially meant for diagonal precondtionners
o*diagonal.hRandom diagonal matrices and diagonal matrices Class especially meant for diagonal precondtionners
o*dot-product.C
o*doubledet.C
o*echelon-form.hNO DOC
o*echelon.C
o*ex-fields-archetype.COn using the field archetype to avoid code bloat
o*ex-fields.CUsing a template function with two distinct fields
o*frobenius.hNO DESC
o*gauss-gf2.hGauss elimination and applications for sparse matrices on $F_2$
o*gauss.hGauss elimination and applications for sparse matrices
o*generic.hGenric random iterator
o*givaro-polynomial.hNO DOC
o*randiter/gmp-rational.hGenerate a random rational with prescribed size
o*graph-charpoly.C
o*grid_reduce.C
o*hilbert.hNO DESC
o*iml_wrapper.hWraper for IML routines and puts them in a dedicated namespace
o*integer-mul.C
o*integer.hThis is a representation of arbitrary integers
o*jit-matrix.hNodoc
o*lattice.hLLL reductionThis is an interface to NTL/FPLLL
o*lifting-container.hLifting from mod p^n to rationals NO DOC
o*linbox-config.hLinbox base configuration file
o*linbox-tags.hProvides tags for various algorithms/solutions, à la FFLAS
o*map-sparse.h
o*map-sparse.inl
o*matrix-domain.hNODOC
o*MatrixDomain/matrix-domain.hNO DOC
o*matrix-hom.hMatrix Homomorphism A map function converts a matrix on a field/ring to its natural image in another field/ring
o*matrix-rank.hComputes the rank of a matrix by Gaussian Elimination, in place
o*matrix-stream-readers.hHere is where all the formats (each of which is a subclass of MatrixStreamReader) are defined, in two places:
o*matrix.hNODOC
o*matrix.inlRaw storage version of DenseMatrix and TriangularMatrix
o*methods.hNO DOC
o*minpoly-integer.hCompute the minpoly of a matrix over an integer ring using modular arithmetic
o*minpoly.C
o*modular-int.CExample of arithmetic in the Givaro::Modular<int> finite field
o*modular.hA Givaro::Modular ring is a representations of Z/mZ
o*mpidet.C
o*mul.hBLAS3 multiplication algorithms
o*ntl-lzz_pEX.hNO DOC
o*ntl-lzz_pX.hNO DOC
o*ntl-ZZ_p.hNO DOC
o*nullspace.hNullspace solutions
o*nullspacebasis.C
o*nullspacebasis_rank.C
o*omp-benchmark.CF
o*omp_block_rank.C
o*omp_smithvalence.C
o*opencl-domain.hNO DOC
o*opencl-resource-controller.h
o*optimizer.h
o*permutation-matrix.h
o*plain-matrix.hReference representation of a PlainMatrix (dense, memory allocating) class and PlainSubmatrix (dense, non-allocating) class
o*power_rank.C
o*poweroftwo_ranks.C
o*qchar.C
o*questions.C
o*random-integer.hGenerates random Integers
o*matrix/random-matrix.hImplementation of random matrices
o*random-matrix.inlImplementation of random matrices
o*random-prime.hGenerates random positive prime Integers
o*rank.C
o*rational-reconstruction.hNO DOC
o*rational-solver.hRational solving (Dixon, Wiedemann,...)
o*rational-solver2.hNO DOC
o*read-write-sparse.h
o*rns.hResidue Number System tools
o*rns.inlResidue Number System implementation
o*rr.C
o*samplebb.C
o*scompose.hImplemenatation of EGV and EGV+ algorithm
o*short-vector.hNO DOCNO DOC
o*sigma-basis.h$\sigma$-basis (minimal basis)
o*sliced3.h
o*smith-form-adaptive.hImplement the adaptive algorithm for Smith form computation
o*smith-form-binary.hImplementation of EGV and EGV+ algorithm
o*blackbox/smith.CMod m Smith form by elmination
o*smith.C
o*smithvalence.C
o*smithvalence.h
o*sms.hMatrixStreamReader for sms matrix format
o*solution-tags.hThis allows files defining objects that have traits concerning several solutions to get the tags and traits with one inclusion
o*solve.CBlackbox solvers
o*solve.hSystem Solving
o*sparse-associative-vector.h
o*sparse-coo-implicit-matrix.h
o*sparse-coo-matrix.h
o*sparse-csr-matrix.h
o*sparse-domain.h
o*sparse-ell-matrix.h
o*sparse-ellr-matrix.h
o*sparse-generic.h
o*sparse-hyb-matrix.h
o*sparse-map-map-matrix.hSupports fast elementary row AND column operations simultaneously
o*sparse-map-map-matrix.inlSupports fast elementary row AND column operations simultaneously
o*sparse-matrix.hA SparseMatrix<_Field, _Storage> ...
o*sparse-parallel-vector.h
o*sparse-sequence-vector.h
o*sparse-tpl-matrix-omp.hNO DOC
o*sparse-tpl-matrix-omp.inlNO DOC
o*sparse-tpl-matrix.hA SparseMatrix<_Field, SparseMatrixFormat::TPL > is a vector of (i,j,value) triples
o*sparseelimdet.C
o*sparseelimrank.C
o*stream.hGeneration of sequences of random vectors
o*test-bitonic-sort.CNo doc
o*test-blackbox-block-container.CNo doc
o*test-blas-domain.CNo doc
o*test-block-ring.CNo doc
o*test-block-wiedemann.CNo doc
o*test-butterfly.CNo doc
o*test-charpoly.CTests the characteristic polynomial of sparse and special matrices
o*test-commentator.CNo doc
o*test-common.inlNo doc
o*test-companion.CNo doc
o*test-cra.CWe test the various CRA algorithms here
o*test-cradomain.CTests LinBox::ChineseRemainer
o*test-dense-zero-one.CNo doc
o*test-dense.CNo doc
o*test-det.CNo doc
o*test-diagonal.CNo doc
o*test-dif.CNo doc
o*test-direct-sum.CNo doc
o*test-echelon-form.CNo doc
o*test-ffpack.CTests for the ffpack set of routines
o*test-fibb.CNo doc
o*test-field.hTests ring and field operations
o*test-frobenius.CNo doc
o*test-ftrmm.CTests all variants of applyP, ftrmm, ftrsm and fgemm for varions m,k,n and leading dimensions combinations
o*test-getentry.CNo doc
o*test-gf2.CNo doc
o*test-givaro-zpz.CNo doc
o*test-givaro-zpzuns.CNo doc
o*test-gmp-rational.CNo doc
o*test-hilbert.CNo doc
o*test-hom.CNo doc
o*test-image-field.CNo doc
o*test-inverse.CNo doc
o*test-isposdef.CNo doc
o*test-ispossemidef.CNo doc
o*test-la-block-lanczos.CNo doc
o*test-last-invariant-factor.CNo doc
o*test-lidia-gfq.CNo doc
o*test-matrix-domain.CNo real doc
o*test-matrix-stream.CNo doc
o*test-matrix-utils.hUtilities for tests on matrices
o*test-mg-block-lanczos.CNo doc
o*test-minpoly.CNo doc
o*test-modular-balanced-double.CTests only runFieldTests on modular-balanced-double
o*test-modular-balanced-float.CTests only runFieldTests on modular-balanced-float
o*test-modular-balanced-int.CFor each integer type T, Givaro::ModularBalanced<T> is tested with a small primm and with a large prime using runFieldTests and testRandomIterator
o*test-modular-byte.CRun runFieldTests and testRandomIterator on modular-byte
o*test-modular-double.CTests only runFieldTests for modular-double
o*test-modular-float.CTests only runFieldTests for modular-float
o*test-modular-int.CFor each integer type T, Givaro::Modular<T> is tested with a small primm and with a large prime using runFieldTests and testRandomIterator
o*test-modular-short.CRun runFieldTests testRandomIterator tests on modular-short
o*test-modular.CRunFieldTests on various Givaro::Modular<XXX> fields
o*test-moore-penrose.CNo doc
o*test-ntl-hankel.CNo doc
o*test-ntl-lzz_p.CNo doc
o*test-ntl-lzz_pE.CNo doc
o*test-ntl-lzz_pEX.CNo doc
o*test-ntl-lzz_pX.CNo doc
o*test-ntl-RR.CNo doc
o*test-ntl-sylvester.CNo doc
o*test-ntl-toeplitz.CNo doc
o*test-ntl-ZZ_p.CNo doc
o*test-nullspace.CTests the dense nullspace functions for Zp
o*test-optimization.CNo doc
o*test-param-fuzzy.CNo doc
o*test-plain-domain.CNo real doc
o*test-qlup.CTests LQUP decomposition, solve, and nullspace of a random sparse matrice
o*test-quad-matrix.CNo doc
o*test-randiter-nonzero.CNo doc
o*test-rank-md.CNo doc
o*test-rank-u32.CNo doc
o*test-rank.hNo doc
o*test-rat-minpoly.CNo doc
o*test-rat-solve.CNo doc
o*test-rational-matrix-factory.CNo doc
o*test-rational-reconstruction-base.CTests rational reconstruction using rational-cra2.h
o*test-rational-solver-adaptive.CNo doc
o*test-rational-solver.CNo doc
o*test-scalar-matrix.CNo doc
o*test-smith-form-adaptive.CNo doc
o*test-smith-form-binary.CNo doc
o*test-smith-form-iliopoulos.CNo doc
o*test-smith-form-local.CNo doc
o*test-smith-form.CNo doc
o*test-solve.CNo doc
o*test-sparse.CNo doc
o*test-subiterator.CNo doc
o*test-submatrix.CNo doc
o*test-subvector.CNo doc
o*test-sum.CNo doc
o*test-toeplitz-det.CNo doc
o*test-toom-cook.CToom-cook multiplication routine
o*test-trace.CNo doc
o*test-transpose.CNo doc
o*test-triplesbb-omp.CNo doc
o*test-triplesbb.CNo doc
o*test-tutorial.CNo doc
o*test-vector-domain.CNo doc
o*test-zero-one.CNo doc
o*timer.hLinBox timer is Givaro's
o*toeplitz.hPartial Specialization of Toeplitz for Dense vectors from an FFT based on Shoup's NTL library
o*valence.CValence of sparse matrix over Z or Zp
o*vector-traits.hVector traits
o*whisart_trace.hWhisart trace Computes the trace of D1 B D2 B^T D1 or D1 B^T D2 B D1
o*wiedemann.hMinpoly computation and Wiedeman solvers
o*zero-one.inlNO DOC
o*zo-gf2.inlNO DOC
\*zo.hWe define a blackbox class of the same name as that in zero-one.h, hence we use the same name here