hybrid/gridvariablescache.hh

Go to the documentation of this file.

// -*- mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*-
// vi: set et ts=4 sw=4 sts=4:
//
// SPDX-FileCopyrightText: Copyright © DuMux Project contributors, see AUTHORS.md in root folder
// SPDX-License-Identifier: GPL-3.0-or-later
//
#ifndef DUMUX_DISCRETIZATION_HYBRID_CVFE_GRID_VARIABLES_CACHE_HH
#define DUMUX_DISCRETIZATION_HYBRID_CVFE_GRID_VARIABLES_CACHE_HH
 
#include <unordered_map>
#include <utility>
#include <vector>
#include <ranges>
#include <memory>
 
#include <dumux/parallel/parallel_for.hh>
 
#include <dumux/common/concepts/localdofs_.hh>
 
// make the local view function available whenever we use this class
#include <dumux/discretization/localview.hh>
#include <dumux/discretization/cvfe/elementsolution.hh>
#include <dumux/discretization/cvfe/quadraturerules.hh>
#include "elementvariables.hh"
 
namespace Dumux::Experimental::CVFE {
 
template<class P, class V, class IPD>
struct HybridCVFEDefaultGridVariablesCacheTraits
{
    using Problem = P;
    using Variables = V;
    using InterpolationPointData = IPD;
 
    template<class GridVariablesCache, bool cachingEnabled>
    using LocalView = HybridCVFEElementVariables<GridVariablesCache, cachingEnabled>;
};
 
template<class Traits, bool enableCaching>
class HybridCVFEGridVariablesCache;
 
// specialization in case of storing the local variables
template<class Traits>
class HybridCVFEGridVariablesCache<Traits, /*cachingEnabled*/true>
{
    using ThisType = HybridCVFEGridVariablesCache<Traits, true>;
public:
    using Problem = typename Traits::Problem;
 
    using Variables = typename Traits::Variables;
 
    using InterpolationPointData = typename Traits::InterpolationPointData;
 
    static constexpr bool cachingEnabled = true;
 
    using LocalView = typename Traits::template LocalView<ThisType, cachingEnabled>;
 
    using MutableLocalView = typename LocalView::MutableView;
 
    HybridCVFEGridVariablesCache(const Problem& problem) : problemPtr_(&problem) {}
 
    template<class GridGeometry, class SolutionVector>
    void init(const GridGeometry& gridGeometry, const SolutionVector& sol)
    {
        variables_.resize(gridGeometry.gridView().size(0));
        ipDataCache_ = std::make_shared<InterpolationPointDataCache>();
        ipDataCache_->resize(gridGeometry.gridView().size(0));
 
        Dumux::parallelFor(gridGeometry.gridView().size(0), [&, &problem = problem()](const std::size_t eIdx)
        {
            const auto element = gridGeometry.element(eIdx);
            const auto fvGeometry = localView(gridGeometry).bindElement(element);
 
            // get the element solution
            auto elemSol = elementSolution(element, sol, gridGeometry);
 
            variables_[eIdx].resize(Dumux::Detail::LocalDofs::numLocalDofs(fvGeometry));
            for (const auto& localDof : localDofs(fvGeometry))
                variables_[eIdx][localDof.index()].update(elemSol, problem, fvGeometry, ipData(fvGeometry, localDof));
 
            ipDataCache_->update(problem, element, fvGeometry, variables_[eIdx]);
        });
    }
 
    template<class GridGeometry, class SolutionVector>
    void update(const GridGeometry& gridGeometry, const SolutionVector& sol)
    {
        if constexpr (InterpolationPointData::isSolDependent)
        {
            auto newIpDataCache = std::make_shared<InterpolationPointDataCache>();
            newIpDataCache->resize(gridGeometry.gridView().size(0));
 
            Dumux::parallelFor(gridGeometry.gridView().size(0), [&, &problem = problem(), newIpDataCache](const std::size_t eIdx)
            {
                const auto element = gridGeometry.element(eIdx);
                const auto fvGeometry = localView(gridGeometry).bindElement(element);
 
                // get the element solution
                auto elemSol = elementSolution(element, sol, gridGeometry);
 
                for (const auto& localDof : localDofs(fvGeometry))
                    variables_[eIdx][localDof.index()].update(elemSol, problem, fvGeometry, ipData(fvGeometry, localDof));
 
                newIpDataCache->update(problem, element, fvGeometry, variables_[eIdx]);
            });
 
            ipDataCache_ = std::move(newIpDataCache);
        }
        else
        {
            Dumux::parallelFor(gridGeometry.gridView().size(0), [&, &problem = problem()](const std::size_t eIdx)
            {
                const auto element = gridGeometry.element(eIdx);
                const auto fvGeometry = localView(gridGeometry).bindElement(element);
 
                // get the element solution
                auto elemSol = elementSolution(element, sol, gridGeometry);
 
                for (const auto& localDof : localDofs(fvGeometry))
                    variables_[eIdx][localDof.index()].update(elemSol, problem, fvGeometry, ipData(fvGeometry, localDof));
            });
        }
    }
 
