1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94
|
// -*- C++ -*-
/**
* @brief The test file of class MarginalTransformationGradient for standard methods
*
* Copyright 2005-2025 Airbus-EDF-IMACS-ONERA-Phimeca
*
* This library 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.
*
* This library 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 this library. If not, see <http://www.gnu.org/licenses/>.
*
*/
#include "openturns/OT.hxx"
#include "openturns/OTtestcode.hxx"
using namespace OT;
using namespace OT::Test;
int main(int, char *[])
{
TESTPREAMBLE;
OStream fullprint(std::cout);
try
{
MarginalTransformationEvaluation::DistributionCollection coll1(0);
coll1.add(Normal(1.0, 2.5));
coll1.add(Gamma(1.5, 3.0));
Point pointLow(0);
pointLow.add(coll1[0].computeQuantile(0.25)[0]);
pointLow.add(coll1[1].computeQuantile(0.25)[0]);
Point pointHigh(0);
pointHigh.add(coll1[0].computeQuantile(0.75)[0]);
pointHigh.add(coll1[1].computeQuantile(0.75)[0]);
MarginalTransformationEvaluation::DistributionCollection coll2(0);
coll2.add(Gamma(2.5, 2.0));
coll2.add(Normal(3.0, 1.5));
// First, check the old constructor
{
MarginalTransformationEvaluation evaluation(coll1);
MarginalTransformationGradient transformation(evaluation);
fullprint << "transformation=" << transformation << std::endl;
fullprint << "transformation.gradient(" << pointLow << ")=" << transformation.gradient(pointLow) << std::endl;
fullprint << "finite difference gradient(" << pointLow << ")=" << CenteredFiniteDifferenceGradient(1.0e-5, evaluation.clone()).gradient(pointLow) << std::endl;
fullprint << "transformation.gradient(" << pointHigh << ")=" << transformation.gradient(pointHigh) << std::endl;
fullprint << "finite difference gradient(" << pointHigh << ")=" << CenteredFiniteDifferenceGradient(1.0e-5, evaluation.clone()).gradient(pointHigh) << std::endl;
fullprint << "input dimension=" << transformation.getInputDimension() << std::endl;
fullprint << "output dimension=" << transformation.getOutputDimension() << std::endl;
}
// Second, check the constructor for old inverse transformation
{
MarginalTransformationEvaluation evaluation(coll1, MarginalTransformationEvaluation::TO);
MarginalTransformationGradient transformation(evaluation);
fullprint << "transformation=" << transformation << std::endl;
Point uLow(coll1.getSize(), 0.25);
Point uHigh(coll1.getSize(), 0.75);
fullprint << "transformation.gradient(" << uLow << ")=" << transformation.gradient(uLow) << std::endl;
fullprint << "finite difference gradient(" << uLow << ")=" << CenteredFiniteDifferenceGradient(1.0e-5, evaluation.clone()).gradient(uLow) << std::endl;
fullprint << "transformation.gradient(" << uHigh << ")=" << transformation.gradient(uHigh) << std::endl;
fullprint << "finite difference gradient(" << uHigh << ")=" << CenteredFiniteDifferenceGradient(1.0e-5, evaluation.clone()).gradient(uHigh) << std::endl;
fullprint << "input dimension=" << transformation.getInputDimension() << std::endl;
fullprint << "output dimension=" << transformation.getOutputDimension() << std::endl;
}
// Third, check the constructor for the new transformation
{
MarginalTransformationEvaluation evaluation(coll1, coll2);
MarginalTransformationGradient transformation(evaluation);
fullprint << "transformation=" << transformation << std::endl;
fullprint << "transformation.gradient(" << pointLow << ")=" << transformation.gradient(pointLow) << std::endl;
fullprint << "finite difference gradient(" << pointLow << ")=" << CenteredFiniteDifferenceGradient(1.0e-5, evaluation.clone()).gradient(pointLow) << std::endl;
fullprint << "transformation.gradient(" << pointHigh << ")=" << transformation.gradient(pointHigh) << std::endl;
fullprint << "finite difference gradient(" << pointHigh << ")=" << CenteredFiniteDifferenceGradient(1.0e-5, evaluation.clone()).gradient(pointHigh) << std::endl;
fullprint << "input dimension=" << transformation.getInputDimension() << std::endl;
fullprint << "output dimension=" << transformation.getOutputDimension() << std::endl;
}
}
catch (TestFailed & ex)
{
std::cerr << ex << std::endl;
return ExitCode::Error;
}
return ExitCode::Success;
}
|