LinBox Namespace Reference

Data Structures
class	FactorMult
class	FieldFactorMult
class	BlackboxBlockContainerBase
	A base class for BlackboxBlockContainer. The primary member function is begin(). It returns an iterator which after i increments (++) dereferences to $U A^i V$, for $U$ and $V$ determined by the init function. It is designed to be used with implementations of Block Berlekamp-Massey such as BlockMasseyDomain. More...
class	BlackboxBlockContainerBase::const_iterator
class	BlackboxBlockContainer
class	BlackboxBlockContainerRecord
class	BlackboxContainerBase
	A base class for BlackboxContainer. The primary member function is begin(). It returns an iterator which after i increments (++) dereferences to $v^T A^i u$, for $v$ and $u$ determined by the form of construction. It is designed to be used with implementations of Berlekamp-Massey such as MasseyDom. More...
class	BlackboxContainerBase::const_iterator
class	BlackboxContainerSymmetric
	See base class for doc. More...
class	BlackboxContainerSymmetrize
	Symmetrizing iterator (for rank computations). # //================================================================ // LinBox Project 1999 // Symmetrizing iterator (for rank computations) // Same left and right vector // A is supposed to have tranpose-vector product // the sequence is this->u^t this->u, (A this->u)^t (A this->u) = this->u^t (A^t A) this->u, // (A^t (A this->u))^t (A^t (A this->u)) = this->u^t (A^t A)^2 this->u , etc. // Time-stamp: <13 Jun 02 18:16:43 Jean-Guillaume.Dumas@imag.fr> // ================================================================ #. More...
class	BlackboxContainer
	Limited doc so far. More...
class	BlasMatrixDomainMulAdd
class	BlasMatrixDomainMul
class	BlasMatrixDomainMulin
class	BlasMatrixDomainInv
class	BlasMatrixDomainRank
class	BlasMatrixDomainDet
class	BlasMatrixDomainLeftSolve
class	BlasMatrixDomainRightSolve
class	BlasMatrixDomainMinpoly
class	BlasMatrixDomainCharpoly
class	BlasMatrixDomain
class	BlockLanczosSolver
class	BlockMasseyDomain
	Compute the linear generator of a sequence of matrices Giorgi, Jeannerod Villard algorithm from ISSAC'03 This class encapsulates the functionality required for computing the block minimal polynomial of a matrix. More...
class	BlockWiedemannSolver
struct	LazyProduct
struct	ChineseRemainder
class	CRA
class	DenseContainer
	Limited doc so far. More...
class	DiophantineSolver
	DiophantineSolver<QSolver> creates a diophantine solver using a QSolver to generate rational solutions Methods solve, randomSolve just expose functions from underlying rational solver. Method diophantineSolve creates a solution with minimal denominator, and can also create a certificate of minimality (described in 'Certified Dense Linear System Solving' by Mulders+Storjohann) which will be left in the public field lastCertificate. More...
class	Eliminator
class	GaussDomain
	Repository of functions for rank by elimination on sparse matrices. Several versions allow for adjustment of the pivoting strategy and for choosing in-place elimination or for not modifying the input matrix. Also an LU interface is offered. More...
class	LABlockLanczosSolver
class	LanczosSolver
	Solve a linear system using the conjugate Lanczos iteration. Lanczos system solver class. This class encapsulates the functionality required for solving a linear system through the conjugate Lanczos iteration. More...
class	LastInvariantFactor
	This is used in a Smith Form algorithm. This computes the last invariant factor of an integer matrix, whether zero or not, by rational solving. More...
class	LiftingContainer
class	LiftingContainerBase
class	LiftingContainerBase::const_iterator
class	DixonLiftingContainer
class	WiedemannLiftingContainer
class	BlockWiedemannLiftingContainer
class	MasseyDomain
	Berlekamp/Massey algorithm. Domain Massey Computation is stopped when the polynomials remain the same for more than EARLY_TERM_THRESOLD When minimal polynomial equals characteristic polynomial, 2 additional iterations are needed to compute it (parameter DEFAULT_ADDITIONAL_ITERATION), but those iterations are not needed for the rank. More...
