DOLFIN-X
DOLFIN-X C++ interface
|
10 #include <dolfinx/common/MPI.h>
43 const std::array<std::shared_ptr<const common::IndexMap>, 2>& index_maps);
56 const std::vector<std::vector<const SparsityPattern*>>& patterns,
58 std::vector<std::reference_wrapper<const common::IndexMap>>, 2>&
73 std::array<std::int64_t, 2>
local_range(
int dim)
const;
76 std::shared_ptr<const common::IndexMap>
index_map(
int dim)
const;
80 insert(
const Eigen::Ref<
const Eigen::Array<std::int32_t, Eigen::Dynamic, 1>>&
82 const Eigen::Ref<
const Eigen::Array<std::int32_t, Eigen::Dynamic, 1>>&
89 const Eigen::Ref<
const Eigen::Array<std::int32_t, Eigen::Dynamic, 1>>&
114 std::array<std::shared_ptr<const common::IndexMap>, 2> _index_maps;
117 std::vector<std::vector<std::int32_t>> _diagonal_cache;
118 std::vector<std::vector<std::int64_t>> _off_diagonal_cache;
121 std::shared_ptr<graph::AdjacencyList<std::int32_t>> _diagonal;
122 std::shared_ptr<graph::AdjacencyList<std::int64_t>> _off_diagonal;
SparsityPattern(MPI_Comm comm, const std::array< std::shared_ptr< const common::IndexMap >, 2 > &index_maps)
Create an empty sparsity pattern with specified dimensions.
Definition: SparsityPattern.cpp:19
std::array< std::int64_t, 2 > local_range(int dim) const
Return local range for dimension dim.
Definition: SparsityPattern.cpp:172
void insert(const Eigen::Ref< const Eigen::Array< std::int32_t, Eigen::Dynamic, 1 >> &rows, const Eigen::Ref< const Eigen::Array< std::int32_t, Eigen::Dynamic, 1 >> &cols)
Insert non-zero locations using local (process-wise) indices.
Definition: SparsityPattern.cpp:185
This class provides a sparsity pattern data structure that can be used to initialize sparse matrices.
Definition: SparsityPattern.h:36
MPI_Comm mpi_comm() const
Return MPI communicator.
Definition: SparsityPattern.cpp:409
void insert_diagonal(const Eigen::Ref< const Eigen::Array< std::int32_t, Eigen::Dynamic, 1 >> &rows)
Insert non-zero locations on the diagonal.
Definition: SparsityPattern.cpp:230
This class provides a static adjacency list data structure. It is commonly used to store directed gra...
Definition: AdjacencyList.h:27
~SparsityPattern()=default
Destructor.
void assemble()
Finalize sparsity pattern and communicate off-process entries.
Definition: SparsityPattern.cpp:255
const graph::AdjacencyList< std::int32_t > & diagonal_pattern() const
Sparsity pattern for the owned (diagonal) block. Uses local indices for the columns.
Definition: SparsityPattern.cpp:394
A duplicate MPI communicator and manage lifetime of the communicator.
Definition: MPI.h:35
SparsityPattern & operator=(SparsityPattern &&pattern)=default
Move assignment.
std::shared_ptr< const common::IndexMap > index_map(int dim) const
Return index map for dimension dim.
Definition: SparsityPattern.cpp:180
std::int64_t num_nonzeros() const
Return number of local nonzeros.
Definition: SparsityPattern.cpp:385
const graph::AdjacencyList< std::int64_t > & off_diagonal_pattern() const
Sparsity pattern for the un-owned (off-diagonal) columns. Uses global indices for the columns.
Definition: SparsityPattern.cpp:402