![]() |
Reference documentation for deal.II version 9.1.1
|
#include <deal.II/lac/block_sparsity_pattern.h>
Public Member Functions | |
| BlockSparsityPattern ()=default | |
| 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) | |
| BlockSparsityPattern (const std::vector< IndexSet > &row_parallel_partitioning, const std::vector< IndexSet > &column_parallel_partitioning, const std::vector< IndexSet > &writeable_rows, 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) |
| void | reinit (const std::vector< IndexSet > &row_parallel_partitioning, const std::vector< IndexSet > &column_parallel_partitioning, const MPI_Comm &communicator=MPI_COMM_WORLD) |
| void | reinit (const std::vector< IndexSet > &row_parallel_partitioning, const std::vector< IndexSet > &column_parallel_partitioning, const std::vector< IndexSet > &writeable_rows, const MPI_Comm &communicator=MPI_COMM_WORLD) |
Public Member Functions inherited from BlockSparsityPatternBase< SparsityPattern > | |
| BlockSparsityPatternBase () | |
| BlockSparsityPatternBase (const size_type n_block_rows, const size_type n_block_columns) | |
| BlockSparsityPatternBase (const BlockSparsityPatternBase &bsp) | |
| ~BlockSparsityPatternBase () override | |
| 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 |
Public Member Functions inherited from Subscriptor | |
| Subscriptor () | |
| Subscriptor (const Subscriptor &) | |
| Subscriptor (Subscriptor &&) noexcept | |
| virtual | ~Subscriptor () |
| Subscriptor & | operator= (const Subscriptor &) |
| Subscriptor & | operator= (Subscriptor &&) noexcept |
| void | subscribe (std::atomic< bool > *const validity, const std::string &identifier="") const |
| void | unsubscribe (std::atomic< bool > *const validity, const std::string &identifier="") const |
| unsigned int | n_subscriptions () const |
| template<typename StreamType > | |
| void | list_subscribers (StreamType &stream) const |
| void | list_subscribers () const |
| template<class Archive > | |
| void | serialize (Archive &ar, const unsigned int version) |
This class extends the base class to implement an array of Trilinos sparsity patterns that can be used to initialize Trilinos block sparse matrices that can be distributed among different processors. It is used in the same way as the BlockSparsityPattern except that it builds upon the TrilinosWrappers::SparsityPattern instead of the SparsityPattern.
This class is has properties of the "dynamic" type of Sparsity patterns (in the sense that it can extend the memory if too little elements were allocated), but otherwise is more like the basic deal.II SparsityPattern (in the sense that the method compress() needs to be called before the pattern can be used).
This class is used in step-32.
Definition at line 626 of file block_sparsity_pattern.h.
1.8.16