struct	MatrixHomTrait
struct	MatrixHomTrait< DenseMatrixBase< typename Ring::Element >, Field >
struct	MatrixHomTrait< SparseMatrix< Ring, typename Vector< Ring >::SparseSeq >, Field >
struct	MatrixHomTrait< SparseMatrix< Ring, typename Vector< Ring >::SparsePar >, Field >
struct	MatrixHomTrait< SparseMatrix< Ring, typename Vector< Ring >::SparseMap >, Field >
struct	MatrixHomTrait< DenseMatrix< Ring >, Field >
struct	MatrixHomTrait< BlasBlackbox< Ring >, Field >
class	MatrixInverse
class	MatrixRank
class	MGBlockLanczosSolver
	Block Lanczos iteration. More...
class	MinPoly
class	MinPolyBlas
class	OneInvariantFactor
	Limited doc so far. More...
class	RationalReconstruction
	Limited doc so far. Used, for instance, after LiftingContainer. More...
class	RationalSolverAdaptive
class	RationalSolver
	interface for the different specialization of p-adic lifting based solvers. More...
class	RationalSolver< Ring, Field, RandomPrime, WiedemannTraits >
	partial specialization of p-adic based solver with Wiedemann algorithm More...
class	RationalSolver< Ring, Field, RandomPrime, BlockWiedemannTraits >
	partial specialization of p-adic based solver with block Wiedemann algorithm More...
class	RationalSolver< Ring, Field, RandomPrime, DixonTraits >
	partial specialization of p-adic based solver with Dixon algorithm More...
class	RationalSolver< Ring, Field, RandomPrime, NumericalTraits >
	partial specialization of p-adic based solver with a hybrid Numeric/Symbolic computation More...
class	Signature
class	Signature::BLAS_LPM_Method
class	Signature::Minpoly_Method
class	SmithFormAdaptive
class	SmithFormBinary
	Compute Smith form. More...
class	SmithFormIliopoulos
	This is Iliopoulos' algorithm do diagonalize. Compute Smith Form by elimination modulo m, for some modulus m such as S(n), the last invariant factor. The elimination method is originally described in "Worst Case Complexity Bounds on Algorithms for computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix", by Costas Iliopoulos. More...
class	SmithFormLocal
	Smith normal form (invariant factors) of a matrix over a local ring. More...
class	SmithFormLocal< Local2_32 >
class	VectorFraction
	VectorFraction<Domain> is a vector of rational elements with common reduced denominator. Here Domain is a ring supporting the gcd, eg NTL_ZZ or PID_integer For compatability with the return type of rationalSolver, it allows conversion from/to std::vector<std::pair<Domain::Element> >. All functions will return the fraction in reduced form, calling reduce() if necessary. More...
class	WiedemannSolver
	Linear system solvers based on Wiedemann's method. This class encapsulates all of the functionality for linear system solving with Wiedemann's algorithm. It includes the random solution and random nullspace element of Kaltofen and Saunders (1991), as well as the certificate of inconsistency of Giesbrecht, Lobo, and Saunders (1998). More...
class	BlasApply
class	MatrixApplyDomain
	blackbox apply optimizations More...
class	BlasMatrixApplyDomain
class	MatrixApplyDomain< Domain, BlasMatrix< typename Domain::Element > >
class	MatrixApplyDomain< Domain, DenseMatrix< Domain > >
class	MatrixApplyDomain< Domain, BlasBlackbox< Domain > >
class	BlackboxArchetype
	showing the member functions provided by all blackbox matrix classes. More...
class	BlackboxInterface
	This blackbox base class exists solely to aid documentation organization. More...
class	Thread
struct	BBBase
class	LessTypeInfo
class	BBThread
class	BlasBlackbox
	template <class> More...
struct	BlasBlackbox::rebind
struct	MatrixTraits< BlasBlackbox< Field > >
struct	MatrixTraits< const BlasBlackbox< Field > >
class	MatrixContainerTrait< BlasBlackbox< Field > >
class	MatrixContainerTrait< const BlasBlackbox< Field > >
class	Butterfly
	Switching Network based BlackBox Matrix. A good preconditioner. More...
