ReducedSteadyNSTurbIntrusive.H

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/>.
Class
    ReducedSteadyNSTurbIntrusive
Description
    A reduced problem for the stationary turbulent NS equations using fully intrusive approach
SourceFiles
    ReducedSteadyNSTurbIntrusive.C
\*---------------------------------------------------------------------------*/
 
 
#ifndef ReducedSteadyNSTurbIntrusive_H
#define ReducedSteadyNSTurbIntrusive_H
 
#include "fvCFD.H"
#include "IOmanip.H"
#include "ReducedProblem.H"
#include "ReducedSteadyNS.H"
#include "SteadyNSTurbIntrusive.H"
#include "ITHACAutilities.H"
#include <Eigen/Dense>
#include <unsupported/Eigen/NonLinearOptimization>
#include <unsupported/Eigen/NumericalDiff>
 
struct newtonSteadyNSTurbIntrusive: public newton_argument<double>
{
    public:
        newtonSteadyNSTurbIntrusive() {}
        newtonSteadyNSTurbIntrusive(int Nx, int Ny,
                                    SteadyNSTurbIntrusive& problem): newton_argument<double>(Nx, Ny),
            problem(&problem),
            Nphi_u(problem.nModesOnline),
            N_BC(problem.inletIndex.rows())
        {}
 
        int operator()(const Eigen::VectorXd& x, Eigen::VectorXd& fvec) const;
        int df(const Eigen::VectorXd& x,  Eigen::MatrixXd& fjac) const;
 
        SteadyNSTurbIntrusive* problem;
        int Nphi_u;
        int N_BC;
        scalar nu;
        Eigen::MatrixXd tauU;
        Eigen::VectorXd bc;
};
 
 
/*---------------------------------------------------------------------------*\
                        Class reducedProblem Declaration
\*---------------------------------------------------------------------------*/
 
 
 
class ReducedSteadyNSTurbIntrusive: public reducedSteadyNS
{
    private:
 
    public:
        // Constructors
        ReducedSteadyNSTurbIntrusive();
        ReducedSteadyNSTurbIntrusive(SteadyNSTurbIntrusive& problem);
 
        ~ReducedSteadyNSTurbIntrusive() {};
 
 
        PtrList<volScalarField> nutFields;
 
        PtrList<volScalarField> nutModes;
 
        PtrList<volScalarField> nutRec;
 
        int nphiNut;
 
        newtonSteadyNSTurbIntrusive newtonObject;
 
        SteadyNSTurbIntrusive* problem;
 
        void solveOnline(Eigen::MatrixXd velNow);
 
        void reconstruct(fileName folder = "./ITHACAOutput/online_rec",
                         int printEvery = 1);
 
        Eigen::MatrixXd setOnlineVelocity(Eigen::MatrixXd vel);
 
        //--------------------------------------------------------------------------
        void reconstructLiftAndDrag(SteadyNSTurbIntrusive& problem,
                                    fileName folder);
 
 
};
 
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
 
 
 
#endif