    template<class ScvOrLocalDof>
    const Variables& variables(const ScvOrLocalDof& scvOrLocalDof) const
    {
        if constexpr (Concept::LocalDof<ScvOrLocalDof>)
            return variables_[scvOrLocalDof.elementIndex()][scvOrLocalDof.index()];
        else
            return variables_[scvOrLocalDof.elementIndex()][scvOrLocalDof.localDofIndex()];
    }
 
    template<class ScvOrLocalDof>
    Variables& variables(const ScvOrLocalDof& scvOrLocalDof)
    {
        if constexpr (Concept::LocalDof<ScvOrLocalDof>)
            return variables_[scvOrLocalDof.elementIndex()][scvOrLocalDof.index()];
        else
            return variables_[scvOrLocalDof.elementIndex()][scvOrLocalDof.localDofIndex()];
    }
 
    const Variables& variables(const std::size_t eIdx, const std::size_t localIdx) const
    { return variables_[eIdx][localIdx]; }
 
    Variables& variables(const std::size_t eIdx, const std::size_t localIdx)
    { return variables_[eIdx][localIdx]; }
 
    const InterpolationPointData& scvfCache(std::size_t eIdx, std::size_t scvfIdx, std::size_t qpIdx) const
    { return ipDataCache_->scvfCache(eIdx, scvfIdx, qpIdx); }
 
    InterpolationPointData& scvfCache(std::size_t eIdx, std::size_t scvfIdx, std::size_t qpIdx)
    { return ipDataCache_->scvfCache(eIdx, scvfIdx, qpIdx); }
 
    const InterpolationPointData& elementCache(std::size_t eIdx, std::size_t qpIdx) const
    { return ipDataCache_->elementCache(eIdx, qpIdx); }
 
    InterpolationPointData& elementCache(std::size_t eIdx, std::size_t qpIdx)
    { return ipDataCache_->elementCache(eIdx, qpIdx); }
 
    const InterpolationPointData& boundaryIntersectionCache(std::size_t eIdx, int intersectionIdx, std::size_t qpIdx) const
    { return ipDataCache_->boundaryIntersectionCache(eIdx, intersectionIdx, qpIdx); }
 
    InterpolationPointData& boundaryIntersectionCache(std::size_t eIdx, int intersectionIdx, std::size_t qpIdx)
    { return ipDataCache_->boundaryIntersectionCache(eIdx, intersectionIdx, qpIdx); }
 
    const Problem& problem() const
    { return *problemPtr_; }
 
private:
    class InterpolationPointDataCache
    {
        struct ElementCache
        {
            std::vector<InterpolationPointData> scvfCache;
            std::vector<std::size_t> qpsOffset;
            std::vector<InterpolationPointData> elementCache;
            std::unordered_map<int, std::vector<InterpolationPointData>> boundaryIntersectionCache;
 
            template<class Problem, class FVElementGeometry, class ElementVariables>
            void update(const Problem& problem,
                        const typename FVElementGeometry::Element& element,
                        const FVElementGeometry& fvGeometry,
                        const ElementVariables& elemVars)
            {
                qpsOffset.resize(fvGeometry.numScvf() + 1, 0);
                for (const auto& scvf : scvfs(fvGeometry))
                {
                    const auto numQps = std::ranges::size(Dumux::CVFE::quadratureRule(fvGeometry, scvf));
                    qpsOffset[scvf.index() + 1] = numQps;
                }
                for (std::size_t i = 2; i < qpsOffset.size(); ++i)
                    qpsOffset[i] += qpsOffset[i-1];
 
                scvfCache.resize(qpsOffset.back());
                for (const auto& scvf : scvfs(fvGeometry))
                {
                    for (const auto& qpData : Dumux::CVFE::quadratureRule(fvGeometry, scvf))
                    {
                        const auto scvfIdx = qpData.ipData().scvfIndex();
                        const auto qpIdx = qpData.ipData().qpIndex();
                        scvfCache[qpsOffset[scvfIdx] + qpIdx].update(problem,
                                                                     element,
                                                                     fvGeometry,
                                                                     elemVars,
                                                                     qpData.ipData());
                    }
                }
 
                const auto elemQuadRule = Dumux::CVFE::quadratureRule(fvGeometry, element);
                elementCache.resize(std::ranges::size(elemQuadRule));
                for (const auto& qpData : elemQuadRule)
                    elementCache[qpData.ipData().qpIndex()].update(problem, element, fvGeometry, elemVars, qpData.ipData());
 
                boundaryIntersectionCache.clear();
                for (const auto& intersection : intersections(fvGeometry.gridGeometry().gridView(), element))
                {
                    if (intersection.boundary())
                    {
                        const auto intersectionIndex = intersection.indexInInside();
                        auto& boundaryCache = boundaryIntersectionCache[intersectionIndex];
                        const auto quadRule = Dumux::CVFE::quadratureRule(fvGeometry, intersection);
                        boundaryCache.resize(std::ranges::size(quadRule));
                        for (const auto& qpData : quadRule)
                            boundaryCache[qpData.ipData().qpIndex()].update(problem,
                                                                            element,
                                                                            fvGeometry,
                                                                            elemVars,
                                                                            qpData.ipData());
                    }
                }
            }
        };
 