struct	Butterfly::rebind
struct	Companion
	Companion matrix of a monic polynomial. More...
struct	Companion::rebind
class	Compose
	General case. More...
struct	Compose::rebind
class	Compose< _Blackbox, _Blackbox >
	specialization for _Blackbox1 = _Blackbox2 More...
struct	Compose< _Blackbox, _Blackbox >::rebind
class	ComposeTraits
	used in ..., for example More...
class	ComposeTraits< DenseMatrix< Field > >
	used in smith-binary, for example More...
class	DenseMatrix
	Blackbox interface to dense matrix representation. More...
struct	DenseMatrix::rebind
struct	MatrixTraits< DenseMatrix< Field > >
struct	MatrixTraits< const DenseMatrix< Field > >
class	DenseMatrixFactory
class	Diagonal
	General diagonal, not be implemented. More...
class	Diagonal< _Field, VectorCategories::DenseVectorTag >
	Specialization of Diagonal for application to dense vectors. More...
struct	Diagonal< _Field, VectorCategories::DenseVectorTag >::rebind
class	Diagonal< Field, VectorCategories::SparseSequenceVectorTag >
	Specialization of Diagonal for application to sparse sequence vectors. More...
struct	Diagonal< Field, VectorCategories::SparseSequenceVectorTag >::rebind
class	Diagonal< Field, VectorCategories::SparseAssociativeVectorTag >
	Specialization of Diagonal for application to sparse associative vectors. More...
struct	Diagonal< Field, VectorCategories::SparseAssociativeVectorTag >::rebind
class	Dif
	Blackbox of a difference: C := A - B, i.e. Cx = Ax - Bx. More...
struct	Dif::rebind
class	DirectSum
	If C = DirectSum(A, B) and y = xA and z = wB, then (y,z) = (x,w)C. More...
struct	DirectSum::rebind
class	DirectSum< Blackbox, Blackbox >
struct	DirectSum< Blackbox, Blackbox >::rebind
class	BlackboxFactory
	A tool for computations with integer and rational matrices. The blackbox factory provides a facility for performing integer or rational computations by reducing modulo one or more primes and recovering the solution with Chinese Remaindering, lifting, or rational reconstruction. It is an interface that provides one method which, given a field, produces a black box representing a particular matrix over that field. The factory object may be passed to various procedures, such as rank, det, and solve, which will perform the required modular reductions to find integer or rational solutions. More...
class	Frobenius
	template <class> More...
struct	Frobenius::rebind
class	Hilbert
	Example of a blackbox that is space efficient, though not time efficient. More...
struct	Hilbert::rebind
class	Hilbert< _Field, VectorCategories::DenseVectorTag >
class	Hilbert< _Field, VectorCategories::SparseSequenceVectorTag >
class	Hilbert< _Field, VectorCategories::SparseAssociativeVectorTag >
class	Inverse
	A Blackbox for the inverse. Not efficient if many applications are used. More...
struct	Inverse::rebind
class	MoorePenrose
	Generalized inverse of a blackbox. Efficiency concerns when many applications are used. More...
struct	MoorePenrose::rebind
class	Hankel
	template <class> More...
struct	Hankel::rebind
class	Sylvester
	template <class> More...
struct	Sylvester::rebind
class	Toeplitz
	This is the blackbox representation of a Toeplitz matrix. More...
struct	Toeplitz::rebind
class	NullMatrix
	This is a representation of the 0 by 0 empty matrix which does not occupy memory. It has it's uses! More...
struct	NullMatrix::rebind
class	Permutation
	size is n. More...
struct	Permutation::rebind
class	PolynomialBB
	represent the matrix P(A) where A is a blackbox and P a polynomial More...
struct	PolynomialBB::rebind
class	RandomMatrixTraits
class	RandomMatrix
struct	RandomMatrix::rebind
class	ScalarMatrix
	Blackbox for aI. Use particularly for representing 0 and I. More...
