ReducedProblem.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 "ReducedProblem.H"
 
// ******************** //
// class reducedProblem //
// ******************** //
 
// * * * * * * * * * * * * * * * Constructors * * * * * * * * * * * * * * * * //
 
// Constructor
 
reducedProblem::reducedProblem()
{
}
 
reducedProblem::reducedProblem(reductionProblem& problem)
    :
    problem(&problem)
{
}
 
// * * * * * * * * * * * * * * * Member Functions  * * * * * * * * * * * * * //
 
void reducedProblem::solveOnline()
{
    Info << "The method reducedProblem::solveOnline in reducedProblem.C is a virtual method"
         << endl;
    Info << "It must be overridden, exiting the code" << endl;
    exit(0);
}
 
Eigen::MatrixXd reducedProblem::solveLinearSys(List<Eigen::MatrixXd> LinSys,
        Eigen::MatrixXd x, Eigen::VectorXd& residual, const Eigen::MatrixXd& bc,
        const std::string solverType)
 
{
    M_Assert(solverType == "fullPivLu" || solverType == "partialPivLu"
             || solverType == "householderQR" || solverType == "colPivHouseholderQR"
             || solverType == "fullPivHouseholderQR"
             || solverType == "completeOrthogonalDecomposition" || solverType == "llt"
             || solverType == "ldlt" || solverType == "bdcSvd"
             || solverType == "jacobiSvd", "solver not defined");
    Eigen::MatrixXd A;
    Eigen::MatrixXd b;
 
    if (LinSys[0].rows() < LinSys[0].cols())
    {
        FatalErrorInFunction << "The system is undetermined, it has more unknowns: " <<
                             LinSys[0].rows() << ", then equations: " << LinSys[0].rows() << abort(
                                 FatalError);
    }
 
    Eigen::MatrixXd y;
    residual = LinSys[0] * x - LinSys[1];
    A = LinSys[0];
    b = LinSys[1];
 
    if (A.rows() > A.cols())
    {
        if (solverType != "completeOrthogonalDecomposition" && solverType != "bdcSvd"
                && solverType != "jacobiSvd")
        {
            A.resize(A.cols(), A.cols());
            b.resize(A.cols(), 1);
            A =  LinSys[0].transpose() * LinSys[0];
            b =  LinSys[0].transpose() * LinSys[1];
            WarningInFunction <<
                              "Using normal equation, results might be inaccurate, better to rely on completeOrthogonalDecomposition, bdcSvd or jacobiSvd"
                              << endl;
        }
    }
 
    for (int i = 0; i < bc.size(); i++)
    {
        A.row(i) *= 0;
        A(i, i) = 1;
        b(i, 0) = bc(i);
    }
 
    if (solverType == "fullPivLu")
    {
        y = A.fullPivLu().solve(b);
    }
    else if (solverType == "partialPivLu")
    {
        y = A.partialPivLu().solve(b);
    }
    else if (solverType == "householderQr")
    {
        y = A.householderQr().solve(b);
    }
    else if (solverType == "colPivHouseholderQr")
    {
        y = A.colPivHouseholderQr().solve(b);
    }
    else if (solverType == "fullPivHouseholderQr")
    {
        y = A.fullPivHouseholderQr().solve(b);
    }
    else if (solverType == "completeOrthogonalDecomposition")
    {
        y = A.completeOrthogonalDecomposition().solve(b);
    }
    else if (solverType == "llt")
    {
        y = A.llt().solve(b);
    }
    else if (solverType == "ldlt")
    {
        y = A.ldlt().solve(b);
    }
    else if (solverType == "bdcSvd")
    {
        y = A.bdcSvd(Eigen::ComputeThinU | Eigen::ComputeThinV).solve(b);
    }
    else if (solverType == "jacobiSvd")
    {
        if (A.rows() > A.cols())
        {
            y = A.jacobiSvd(Eigen::ComputeThinU | Eigen::ComputeThinV).solve(b);
        }
        else
        {
            y = A.jacobiSvd().solve(b);
        }
    }
 
    return y;
}
 
