9 #include <dolfinx/common/MPI.h>
44 const std::array<std::shared_ptr<const common::IndexMap>, 2>& maps,
45 const std::array<int, 2>& bs);
59 const std::vector<std::vector<const SparsityPattern*>>& patterns,
62 std::pair<std::reference_wrapper<const common::IndexMap>,
int>>,
64 const std::array<std::vector<int>, 2>& bs);
78 void insert(
const std::span<const std::int32_t>& rows,
79 const std::span<const std::int32_t>& cols);
93 std::shared_ptr<const common::IndexMap>
index_map(
int dim)
const;
120 std::int32_t
nnz_diag(std::int32_t row)
const;
139 MPI_Comm
comm()
const;
146 std::array<std::shared_ptr<const common::IndexMap>, 2> _index_maps;
149 std::array<int, 2> _bs;
152 std::vector<std::int64_t> _col_ghosts;
154 std::vector<std::int32_t> _col_ghost_owners;
157 std::vector<std::vector<std::int32_t>> _row_cache;
160 std::shared_ptr<graph::AdjacencyList<std::int32_t>> _graph;
163 std::vector<int> _off_diagonal_offset;
A duplicate MPI communicator and manage lifetime of the communicator.
Definition: MPI.h:41
This class represents the distribution index arrays across processes. An index array is a contiguous ...
Definition: IndexMap.h:64
This class provides a static adjacency list data structure. It is commonly used to store directed gra...
Definition: AdjacencyList.h:26
This class provides a sparsity pattern data structure that can be used to initialize sparse matrices....
Definition: SparsityPattern.h:34
SparsityPattern & operator=(SparsityPattern &&pattern)=default
Move assignment.
SparsityPattern(SparsityPattern &&pattern)=default
Move constructor.
std::shared_ptr< const common::IndexMap > index_map(int dim) const
Index map for given dimension dimension. Returns the index map for rows and columns that will be set ...
Definition: SparsityPattern.cpp:194
std::int32_t nnz_off_diag(std::int32_t row) const
Number of non-zeros in unowned columns (off-diagonal block) on a given row.
Definition: SparsityPattern.cpp:408
int block_size(int dim) const
Return index map block size for dimension dim.
Definition: SparsityPattern.cpp:225
const graph::AdjacencyList< std::int32_t > & graph() const
Sparsity pattern graph after assembly. Uses local indices for the columns.
Definition: SparsityPattern.cpp:415
std::int32_t nnz_diag(std::int32_t row) const
Number of non-zeros in owned columns (diagonal block) on a given row.
Definition: SparsityPattern.cpp:401
void insert_diagonal(const std::span< const std::int32_t > &rows)
Insert non-zero locations on the diagonal.
Definition: SparsityPattern.cpp:169
std::int64_t num_nonzeros() const
Number of nonzeros on this rank after assembly, including ghost rows.
Definition: SparsityPattern.cpp:394
void insert(const std::span< const std::int32_t > &rows, const std::span< const std::int32_t > &cols)
Insert non-zero locations using local (process-wise) indices.
Definition: SparsityPattern.cpp:144
std::vector< std::int64_t > column_indices() const
Global indices of non-zero columns on owned rows.
Definition: SparsityPattern.cpp:199
common::IndexMap column_index_map() const
Builds the index map for columns after assembly of the sparsity pattern.
Definition: SparsityPattern.cpp:214
void assemble()
Finalize sparsity pattern and communicate off-process entries.
Definition: SparsityPattern.cpp:227
SparsityPattern(MPI_Comm comm, const std::array< std::shared_ptr< const common::IndexMap >, 2 > &maps, const std::array< int, 2 > &bs)
Create an empty sparsity pattern with specified dimensions.
Definition: SparsityPattern.cpp:20
MPI_Comm comm() const
Return MPI communicator.
Definition: SparsityPattern.cpp:427
~SparsityPattern()=default
Destructor.
std::span< const int > off_diagonal_offset() const
Row-wise start of off-diagonal (unowned columns) on each row.
Definition: SparsityPattern.cpp:422
Miscellaneous classes, functions and types.
Graph data structures and algorithms.
Definition: dofmapbuilder.h:25
Linear algebra interface.
Definition: sparsitybuild.h:15