struct	ScalarMatrix::rebind
class	SCompose
class	SparseMatrix
	vector of sparse rows. More...
struct	SparseMatrix::rebind
class	SparseMatrixFactory
struct	MatrixTraits< SparseMatrix< Field, _Row > >
struct	MatrixTraits< const SparseMatrix< Field, _Row > >
class	SubMatrixTraits< DenseMatrix< Field > >
class	SubMatrixTraits< Submatrix< DenseMatrix< Field > > >
class	Submatrix
class	Submatrix< Blackbox, VectorCategories::DenseVectorTag >
struct	Submatrix< Blackbox, VectorCategories::DenseVectorTag >::rebind
class	Submatrix< DenseMatrix< _Field >, VectorCategories::DenseVectorTag >
struct	Submatrix< DenseMatrix< _Field >, VectorCategories::DenseVectorTag >::rebind
class	SubRowMatrix< Matrix, MatrixCategories::RowMatrixTag >
struct	SubRowMatrix< Matrix, MatrixCategories::RowMatrixTag >::rebind
class	Sum
	blackbox of a matrix sum without copying. More...
struct	Sum::rebind
class	Transpose
	transpose matrix without copying. More...
struct	Transpose::rebind
class	TriplesBB
	wrapper for NAG Sparse Matrix format. More...
struct	TriplesBB::rebind
class	ZeroOne
	Time and space efficient representation of sparse {0,1}-matrices. More...
struct	ZeroOne::rebind
class	ElementAbstract
	Abstract element base class, a technicality. More...
class	ElementArchetype
	Field and Ring element interface specification and archetypical instance class. More...
class	ElementEnvelope
	Adaptor from archetypical interface to abstract interface, a technicality. More...
class	GivPolynomial
	Polynomials over a domain. More...
struct	GivPolynomial::rebind
class	GMPRationalElement
	elements of GMP_Rationals. More...
class	FFLAS
	BLAS for matrices over finite fields. More...
class	FFPACK
	Set of elimination based routines for dense linear algebra with matrices over finite prime field of characteristic less than 2^26. More...
class	FieldAbstract
	field base class. More...
class	FieldArchetype
	field specification and archetypical instance. More...
class	FieldEnvelope
	Derived class used to implement the field archetype. More...
class	FieldInterface
	This field base class exists solely to aid documentation organization. More...
class	RingCategories
struct	RingCategories::GenericTag
struct	RingCategories::ModularTag
struct	RingCategories::IntegerTag
struct	RingCategories::RationalTag
struct	ClassifyRing
struct	FieldTraits
struct	ClassifyRing< GF2 >
class	GF2
struct	ClassifyRing< GivaroExtension< BaseField > >
struct	FieldTraits< GivaroExtension< BaseField > >
struct	GivaroField
	give LinBox fields an allure of Givaro Fields More...
class	GivaroExtension
class	GivaroExtension< GivaroGfq >
class	Hom< BaseField, GivaroExtension< BaseField > >
struct	ClassifyRing< GivaroGfq >
class	GivaroGfq
struct	ClassifyRing< GivaroMontg >
class	GivaroMontg
	wrapper of Givaro's Montgomery<Std32>. More...
struct	ClassifyRing< GivaroRational >
class	GivaroRational
struct	ClassifyRing< GivaroZpz< Tag > >
class	GivaroZpz
	wrapper of Givaro's ZpzDom. More...
class	FieldAXPY< GivaroZpz< Std32 > >
class	FieldAXPY< GivaroZpz< Std16 > >
class	DotProductDomain< GivaroZpz< Std32 > >
class	DotProductDomain< GivaroZpz< Std16 > >
struct	ClassifyRing< GMP_Integers >
struct	ClassifyRing< GMPRationalField >
class	GMPRationalField
class	NoHomError
	Error object for attempt to establish a Hom that cannot exist. More...
class	Hom
	map element of source ring(field) to target ring More...
class	Hom< Source, Source >
struct	ClassifyRing< LidiaGfq >
class	LidiaGfq
	defines the Galois Field GF(pk). More...
