89 using BVector =
typename BlackoilModel<TypeTag>::BVector;
92 using Mat =
typename BlackoilModel<TypeTag>::Mat;
94 static constexpr int numEq = Indices::numEq;
101 : model_(model), rank_(model_.simulator().vanguard().grid().comm().rank())
113 using EntitySeed =
typename Grid::template Codim<0>::EntitySeed;
123 const auto& grid = model_.simulator().vanguard().grid();
126 const auto& gridView = grid.leafGridView();
130 for (
auto it =
beg; it != end; ++it, ++cell) {
132 seeds[
p][count[
p]] = it->seed();
139 for (
int index = 0; index <
num_domains; ++index) {
145 Dune::SubGridPart<Grid> view{grid, std::move(
seeds[index])};
147 this->domains_.emplace_back(index,
157 for (
int index = 0; index <
num_domains; ++index) {
161 const auto& eclState = model_.simulator().vanguard().eclState();
164 loc_param.init(eclState.getSimulationConfig().useCPR());
166 if (domains_[index].cells.size() < 200) {
169 loc_param.linear_solver_print_json_definition_ =
false;
172 domain_linsolvers_.back().setDomainIndex(index);
182 model_.wellModel().setupDomains(domains_);
186 template <
class NonlinearSolverType>
197 if (report.converged) {
203 auto& solution = model_.simulator().model().solution(0);
212 std::vector<SimulatorReportSingle>
domain_reports(domains_.size());
217 switch (model_.param().local_solve_approach_) {
218 case DomainSolveApproach::Jacobi:
223 case DomainSolveApproach::GaussSeidel:
238 logger.debug(fmt::format(
"Convergence failure in domain {} on rank {}." ,
domain.index, rank_));
260 if (
dr.total_newton_iterations == 0) {
267 local_reports_accumulated_ +=
rep;
270 if (model_.param().local_solve_approach_ == DomainSolveApproach::Jacobi) {
272 model_.simulator().model().invalidateAndUpdateIntensiveQuantities(0);
283 const auto& comm = model_.simulator().vanguard().grid().comm();
284 if (comm.size() > 1) {
285 const auto*
ccomm = model_.simulator().model().newtonMethod().linearSolver().comm();
288 ccomm->copyOwnerToAll(solution, solution);
291 const std::size_t
num = solution.size();
293 for (std::size_t
ii = 0;
ii <
num; ++
ii) {
297 for (std::size_t
ii = 0;
ii <
num; ++
ii) {
302 model_.simulator().model().invalidateAndUpdateIntensiveQuantitiesOverlap(0);
311 OpmLog::debug(fmt::format(
"Local solves finished. Converged for {}/{} domains. {} domains did no work. {} total local Newton iterations.\n",
323 report.converged =
true;
331 return local_reports_accumulated_;
334 void writePartitions(
const std::filesystem::path&
odir)
const
336 const auto& elementMapper = this->model_.simulator().model().elementMapper();
337 const auto&
cartMapper = this->model_.simulator().vanguard().cartesianIndexMapper();
339 const auto& grid = this->model_.simulator().vanguard().grid();
340 const auto& comm = grid.comm();
341 const auto nDigit = 1 +
static_cast<int>(std::floor(std::log10(comm.size())));
343 std::ofstream
pfile {
odir / fmt::format(
"{1:0>{0}}",
nDigit, comm.rank()) };
345 const auto p = this->reconstitutePartitionVector();
348 pfile << comm.rank() <<
' '
349 <<
cartMapper.cartesianIndex(elementMapper.index(cell)) <<
' '
357 std::pair<SimulatorReportSingle, ConvergenceReport>
358 solveDomain(
const Domain&
domain,
359 const SimulatorTimerInterface& timer,
366 SimulatorReportSingle report;
367 Dune::Timer solveTimer;
387 report += this->assembleReservoirDomain(
domain);
396 report.converged =
true;
404 model_.wellModel().linearizeDomain(
domain,
408 report.assemble_time +=
tt1;
409 report.assemble_time_well +=
tt1;
412 const int max_iter = model_.param().max_local_solve_iterations_;
421 const int nc = grid.size(0);
425 this->solveJacobianSystemDomain(
domain, x);
426 model_.wellModel().postSolveDomain(x,
domain);
431 report.linear_solve_setup_time += model_.linearSolveSetupTime();
432 report.total_linear_iterations = model_.linearIterationsLastSolve();
437 this->updateDomainSolution(
domain, x);
451 report += this->assembleReservoirDomain(
domain);
465 model_.wellModel().linearizeDomain(
domain,
469 report.assemble_time +=
tt2;
470 report.assemble_time_well +=
tt2;
489 report.total_newton_iterations =
iter;
490 report.total_linearizations =
iter;
491 report.total_time = solveTimer.stop();
497 SimulatorReportSingle assembleReservoirDomain(
const Domain&
domain)
500 model_.simulator().model().linearizer().linearizeDomain(
domain);
501 return model_.wellModel().lastReport();
505 void solveJacobianSystemDomain(
const Domain&
domain, BVector&
global_x)
513 if (domain_matrices_[
domain.index]) {
518 auto&
jac = *domain_matrices_[
domain.index];
519 auto res = Details::extractVector(
modelSimulator.model().linearizer().residual(),
530 model_.linearSolveSetupTime() =
perfTimer.stop();
538 void updateDomainSolution(
const Domain&
domain,
const BVector&
dx)
540 auto& simulator = model_.simulator();
541 auto& newtonMethod = simulator.model().newtonMethod();
542 SolutionVector& solution = simulator.model().solution(0);
544 newtonMethod.update_(solution,
553 simulator.model().invalidateAndUpdateIntensiveQuantities(0,
domain);
557 std::pair<Scalar, Scalar> localDomainConvergenceData(
const Domain&
domain,
558 std::vector<Scalar>&
R_sum,
560 std::vector<Scalar>&
B_avg,
573 const auto& gridView =
domain.view;
574 const auto&
elemEndIt = gridView.template end<0>();
581 if (
elemIt->partitionType() != Dune::InteriorEntity) {
586 elemCtx.updatePrimaryIntensiveQuantities(0);
607 for (
int i = 0; i<
bSize; ++i )
615 ConvergenceReport getDomainReservoirConvergence(
const double reportTime,
620 std::vector<Scalar>&
B_avg,
623 using Vector = std::vector<Scalar>;
639 iteration >= model_.param().min_strict_cnv_iter_;
642 const Scalar
tol_cnv = model_.param().local_tolerance_scaling_cnv_
644 : model_.param().tolerance_cnv_);
647 const Scalar
tol_mb = model_.param().local_tolerance_scaling_mb_
648 * (
use_relaxed_mb ? model_.param().tolerance_mb_relaxed_ : model_.param().tolerance_mb_);
661 ConvergenceReport report{reportTime};
662 using CR = ConvergenceReport;
665 CR::ReservoirFailure::Type
types[2] = { CR::ReservoirFailure::Type::MassBalance,
666 CR::ReservoirFailure::Type::Cnv };
668 for (
int ii : {0, 1}) {
669 if (std::isnan(
res[
ii])) {
670 report.setReservoirFailed({
types[
ii], CR::Severity::NotANumber,
compIdx});
671 logger.debug(
"NaN residual for " + model_.compNames().name(
compIdx) +
" equation.");
672 }
else if (
res[
ii] > model_.param().max_residual_allowed_) {
673 report.setReservoirFailed({
types[
ii], CR::Severity::TooLarge,
compIdx});
674 logger.debug(
"Too large residual for " + model_.compNames().name(
compIdx) +
" equation.");
675 }
else if (
res[
ii] < 0.0) {
676 report.setReservoirFailed({
types[
ii], CR::Severity::Normal,
compIdx});
677 logger.debug(
"Negative residual for " + model_.compNames().name(
compIdx) +
" equation.");
679 report.setReservoirFailed({
types[
ii], CR::Severity::Normal,
compIdx});
691 std::string
msg = fmt::format(
"Domain {} on rank {}, size {}, containing cell {}\n| Iter",
706 std::ostringstream
ss;
708 const std::streamsize
oprec =
ss.precision(3);
709 const std::ios::fmtflags
oflags =
ss.setf(std::ios::scientific);
725 ConvergenceReport getDomainConvergence(
const Domain&
domain,
726 const SimulatorTimerInterface& timer,
731 std::vector<Scalar>
B_avg(numEq, 0.0);
732 auto report = this->getDomainReservoirConvergence(timer.simulationTimeElapsed(),
733 timer.currentStepLength(),
744 std::vector<int> getSubdomainOrder()
752 if (model_.param().local_solve_approach_ == DomainSolveApproach::Jacobi) {
755 }
else if (model_.param().local_solve_approach_ == DomainSolveApproach::GaussSeidel) {
758 switch (model_.param().local_domain_ordering_) {
759 case DomainOrderingMeasure::AveragePressure: {
761 for (
const auto&
domain : domains_) {
763 for (
const int c :
domain.cells) {
764 press_sum += solution[
c][Indices::pressureSwitchIdx];
771 case DomainOrderingMeasure::MaxPressure: {
773 for (
const auto&
domain : domains_) {
775 for (
const int c :
domain.cells) {
782 case DomainOrderingMeasure::Residual: {
784 const auto& residual =
modelSimulator.model().linearizer().residual();
785 const int num_vars = residual[0].size();
786 for (
const auto&
domain : domains_) {
788 for (
const int c :
domain.cells) {
802 [&
m](
const int i1,
const int i2){ return m[i1] > m[i2]; });
805 throw std::logic_error(
"Domain solve approach must be Jacobi or Gauss-Seidel");
809 template<
class GlobalEqVector>
810 void solveDomainJacobi(GlobalEqVector& solution,
815 const SimulatorTimerInterface& timer,
826 model_.simulator().model().invalidateAndUpdateIntensiveQuantities(0,
domain);
830 model_.simulator().model().invalidateAndUpdateIntensiveQuantities(0,
domain);
834 template<
class GlobalEqVector>
835 void solveDomainGaussSeidel(GlobalEqVector& solution,
840 const SimulatorTimerInterface& timer,
856 for (
const auto&
rc :
convrep.reservoirConvergence()) {
857 if (
rc.type() == ConvergenceReport::ReservoirFailure::Type::MassBalance) {
859 }
else if (
rc.type() == ConvergenceReport::ReservoirFailure::Type::Cnv) {
868 logger.debug(fmt::format(
"Accepting solution in unconverged domain {} on rank {}.",
domain.index, rank_));
871 logger.debug(
"Unconverged local solution.");
874 logger.debug(
"Unconverged local solution with well convergence failures:");
875 for (
const auto&
wf :
convrep.wellFailures()) {
886 model_.simulator().model().invalidateAndUpdateIntensiveQuantities(0,
domain);
890 Scalar computeCnvErrorPvLocal(
const Domain&
domain,
891 const std::vector<Scalar>&
B_avg,
double dt)
const
894 const auto& simulator = model_.simulator();
895 const auto& model = simulator.model();
896 const auto& problem = simulator.problem();
897 const auto& residual = simulator.model().linearizer().residual();
918 decltype(
auto) partitionCells()
const
920 const auto& grid = this->model_.simulator().vanguard().grid();
922 using GridView = std::remove_cv_t<std::remove_reference_t<
923 decltype(grid.leafGridView())>>;
925 using Element = std::remove_cv_t<std::remove_reference_t<
926 typename GridView::template Codim<0>::Entity>>;
928 const auto& param = this->model_.param();
932 zoltan_ctrl.domain_imbalance = param.local_domain_partition_imbalance_;
935 [elementMapper = &this->model_.simulator().model().elementMapper()]
936 (
const Element& element)
938 return elementMapper->index(element);
942 [
cartMapper = &this->model_.simulator().vanguard().cartesianIndexMapper()]
949 const auto need_wells = param.local_domain_partition_method_ ==
"zoltan";
952 ? this->model_.simulator().vanguard().schedule().getWellsatEnd()
953 : std::vector<Well>{};
956 ? this->model_.simulator().vanguard().schedule().getPossibleFutureConnections()
957 : std::unordered_map<std::string, std::set<int>> {};
961 const int num_domains = (param.num_local_domains_ > 0)
962 ? param.num_local_domains_
965 return ::Opm::partitionCells(param.local_domain_partition_method_,
970 std::vector<int> reconstitutePartitionVector()
const
972 const auto& grid = this->model_.simulator().vanguard().grid();
974 auto numD = std::vector<int>(grid.comm().size() + 1, 0);
975 numD[grid.comm().rank() + 1] =
static_cast<int>(this->domains_.size());
976 grid.comm().sum(
numD.data(),
numD.size());
977 std::partial_sum(
numD.begin(),
numD.end(),
numD.begin());
979 auto p = std::vector<int>(grid.size(0));
980 auto maxCellIdx = std::numeric_limits<int>::min();
982 auto d =
numD[grid.comm().rank()];
984 for (
const auto& cell :
domain.cells) {
999 std::vector<Domain> domains_;
1000 std::vector<std::unique_ptr<Mat>> domain_matrices_;
1001 std::vector<ISTLSolverType> domain_linsolvers_;
1002 SimulatorReportSingle local_reports_accumulated_;