Reference documentation for deal.II version 9.1.1
\(\newcommand{\dealcoloneq}{\mathrel{\vcenter{:}}=}\)
sparse_matrix_collection.h
1 // ---------------------------------------------------------------------
2 //
3 // Copyright (C) 2003 - 2018 by the deal.II authors
4 //
5 // This file is part of the deal.II library.
6 //
7 // The deal.II library is free software; you can use it, redistribute
8 // it, and/or modify it under the terms of the GNU Lesser General
9 // Public License as published by the Free Software Foundation; either
10 // version 2.1 of the License, or (at your option) any later version.
11 // The full text of the license can be found in the file LICENSE.md at
12 // the top level directory of deal.II.
13 //
14 // ---------------------------------------------------------------------
15 
16 #ifndef dealii_mg_sparse_matrix_collection_h
17 #define dealii_mg_sparse_matrix_collection_h
18 
19 #include <deal.II/base/mg_level_object.h>
20 
21 #include <deal.II/lac/dynamic_sparsity_pattern.h>
22 #include <deal.II/lac/sparse_matrix.h>
23 #include <deal.II/lac/vector.h>
24 
25 #include <deal.II/multigrid/mg_base.h>
26 #include <deal.II/multigrid/mg_tools.h>
27 
28 #include <memory>
29 
30 DEAL_II_NAMESPACE_OPEN
31 
32 namespace mg
33 {
41  template <typename number>
43  {
44  public:
45  void
46  resize(const unsigned int minlevel, const unsigned int maxlevel);
47 
48  template <typename DoFHandlerType>
49  void
50  reinit(const DoFHandlerType &dof_handler);
51 
52  void
53  set_zero();
54 
56  MGLevelObject<SparsityPattern> sparsity_edge;
57 
63  };
64 
65 
66  template <typename number>
67  void
68  SparseMatrixCollection<number>::resize(const unsigned int minlevel,
69  const unsigned int maxlevel)
70  {
71  matrix.resize(minlevel, maxlevel);
72  matrix.clear_elements();
73  matrix_up.resize(minlevel + 1, maxlevel);
74  matrix_up.clear_elements();
75  matrix_down.resize(minlevel + 1, maxlevel);
76  matrix_down.clear_elements();
77  matrix_in.resize(minlevel, maxlevel);
78  matrix_in.clear_elements();
79  matrix_out.resize(minlevel, maxlevel);
80  matrix_out.clear_elements();
81  sparsity.resize(minlevel, maxlevel);
82  sparsity_edge.resize(minlevel, maxlevel);
83  }
84 
85 
86  template <typename number>
87  template <typename DoFHandlerType>
88  void
89  SparseMatrixCollection<number>::reinit(const DoFHandlerType &dof_handler)
90  {
91  AssertIndexRange(sparsity.max_level(),
92  dof_handler.get_triangulation().n_levels());
93 
94  for (unsigned int level = sparsity.min_level();
95  level <= sparsity.max_level();
96  ++level)
97  {
98  DynamicSparsityPattern dsp(dof_handler.n_dofs(level));
99  MGTools::make_flux_sparsity_pattern(dof_handler, dsp, level);
100  sparsity[level].copy_from(dsp);
101  matrix[level].reinit(sparsity[level]);
102  matrix_in[level].reinit(sparsity[level]);
103  matrix_out[level].reinit(sparsity[level]);
104  if (level > 0)
105  {
106  DynamicSparsityPattern ci_sparsity;
107  ci_sparsity.reinit(dof_handler.n_dofs(level - 1),
108  dof_handler.n_dofs(level));
110  ci_sparsity,
111  level);
112  sparsity_edge[level].copy_from(ci_sparsity);
113  matrix_up[level].reinit(sparsity_edge[level]);
114  matrix_down[level].reinit(sparsity_edge[level]);
115  }
116  }
117  }
118 
119  template <typename number>
120  void
121  SparseMatrixCollection<number>::set_zero()
122  {
123  matrix = 0.;
124  matrix_in = 0.;
125  matrix_out = 0.;
126  matrix_up = 0.;
127  matrix_down = 0.;
128  }
129 
130 } // namespace mg
131 
132 DEAL_II_NAMESPACE_CLOSE
133 
134 #endif
Contents is actually a matrix.
Definition: mg.h:81
void make_flux_sparsity_pattern(const DoFHandler< dim, spacedim > &dof_handler, SparsityPatternType &sparsity, const unsigned int level)
Definition: mg_tools.cc:607
#define AssertIndexRange(index, range)
Definition: exceptions.h:1637
void reinit(const size_type m, const size_type n, const IndexSet &rowset=IndexSet())
void make_flux_sparsity_pattern_edge(const DoFHandler< dim, spacedim > &dof_handler, SparsityPatternType &sparsity, const unsigned int level)
Definition: mg_tools.cc:683