![]() |
Reference documentation for deal.II version 8.1.0
|
Public Member Functions | |
BlockSparsityPattern () | |
BlockSparsityPattern (const size_type n_rows, const size_type n_columns) | |
BlockSparsityPattern (const std::vector< size_type > &row_block_sizes, const std::vector< size_type > &col_block_sizes) | |
BlockSparsityPattern (const std::vector< Epetra_Map > ¶llel_partitioning) | |
BlockSparsityPattern (const std::vector< IndexSet > ¶llel_partitioning, const MPI_Comm &communicator=MPI_COMM_WORLD) | |
void | reinit (const std::vector< size_type > &row_block_sizes, const std::vector< size_type > &col_block_sizes) |
void | reinit (const std::vector< Epetra_Map > ¶llel_partitioning) |
void | reinit (const std::vector< IndexSet > ¶llel_partitioning, const MPI_Comm &communicator=MPI_COMM_WORLD) |
![]() | |
BlockSparsityPatternBase () | |
BlockSparsityPatternBase (const size_type n_block_rows, const size_type n_block_columns) | |
BlockSparsityPatternBase (const BlockSparsityPatternBase &bsp) | |
~BlockSparsityPatternBase () | |
void | reinit (const size_type n_block_rows, const size_type n_block_columns) |
BlockSparsityPatternBase & | operator= (const BlockSparsityPatternBase &) |
void | collect_sizes () |
SparsityPattern & | block (const size_type row, const size_type column) |
const SparsityPattern & | block (const size_type row, const size_type column) const |
const BlockIndices & | get_row_indices () const |
const BlockIndices & | get_column_indices () const |
void | compress () |
size_type | n_block_rows () const |
size_type | n_block_cols () const |
bool | empty () const |
size_type | max_entries_per_row () const |
void | add (const size_type i, const size_type j) |
void | add_entries (const size_type row, ForwardIterator begin, ForwardIterator end, const bool indices_are_sorted=false) |
size_type | n_rows () const |
size_type | n_cols () const |
bool | exists (const size_type i, const size_type j) const |
unsigned int | row_length (const size_type row) const |
size_type | n_nonzero_elements () const |
void | print (std::ostream &out) const |
void | print_gnuplot (std::ostream &out) const |
DeclException4 (ExcIncompatibleRowNumbers, int, int, int, int,<< "The blocks ["<< arg1<< ','<< arg2<< "] and ["<< arg3<< ','<< arg4<< "] have differing row numbers.") | |
DeclException4 (ExcIncompatibleColNumbers, int, int, int, int,<< "The blocks ["<< arg1<< ','<< arg2<< "] and ["<< arg3<< ','<< arg4<< "] have differing column numbers.") | |
DeclException0 (ExcInvalidConstructorCall) | |
![]() | |
Subscriptor () | |
Subscriptor (const Subscriptor &) | |
virtual | ~Subscriptor () |
Subscriptor & | operator= (const Subscriptor &) |
void | subscribe (const char *identifier=0) const |
void | unsubscribe (const char *identifier=0) const |
unsigned int | n_subscriptions () const |
void | list_subscribers () const |
DeclException3 (ExcInUse, int, char *, std::string &,<< "Object of class "<< arg2<< " is still used by "<< arg1<< " other objects.\n"<< "(Additional information: "<< arg3<< ")\n"<< "Note the entry in the Frequently Asked Questions of "<< "deal.II (linked to from http://www.dealii.org/) for "<< "more information on what this error means.") | |
DeclException2 (ExcNoSubscriber, char *, char *,<< "No subscriber with identifier \""<< arg2<< "\" did subscribe to this object of class "<< arg1) | |
template<class Archive > | |
void | serialize (Archive &ar, const unsigned int version) |
Additional Inherited Members | |
![]() | |
typedef types::global_dof_index | size_type |
![]() | |
static const size_type | invalid_entry |
![]() | |
size_type | rows |
size_type | columns |
Table< 2, SmartPointer < SparsityPattern, BlockSparsityPatternBase < SparsityPattern > > > | sub_objects |
BlockIndices | row_indices |
BlockIndices | column_indices |
Definition at line 1013 of file block_sparsity_pattern.h.
TrilinosWrappers::BlockSparsityPattern::BlockSparsityPattern | ( | ) |
Initialize the matrix empty, that is with no memory allocated. This is useful if you want such objects as member variables in other classes. You can make the structure usable by calling the reinit() function.
TrilinosWrappers::BlockSparsityPattern::BlockSparsityPattern | ( | const size_type | n_rows, |
const size_type | n_columns | ||
) |
Initialize the matrix with the given number of block rows and columns. The blocks themselves are still empty, and you have to call collect_sizes() after you assign them sizes.
TrilinosWrappers::BlockSparsityPattern::BlockSparsityPattern | ( | const std::vector< size_type > & | row_block_sizes, |
const std::vector< size_type > & | col_block_sizes | ||
) |
Initialize the pattern with two BlockIndices for the block structures of matrix rows and columns. This function is equivalent to calling the previous constructor with the length of the two index vector and then entering the index values.
TrilinosWrappers::BlockSparsityPattern::BlockSparsityPattern | ( | const std::vector< Epetra_Map > & | parallel_partitioning | ) |
Initialize the pattern with an array Epetra_Map that specifies both rows and columns of the matrix (so the final matrix will be a square matrix), where the Epetra_Map specifies the parallel distribution of the degrees of freedom on the individual block. This function is equivalent to calling the second constructor with the length of the mapping vector and then entering the index values.
TrilinosWrappers::BlockSparsityPattern::BlockSparsityPattern | ( | const std::vector< IndexSet > & | parallel_partitioning, |
const MPI_Comm & | communicator = MPI_COMM_WORLD |
||
) |
Initialize the pattern with an array of index sets that specifies both rows and columns of the matrix (so the final matrix will be a square matrix), where the size() of the IndexSets specifies the size of the blocks and the values in each IndexSet denotes the rows that are going to be saved in each block.
void TrilinosWrappers::BlockSparsityPattern::reinit | ( | const std::vector< size_type > & | row_block_sizes, |
const std::vector< size_type > & | col_block_sizes | ||
) |
Resize the matrix to a tensor product of matrices with dimensions defined by the arguments.
The matrix will have as many block rows and columns as there are entries in the two arguments. The block at position (i,j) will have the dimensions row_block_sizes[i]
times col_block_sizes[j]
.
void TrilinosWrappers::BlockSparsityPattern::reinit | ( | const std::vector< Epetra_Map > & | parallel_partitioning | ) |
Resize the matrix to a square tensor product of matrices with parallel distribution according to the specifications in the array of Epetra_Maps.
void TrilinosWrappers::BlockSparsityPattern::reinit | ( | const std::vector< IndexSet > & | parallel_partitioning, |
const MPI_Comm & | communicator = MPI_COMM_WORLD |
||
) |
Resize the matrix to a square tensor product of matrices. See the constructor that takes a vector of IndexSets for details.