mirror of
https://github.com/OPM/opm-simulators.git
synced 2025-02-25 18:55:30 -06:00
Base face processing decision of faces on cartesian indices
This will process the same faces in serial and parallel. Hence it make the silent assumption that we only process faces from low cartesian index to high cartesian index hold again. This should fix PINCH MULTZ ALL in parallel.
This commit is contained in:
parent
00c5d9f016
commit
11f9eb9d88
@ -273,14 +273,14 @@ public:
|
||||
A * (n*d)/(d*d);
|
||||
}
|
||||
|
||||
// we only need to calculate a face's transmissibility
|
||||
// once...
|
||||
if (elemIdx > outsideElemIdx)
|
||||
continue;
|
||||
|
||||
unsigned insideCartElemIdx = cartMapper.cartesianIndex(elemIdx);
|
||||
unsigned outsideCartElemIdx = cartMapper.cartesianIndex(outsideElemIdx);
|
||||
|
||||
// we only need to calculate a face's transmissibility
|
||||
// once...
|
||||
if (insideCartElemIdx > outsideCartElemIdx)
|
||||
continue;
|
||||
|
||||
// local indices of the faces of the inside and
|
||||
// outside elements which contain the intersection
|
||||
int insideFaceIdx = intersection.indexInInside();
|
||||
|
Loading…
Reference in New Issue
Block a user