mirror of
https://github.com/OPM/opm-simulators.git
synced 2025-02-25 18:55:30 -06:00
Change order of constructor arguments.
This allows simplification, and having just two constructors.
This commit is contained in:
@@ -36,32 +36,23 @@ namespace Dune
|
|||||||
/// Create a sequential solver.
|
/// Create a sequential solver.
|
||||||
template <class MatrixType, class VectorType>
|
template <class MatrixType, class VectorType>
|
||||||
FlexibleSolver<MatrixType, VectorType>::
|
FlexibleSolver<MatrixType, VectorType>::
|
||||||
FlexibleSolver(const boost::property_tree::ptree& prm, const MatrixType& matrix,
|
FlexibleSolver(const MatrixType& matrix,
|
||||||
|
const boost::property_tree::ptree& prm,
|
||||||
const std::function<VectorType()>& weightsCalculator)
|
const std::function<VectorType()>& weightsCalculator)
|
||||||
{
|
{
|
||||||
init(prm, matrix, weightsCalculator, Dune::Amg::SequentialInformation());
|
init(matrix, Dune::Amg::SequentialInformation(), prm, weightsCalculator);
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Create a parallel solver (if Comm is e.g. OwnerOverlapCommunication).
|
/// Create a parallel solver (if Comm is e.g. OwnerOverlapCommunication).
|
||||||
template <class MatrixType, class VectorType>
|
template <class MatrixType, class VectorType>
|
||||||
template <class Comm>
|
template <class Comm>
|
||||||
FlexibleSolver<MatrixType, VectorType>::
|
FlexibleSolver<MatrixType, VectorType>::
|
||||||
FlexibleSolver(const boost::property_tree::ptree& prm,
|
FlexibleSolver(const MatrixType& matrix,
|
||||||
const MatrixType& matrix,
|
const Comm& comm,
|
||||||
// const Comm& comm)
|
const boost::property_tree::ptree& prm,
|
||||||
const typename std::enable_if<IsComm<Comm>::value, Comm>::type& comm)
|
const std::function<VectorType()>& weightsCalculator)
|
||||||
{
|
{
|
||||||
init(prm, matrix, std::function<VectorType()>(), comm);
|
init(matrix, comm, prm, weightsCalculator);
|
||||||
}
|
|
||||||
|
|
||||||
/// Create a parallel solver (if Comm is e.g. OwnerOverlapCommunication).
|
|
||||||
template <class MatrixType, class VectorType>
|
|
||||||
template <class Comm>
|
|
||||||
FlexibleSolver<MatrixType, VectorType>::
|
|
||||||
FlexibleSolver(const boost::property_tree::ptree& prm, const MatrixType& matrix,
|
|
||||||
const std::function<VectorType()>& weightsCalculator, const Comm& comm)
|
|
||||||
{
|
|
||||||
init(prm, matrix, weightsCalculator, comm);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
template <class MatrixType, class VectorType>
|
template <class MatrixType, class VectorType>
|
||||||
@@ -183,8 +174,10 @@ namespace Dune
|
|||||||
template <class Comm>
|
template <class Comm>
|
||||||
void
|
void
|
||||||
FlexibleSolver<MatrixType, VectorType>::
|
FlexibleSolver<MatrixType, VectorType>::
|
||||||
init(const boost::property_tree::ptree& prm, const MatrixType& matrix,
|
init(const MatrixType& matrix,
|
||||||
const std::function<VectorType()> weightsCalculator, const Comm& comm)
|
const Comm& comm,
|
||||||
|
const boost::property_tree::ptree& prm,
|
||||||
|
const std::function<VectorType()> weightsCalculator)
|
||||||
{
|
{
|
||||||
initOpPrecSp(matrix, prm, weightsCalculator, comm);
|
initOpPrecSp(matrix, prm, weightsCalculator, comm);
|
||||||
initSolver(prm, comm.communicator().rank()==0);
|
initSolver(prm, comm.communicator().rank()==0);
|
||||||
@@ -203,45 +196,36 @@ template <int N>
|
|||||||
using OBM = Dune::BCRSMatrix<Opm::MatrixBlock<double, N, N>>;
|
using OBM = Dune::BCRSMatrix<Opm::MatrixBlock<double, N, N>>;
|
||||||
|
|
||||||
// Variants using Dune::FieldMatrix blocks.
|
// Variants using Dune::FieldMatrix blocks.
|
||||||
// template class Dune::FlexibleSolver<BM<1>, BV<1>>;
|
template class Dune::FlexibleSolver<BM<1>, BV<1>>;
|
||||||
// template class Dune::FlexibleSolver<BM<2>, BV<2>>;
|
template class Dune::FlexibleSolver<BM<2>, BV<2>>;
|
||||||
template class Dune::FlexibleSolver<BM<3>, BV<3>>;
|
template class Dune::FlexibleSolver<BM<3>, BV<3>>;
|
||||||
// template class Dune::FlexibleSolver<BM<4>, BV<4>>;
|
template class Dune::FlexibleSolver<BM<4>, BV<4>>;
|
||||||
/*
|
|
||||||
// Variants using Opm::MatrixBlock blocks.
|
// Variants using Opm::MatrixBlock blocks.
|
||||||
template class Dune::FlexibleSolver<OBM<1>, BV<1>>;
|
template class Dune::FlexibleSolver<OBM<1>, BV<1>>;
|
||||||
template class Dune::FlexibleSolver<OBM<2>, BV<2>>;
|
template class Dune::FlexibleSolver<OBM<2>, BV<2>>;
|
||||||
template class Dune::FlexibleSolver<OBM<3>, BV<3>>;
|
template class Dune::FlexibleSolver<OBM<3>, BV<3>>;
|
||||||
template class Dune::FlexibleSolver<OBM<4>, BV<4>>;
|
template class Dune::FlexibleSolver<OBM<4>, BV<4>>;
|
||||||
|
|
||||||
|
|
||||||
using Comm = Dune::OwnerOverlapCopyCommunication<int, int>;
|
using Comm = Dune::OwnerOverlapCopyCommunication<int, int>;
|
||||||
|
|
||||||
template Dune::FlexibleSolver<OBM<1>, BV<1>>::FlexibleSolver(const boost::property_tree::ptree& prm,
|
template Dune::FlexibleSolver<OBM<1>, BV<1>>::FlexibleSolver(const MatrixType& matrix,
|
||||||
const OBM<1>& matrix,
|
const Comm& comm,
|
||||||
const Comm&);
|
const boost::property_tree::ptree& prm,
|
||||||
template Dune::FlexibleSolver<OBM<1>, BV<1>>::FlexibleSolver(const boost::property_tree::ptree& prm,
|
const std::function<BV<1>()>& weightsCalculator);
|
||||||
const MatrixType& matrix,
|
|
||||||
const std::function<BV<1>()>& weightsCalculator,
|
template Dune::FlexibleSolver<OBM<2>, BV<2>>::FlexibleSolver(const MatrixType& matrix,
|
||||||
const Comm& comm);
|
const Comm& comm,
|
||||||
template Dune::FlexibleSolver<OBM<2>, BV<2>>::FlexibleSolver(const boost::property_tree::ptree& prm,
|
const boost::property_tree::ptree& prm,
|
||||||
const OBM<2>& matrix,
|
const std::function<BV<2>()>& weightsCalculator);
|
||||||
const Comm&);
|
|
||||||
template Dune::FlexibleSolver<OBM<2>, BV<2>>::FlexibleSolver(const boost::property_tree::ptree& prm,
|
template Dune::FlexibleSolver<OBM<3>, BV<3>>::FlexibleSolver(const MatrixType& matrix,
|
||||||
const MatrixType& matrix,
|
const Comm& comm,
|
||||||
const std::function<BV<2>()>& weightsCalculator,
|
const boost::property_tree::ptree& prm,
|
||||||
const Comm& comm);
|
const std::function<BV<3>()>& weightsCalculator);
|
||||||
template Dune::FlexibleSolver<OBM<3>, BV<3>>::FlexibleSolver(const boost::property_tree::ptree& prm,
|
|
||||||
const OBM<3>& matrix,
|
template Dune::FlexibleSolver<OBM<4>, BV<4>>::FlexibleSolver(const MatrixType& matrix,
|
||||||
const Comm&);
|
const Comm& comm,
|
||||||
template Dune::FlexibleSolver<OBM<3>, BV<3>>::FlexibleSolver(const boost::property_tree::ptree& prm,
|
const boost::property_tree::ptree& prm,
|
||||||
const MatrixType& matrix,
|
const std::function<BV<4>()>& weightsCalculator);
|
||||||
const std::function<BV<3>()>& weightsCalculator,
|
|
||||||
const Comm& comm);
|
|
||||||
template Dune::FlexibleSolver<OBM<4>, BV<4>>::FlexibleSolver(const boost::property_tree::ptree& prm,
|
|
||||||
const OBM<4>& matrix,
|
|
||||||
const Comm&);
|
|
||||||
template Dune::FlexibleSolver<OBM<4>, BV<4>>::FlexibleSolver(const boost::property_tree::ptree& prm,
|
|
||||||
const MatrixType& matrix,
|
|
||||||
const std::function<BV<4>()>& weightsCalculator,
|
|
||||||
const Comm& comm);
|
|
||||||
*/
|
|
||||||
|
|||||||
@@ -35,19 +35,6 @@
|
|||||||
namespace Dune
|
namespace Dune
|
||||||
{
|
{
|
||||||
|
|
||||||
template<class C>
|
|
||||||
struct IsComm : std::false_type
|
|
||||||
{};
|
|
||||||
|
|
||||||
template<>
|
|
||||||
struct IsComm<Dune::Amg::SequentialInformation> : std::true_type
|
|
||||||
{};
|
|
||||||
|
|
||||||
#if HAVE_MPI
|
|
||||||
template<class Index>
|
|
||||||
struct IsComm<Dune::OwnerOverlapCopyCommunication<Index>> : std::true_type
|
|
||||||
{};
|
|
||||||
#endif
|
|
||||||
/// A solver class that encapsulates all needed objects for a linear solver
|
/// A solver class that encapsulates all needed objects for a linear solver
|
||||||
/// (operator, scalar product, iterative solver and preconditioner) and sets
|
/// (operator, scalar product, iterative solver and preconditioner) and sets
|
||||||
/// them up based on runtime parameters, using the PreconditionerFactory for
|
/// them up based on runtime parameters, using the PreconditionerFactory for
|
||||||
@@ -60,20 +47,16 @@ public:
|
|||||||
using VectorType = VectorTypeT;
|
using VectorType = VectorTypeT;
|
||||||
|
|
||||||
/// Create a sequential solver.
|
/// Create a sequential solver.
|
||||||
FlexibleSolver(const boost::property_tree::ptree& prm, const MatrixType& matrix,
|
FlexibleSolver(const MatrixType& matrix,
|
||||||
|
const boost::property_tree::ptree& prm,
|
||||||
const std::function<VectorTypeT()>& weightsCalculator = std::function<VectorTypeT()>());
|
const std::function<VectorTypeT()>& weightsCalculator = std::function<VectorTypeT()>());
|
||||||
|
|
||||||
/// Create a parallel solver (if Comm is e.g. OwnerOverlapCommunication).
|
/// Create a parallel solver (if Comm is e.g. OwnerOverlapCommunication).
|
||||||
template <class Comm>
|
template <class Comm>
|
||||||
FlexibleSolver(const boost::property_tree::ptree& prm,
|
FlexibleSolver(const MatrixType& matrix,
|
||||||
const MatrixType& matrix,
|
const Comm& comm,
|
||||||
// const Comm& comm);
|
const boost::property_tree::ptree& prm,
|
||||||
const typename std::enable_if<IsComm<Comm>::value, Comm>::type& comm);
|
const std::function<VectorTypeT()>& weightsCalculator = std::function<VectorTypeT()>());
|
||||||
|
|
||||||
/// Create a parallel solver (if Comm is e.g. OwnerOverlapCommunication).
|
|
||||||
template <class Comm>
|
|
||||||
FlexibleSolver(const boost::property_tree::ptree& prm, const MatrixType& matrix,
|
|
||||||
const std::function<VectorTypeT()>& weightsCalculator, const Comm& comm);
|
|
||||||
|
|
||||||
virtual void apply(VectorType& x, VectorType& rhs, Dune::InverseOperatorResult& res) override;
|
virtual void apply(VectorType& x, VectorType& rhs, Dune::InverseOperatorResult& res) override;
|
||||||
|
|
||||||
@@ -105,8 +88,10 @@ private:
|
|||||||
// Main initialization routine.
|
// Main initialization routine.
|
||||||
// Call with Comm == Dune::Amg::SequentialInformation to get a serial solver.
|
// Call with Comm == Dune::Amg::SequentialInformation to get a serial solver.
|
||||||
template <class Comm>
|
template <class Comm>
|
||||||
void init(const boost::property_tree::ptree& prm, const MatrixType& matrix,
|
void init(const MatrixType& matrix,
|
||||||
const std::function<VectorTypeT()> weightsCalculator, const Comm& comm);
|
const Comm& comm,
|
||||||
|
const boost::property_tree::ptree& prm,
|
||||||
|
const std::function<VectorTypeT()> weightsCalculator);
|
||||||
|
|
||||||
std::shared_ptr<AbstractOperatorType> linearoperator_;
|
std::shared_ptr<AbstractOperatorType> linearoperator_;
|
||||||
std::shared_ptr<AbstractPrecondType> preconditioner_;
|
std::shared_ptr<AbstractPrecondType> preconditioner_;
|
||||||
|
|||||||
@@ -905,10 +905,10 @@ protected:
|
|||||||
if (isParallel()) {
|
if (isParallel()) {
|
||||||
#if HAVE_MPI
|
#if HAVE_MPI
|
||||||
assert(noGhostMat_);
|
assert(noGhostMat_);
|
||||||
flexibleSolver_.reset(new FlexibleSolverType(prm_, *noGhostMat_, weightsCalculator, *comm_));
|
flexibleSolver_.reset(new FlexibleSolverType(*noGhostMat_, *comm_, prm_, weightsCalculator));
|
||||||
#endif
|
#endif
|
||||||
} else {
|
} else {
|
||||||
flexibleSolver_.reset(new FlexibleSolverType(prm_, *matrix_, weightsCalculator));
|
flexibleSolver_.reset(new FlexibleSolverType(*matrix_, prm_, weightsCalculator));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
|
|||||||
@@ -199,11 +199,11 @@ public:
|
|||||||
if (isParallel()) {
|
if (isParallel()) {
|
||||||
#if HAVE_MPI
|
#if HAVE_MPI
|
||||||
matrix_ = &mat.istlMatrix();
|
matrix_ = &mat.istlMatrix();
|
||||||
solver_.reset(new SolverType(prm_, mat.istlMatrix(), weightsCalculator, *comm_));
|
solver_.reset(new SolverType(mat.istlMatrix(), *comm_, prm_, weightsCalculator));
|
||||||
#endif
|
#endif
|
||||||
} else {
|
} else {
|
||||||
matrix_ = &mat.istlMatrix();
|
matrix_ = &mat.istlMatrix();
|
||||||
solver_.reset(new SolverType(prm_, mat.istlMatrix(), weightsCalculator));
|
solver_.reset(new SolverType(mat.istlMatrix(), prm_, weightsCalculator));
|
||||||
}
|
}
|
||||||
rhs_ = b;
|
rhs_ = b;
|
||||||
} else {
|
} else {
|
||||||
|
|||||||
@@ -61,9 +61,9 @@ namespace Amg
|
|||||||
: linsolver_()
|
: linsolver_()
|
||||||
{
|
{
|
||||||
if (op.category() == Dune::SolverCategory::overlapping) {
|
if (op.category() == Dune::SolverCategory::overlapping) {
|
||||||
linsolver_.reset(new Solver(prm, op.getmat(), std::function<X()>(), comm));
|
linsolver_.reset(new Solver(op.getmat(), comm, prm, std::function<X()>()));
|
||||||
} else {
|
} else {
|
||||||
linsolver_.reset(new Solver(prm, op.getmat(), std::function<X()>()));
|
linsolver_.reset(new Solver(op.getmat(), prm, std::function<X()>()));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
@@ -70,7 +70,7 @@ testSolver(const boost::property_tree::ptree& prm, const std::string& matrix_fil
|
|||||||
prm.get<int>("preconditioner.pressure_var_index"),
|
prm.get<int>("preconditioner.pressure_var_index"),
|
||||||
transpose);
|
transpose);
|
||||||
};
|
};
|
||||||
Dune::FlexibleSolver<Matrix, Vector> solver(prm, matrix, wc);
|
Dune::FlexibleSolver<Matrix, Vector> solver(matrix, prm, wc);
|
||||||
Vector x(rhs.size());
|
Vector x(rhs.size());
|
||||||
Dune::InverseOperatorResult res;
|
Dune::InverseOperatorResult res;
|
||||||
solver.apply(x, rhs, res);
|
solver.apply(x, rhs, res);
|
||||||
|
|||||||
Reference in New Issue
Block a user