struct	ClassifyRing< Local2_32 >
struct	Local2_32
	Fast arithmetic mod 2^32, including gcd. More...
struct	ClassifyRing< Modular< int > >
class	Modular< int >
	template <> More...
class	FieldAXPY< Modular< int > >
class	DotProductDomain< Modular< int > >
struct	ClassifyRing< Modular< int32 > >
class	Modular< int32 >
	template <> More...
class	FieldAXPY< Modular< int32 > >
class	DotProductDomain< Modular< int32 > >
struct	ClassifyRing< Modular< int8 > >
class	Modular< int8 >
	Specialization of Modular to signed 8 bit element type with efficient dot product. More...
class	FieldAXPY< Modular< int8 > >
class	DotProductDomain< Modular< int8 > >
class	MVProductDomain< Modular< int8 > >
struct	ClassifyRing< Modular< double > >
class	Modular< double >
	template <> More...
class	FieldAXPY< Modular< double > >
class	DotProductDomain< Modular< double > >
class	MVProductDomain< Modular< int32 > >
struct	ClassifyRing< Modular< short > >
class	Modular< int16 >
	Specialization of Modular to short element type with efficient dot product. More...
class	FieldAXPY< Modular< int16 > >
class	DotProductDomain< Modular< int16 > >
class	MVProductDomain< Modular< int16 > >
struct	ClassifyRing< Modular< Element > >
class	ModularBase
class	Modular
	Prime fields of positive characteristic implemented directly in LinBox. More...
class	Modular< uint8 >
	Allows compact storage when the modulus is less than 2^8. More...
class	Modular< uint16 >
	Specialization of class Modular for uint16 element type. More...
class	Modular< uint32 >
	Specialization of class Modular for uint32 element type. More...
class	FieldAXPY< Modular< _Element > >
class	FieldAXPY< Modular< uint8 > >
class	FieldAXPY< Modular< uint16 > >
class	FieldAXPY< Modular< uint32 > >
class	DotProductDomain< Modular< uint8 > >
class	DotProductDomain< Modular< uint16 > >
class	DotProductDomain< Modular< uint32 > >
class	MVProductDomain< Modular< uint8 > >
class	MVProductDomain< Modular< uint16 > >
class	MVProductDomain< Modular< uint32 > >
struct	ClassifyRing< UnparametricRandIter< NTL::GF2E > >
class	UnparametricRandIter< NTL::GF2E >
	template<> More...
class	NTL_GF2E
struct	ClassifyRing< NTL_zz_p >
struct	NTL_zz_p
struct	ClassifyRing< UnparametricRandIter< NTL::zz_pE > >
class	UnparametricRandIter< NTL::zz_pE >
struct	ClassifyRing< NTL_PID_zz_p >
struct	NTL_PID_zz_p
	extend Wrapper of zz_p from NTL. Add PID functions More...
struct	ClassifyRing< UnparametricField< NTL::RR > >
struct	ClassifyRing< NTL_ZZ >
class	FieldAXPY< NTL_ZZ >
struct	ClassifyRing< UnparametricField< NTL::ZZ_p > >
struct	NTL_ZZ_p
struct	ClassifyRing< UnparametricRandIter< NTL::ZZ_pE > >
class	UnparametricRandIter< NTL::ZZ_pE >
class	NTL_ZZ_pE
class	ParamFuzzy
struct	ClassifyRing< PID_integer >
struct	ClassifyRIng< PIRModular< int > >
class	PIRModular< int >
	template <> More...
class	FieldAXPY< PIRModular< int > >
class	DotProductDomain< PIRModular< int > >
class	MVProductDomain< PIRModular< int32 > >
struct	ClassifyRIng< PIRModular< int32 > >
class	PIRModular< int32 >
	template <> More...
class	FieldAXPY< PIRModular< int32 > >
class	DotProductDomain< PIRModular< int32 > >
struct	ClassifyRIng< PIR_ntl_ZZ_p >
class	PIR_ntl_ZZ_p
	extend Wrapper of ZZ_p from NTL. Add PIR functions More...
