ReducedLaplacian.C

Go to the documentation of this file.

/*---------------------------------------------------------------------------*\
     ██╗████████╗██╗  ██╗ █████╗  ██████╗ █████╗       ███████╗██╗   ██╗
     ██║╚══██╔══╝██║  ██║██╔══██╗██╔════╝██╔══██╗      ██╔════╝██║   ██║
     ██║   ██║   ███████║███████║██║     ███████║█████╗█████╗  ██║   ██║
     ██║   ██║   ██╔══██║██╔══██║██║     ██╔══██║╚════╝██╔══╝  ╚██╗ ██╔╝
     ██║   ██║   ██║  ██║██║  ██║╚██████╗██║  ██║      ██║      ╚████╔╝
     ╚═╝   ╚═╝   ╚═╝  ╚═╝╚═╝  ╚═╝ ╚═════╝╚═╝  ╚═╝      ╚═╝       ╚═══╝
 
 * In real Time Highly Advanced Computational Applications for Finite Volumes
 * Copyright (C) 2017 by the ITHACA-FV authors
-------------------------------------------------------------------------------
 
License
    This file is part of ITHACA-FV
 
    ITHACA-FV is free software: you can redistribute it and/or modify
    it under the terms of the GNU Lesser General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.
 
    ITHACA-FV is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
    GNU Lesser General Public License for more details.
 
    You should have received a copy of the GNU Lesser General Public License
    along with ITHACA-FV. If not, see <http://www.gnu.org/licenses/>.
 
\*---------------------------------------------------------------------------*/
 
 
#include "ReducedLaplacian.H"
 
 
// * * * * * * * * * * * * * * * Constructors * * * * * * * * * * * * * * * * //
 
// Constructor
reducedLaplacian::reducedLaplacian()
{
}
 
reducedLaplacian::reducedLaplacian(laplacianProblem& problem)
    :
    problem(&problem)
{
}
 
void reducedLaplacian::solveOnline(Eigen::MatrixXd mu)
{
    if (mu.cols() != problem->A_matrices.size())
    {
        Info << "wrong dimension of online parameters" << endl;
        exit(0);
    }
 
    Eigen::MatrixXd A;
    A.setZero(problem->NTmodes, problem->NTmodes);
 
    for (int i = 0; i < problem->A_matrices.size() ; i++)
    {
        A += problem->A_matrices[i] * mu(0, i);
    }
 
    Eigen::MatrixXd x;
    x = A.fullPivLu().solve(-problem->source);
    online_solution.conservativeResize(count_online_solve, problem->NTmodes + 1);
    online_solution(count_online_solve - 1, 0) = count_online_solve;
    online_solution.row(count_online_solve - 1).tail(problem->NTmodes) =
        x.transpose();
    count_online_solve += 1;
}
 
void reducedLaplacian::reconstruct(fileName folder, int printevery)
{
    mkDir(folder);
    ITHACAutilities::createSymLink(folder);
    int counter = 0;
    int nextwrite = 0;
 
    for (int i = 0; i < online_solution.rows(); i++)
    {
        if (counter == nextwrite)
        {
            volScalarField T_rec("T_rec", problem->Tmodes[0] * 0);
 
            for (int j = 0; j < problem->NTmodes; j++)
            {
                T_rec += problem->Tmodes[j] * online_solution(i, j + 1);
            }
 
            Trec.append((T_rec).clone());
            ITHACAstream::exportSolution(T_rec, name(online_solution(i, 0)), folder);
            nextwrite += printevery;
        }
 
        counter++;
    }
}
 
 
 
 
// ************************************************************************* //