    public:
 
        InterpolationPointDataCache()
        {}
 
        void resize(const std::size_t numElements)
        {
            elementCaches_.resize(numElements);
        }
 
        template<class Problem, class FVElementGeometry, class ElementVariables>
        void update(const Problem& problem,
                    const typename FVElementGeometry::Element& element,
                    const FVElementGeometry& fvGeometry,
                    const ElementVariables& elemVars)
        {
            const auto eIdx = fvGeometry.gridGeometry().elementMapper().index(element);
            elementCaches_[eIdx].update(problem, element, fvGeometry, elemVars);
        }
 
        // access operator
        const InterpolationPointData& scvfCache(std::size_t eIdx, std::size_t scvfIdx, std::size_t qpIdx) const
        {
            const auto& elementCache = elementCaches_[eIdx];
            return elementCache.scvfCache[elementCache.qpsOffset[scvfIdx] + qpIdx];
        }
 
        // access operator
        InterpolationPointData& scvfCache(std::size_t eIdx, std::size_t scvfIdx, std::size_t qpIdx)
        {
            auto& elementCache = elementCaches_[eIdx];
            return elementCache.scvfCache[elementCache.qpsOffset[scvfIdx] + qpIdx];
        }
 
        // access operator
        const InterpolationPointData& elementCache(std::size_t eIdx, std::size_t qpIdx) const
        { return elementCaches_[eIdx].elementCache[qpIdx]; }
 
        // access operator
        InterpolationPointData& elementCache(std::size_t eIdx, std::size_t qpIdx)
        { return elementCaches_[eIdx].elementCache[qpIdx]; }
 
        // access operator
        const InterpolationPointData& boundaryIntersectionCache(std::size_t eIdx, int intersectionIdx, std::size_t qpIdx) const
        { return elementCaches_[eIdx].boundaryIntersectionCache.at(intersectionIdx)[qpIdx]; }
 
        // access operator
        InterpolationPointData& boundaryIntersectionCache(std::size_t eIdx, int intersectionIdx, std::size_t qpIdx)
        { return elementCaches_[eIdx].boundaryIntersectionCache[intersectionIdx][qpIdx]; }
 
        const ElementCache& cache(std::size_t eIdx) const
        { return elementCaches_[eIdx]; }
 
        ElementCache& cache(std::size_t eIdx)
        { return elementCaches_[eIdx]; }
 
    private:
        std::vector<ElementCache> elementCaches_; 
    };
 
public:
    const auto& cache(std::size_t eIdx) const
    { return ipDataCache_->cache(eIdx); }
 
    auto& cache(std::size_t eIdx)
    { return ipDataCache_->cache(eIdx); }
 
private:
    const Problem* problemPtr_;
    std::vector<std::vector<Variables>> variables_;
    std::shared_ptr<InterpolationPointDataCache> ipDataCache_;
};
 
// Specialization when the current local variables are not stored
template<class Traits>
class HybridCVFEGridVariablesCache<Traits, /*cachingEnabled*/false>
{
    using ThisType = HybridCVFEGridVariablesCache<Traits, false>;
 
public:
    using Problem = typename Traits::Problem;
 
    using Variables = typename Traits::Variables;
 
    static constexpr bool cachingEnabled = false;
 
    using LocalView = typename Traits::template LocalView<ThisType, cachingEnabled>;
 
    using MutableLocalView = typename LocalView::MutableView;
 
    using InterpolationPointData = typename Traits::InterpolationPointData;
 
    HybridCVFEGridVariablesCache(const Problem& problem) : problemPtr_(&problem) {}
 
    template<class GridGeometry, class SolutionVector>
    void update(const GridGeometry& gridGeometry, const SolutionVector& sol) {}
 
    const Problem& problem() const
    { return *problemPtr_;}
 
private:
    const Problem* problemPtr_;
};
 
} // end namespace Dumux::Experimental::CVFE
 
#endif