1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372
|
// ------------------------------------------------------------------------
//
// SPDX-License-Identifier: LGPL-2.1-or-later
// Copyright (C) 2003 - 2025 by the deal.II authors
//
// This file is part of the deal.II library.
//
// Part of the source code is dual licensed under Apache-2.0 WITH
// LLVM-exception OR LGPL-2.1-or-later. Detailed license information
// governing the source code and code contributions can be found in
// LICENSE.md and CONTRIBUTING.md at the top level directory of deal.II.
//
// ------------------------------------------------------------------------
#include <deal.II/base/function.h>
#include <deal.II/base/logstream.h>
#include <deal.II/dofs/dof_accessor.h>
#include <deal.II/dofs/dof_tools.h>
#include <deal.II/fe/fe.h>
#include <deal.II/grid/tria.h>
#include <deal.II/grid/tria_iterator.h>
#include <deal.II/lac/block_sparse_matrix.h>
#include <deal.II/lac/block_vector.h>
#include <deal.II/lac/dynamic_sparsity_pattern.h>
#include <deal.II/lac/la_parallel_block_vector.h>
#include <deal.II/lac/la_parallel_vector.h>
#include <deal.II/lac/sparse_matrix.h>
#include <deal.II/lac/sparsity_tools.h>
#include <deal.II/lac/trilinos_epetra_vector.h>
#include <deal.II/lac/trilinos_parallel_block_vector.h>
#include <deal.II/lac/trilinos_vector.h>
#include <deal.II/lac/vector.h>
#include <deal.II/multigrid/mg_tools.h>
#include <deal.II/multigrid/mg_transfer.h>
#include <algorithm>
DEAL_II_NAMESPACE_OPEN
template <typename VectorType>
MGTransferPrebuilt<VectorType>::MGTransferPrebuilt(
const MGConstrainedDoFs &mg_c)
{
this->mg_constrained_dofs = &mg_c;
}
template <typename VectorType>
void
MGTransferPrebuilt<VectorType>::initialize_constraints(
const MGConstrainedDoFs &mg_c)
{
this->mg_constrained_dofs = &mg_c;
}
template <typename VectorType>
void
MGTransferPrebuilt<VectorType>::clear()
{
MGLevelGlobalTransfer<VectorType>::clear();
prolongation_matrices.resize(0);
prolongation_sparsities.resize(0);
interface_dofs.resize(0);
}
template <typename VectorType>
void
MGTransferPrebuilt<VectorType>::prolongate(const unsigned int to_level,
VectorType &dst,
const VectorType &src) const
{
Assert((to_level >= 1) && (to_level <= prolongation_matrices.size()),
ExcIndexRange(to_level, 1, prolongation_matrices.size() + 1));
if (this->mg_constrained_dofs != nullptr &&
this->mg_constrained_dofs->get_user_constraint_matrix(to_level - 1)
.get_local_lines()
.size() > 0)
{
VectorType copy_src(src);
this->mg_constrained_dofs->get_user_constraint_matrix(to_level - 1)
.distribute(copy_src);
prolongation_matrices[to_level - 1]->vmult(dst, copy_src);
}
else
{
prolongation_matrices[to_level - 1]->vmult(dst, src);
}
}
template <typename VectorType>
void
MGTransferPrebuilt<VectorType>::restrict_and_add(const unsigned int from_level,
VectorType &dst,
const VectorType &src) const
{
Assert((from_level >= 1) && (from_level <= prolongation_matrices.size()),
ExcIndexRange(from_level, 1, prolongation_matrices.size() + 1));
prolongation_matrices[from_level - 1]->Tvmult_add(dst, src);
}
namespace
{
/**
* Helper function for build. Checks for identity constrained dofs
* and replace with the indices of the dofs to which they are constrained
*/
void
replace(const MGConstrainedDoFs *mg_constrained_dofs,
const unsigned int level,
std::vector<types::global_dof_index> &dof_indices)
{
if (mg_constrained_dofs != nullptr &&
mg_constrained_dofs->get_level_constraints(level).n_constraints() > 0)
for (auto &ind : dof_indices)
if (mg_constrained_dofs->get_level_constraints(level)
.is_identity_constrained(ind))
{
Assert(mg_constrained_dofs->get_level_constraints(level)
.get_constraint_entries(ind)
->size() == 1,
ExcInternalError());
ind = mg_constrained_dofs->get_level_constraints(level)
.get_constraint_entries(ind)
->front()
.first;
}
}
} // namespace
template <typename VectorType>
template <int dim, int spacedim>
void
MGTransferPrebuilt<VectorType>::build(
const DoFHandler<dim, spacedim> &dof_handler)
{
Assert(dof_handler.has_level_dofs(),
ExcMessage(
"The underlying DoFHandler object has not had its "
"distribute_mg_dofs() function called, but this is a prerequisite "
"for multigrid transfers. You will need to call this function, "
"probably close to where you already call distribute_dofs()."));
const unsigned int n_levels =
dof_handler.get_triangulation().n_global_levels();
const unsigned int dofs_per_cell = dof_handler.get_fe().n_dofs_per_cell();
this->sizes.resize(n_levels);
for (unsigned int l = 0; l < n_levels; ++l)
this->sizes[l] = dof_handler.n_dofs(l);
// reset the size of the array of
// matrices. call resize(0) first,
// in order to delete all elements
// and clear their memory. then
// repopulate these arrays
//
// note that on resize(0), the
// shared_ptr class takes care of
// deleting the object it points to
// by itself
prolongation_matrices.resize(0);
prolongation_sparsities.resize(0);
prolongation_matrices.reserve(n_levels - 1);
prolongation_sparsities.reserve(n_levels - 1);
for (unsigned int i = 0; i < n_levels - 1; ++i)
{
prolongation_sparsities.emplace_back(
new typename internal::MatrixSelector<VectorType>::Sparsity);
prolongation_matrices.emplace_back(
new typename internal::MatrixSelector<VectorType>::Matrix);
}
// two fields which will store the
// indices of the multigrid dofs
// for a cell and one of its children
std::vector<types::global_dof_index> dof_indices_parent(dofs_per_cell);
std::vector<types::global_dof_index> dof_indices_child(dofs_per_cell);
std::vector<types::global_dof_index> entries(dofs_per_cell);
// for each level: first build the sparsity
// pattern of the matrices and then build the
// matrices themselves. note that we only
// need to take care of cells on the coarser
// level which have children
for (unsigned int level = 0; level < n_levels - 1; ++level)
{
// reset the dimension of the structure. note that for the number of
// entries per row, the number of parent dofs coupling to a child dof is
// necessary. this, of course, is the number of degrees of freedom per
// cell
//
// increment dofs_per_cell since a useless diagonal element will be
// stored
const IndexSet level_p1_relevant_dofs =
DoFTools::extract_locally_relevant_level_dofs(dof_handler, level + 1);
DynamicSparsityPattern dsp(this->sizes[level + 1],
this->sizes[level],
level_p1_relevant_dofs);
for (const auto &cell : dof_handler.cell_iterators_on_level(level))
if (cell->has_children() && cell->is_locally_owned_on_level())
{
cell->get_mg_dof_indices(dof_indices_parent);
replace(this->mg_constrained_dofs, level, dof_indices_parent);
Assert(cell->n_children() ==
GeometryInfo<dim>::max_children_per_cell,
ExcNotImplemented());
for (unsigned int child = 0; child < cell->n_children(); ++child)
{
// set an alias to the prolongation matrix for this child
const FullMatrix<double> &prolongation =
dof_handler.get_fe().get_prolongation_matrix(
child, cell->refinement_case());
Assert(prolongation.n() != 0, ExcNoProlongation());
cell->child(child)->get_mg_dof_indices(dof_indices_child);
replace(this->mg_constrained_dofs,
level + 1,
dof_indices_child);
// now tag the entries in the
// matrix which will be used
// for this pair of parent/child
for (unsigned int i = 0; i < dofs_per_cell; ++i)
{
entries.resize(0);
for (unsigned int j = 0; j < dofs_per_cell; ++j)
if (prolongation(i, j) != 0)
entries.push_back(dof_indices_parent[j]);
dsp.add_entries(dof_indices_child[i],
entries.begin(),
entries.end());
}
}
}
#ifdef DEAL_II_WITH_MPI
if (internal::MatrixSelector<
VectorType>::requires_distributed_sparsity_pattern)
{
// Since PETSc matrices do not offer the functionality to fill up in-
// complete sparsity patterns on their own, the sparsity pattern must
// be manually distributed.
// Distribute sparsity pattern
::dealii::SparsityTools::distribute_sparsity_pattern(
dsp,
dof_handler.locally_owned_mg_dofs(level + 1),
dof_handler.get_mpi_communicator(),
dsp.row_index_set());
}
#endif
internal::MatrixSelector<VectorType>::reinit(
*prolongation_matrices[level],
*prolongation_sparsities[level],
level,
dsp,
dof_handler);
dsp.reinit(0, 0);
// In the end, the entries in this object will only be real valued.
// Nevertheless, we have to take the underlying scalar type of the
// vector we want to use this class with. The global matrix the entries
// of this matrix are copied into has to be able to perform a
// matrix-vector multiplication and this is in general only implemented if
// the scalar type for matrix and vector is the same. Furthermore,
// copying entries between this local object and the global matrix is only
// implemented if the objects have the same scalar type.
FullMatrix<typename VectorType::value_type> prolongation;
// now actually build the matrices
for (const auto &cell : dof_handler.cell_iterators_on_level(level))
if (cell->has_children() && cell->is_locally_owned_on_level())
{
cell->get_mg_dof_indices(dof_indices_parent);
replace(this->mg_constrained_dofs, level, dof_indices_parent);
Assert(cell->n_children() ==
GeometryInfo<dim>::max_children_per_cell,
ExcNotImplemented());
for (unsigned int child = 0; child < cell->n_children(); ++child)
{
// set an alias to the prolongation matrix for this child
prolongation = dof_handler.get_fe().get_prolongation_matrix(
child, cell->refinement_case());
if (this->mg_constrained_dofs != nullptr &&
this->mg_constrained_dofs->have_boundary_indices())
for (unsigned int j = 0; j < dofs_per_cell; ++j)
if (this->mg_constrained_dofs->is_boundary_index(
level, dof_indices_parent[j]))
for (unsigned int i = 0; i < dofs_per_cell; ++i)
prolongation(i, j) = 0.;
cell->child(child)->get_mg_dof_indices(dof_indices_child);
replace(this->mg_constrained_dofs,
level + 1,
dof_indices_child);
// now set the entries in the matrix
for (unsigned int i = 0; i < dofs_per_cell; ++i)
prolongation_matrices[level]->set(dof_indices_child[i],
dofs_per_cell,
dof_indices_parent.data(),
&prolongation(i, 0),
true);
}
}
prolongation_matrices[level]->compress(VectorOperation::insert);
}
this->fill_and_communicate_copy_indices(dof_handler);
}
template <typename VectorType>
void
MGTransferPrebuilt<VectorType>::print_matrices(std::ostream &os) const
{
for (unsigned int level = 0; level < prolongation_matrices.size(); ++level)
{
os << "Level " << level << std::endl;
prolongation_matrices[level]->print(os);
os << std::endl;
}
}
template <typename VectorType>
std::size_t
MGTransferPrebuilt<VectorType>::memory_consumption() const
{
std::size_t result = MGLevelGlobalTransfer<VectorType>::memory_consumption();
for (unsigned int i = 0; i < prolongation_matrices.size(); ++i)
result += prolongation_matrices[i]->memory_consumption() +
prolongation_sparsities[i]->memory_consumption();
return result;
}
// explicit instantiation
#include "multigrid/mg_transfer_prebuilt.inst"
DEAL_II_NAMESPACE_CLOSE
|