class	FieldAXPY< PIR_ntl_ZZ_p >
class	DotProductDomain< PIR_ntl_ZZ_p >
class	MVProductDomain< PIR_ntl_ZZ_p >
struct	Rebind
	used in support of Hom, MatrixHom More...
struct	ClassifyRing< UnparametricField< K > >
class	UnparametricField
class	FieldAXPY< UnparametricField< integer > >
class	BlackboxSymmetrizeIterator
class	MatrixArchetype
struct	MatrixTraits< MatrixArchetype< Element > >
class	MatrixContainerTrait< BlasMatrix< typename Field::Element > >
class	MatrixContainerTrait< const BlasMatrix< typename Field::Element > >
class	BlasMatrix
	Limited docs so far. More...
class	BlasTag
class	TriangularBlasMatrix
struct	MatrixTraits< BlasMatrix< Element > >
struct	MatrixTraits< const BlasMatrix< Element > >
class	indexDomain
class	BlasPermutation
class	TransposedBlasMatrix
class	TransposedBlasMatrix< TransposedBlasMatrix< Matrix > >
class	DenseRowsMatrix
struct	MatrixTraits< DenseRowsMatrix< Row > >
class	DenseSubmatrix
struct	DenseSubmatrix::rebind
struct	MatrixTraits< DenseSubmatrix< Element > >
class	DenseMatrixBase
struct	DenseMatrixBase::rebind
struct	MatrixTraits< DenseMatrixBase< Element > >
struct	MatrixTraits< const DenseMatrixBase< Element > >
class	FactorizedMatrixLeftSolve
class	FactorizedMatrixRightSolve
class	FactorizedMatrixLeftLSolve
class	FactorizedMatrixRightLSolve
class	FactorizedMatrixLeftUSolve
class	FactorizedMatrixRightUSolve
class	LQUPMatrix
struct	MatrixContainerCategory
struct	MatrixContainerCategory::BlasContainer
struct	MatrixContainerCategory::Container
struct	MatrixContainerCategory::Blackbox
class	MatrixContainerTrait
class	MatrixContainerTrait< DenseMatrixBase< typename Field::Element > >
class	MatrixContainerTrait< SparseMatrixBase< typename Field::Element > >
class	MatrixContainerTrait< DenseMatrix< Field > >
class	MatrixContainerTrait< SparseMatrix< Field > >
struct	MatrixCategories
	For specializing matrix arithmetic. More...
struct	MatrixCategories::BlackboxTag
struct	MatrixCategories::RowMatrixTag
struct	MatrixCategories::ColMatrixTag
struct	MatrixCategories::RowColMatrixTag
struct	MatrixTraits
class	MVProductDomain
	Helper class to allow specializations of certain matrix-vector products. More...
class	MatrixDomain
	Class of matrix arithmetic functions. More...
class	InvalidMatrixInput
class	FieldIO
	Dummy field for conceptually unclear io. More...
