sparse Directory Reference

Containers and algorithms for sparse linear algebra. [tutorial] .

More...

Directory dependency graph for sparse:

Files
file	bothcat.h [code]
	Routines to concatenate SparseMatrix's in two-by-two fashion.
file	conjugate.h [code]
	Returns a conjugated copy of a SparseMatrix.
file	diag.h [code]
	Returns the diagonal of a SparseMatrix.
file	diagcat.h [code]
	Routines to concatenate SparseMatrix's in diagonal fashion.
file	dimm.h [code]
	Routines for multiplying by a DiagonalMatrix.
file	equilibrate.h [code]
	Rescales rows and columns of a symmetric SparseMatrix A, prior to direct factorization.
file	expr.h [code]
	Overloads expr() for SparseMatrix<Number> and Pattern.
file	flip.h [code]
	Routines for flipping (reversing) SparseMatrix's.
file	frobenius.h [code]
	Returns frobenius norm of a SparseMatrix.
file	gemm.h [code]
	Variety of routines for mixed dense*sparse or dense*sparse matrix multiplies. The dense*dense case is already covered by dense/gemm.h, and the sparse*sparse case is within sparse/multiply.h. However, if both A and B are sparse, it's more common to treat the product (A*B) as a cascade of two operators, e.g. Y = A*(B*X), etc.
file	gemv.h [code]
	Signatures for sparse matrix * dense vector multiplies. All delegate to gemm() under the hood.
file	hemm.h [code]
	Routines for hermitian SparseMatrix * dense Matrix multiplication.
file	hermitian.h [code]
	Returns a hermitian copy of a SparseMatrix.
file	horzcat.h [code]
	Routines to concatenate SparseMatrix's in left/right fashion.
file	laplacian.h [code]
	Helper routines for making a graph laplacian from a PatternBuilder.
file	laplacian1.h [code]
	Helper routines for reordering/filling 1D structured grids. Used by many unit tests.
file	laplacian2.h [code]
	Helper routines for reordering/filling 2D structured grids. Used by many unit tests.
file	laplacian3.h [code]
	Helper routines for reordering/filling 3D structured grids. Used by many unit tests.
file	lower_precision.h [code]
	Routines for copying and lowering the precision of a SparseMatrix.
file	matrixmarket.h [code]
	Writes/reads a SparseMatrix to/from a MatrixMarket file (*.mtx) See http://math.nist.gov/MatrixMarket/ for test inputs in this format.
file	minmax.h [code]
	Routines to find the extremal values of a SparseMatrix.
file	multiply.h [code]
	Routines to multiply "fat inner products" of SparseMatrix's, C = A'A and C = A'B.
file	Pattern.h [code]
	Container class for a sparse nonzero pattern, used in reordering/symbolic analysis.
file	PatternBuilder.h [code]
	Builder class for a sparse nonzero pattern, used in reordering/symbolic analysis.
file	PatternRange.h [code]
	Range/Iterator types associated with Pattern.
file	perm2sparse.h [code]
	Makes an explicit SparseMatrix from a permutation vector.
file	Permutation.h [code]
	Aggregates a (perm, iperm, swaps) triple into a vocabulary type.
file	permute.h [code]
	Given a SparseMatrix A and permutations P and Q, returns P'*A*Q.
file	phasor.h [code]
	Applies random phase shifts to a complex square SparseMatrix.
file	raise_precision.h [code]
	Routines for copying and raising the precision of a SparseMatrix.
file	SparseMatrix.h [code]
	General purpose compressed-sparse-column (CSC) container.
file	SparseMatrixBuilder.h [code]
	Convenience type for building SparseMatrix's, allow random access without fussing with upfront construction of a Pattern.
file	SparseMatrixRange.h [code]
	Range/Iterator types associated with SparseMatrix.
file	symm.h [code]
	Routines for symmetric SparseMatrix * dense Matrix multiplication.
file	threshold.h [code]
	Generates a SparseMatrix by thresholding a dense Matrix, or another SparseMatrix.
file	transpose.h [code]
	Returns a transposed copy of a SparseMatrix.
file	tril.h [code]
	Returns the lower triangle of a SparseMatrix.
file	triu.h [code]
	Returns the upper triangle of a SparseMatrixRange.
file	trmm.h [code]
	Routines for multiplying by a triangular SparseMatrix.
file	trsm.h [code]
	Routines for backsolving by a triangular SparseMatrix.
file	vertcat.h [code]
	Routines to concatenate SparseMatrix's in top/bottom fashion.

Detailed Description

Containers and algorithms for sparse linear algebra. [tutorial] .