constrained_linear_operator.h

Go to the documentation of this file.

// -----------------------------------------------------------------------------
//
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception OR LGPL-2.1-or-later
// Copyright (C) 2015 - 2024 by the deal.II authors
//
// This file is part of the deal.II library.
//
// Detailed license information governing the source code and contributions
// can be found in LICENSE.md and CONTRIBUTING.md at the top level directory.
//
// -----------------------------------------------------------------------------
 
#ifndef dealii_constrained_linear_operator_h
#define dealii_constrained_linear_operator_h
 
#include <deal.II/base/config.h>
 
#include <deal.II/lac/affine_constraints.h>
#include <deal.II/lac/linear_operator.h>
#include <deal.II/lac/packaged_operation.h>
 
 
DEAL_II_NAMESPACE_OPEN
 
 
template <typename Range, typename Domain, typename Payload>
LinearOperator<Range, Domain, Payload>
distribute_constraints_linear_operator(
  const AffineConstraints<typename Range::value_type> &constraints,
  const LinearOperator<Range, Domain, Payload>        &exemplar)
{
  LinearOperator<Range, Domain, Payload> return_op = exemplar;
 
  return_op.vmult_add = [&constraints](Range &v, const Domain &u) {
    Assert(!::PointerComparison::equal(&v, &u),
           ::ExcMessage("The domain and range vectors must be different "
                              "storage locations"));
 
    // First, add vector u to v unconditionally and clean up constrained
    // degrees of freedom later.
    v += u;
 
    const auto &locally_owned_elements = v.locally_owned_elements();
    for (const auto &line : constraints.get_lines())
      {
        const auto i = line.index;
        if (locally_owned_elements.is_element(i))
          {
            v(i) -= u(i);
            const auto &entries = line.entries;
            for (types::global_dof_index j = 0; j < entries.size(); ++j)
              {
                const auto pos = entries[j].first;
                v(i) += u(pos) * entries[j].second;
              }
          }
      }
 
    v.compress(VectorOperation::add);
  };
 
  return_op.Tvmult_add = [&constraints](Domain &v, const Range &u) {
    Assert(!::PointerComparison::equal(&v, &u),
           ::ExcMessage("The domain and range vectors must be different "
                              "storage locations"));
 
    // First, add vector u to v unconditionally and clean up constrained
    // degrees of freedom later.
    v += u;
 
    const auto &locally_owned_elements = v.locally_owned_elements();
    for (const auto &line : constraints.get_lines())
      {
        const auto i = line.index;
 
        if (locally_owned_elements.is_element(i))
          {
            v(i) -= u(i);
          }
 
        const auto &entries = line.entries;
        for (types::global_dof_index j = 0; j < entries.size(); ++j)
          {
            const auto pos = entries[j].first;
            if (locally_owned_elements.is_element(pos))
              v(pos) += u(i) * entries[j].second;
          }
      }
 
    v.compress(VectorOperation::add);
  };
 
  return_op.vmult = [vmult_add = return_op.vmult_add](Range        &v,
                                                      const Domain &u) {
    v = 0.;
    vmult_add(v, u);
  };
 
  return_op.Tvmult = [Tvmult_add = return_op.Tvmult_add](Domain      &v,
                                                         const Range &u) {
    v = 0.;
    Tvmult_add(v, u);
  };
 
  return return_op;
}
 
 
template <typename Range, typename Domain, typename Payload>
LinearOperator<Range, Domain, Payload>
project_to_constrained_linear_operator(
  const AffineConstraints<typename Range::value_type> &constraints,
  const LinearOperator<Range, Domain, Payload>        &exemplar)
{
  LinearOperator<Range, Domain, Payload> return_op = exemplar;
 
  return_op.vmult_add = [&constraints](Range &v, const Domain &u) {
    const auto &locally_owned_elements = v.locally_owned_elements();
    for (const auto &line : constraints.get_lines())
      {
        const auto i = line.index;
        if (locally_owned_elements.is_element(i))
          {
            v(i) += u(i);
          }
      }
 
    v.compress(VectorOperation::add);
  };
 
  return_op.Tvmult_add = [&constraints](Domain &v, const Range &u) {
    const auto &locally_owned_elements = v.locally_owned_elements();
    for (const auto &line : constraints.get_lines())
      {
        const auto i = line.index;
        if (locally_owned_elements.is_element(i))
          {
            v(i) += u(i);
          }
      }
 
    v.compress(VectorOperation::add);
  };
 
  return_op.vmult = [vmult_add = return_op.vmult_add](Range        &v,
                                                      const Domain &u) {
    v = 0.;
    vmult_add(v, u);
  };
 
  return_op.Tvmult = [Tvmult_add = return_op.Tvmult_add](Domain      &v,
                                                         const Range &u) {
    v = 0.;
    Tvmult_add(v, u);
  };
 
  return return_op;
}
 
 
template <typename Range, typename Domain, typename Payload>
LinearOperator<Range, Domain, Payload>
constrained_linear_operator(
  const AffineConstraints<typename Range::value_type> &constraints,
  const LinearOperator<Range, Domain, Payload>        &linop)
{
  const auto C    = distribute_constraints_linear_operator(constraints, linop);
  const auto Ct   = transpose_operator(C);
  const auto Id_c = project_to_constrained_linear_operator(constraints, linop);
  return Ct * linop * C + Id_c;
}
 
 
template <typename Range, typename Domain, typename Payload>
PackagedOperation<Range>
constrained_right_hand_side(
  const AffineConstraints<typename Range::value_type> &constraints,
  const LinearOperator<Range, Domain, Payload>        &linop,
  const Range                                         &right_hand_side)
{
  PackagedOperation<Range> return_comp;
 
  return_comp.reinit_vector = linop.reinit_range_vector;
 
  return_comp.apply_add = [&constraints, &linop, &right_hand_side](Range &v) {
    const auto C  = distribute_constraints_linear_operator(constraints, linop);
    const auto Ct = transpose_operator(C);
 
    GrowingVectorMemory<Domain>            vector_memory;
    typename VectorMemory<Domain>::Pointer k(vector_memory);
    linop.reinit_domain_vector(*k, /*bool fast=*/false);
    constraints.distribute(*k);
 
    v += Ct * (right_hand_side - linop * *k);
  };
 
  return_comp.apply = [apply_add = return_comp.apply_add](Range &v) {
    v = 0.;
    apply_add(v);
  };
 
  return return_comp;
}
 
DEAL_II_NAMESPACE_CLOSE
 
#endif