A general sparsity pattern implementation using the full pattern of the basis by adding all local indices. More...

Public Member Functions
template<class Basis >
	SparsityPattern (Basis const &basis, SymmetryStructure symmetry=SymmetryStructure::unknown)

template<class RowBasis , class ColBasis >
	SparsityPattern (RowBasis const &rowBasis, ColBasis const &colBasis, SymmetryStructure symmetry=SymmetryStructure::unknown)

std::size_t	rows () const
	Number of rows in the matrix.

std::size_t	cols () const
	Number of columns in the matrix.

std::size_t	avgRowSize () const
	Average number of non-zeros per row.

std::size_t	rowSize (std::size_t r) const
	Number of non-zeros in row r.

std::size_t	nnz () const
	Total number of non-zeros.

template<class Matrix >
void	applyTo (Matrix &matrix) const
	Initialize a matrix with the non-zero structure.

Protected Member Functions
template<class Basis >
void	init (Basis const &basis)

template<class RowBasis , class ColBasis >
void	init (RowBasis const &rowBasis, ColBasis const &colBasis)

Detailed Description

A general sparsity pattern implementation using the full pattern of the basis by adding all local indices.

The documentation for this class was generated from the following file:

/home/docs/checkouts/readthedocs.org/user_builds/amdis-test/checkouts/develop/amdis/linearalgebra/SparsityPattern.hpp

Public Member Functions