
Public Member Functions | |
| BlockCompressedSimpleSparsityPattern () | |
| BlockCompressedSimpleSparsityPattern (const unsigned int n_rows, const unsigned int n_columns) | |
| BlockCompressedSimpleSparsityPattern (const std::vector< unsigned int > &row_block_sizes, const std::vector< unsigned int > &col_block_sizes) | |
| BlockCompressedSimpleSparsityPattern (const std::vector< IndexSet > &partitioning) | |
| void | reinit (const std::vector< unsigned int > &row_block_sizes, const std::vector< unsigned int > &col_block_sizes) |
| void | reinit (const std::vector< IndexSet > &partitioning) |
This class extends the base class to implement an array of compressed sparsity patterns that can be used to initialize objects of type BlockSparsityPattern. It is used in the same way as the BlockCompressedSparsityPattern except that it builds upon the CompressedSimpleSparsityPattern instead of the CompressedSparsityPattern. See the documentation of the BlockCompressedSparsityPattern for examples.
This class is an example of the "dynamic" type of Sparsity patterns.
Note: There are several, exchangeable variations of this class, see Sparsity patterns, section 'Dynamic block sparsity patterns' for more information.
This class is used in step-22 and step-31.
Definition at line 878 of file block_sparsity_pattern.h.
| BlockCompressedSimpleSparsityPattern::BlockCompressedSimpleSparsityPattern | ( | ) |
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.
| BlockCompressedSimpleSparsityPattern::BlockCompressedSimpleSparsityPattern | ( | const unsigned int | n_rows, |
| const unsigned int | 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.
| BlockCompressedSimpleSparsityPattern::BlockCompressedSimpleSparsityPattern | ( | const std::vector< unsigned int > & | row_block_sizes, |
| const std::vector< unsigned int > & | 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.
| BlockCompressedSimpleSparsityPattern::BlockCompressedSimpleSparsityPattern | ( | const std::vector< IndexSet > & | partitioning ) |
Initialize the pattern with symmetric blocks. The number of IndexSets in the vector determine the number of rows and columns of blocks. The size of each block is determined by the size() of the respective IndexSet. Each block only stores the rows given by the values in the IndexSet, which is useful for distributed memory parallel computations and usually corresponds to the locally owned DoFs.
| void BlockCompressedSimpleSparsityPattern::reinit | ( | const std::vector< unsigned int > & | row_block_sizes, |
| const std::vector< unsigned int > & | col_block_sizes | ||
| ) |
Resize the pattern 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 BlockCompressedSimpleSparsityPattern::reinit | ( | const std::vector< IndexSet > & | partitioning ) |
Resize the pattern with symmetric blocks determined by the size() of each IndexSet. See the constructor taking a vector of IndexSets for details.
documentation generated on Fri Feb 3 2012 06:04:05 by
doxygen
1.7.2