class	SparseMatrixWriteHelper
class	SparseMatrixWriteHelper::NoField
class	SparseMatrixReadWriteHelper
class	SparseMatrixWriteHelper< _Element, Row, VectorCategories::SparseParallelVectorTag >
class	SparseMatrixWriteHelper< _Element, Row, VectorCategories::SparseParallelVectorTag >::NoField
class	SparseMatrixBase
struct	SparseMatrixBase::rebind
class	SparseMatrixBase< _Element, _Row, VectorCategories::SparseSequenceVectorTag >
struct	SparseMatrixBase< _Element, _Row, VectorCategories::SparseSequenceVectorTag >::rebind
class	SparseMatrixBase< _Element, _Row, VectorCategories::SparseSequenceVectorTag >::_RawIterator
class	SparseMatrixBase< _Element, _Row, VectorCategories::SparseSequenceVectorTag >::_RawIndexedIterator
class	SparseMatrixBase< _Element, _Row, VectorCategories::SparseAssociativeVectorTag >
struct	SparseMatrixBase< _Element, _Row, VectorCategories::SparseAssociativeVectorTag >::rebind
class	SparseMatrixBase< _Element, _Row, VectorCategories::SparseAssociativeVectorTag >::_RawIterator
class	SparseMatrixBase< _Element, _Row, VectorCategories::SparseAssociativeVectorTag >::_RawIndexedIterator
class	SparseMatrixBase< _Element, _Row, VectorCategories::SparseParallelVectorTag >
struct	SparseMatrixBase< _Element, _Row, VectorCategories::SparseParallelVectorTag >::rebind
class	SparseMatrixBase< _Element, _Row, VectorCategories::SparseParallelVectorTag >::_RawIterator
class	SparseMatrixBase< _Element, _Row, VectorCategories::SparseParallelVectorTag >::_RawIndexedIterator
struct	MatrixTraits< SparseMatrixBase< Element, Row, Trait > >
struct	MatrixTraits< const SparseMatrixBase< Element, Row, Trait > >
class	TransposeMatrix
class	TransposeMatrix< Matrix, MatrixCategories::RowColMatrixTag >
class	TransposeMatrix< Matrix, MatrixCategories::RowMatrixTag >
class	TransposeMatrix< Matrix, MatrixCategories::ColMatrixTag >
struct	MatrixTraits< TransposeMatrix< Matrix, MatrixCategories::RowColMatrixTag > >
struct	MatrixTraits< TransposeMatrix< Matrix, MatrixCategories::RowMatrixTag > >
struct	MatrixTraits< TransposeMatrix< Matrix, MatrixCategories::ColMatrixTag > >
struct	MatrixTraits< const TransposeMatrix< Matrix, MatrixCategories::RowColMatrixTag > >
struct	MatrixTraits< const TransposeMatrix< Matrix, MatrixCategories::RowMatrixTag > >
struct	MatrixTraits< const TransposeMatrix< Matrix, MatrixCategories::ColMatrixTag > >
class	RandIterAbstract
class	RandIterArchetype
class	RandIterEnvelope
class	GenericRandIter
class	GF2RandIter
class	GmpRandomPrime
	generating random prime integers, using the gmp library. More...
class	GMPRationalRandIter
class	LidiaGfqRandIter
class	MersenneTwister
class	ModularRandIter
class	ModularBase::RandIter
class	NonzeroRandIter
class	NTL_ZZRandIter
class	ParamFuzzyRandIter
class	RandomPrime
class	UnparametricRandIter
class	RingAbstract
	Abstract ring base class. More...
class	RingArchetype
	specification and archetypic instance for the ring interface More...
class	RingEnvelope
	implement the ring archetype to minimize code bloat. More...
class	GivPolynomialRing
	polynomials with coefficients modulo some power of two More...
class	PowerOfTwoModular
	Ring of elements modulo some power of two. More...
struct	PowerOfTwoModular::RandIter
class	RingInterface
	This ring base class exists solely to aid documentation organization. More...
struct	IntegerModularDet
struct	Specifier
struct	HybridSpecifier
struct	BlackboxSpecifier
struct	EliminationSpecifier
struct	WiedemannTraits
struct	LanczosTraits
struct	BlockLanczosTraits
struct	SparseEliminationTraits
struct	DixonTraits
struct	BlockWiedemannTraits
struct	NumericalTraits
struct	BlasEliminationTraits
struct	NonBlasEliminationTraits
struct	Method
	Method specifiers for controlling algorithm choice. More...
struct	SolverTraits
class	SolveFailed
class	InconsistentSystem
struct	IntegerModularMinpoly
class	SolverConcept
	showing functions expected of solver objects More...
class	Valence
class	Wiedemann
	solutions all based on Wiedemann's algorithm. More...
class	BooleanSwitch
class	BooleanSwitchFactory
class	CekstvSwitch
class	CekstvSwitchFactory
struct	LessThanString
class	ActivityState
	used by commentator More...
class	Commentator
	give information to user during runtime More...
struct	Commentator::StepsAndTime
struct	Commentator::Activity
class	MessageClass
class	PreconditionFailed
class	LinboxError
class	LinboxMathError
class