forked from trilinos/Trilinos
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge Pull Request trilinos#12684 from cgcgcg/Trilinos/mueluRegressio…
…nTest Automatically Merged using Trilinos Pull Request AutoTester PR Title: b'MueLu: Add H2D regression test' PR Author: cgcgcg
- Loading branch information
Showing
4 changed files
with
287 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,140 @@ | ||
// @HEADER | ||
// | ||
// *********************************************************************** | ||
// | ||
// MueLu: A package for multigrid based preconditioning | ||
// Copyright 2012 Sandia Corporation | ||
// | ||
// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, | ||
// the U.S. Government retains certain rights in this software. | ||
// | ||
// Redistribution and use in source and binary forms, with or without | ||
// modification, are permitted provided that the following conditions are | ||
// met: | ||
// | ||
// 1. Redistributions of source code must retain the above copyright | ||
// notice, this list of conditions and the following disclaimer. | ||
// | ||
// 2. Redistributions in binary form must reproduce the above copyright | ||
// notice, this list of conditions and the following disclaimer in the | ||
// documentation and/or other materials provided with the distribution. | ||
// | ||
// 3. Neither the name of the Corporation nor the names of the | ||
// contributors may be used to endorse or promote products derived from | ||
// this software without specific prior written permission. | ||
// | ||
// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY | ||
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE | ||
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, | ||
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, | ||
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR | ||
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF | ||
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING | ||
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS | ||
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | ||
// | ||
// Questions? Contact | ||
// Jonathan Hu ([email protected]) | ||
// Andrey Prokopenko ([email protected]) | ||
// Ray Tuminaro ([email protected]) | ||
// | ||
// *********************************************************************** | ||
// | ||
// @HEADER | ||
#include <Teuchos_UnitTestHarness.hpp> | ||
|
||
#include <Xpetra_Map.hpp> | ||
#include <Xpetra_Matrix.hpp> | ||
|
||
#include <MueLu_config.hpp> | ||
#include <MueLu_TestHelpers.hpp> | ||
#include <MueLu_Version.hpp> | ||
#include <MueLu_Hierarchy.hpp> | ||
#include <MueLu_CreateXpetraPreconditioner.hpp> | ||
|
||
#include <Tpetra_Details_KokkosCounter.hpp> | ||
|
||
namespace MueLuTests { | ||
|
||
TEUCHOS_UNIT_TEST_TEMPLATE_4_DECL(Regression, H2D, Scalar, LocalOrdinal, GlobalOrdinal, Node) { | ||
#include <MueLu_UseShortNames.hpp> | ||
MUELU_TESTING_SET_OSTREAM; | ||
MUELU_TESTING_LIMIT_SCOPE(Scalar, GlobalOrdinal, Node); | ||
out << "version: " << MueLu::Version() << std::endl; | ||
|
||
typedef typename Teuchos::ScalarTraits<SC>::magnitudeType real_type; | ||
typedef typename Xpetra::MultiVector<real_type, LO, GO, NO> RealValuedMultiVector; | ||
|
||
RCP<const Teuchos::Comm<int> > comm = TestHelpers::Parameters::getDefaultComm(); | ||
if (comm->getSize() != 1) { | ||
out << "Skipping test for more than 1 proc" << std::endl; | ||
return; | ||
} | ||
Teuchos::RCP<Teuchos::StackedTimer> stacked_timer = rcp(new Teuchos::StackedTimer("H2D")); | ||
Teuchos::TimeMonitor::setStackedTimer(stacked_timer); | ||
int numRows = 399; | ||
RCP<Matrix> A = TestHelpers::TestFactory<Scalar, LocalOrdinal, GlobalOrdinal, Node>::Build1DPoisson(numRows); | ||
GO nx = numRows; | ||
Teuchos::ParameterList galeriList; | ||
galeriList.set("nx", nx); | ||
RCP<RealValuedMultiVector> coordinates = Galeri::Xpetra::Utils::CreateCartesianCoordinates<SC, LO, GO, Map, RealValuedMultiVector>("1D", A->getRowMap(), galeriList); | ||
|
||
Teuchos::ParameterList MueLuList; | ||
MueLuList.set("verbosity", "high"); | ||
MueLuList.set("coarse: max size", numRows - 1); // make it so we want two levels | ||
MueLuList.set("smoother: type", "RELAXATION"); | ||
MueLuList.sublist("smoother: params").set("relaxation: type", "Jacobi"); | ||
MueLuList.set("max levels", 2); | ||
MueLuList.set("use kokkos refactor", false); | ||
|
||
Teuchos::ParameterList userParamList = MueLuList.sublist("user data"); | ||
userParamList.set<RCP<RealValuedMultiVector> >("Coordinates", coordinates); | ||
|
||
Tpetra::Details::DeepCopyCounter::reset(); | ||
Tpetra::Details::DeepCopyCounter::start(); | ||
|
||
Teuchos::RCP<MueLu::Hierarchy<Scalar, LocalOrdinal, GlobalOrdinal, Node> > H = | ||
MueLu::CreateXpetraPreconditioner<Scalar, LocalOrdinal, GlobalOrdinal, Node>(A, MueLuList); | ||
|
||
Tpetra::Details::DeepCopyCounter::stop(); | ||
|
||
// confirm that we did get a hierarchy with two levels -- a sanity check for this test | ||
TEST_EQUALITY(2, H->GetGlobalNumLevels()); | ||
|
||
if (Node::is_cpu) { | ||
TEST_EQUALITY(Tpetra::Details::DeepCopyCounter::get_count_different_space(), 0); | ||
} else { | ||
TEST_EQUALITY(Tpetra::Details::DeepCopyCounter::get_count_different_space(), 37); | ||
} | ||
|
||
auto X = Xpetra::MultiVectorFactory<SC, LO, GO, NO>::Build(A->getRowMap(), 1); | ||
auto B = Xpetra::MultiVectorFactory<SC, LO, GO, NO>::Build(A->getRowMap(), 1); | ||
|
||
Tpetra::Details::DeepCopyCounter::reset(); | ||
Tpetra::Details::DeepCopyCounter::start(); | ||
|
||
H->Iterate(*B, *X, 1, false); | ||
|
||
Tpetra::Details::DeepCopyCounter::stop(); | ||
|
||
if (Node::is_cpu) { | ||
TEST_EQUALITY(Tpetra::Details::DeepCopyCounter::get_count_different_space(), 0); | ||
} else { | ||
TEST_EQUALITY(Tpetra::Details::DeepCopyCounter::get_count_different_space(), 2); | ||
} | ||
|
||
stacked_timer->stopBaseTimer(); | ||
Teuchos::StackedTimer::OutputOptions options; | ||
options.output_fraction = options.output_histogram = options.output_minmax = true; | ||
stacked_timer->report(out, comm, options); | ||
|
||
} // H2D | ||
|
||
#define MUELU_ETI_GROUP(Scalar, LO, GO, Node) \ | ||
TEUCHOS_UNIT_TEST_TEMPLATE_4_INSTANT(Regression, H2D, Scalar, LO, GO, Node) | ||
|
||
#include <MueLu_ETI_4arg.hpp> | ||
|
||
} // namespace MueLuTests |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,145 @@ | ||
// @HEADER | ||
// | ||
// *********************************************************************** | ||
// | ||
// MueLu: A package for multigrid based preconditioning | ||
// Copyright 2012 Sandia Corporation | ||
// | ||
// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, | ||
// the U.S. Government retains certain rights in this software. | ||
// | ||
// Redistribution and use in source and binary forms, with or without | ||
// modification, are permitted provided that the following conditions are | ||
// met: | ||
// | ||
// 1. Redistributions of source code must retain the above copyright | ||
// notice, this list of conditions and the following disclaimer. | ||
// | ||
// 2. Redistributions in binary form must reproduce the above copyright | ||
// notice, this list of conditions and the following disclaimer in the | ||
// documentation and/or other materials provided with the distribution. | ||
// | ||
// 3. Neither the name of the Corporation nor the names of the | ||
// contributors may be used to endorse or promote products derived from | ||
// this software without specific prior written permission. | ||
// | ||
// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY | ||
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE | ||
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, | ||
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, | ||
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR | ||
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF | ||
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING | ||
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS | ||
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | ||
// | ||
// Questions? Contact | ||
// Jonathan Hu ([email protected]) | ||
// Andrey Prokopenko ([email protected]) | ||
// Ray Tuminaro ([email protected]) | ||
// | ||
// *********************************************************************** | ||
// | ||
// @HEADER | ||
#include <Teuchos_UnitTestHarness.hpp> | ||
|
||
#include <Xpetra_Map.hpp> | ||
#include <Xpetra_Matrix.hpp> | ||
// Galeri | ||
#include <Galeri_XpetraParameters.hpp> | ||
#include <Galeri_XpetraProblemFactory.hpp> | ||
#include <Galeri_XpetraUtils.hpp> | ||
|
||
#include <MueLu_config.hpp> | ||
#include <MueLu_TestHelpers_kokkos.hpp> | ||
#include <MueLu_Version.hpp> | ||
#include <MueLu_Hierarchy.hpp> | ||
#include <MueLu_CreateXpetraPreconditioner.hpp> | ||
|
||
#include <Tpetra_Details_KokkosCounter.hpp> | ||
|
||
namespace MueLuTests { | ||
|
||
TEUCHOS_UNIT_TEST_TEMPLATE_4_DECL(Regression, H2D, Scalar, LocalOrdinal, GlobalOrdinal, Node) { | ||
#include <MueLu_UseShortNames.hpp> | ||
MUELU_TESTING_SET_OSTREAM; | ||
MUELU_TESTING_LIMIT_SCOPE(Scalar, GlobalOrdinal, Node); | ||
out << "version: " << MueLu::Version() << std::endl; | ||
|
||
typedef typename Teuchos::ScalarTraits<SC>::magnitudeType real_type; | ||
typedef typename Xpetra::MultiVector<real_type, LO, GO, NO> RealValuedMultiVector; | ||
|
||
RCP<const Teuchos::Comm<int> > comm = TestHelpers_kokkos::Parameters::getDefaultComm(); | ||
if (comm->getSize() != 1) { | ||
out << "Skipping test for more than 1 proc" << std::endl; | ||
return; | ||
} | ||
Teuchos::RCP<Teuchos::StackedTimer> stacked_timer = rcp(new Teuchos::StackedTimer("H2D")); | ||
Teuchos::TimeMonitor::setStackedTimer(stacked_timer); | ||
int numRows = 399; | ||
RCP<Matrix> A = MueLuTests::TestHelpers_kokkos::TestFactory<SC, LO, GO, NO>::Build1DPoisson(numRows); | ||
RCP<const Map> map = A->getMap(); | ||
RCP<RealValuedMultiVector> coordinates = Xpetra::MultiVectorFactory<real_type, LO, GO, NO>::Build(map, 1); | ||
RCP<MultiVector> nullspace = MultiVectorFactory::Build(map, 1); | ||
nullspace->putScalar(Teuchos::ScalarTraits<SC>::one()); | ||
|
||
Teuchos::ParameterList MueLuList; | ||
MueLuList.set("verbosity", "high"); | ||
MueLuList.set("coarse: max size", numRows - 1); // make it so we want two levels | ||
MueLuList.set("smoother: type", "RELAXATION"); | ||
MueLuList.sublist("smoother: params").set("relaxation: type", "Jacobi"); | ||
MueLuList.set("max levels", 2); | ||
MueLuList.set("use kokkos refactor", true); | ||
|
||
Teuchos::ParameterList userParamList = MueLuList.sublist("user data"); | ||
userParamList.set<RCP<RealValuedMultiVector> >("Coordinates", coordinates); | ||
userParamList.set<RCP<MultiVector> >("Nullspace", nullspace); | ||
|
||
Tpetra::Details::DeepCopyCounter::reset(); | ||
Tpetra::Details::DeepCopyCounter::start(); | ||
|
||
Teuchos::RCP<MueLu::Hierarchy<Scalar, LocalOrdinal, GlobalOrdinal, Node> > H = | ||
MueLu::CreateXpetraPreconditioner<Scalar, LocalOrdinal, GlobalOrdinal, Node>(A, MueLuList); | ||
|
||
Tpetra::Details::DeepCopyCounter::stop(); | ||
|
||
// confirm that we did get a hierarchy with two levels -- a sanity check for this test | ||
TEST_EQUALITY(2, H->GetGlobalNumLevels()); | ||
|
||
if (Node::is_cpu) { | ||
TEST_EQUALITY(Tpetra::Details::DeepCopyCounter::get_count_different_space(), 0); | ||
} else { | ||
TEST_EQUALITY(Tpetra::Details::DeepCopyCounter::get_count_different_space(), 42); | ||
} | ||
|
||
auto X = Xpetra::MultiVectorFactory<SC, LO, GO, NO>::Build(map, 1); | ||
auto B = Xpetra::MultiVectorFactory<SC, LO, GO, NO>::Build(map, 1); | ||
|
||
Tpetra::Details::DeepCopyCounter::reset(); | ||
Tpetra::Details::DeepCopyCounter::start(); | ||
|
||
H->Iterate(*B, *X, 1, false); | ||
|
||
Tpetra::Details::DeepCopyCounter::stop(); | ||
|
||
if (Node::is_cpu) { | ||
TEST_EQUALITY(Tpetra::Details::DeepCopyCounter::get_count_different_space(), 0); | ||
} else { | ||
TEST_EQUALITY(Tpetra::Details::DeepCopyCounter::get_count_different_space(), 2); | ||
} | ||
|
||
stacked_timer->stopBaseTimer(); | ||
Teuchos::StackedTimer::OutputOptions options; | ||
options.output_fraction = options.output_histogram = options.output_minmax = true; | ||
stacked_timer->report(out, comm, options); | ||
|
||
} // H2D | ||
|
||
#define MUELU_ETI_GROUP(Scalar, LO, GO, Node) \ | ||
TEUCHOS_UNIT_TEST_TEMPLATE_4_INSTANT(Regression, H2D, Scalar, LO, GO, Node) | ||
|
||
#include <MueLu_ETI_4arg.hpp> | ||
|
||
} // namespace MueLuTests |