Ginkgo  Generated from pipelines/2662685947 branch based on develop. Ginkgo version 2.0.0
A numerical linear algebra library targeting many-core architectures
rcm.hpp
1 // SPDX-FileCopyrightText: 2017 - 2026 The Ginkgo authors
2 //
3 // SPDX-License-Identifier: BSD-3-Clause
4 
5 #ifndef GKO_PUBLIC_CORE_REORDER_RCM_HPP_
6 #define GKO_PUBLIC_CORE_REORDER_RCM_HPP_
7 
8 
9 #include <memory>
10 
11 #include <ginkgo/core/base/abstract_factory.hpp>
12 #include <ginkgo/core/base/array.hpp>
13 #include <ginkgo/core/base/dim.hpp>
14 #include <ginkgo/core/base/lin_op.hpp>
15 #include <ginkgo/core/base/polymorphic_object.hpp>
16 #include <ginkgo/core/base/types.hpp>
17 #include <ginkgo/core/base/utils.hpp>
18 #include <ginkgo/core/matrix/csr.hpp>
19 #include <ginkgo/core/matrix/identity.hpp>
20 #include <ginkgo/core/matrix/permutation.hpp>
21 #include <ginkgo/core/matrix/sparsity_csr.hpp>
22 #include <ginkgo/core/reorder/reordering_base.hpp>
23 
24 
25 namespace gko {
31 namespace reorder {
32 
33 
34 enum class starting_strategy { minimum_degree, pseudo_peripheral };
35 
36 
70 template <typename ValueType = default_precision, typename IndexType = int32>
71 class Rcm : public ReorderingBase<IndexType> {
72  GKO_ASSERT_SUPPORTED_VALUE_AND_INDEX_TYPE;
73 
74 public:
77  using value_type = ValueType;
78  using index_type = IndexType;
79 
86  std::shared_ptr<const PermutationMatrix> get_permutation() const
87  {
88  return permutation_;
89  }
90 
97  std::shared_ptr<const PermutationMatrix> get_inverse_permutation() const
98  {
99  return inv_permutation_;
100  }
101 
102  /*const array<index_type>& get_permutation_array() const override
103  {
104  return permutation_array_;
105  }*/
106 
108  {
113  bool GKO_FACTORY_PARAMETER_SCALAR(construct_inverse_permutation, false);
114 
119  starting_strategy GKO_FACTORY_PARAMETER_SCALAR(
120  strategy, starting_strategy::pseudo_peripheral);
121  };
122  GKO_ENABLE_REORDERING_BASE_FACTORY(Rcm, parameters, Factory);
124 
125 protected:
126  explicit Rcm(std::shared_ptr<const Executor> exec);
127 
128  explicit Rcm(const Factory* factory, const ReorderingBaseArgs& args);
129 
130 private:
131  std::shared_ptr<PermutationMatrix> permutation_;
132  std::shared_ptr<PermutationMatrix> inv_permutation_;
133 };
134 
135 
136 } // namespace reorder
137 
138 
139 namespace experimental {
140 namespace reorder {
141 
142 
143 using rcm_starting_strategy = gko::reorder::starting_strategy;
144 
145 
171 template <typename IndexType = int32>
172 class Rcm : public LinOpFactory {
173  GKO_ASSERT_SUPPORTED_INDEX_TYPE;
174 
175 public:
176  struct parameters_type;
177  friend class enable_parameters_type<parameters_type, Rcm<IndexType>>;
178 
179  using index_type = IndexType;
181 
183  : public enable_parameters_type<parameters_type, Rcm<IndexType>> {
189 
194  rcm_starting_strategy GKO_FACTORY_PARAMETER_SCALAR(
195  strategy, rcm_starting_strategy::pseudo_peripheral);
196  };
197 
203  const parameters_type& get_parameters() { return parameters_; }
204 
212  std::unique_ptr<permutation_type> generate(
213  std::shared_ptr<const LinOp> system_matrix) const;
214 
216  static parameters_type build() { return {}; }
217 
218 protected:
219  explicit Rcm(std::shared_ptr<const Executor> exec,
220  const parameters_type& params = {});
221 
222  std::unique_ptr<LinOp> generate_impl(
223  std::shared_ptr<const LinOp> system_matrix) const override;
224 
225  parameters_type parameters_;
226 };
227 
228 
229 } // namespace reorder
230 } // namespace experimental
231 } // namespace gko
232 
233 
234 #endif // GKO_PUBLIC_CORE_REORDER_RCM_HPP_
gko::experimental::reorder::Rcm::parameters_type::strategy
rcm_starting_strategy strategy
This parameter controls the strategy used to determine a starting vertex.
Definition: rcm.hpp:195
gko::experimental::reorder::Rcm::parameters_type::skip_symmetrize
bool skip_symmetrize
If set to false, computes the RCM reordering on A + A^T, otherwise assumes that A is symmetric and us...
Definition: rcm.hpp:188
gko::matrix::SparsityCsr
SparsityCsr is a matrix format which stores only the sparsity pattern of a sparse matrix by compressi...
Definition: csr.hpp:40
gko::experimental::reorder::Rcm
Rcm (Reverse Cuthill-McKee) is a reordering algorithm minimizing the bandwidth of a matrix.
Definition: rcm.hpp:172
gko::experimental::reorder::Rcm::generate
std::unique_ptr< permutation_type > generate(std::shared_ptr< const LinOp > system_matrix) const
gko::matrix::Permutation
Permutation is a matrix format that represents a permutation matrix, i.e.
Definition: csr.hpp:52
GKO_FACTORY_PARAMETER_SCALAR
#define GKO_FACTORY_PARAMETER_SCALAR(_name, _default)
Creates a scalar factory parameter in the factory parameters structure.
Definition: abstract_factory.hpp:437
gko
The Ginkgo namespace.
Definition: abstract_factory.hpp:20
gko::reorder::Rcm::get_inverse_permutation
std::shared_ptr< const PermutationMatrix > get_inverse_permutation() const
Gets the inverse permutation (permutation matrix, output of the algorithm) of the linear operator.
Definition: rcm.hpp:97
gko::experimental::reorder::Rcm::get_parameters
const parameters_type & get_parameters()
Returns the parameters used to construct the factory.
Definition: rcm.hpp:203
gko::reorder::Rcm::get_permutation
std::shared_ptr< const PermutationMatrix > get_permutation() const
Gets the permutation (permutation matrix, output of the algorithm) of the linear operator.
Definition: rcm.hpp:86
gko::reorder::ReorderingBase
The ReorderingBase class is a base class for all the reordering algorithms.
Definition: reordering_base.hpp:34
gko::experimental::reorder::Rcm::parameters_type
Definition: rcm.hpp:182
GKO_ENABLE_BUILD_METHOD
#define GKO_ENABLE_BUILD_METHOD(_factory_name)
Defines a build method for the factory, simplifying its construction by removing the repetitive typin...
Definition: abstract_factory.hpp:386
gko::reorder::Rcm::Factory
Definition: rcm.hpp:122
GKO_CREATE_FACTORY_PARAMETERS
#define GKO_CREATE_FACTORY_PARAMETERS(_parameters_name, _factory_name)
This Macro will generate a new type containing the parameters for the factory _factory_name.
Definition: abstract_factory.hpp:272
gko::LinOpFactory
A LinOpFactory represents a higher order mapping which transforms one linear operator into another.
Definition: lin_op.hpp:343
gko::reorder::ReorderingBaseArgs
This struct is used to pass parameters to the EnableDefaultReorderingBaseFactory::generate() method.
Definition: reordering_base.hpp:63
gko::enable_parameters_type
The enable_parameters_type mixin is used to create a base implementation of the factory parameters st...
Definition: abstract_factory.hpp:203
gko::reorder::Rcm
Rcm (Reverse Cuthill-McKee) is a reordering algorithm minimizing the bandwidth of a matrix.
Definition: rcm.hpp:71
gko::experimental::reorder::Rcm::build
static parameters_type build()
Creates a new parameter_type to set up the factory.
Definition: rcm.hpp:216