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())
104 const auto& [partition_vector, num_domains] = this->partitionCells();
107 std::vector<int> sizes(num_domains, 0);
108 for (
const auto& p : partition_vector) {
113 using EntitySeed =
typename Grid::template Codim<0>::EntitySeed;
114 std::vector<std::vector<EntitySeed>> seeds(num_domains);
115 std::vector<std::vector<int>> partitions(num_domains);
116 for (
int domain = 0; domain < num_domains; ++domain) {
117 seeds[domain].resize(sizes[domain]);
118 partitions[domain].resize(sizes[domain]);
123 const auto& grid = model_.simulator().vanguard().grid();
125 std::vector<int> count(num_domains, 0);
126 const auto& gridView = grid.leafGridView();
127 const auto beg = gridView.template begin<0, Dune::Interior_Partition>();
128 const auto end = gridView.template end<0, Dune::Interior_Partition>();
130 for (
auto it = beg; it != end; ++it, ++cell) {
131 const int p = partition_vector[cell];
132 seeds[p][count[p]] = it->seed();
133 partitions[p][count[p]] = cell;
136 assert(count == sizes);
139 for (
int index = 0; index < num_domains; ++index) {
140 std::vector<bool> interior(partition_vector.size(),
false);
141 for (
int ix : partitions[index]) {
145 Dune::SubGridPart<Grid> view{grid, std::move(seeds[index])};
147 this->domains_.emplace_back(index,
148 std::move(partitions[index]),
154 domain_matrices_.resize(num_domains);
157 for (
int index = 0; index < num_domains; ++index) {
161 const auto& eclState = model_.simulator().vanguard().eclState();
163 loc_param.is_nldd_local_solver_ =
true;
164 loc_param.init(eclState.getSimulationConfig().useCPR());
166 if (domains_[index].cells.size() < 200) {
167 loc_param.linsolver_ =
"umfpack";
169 loc_param.linear_solver_print_json_definition_ =
false;
170 const bool force_serial =
true;
171 domain_linsolvers_.emplace_back(model_.simulator(), loc_param, force_serial);
172 domain_linsolvers_.back().setDomainIndex(index);
175 assert(
int(domains_.size()) == num_domains);
182 model_.wellModel().setupDomains(domains_);
186 template <
class NonlinearSolverType>
189 NonlinearSolverType& nonlinear_solver)
193 Dune::Timer perfTimer;
195 model_.initialLinearization(report, iteration, nonlinear_solver.minIter(), nonlinear_solver.maxIter(), timer);
197 if (report.converged) {
203 auto& solution = model_.simulator().model().solution(0);
204 auto initial_solution = solution;
205 auto locally_solved = initial_solution;
208 const auto domain_order = this->getSubdomainOrder();
212 std::vector<SimulatorReportSingle> domain_reports(domains_.size());
213 for (
const int domain_index : domain_order) {
214 const auto& domain = domains_[domain_index];
217 switch (model_.param().local_solve_approach_) {
218 case DomainSolveApproach::Jacobi:
219 solveDomainJacobi(solution, locally_solved, local_report, logger,
220 iteration, timer, domain);
223 case DomainSolveApproach::GaussSeidel:
224 solveDomainGaussSeidel(solution, locally_solved, local_report, logger,
225 iteration, timer, domain);
231 local_report.converged =
false;
236 if (!local_report.converged) {
238 logger.debug(fmt::format(
"Convergence failure in domain {} on rank {}." , domain.index, rank_));
240 domain_reports[domain.index] = local_report;
245 global_logger.logMessages();
250 std::array<int, 4> counts{ 0, 0, 0,
static_cast<int>(domain_reports.size()) };
251 int& num_converged = counts[0];
252 int& num_converged_already = counts[1];
253 int& num_local_newtons = counts[2];
254 int& num_domains = counts[3];
257 for (
const auto& dr : domain_reports) {
260 if (dr.total_newton_iterations == 0) {
261 ++num_converged_already;
266 num_local_newtons = rep.total_newton_iterations;
267 local_reports_accumulated_ += rep;
270 if (model_.param().local_solve_approach_ == DomainSolveApproach::Jacobi) {
271 solution = locally_solved;
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();
292 Dune::BlockVector<std::size_t> allmeanings(num);
293 for (std::size_t ii = 0; ii < num; ++ii) {
294 allmeanings[ii] = PVUtil::pack(solution[ii]);
296 ccomm->copyOwnerToAll(allmeanings, allmeanings);
297 for (std::size_t ii = 0; ii < num; ++ii) {
298 PVUtil::unPack(solution[ii], allmeanings[ii]);
302 model_.simulator().model().invalidateAndUpdateIntensiveQuantitiesOverlap(0);
305 comm.sum(counts.data(), counts.size());
309 const bool is_iorank = this->rank_ == 0;
311 OpmLog::debug(fmt::format(
"Local solves finished. Converged for {}/{} domains. {} domains did no work. {} total local Newton iterations.\n",
312 num_converged, num_domains, num_converged_already, num_local_newtons));
320 auto rep = model_.nonlinearIterationNewton(iteration + 100, timer, nonlinear_solver);
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();
347 for (
const auto& cell : elements(grid.leafGridView(), Dune::Partitions::interior)) {
348 pfile << comm.rank() <<
' '
349 << cartMapper.cartesianIndex(elementMapper.index(cell)) <<
' '
357 std::pair<SimulatorReportSingle, ConvergenceReport>
358 solveDomain(
const Domain& domain,
359 const SimulatorTimerInterface& timer,
360 DeferredLogger& logger,
361 [[maybe_unused]]
const int global_iteration,
362 const bool initial_assembly_required)
364 auto& modelSimulator = model_.simulator();
366 SimulatorReportSingle report;
367 Dune::Timer solveTimer;
369 Dune::Timer detailTimer;
371 modelSimulator.model().newtonMethod().setIterationIndex(0);
378 if (initial_assembly_required) {
380 modelSimulator.model().newtonMethod().setIterationIndex(iter);
383 modelSimulator.problem().wellModel().assembleDomain(modelSimulator.model().newtonMethod().numIterations(),
384 modelSimulator.timeStepSize(),
387 report += this->assembleReservoirDomain(domain);
388 report.assemble_time += detailTimer.stop();
392 std::vector<Scalar> resnorms;
393 auto convreport = this->getDomainConvergence(domain, timer, 0, logger, resnorms);
394 if (convreport.converged()) {
396 report.converged =
true;
397 return { report, convreport };
404 model_.wellModel().linearizeDomain(domain,
405 modelSimulator.model().linearizer().jacobian(),
406 modelSimulator.model().linearizer().residual());
407 const double tt1 = detailTimer.stop();
408 report.assemble_time += tt1;
409 report.assemble_time_well += tt1;
412 const int max_iter = model_.param().max_local_solve_iterations_;
413 const auto& grid = modelSimulator.vanguard().grid();
414 double damping_factor = 1.0;
415 std::vector<std::vector<Scalar>> convergence_history;
416 convergence_history.reserve(20);
417 convergence_history.push_back(resnorms);
421 const int nc = grid.size(0);
425 this->solveJacobianSystemDomain(domain, x);
426 model_.wellModel().postSolveDomain(x, domain);
427 if (damping_factor != 1.0) {
430 report.linear_solve_time += detailTimer.stop();
431 report.linear_solve_setup_time += model_.linearSolveSetupTime();
432 report.total_linear_iterations = model_.linearIterationsLastSolve();
437 this->updateDomainSolution(domain, x);
438 report.update_time += detailTimer.stop();
444 modelSimulator.model().newtonMethod().setIterationIndex(iter);
448 modelSimulator.problem().wellModel().assembleDomain(modelSimulator.model().newtonMethod().numIterations(),
449 modelSimulator.timeStepSize(),
451 report += this->assembleReservoirDomain(domain);
452 report.assemble_time += detailTimer.stop();
458 convreport = this->getDomainConvergence(domain, timer, iter, logger, resnorms);
459 convergence_history.push_back(resnorms);
465 model_.wellModel().linearizeDomain(domain,
466 modelSimulator.model().linearizer().jacobian(),
467 modelSimulator.model().linearizer().residual());
468 const double tt2 = detailTimer.stop();
469 report.assemble_time += tt2;
470 report.assemble_time_well += tt2;
473 if (!convreport.converged() && !convreport.wellFailed()) {
474 bool oscillate =
false;
475 bool stagnate =
false;
476 const int numPhases = convergence_history.front().size();
477 detail::detectOscillations(convergence_history, iter, numPhases,
478 Scalar{0.2}, 1, oscillate, stagnate);
480 damping_factor *= 0.85;
481 logger.debug(fmt::format(
"| Damping factor is now {}", damping_factor));
484 }
while (!convreport.converged() && iter <= max_iter);
486 modelSimulator.problem().endIteration();
488 report.converged = convreport.converged();
489 report.total_newton_iterations = iter;
490 report.total_linearizations = iter;
491 report.total_time = solveTimer.stop();
493 return { report, convreport };
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)
507 const auto& modelSimulator = model_.simulator();
509 Dune::Timer perfTimer;
512 const Mat& main_matrix = modelSimulator.model().linearizer().jacobian().istlMatrix();
513 if (domain_matrices_[domain.index]) {
514 Details::copySubMatrix(main_matrix, domain.cells, *domain_matrices_[domain.index]);
516 domain_matrices_[domain.index] = std::make_unique<Mat>(Details::extractMatrix(main_matrix, domain.cells));
518 auto& jac = *domain_matrices_[domain.index];
519 auto res = Details::extractVector(modelSimulator.model().linearizer().residual(),
527 auto& linsolver = domain_linsolvers_[domain.index];
529 linsolver.prepare(jac, res);
530 model_.linearSolveSetupTime() = perfTimer.stop();
531 linsolver.setResidual(res);
534 Details::setGlobal(x, domain.cells, global_x);
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,
559 std::vector<Scalar>& maxCoeff,
560 std::vector<Scalar>& B_avg,
561 std::vector<int>& maxCoeffCell)
563 const auto& modelSimulator = model_.simulator();
565 Scalar pvSumLocal = 0.0;
566 Scalar numAquiferPvSumLocal = 0.0;
567 const auto& model = modelSimulator.model();
568 const auto& problem = modelSimulator.problem();
570 const auto& modelResid = modelSimulator.model().linearizer().residual();
572 ElementContext elemCtx(modelSimulator);
573 const auto& gridView = domain.view;
574 const auto& elemEndIt = gridView.template end<0>();
575 IsNumericalAquiferCell isNumericalAquiferCell(gridView.grid());
577 for (
auto elemIt = gridView.template begin</*codim=*/0>();
581 if (elemIt->partitionType() != Dune::InteriorEntity) {
584 const auto& elem = *elemIt;
585 elemCtx.updatePrimaryStencil(elem);
586 elemCtx.updatePrimaryIntensiveQuantities(0);
588 const unsigned cell_idx = elemCtx.globalSpaceIndex(0, 0);
589 const auto& intQuants = elemCtx.intensiveQuantities(0, 0);
590 const auto& fs = intQuants.fluidState();
592 const auto pvValue = problem.referencePorosity(cell_idx, 0) *
593 model.dofTotalVolume(cell_idx);
594 pvSumLocal += pvValue;
596 if (isNumericalAquiferCell(elem))
598 numAquiferPvSumLocal += pvValue;
601 model_.getMaxCoeff(cell_idx, intQuants, fs, modelResid, pvValue,
602 B_avg, R_sum, maxCoeff, maxCoeffCell);
606 const int bSize = B_avg.size();
607 for (
int i = 0; i<bSize; ++i )
609 B_avg[ i ] /= Scalar(domain.cells.size());
612 return {pvSumLocal, numAquiferPvSumLocal};
615 ConvergenceReport getDomainReservoirConvergence(
const double reportTime,
618 const Domain& domain,
619 DeferredLogger& logger,
620 std::vector<Scalar>& B_avg,
621 std::vector<Scalar>& residual_norms)
623 using Vector = std::vector<Scalar>;
625 const int numComp = numEq;
626 Vector R_sum(numComp, 0.0 );
627 Vector maxCoeff(numComp, std::numeric_limits<Scalar>::lowest() );
628 std::vector<int> maxCoeffCell(numComp, -1);
629 const auto [ pvSum, numAquiferPvSum]
630 = this->localDomainConvergenceData(domain, R_sum, maxCoeff, B_avg, maxCoeffCell);
632 auto cnvErrorPvFraction = computeCnvErrorPvLocal(domain, B_avg, dt);
633 cnvErrorPvFraction /= (pvSum - numAquiferPvSum);
638 const bool use_relaxed_cnv = cnvErrorPvFraction < model_.param().relaxed_max_pv_fraction_ &&
639 iteration >= model_.param().min_strict_cnv_iter_;
642 const Scalar tol_cnv = model_.param().local_tolerance_scaling_cnv_
643 * (use_relaxed_cnv ? model_.param().tolerance_cnv_relaxed_
644 : model_.param().tolerance_cnv_);
646 const bool use_relaxed_mb = iteration >= model_.param().min_strict_mb_iter_;
647 const Scalar tol_mb = model_.param().local_tolerance_scaling_mb_
648 * (use_relaxed_mb ? model_.param().tolerance_mb_relaxed_ : model_.param().tolerance_mb_);
651 std::vector<Scalar> CNV(numComp);
652 std::vector<Scalar> mass_balance_residual(numComp);
653 for (
int compIdx = 0; compIdx < numComp; ++compIdx )
655 CNV[compIdx] = B_avg[compIdx] * dt * maxCoeff[compIdx];
656 mass_balance_residual[compIdx] = std::abs(B_avg[compIdx]*R_sum[compIdx]) * dt / pvSum;
657 residual_norms.push_back(CNV[compIdx]);
661 ConvergenceReport report{reportTime};
662 using CR = ConvergenceReport;
663 for (
int compIdx = 0; compIdx < numComp; ++compIdx) {
664 Scalar res[2] = { mass_balance_residual[compIdx], CNV[compIdx] };
665 CR::ReservoirFailure::Type types[2] = { CR::ReservoirFailure::Type::MassBalance,
666 CR::ReservoirFailure::Type::Cnv };
667 Scalar tol[2] = { tol_mb, tol_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.");
678 }
else if (res[ii] > tol[ii]) {
679 report.setReservoirFailed({types[ii], CR::Severity::Normal, compIdx});
682 report.setReservoirConvergenceMetric(types[ii], compIdx, res[ii], tol[ii]);
687 const bool converged_at_initial_state = (report.converged() && iteration == 0);
688 if (!converged_at_initial_state) {
689 if (iteration == 0) {
691 std::string msg = fmt::format(
"Domain {} on rank {}, size {}, containing cell {}\n| Iter",
692 domain.index, this->rank_, domain.cells.size(), domain.cells[0]);
693 for (
int compIdx = 0; compIdx < numComp; ++compIdx) {
695 msg += model_.compNames().name(compIdx)[0];
698 for (
int compIdx = 0; compIdx < numComp; ++compIdx) {
700 msg += model_.compNames().name(compIdx)[0];
706 std::ostringstream ss;
708 const std::streamsize oprec = ss.precision(3);
709 const std::ios::fmtflags oflags = ss.setf(std::ios::scientific);
710 ss << std::setw(4) << iteration;
711 for (
int compIdx = 0; compIdx < numComp; ++compIdx) {
712 ss << std::setw(11) << mass_balance_residual[compIdx];
714 for (
int compIdx = 0; compIdx < numComp; ++compIdx) {
715 ss << std::setw(11) << CNV[compIdx];
719 logger.debug(ss.str());
725 ConvergenceReport getDomainConvergence(
const Domain& domain,
726 const SimulatorTimerInterface& timer,
728 DeferredLogger& logger,
729 std::vector<Scalar>& residual_norms)
731 std::vector<Scalar> B_avg(numEq, 0.0);
732 auto report = this->getDomainReservoirConvergence(timer.simulationTimeElapsed(),
733 timer.currentStepLength(),
739 report += model_.wellModel().getDomainWellConvergence(domain, B_avg, logger);
744 std::vector<int> getSubdomainOrder()
746 const auto& modelSimulator = model_.simulator();
747 const auto& solution = modelSimulator.model().solution(0);
749 std::vector<int> domain_order(domains_.size());
750 std::iota(domain_order.begin(), domain_order.end(), 0);
752 if (model_.param().local_solve_approach_ == DomainSolveApproach::Jacobi) {
755 }
else if (model_.param().local_solve_approach_ == DomainSolveApproach::GaussSeidel) {
757 std::vector<Scalar> measure_per_domain(domains_.size());
758 switch (model_.param().local_domain_ordering_) {
759 case DomainOrderingMeasure::AveragePressure: {
761 for (
const auto& domain : domains_) {
762 Scalar press_sum = 0.0;
763 for (
const int c : domain.cells) {
764 press_sum += solution[c][Indices::pressureSwitchIdx];
766 const Scalar avgpress = press_sum / domain.cells.size();
767 measure_per_domain[domain.index] = avgpress;
771 case DomainOrderingMeasure::MaxPressure: {
773 for (
const auto& domain : domains_) {
774 Scalar maxpress = 0.0;
775 for (
const int c : domain.cells) {
776 maxpress = std::max(maxpress, solution[c][Indices::pressureSwitchIdx]);
778 measure_per_domain[domain.index] = maxpress;
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) {
789 for (
int ii = 0; ii < num_vars; ++ii) {
790 maxres = std::max(maxres, std::fabs(residual[c][ii]));
793 measure_per_domain[domain.index] = maxres;
800 const auto& m = measure_per_domain;
801 std::stable_sort(domain_order.begin(), domain_order.end(),
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,
811 GlobalEqVector& locally_solved,
812 SimulatorReportSingle& local_report,
813 DeferredLogger& logger,
815 const SimulatorTimerInterface& timer,
816 const Domain& domain)
818 auto initial_local_well_primary_vars = model_.wellModel().getPrimaryVarsDomain(domain);
819 auto initial_local_solution = Details::extractVector(solution, domain.cells);
820 auto res = solveDomain(domain, timer, logger, iteration,
false);
821 local_report = res.first;
822 if (local_report.converged) {
823 auto local_solution = Details::extractVector(solution, domain.cells);
824 Details::setGlobal(local_solution, domain.cells, locally_solved);
825 Details::setGlobal(initial_local_solution, domain.cells, solution);
826 model_.simulator().model().invalidateAndUpdateIntensiveQuantities(0, domain);
828 model_.wellModel().setPrimaryVarsDomain(domain, initial_local_well_primary_vars);
829 Details::setGlobal(initial_local_solution, domain.cells, solution);
830 model_.simulator().model().invalidateAndUpdateIntensiveQuantities(0, domain);
834 template<
class GlobalEqVector>
835 void solveDomainGaussSeidel(GlobalEqVector& solution,
836 GlobalEqVector& locally_solved,
837 SimulatorReportSingle& local_report,
838 DeferredLogger& logger,
840 const SimulatorTimerInterface& timer,
841 const Domain& domain)
843 auto initial_local_well_primary_vars = model_.wellModel().getPrimaryVarsDomain(domain);
844 auto initial_local_solution = Details::extractVector(solution, domain.cells);
845 auto res = solveDomain(domain, timer, logger, iteration,
true);
846 local_report = res.first;
847 if (!local_report.converged) {
850 const auto& convrep = res.second;
852 if (!convrep.wellFailed()) {
855 Scalar cnv_sum = 0.0;
856 for (
const auto& rc : convrep.reservoirConvergence()) {
857 if (rc.type() == ConvergenceReport::ReservoirFailure::Type::MassBalance) {
858 mb_sum += rc.value();
859 }
else if (rc.type() == ConvergenceReport::ReservoirFailure::Type::Cnv) {
860 cnv_sum += rc.value();
864 const Scalar acceptable_local_mb_sum = 1e-3;
865 const Scalar acceptable_local_cnv_sum = 1.0;
866 if (mb_sum < acceptable_local_mb_sum && cnv_sum < acceptable_local_cnv_sum) {
867 local_report.converged =
true;
868 logger.debug(fmt::format(
"Accepting solution in unconverged domain {} on rank {}.", domain.index, rank_));
869 logger.debug(fmt::format(
"Value of mb_sum: {} cnv_sum: {}", mb_sum, cnv_sum));
871 logger.debug(
"Unconverged local solution.");
874 logger.debug(
"Unconverged local solution with well convergence failures:");
875 for (
const auto& wf : convrep.wellFailures()) {
876 logger.debug(to_string(wf));
880 if (local_report.converged) {
881 auto local_solution = Details::extractVector(solution, domain.cells);
882 Details::setGlobal(local_solution, domain.cells, locally_solved);
884 model_.wellModel().setPrimaryVarsDomain(domain, initial_local_well_primary_vars);
885 Details::setGlobal(initial_local_solution, domain.cells, solution);
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();
899 for (
const int cell_idx : domain.cells) {
900 const Scalar pvValue = problem.referencePorosity(cell_idx, 0) *
901 model.dofTotalVolume(cell_idx);
902 const auto& cellResidual = residual[cell_idx];
903 bool cnvViolated =
false;
905 for (
unsigned eqIdx = 0; eqIdx < cellResidual.size(); ++eqIdx) {
907 Scalar CNV = cellResidual[eqIdx] * dt * B_avg[eqIdx] / pvValue;
908 cnvViolated = cnvViolated || (fabs(CNV) > model_.param().tolerance_cnv_);
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();
930 auto zoltan_ctrl = ZoltanPartitioningControl<Element>{};
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);
941 zoltan_ctrl.local_to_global =
942 [cartMapper = &this->model_.simulator().vanguard().cartesianIndexMapper()]
945 return cartMapper->cartesianIndex(elemIdx);
949 const auto need_wells = param.local_domain_partition_method_ ==
"zoltan";
951 const auto wells = need_wells
952 ? this->model_.simulator().vanguard().schedule().getWellsatEnd()
953 : std::vector<Well>{};
955 const auto& possibleFutureConnectionSet = need_wells
956 ? this->model_.simulator().vanguard().schedule().getPossibleFutureConnections()
957 : std::unordered_map<std::string, std::set<int>> {};
960 constexpr int default_cells_per_domain = 1000;
961 const int num_domains = (param.num_local_domains_ > 0)
962 ? param.num_local_domains_
963 : detail::countGlobalCells(grid) / default_cells_per_domain;
965 return ::Opm::partitionCells(param.local_domain_partition_method_,
966 num_domains, grid.leafGridView(), wells,
967 possibleFutureConnectionSet, zoltan_ctrl);
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()];
983 for (
const auto& domain : this->domains_) {
984 for (
const auto& cell : domain.cells) {
986 if (cell > maxCellIdx) {
994 p.erase(p.begin() + maxCellIdx + 1, p.end());
998 BlackoilModel<TypeTag>& model_;
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_;