OilfieldToolsNet/opm-simulators
4
0
Fork 0
mirror of https://github.com/OPM/opm-simulators.git synced 2025-02-25 18:55:30 -06:00
Code Issues Packages Projects Releases Wiki Activity

Added more inactive experimental code.

Browse Source
This commit is contained in:
Atgeirr Flø Rasmussen 2012-02-25 22:39:01 +01:00
parent 8c16722b84
commit 9667d09fe0
1 changed files with 47 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

49
opm/core/transport/reorder/TransportModelTwophase.cpp
View File

@ -79,7 +79,6 @@ namespace Opm
// &seq[0], &comp[0], &ncomp, // &seq[0], &comp[0], &ncomp,
// &ia_[0], &ja_[0]); // &ia_[0], &ja_[0]);
reorderAndTransport(grid_, darcyflux); reorderAndTransport(grid_, darcyflux);
} }
@ -149,6 +148,45 @@ namespace Opm
fractionalflow_[cell] = fracFlow(saturation_[cell], cell); fractionalflow_[cell] = fracFlow(saturation_[cell], cell);
} }
// namespace {
// class TofComputer
// {
// public:
// TofComputer(const int num_cells,
// const int* ia,
// const int* ja,
// const int startcell,
// std::vector<int>& tof)
// : ia_(ia),
// ja_(ja)
// {
// tof.clear();
// tof.resize(num_cells, num_cells);
// tof[startcell] = 0;
// tof_ = &tof[0];
// visitTof(startcell);
// }
// private:
// const int* ia_;
// const int* ja_;
// int* tof_;
// void visitTof(const int cell)
// {
// for (int j = ia_[cell]; j < ia_[cell+1]; ++j) {
// const int nb_cell = ja_[j];
// if (tof_[nb_cell] > tof_[cell] + 1) {
// tof_[nb_cell] = tof_[cell] + 1;
// visitTof(nb_cell);
// }
// }
// }
// };
// } // anon namespace
void TransportModelTwophase::solveMultiCell(const int num_cells, const int* cells) void TransportModelTwophase::solveMultiCell(const int num_cells, const int* cells)
{ {
// std::ofstream os("dump"); // std::ofstream os("dump");
@ -168,7 +206,7 @@ namespace Opm
// upstream_pos.push_back(0); // upstream_pos.push_back(0);
// done_pos[0] = 1; // done_pos[0] = 1;
// int current = 0; // int current = 0;
// while (new_pos.size() < num_cells) { // while (int(new_pos.size()) < num_cells) {
// const int i = upstream_pos[current++]; // const int i = upstream_pos[current++];
// new_pos.push_back(i); // new_pos.push_back(i);
// const int cell = cells[i]; // const int cell = cells[i];
@ -189,6 +227,13 @@ namespace Opm
// int* c = const_cast<int*>(cells); // int* c = const_cast<int*>(cells);
// std::random_shuffle(c, c + num_cells); // std::random_shuffle(c, c + num_cells);
// Experiment: compute topological tof from first cell.
// Verdict: maybe useful, not tried to exploit it yet.
// std::vector<int> tof;
// TofComputer comp(grid_.number_of_cells, &ia_[0], &ja_[0], cells[0], tof);
// std::ofstream tofdump("tofdump");
// std::copy(tof.begin(), tof.end(), std::ostream_iterator<double>(tofdump, "\n"));
// Experiment: implement a metric measuring badness of ordering // Experiment: implement a metric measuring badness of ordering
// as average distance in (cyclic) ordering from // as average distance in (cyclic) ordering from
// upstream neighbours. // upstream neighbours.