Eigen::MatrixXd reducedProblem::solveLinearSys(List<Eigen::MatrixXd> LinSys,
        Eigen::MatrixXd x, Eigen::VectorXd& residual, const std::string solverType)
{
    const Eigen::MatrixXd& bc = Eigen::MatrixXd::Zero(0, 0);
    Eigen::MatrixXd y = reducedProblem::solveLinearSys(LinSys, x, residual, bc,
                        solverType);
    return y;
}
 
// ****************** //
// class onlineInterp //
// ****************** //
 
// * * * * * * * * * * * * * * * Constructors * * * * * * * * * * * * * * * * //
 
// Constructor
 
onlineInterp::onlineInterp()
{
    Nmu_samples =
        ITHACAstream::readMatrix("./ITHACAoutput/Offline/mu_samples_mat.txt").cols();
}
 
Eigen::MatrixXd onlineInterp::getInterpCoeffRBF(std::vector<SPLINTER::RBFSpline>
        rbfVec, Eigen::MatrixXd mu_interp)
{
    M_Assert(mu_interp.cols() == Nmu_samples,
             "Matrix 'mu_interp' must have same number and order of columns (i.e. parameters) as the matrix 'mu_samples'.");
    int Nmodes = rbfVec.size();
    // Nsamples (snapshots) to evaluate the interpolator at
    int Nsamples = mu_interp.rows();
    Eigen::MatrixXd muInterpRefined(mu_interp.rows(), 0);
 
    // Discard columns of mu_interp that have constant value for all elements, and use a refined matrix muInterpRefined
    for (int i = 0; i < mu_interp.cols(); i++)
    {
        double firstVal = mu_interp(0, i);
        bool isConst = (mu_interp.col(i).array() == firstVal).all();
 
        // Consider only columns with non-constant values
        if (isConst == 0)
        {
            muInterpRefined.conservativeResize(muInterpRefined.rows(),
                                               muInterpRefined.cols() + 1);
            muInterpRefined.col(muInterpRefined.cols() - 1) = mu_interp.col(i);
        }
    }
 
    int Nmu = muInterpRefined.cols();
    Eigen::MatrixXd coeff_interp(Nmodes, Nsamples);
 
    for (int i = 0; i < Nmodes; i++)
    {
        for (int j = 0; j < Nsamples; j++)
        {
            SPLINTER::DenseVector x(Nmu);
 
            for (int k = 0; k < Nmu; k++)
            {
                x(k) = muInterpRefined(j, k);
            }
 
            coeff_interp(i, j) = rbfVec[i].eval(x);
        }
    }
 
    return coeff_interp;
}
 
 
Eigen::MatrixXd onlineInterp::getInterpCoeffSPL(std::vector<SPLINTER::BSpline>
        splVec, Eigen::MatrixXd mu_interp)
{
    M_Assert(mu_interp.cols() == Nmu_samples,
             "Matrix 'mu_interp' must have same number and order of columns (i.e. parametes) as the matrix 'mu_samples'.");
    int Nmodes = splVec.size();
    // Nsamples (snapshots) to evaluate the interpolator at
    int Nsamples = mu_interp.rows();
    Eigen::MatrixXd muInterpRefined(mu_interp.rows(), 0);
 
    // Discard columns of mu_interp that have constant value for all elements, and use a refined matrix muInterpRefined
    for (int i = 0; i < mu_interp.cols(); i++)
    {
        double firstVal = mu_interp(0, i);
        bool isConst = (mu_interp.col(i).array() == firstVal).all();
 
        // Consider only columns with non-constant values
        if (isConst == 0)
        {
            muInterpRefined.conservativeResize(muInterpRefined.rows(),
                                               muInterpRefined.cols() + 1);
            muInterpRefined.col(muInterpRefined.cols() - 1) = mu_interp.col(i);
        }
    }
 
    int Nmu = muInterpRefined.cols();
    Eigen::MatrixXd coeff_interp(Nmodes, Nsamples);
 
    for (int i = 0; i < Nmodes; i++)
    {
        for (int j = 0; j < Nsamples; j++)
        {
            SPLINTER::DenseVector x(Nmu);
 
            for (int k = 0; k < Nmu; k++)
            {
                x(k) = muInterpRefined(j, k);
            }
 
            coeff_interp(i, j) = splVec[i].eval(x);
        }
    }
 
    return coeff_interp;
}
 
// ************************************************************************* //