49inline void edgeLimitedGrad<Type>::limitEdge
52 const scalar maxDelta,
53 const scalar minDelta,
54 const scalar extrapolate
57 if (extrapolate > maxDelta + VSMALL)
61 else if (extrapolate < minDelta - VSMALL)
77 const faMesh&
mesh = vsf.mesh();
79 tmp<areaVectorField> tGrad = basicGradScheme_().calcGrad(vsf,
name);
97 const scalar rk = (1.0/k_ - 1.0);
101 const label own = owner[edgei];
102 const label nei = neighbour[edgei];
104 const scalar vsfOwn = vsf[own];
105 const scalar vsfNei = vsf[nei];
107 scalar maxEdge =
max(vsfOwn, vsfNei);
108 scalar minEdge =
min(vsfOwn, vsfNei);
109 const scalar maxMinEdge = rk*(maxEdge - minEdge);
110 maxEdge += maxMinEdge;
111 minEdge -= maxMinEdge;
119 (Cf[edgei] -
C[own]) &
g[own]
128 (Cf[edgei] -
C[nei]) &
g[nei]
133 auto updateLimiter = [&](
const label patchi,
const scalarField&
fld) ->
void
136 const vectorField& pCf = Cf.boundaryField()[patchi];
140 const label own = pOwner[edgei];
142 const scalar vsfOwn = vsf[own];
143 const scalar vsfNei =
fld[edgei];
145 scalar maxEdge =
max(vsfOwn, vsfNei);
146 scalar minEdge =
min(vsfOwn, vsfNei);
147 const scalar maxMinEdge = rk*(maxEdge - minEdge);
148 maxEdge += maxMinEdge;
149 minEdge -= maxMinEdge;
156 (pCf[edgei] -
C[own]) &
g[own]
168 updateLimiter(patchi, psf.patchNeighbourField());
170 else if (psf.fixesValue())
172 updateLimiter(patchi, psf);
181 Info<<
"gradient limiter for: " << vsf.name()
182 <<
" min = " <<
limits.min()
183 <<
" max = " <<
limits.max()
184 <<
" average: " << avg <<
endl;
188 g.correctBoundaryConditions();
202 const faMesh&
mesh = vvf.mesh();
204 tmp<areaTensorField> tGrad = basicGradScheme_().grad(vvf,
name);
222 const scalar rk = (1.0/k_ - 1.0);
226 const label own = owner[edgei];
227 const label nei = neighbour[edgei];
230 vector gradf((Cf[edgei] -
C[own]) &
g[own]);
232 scalar vsfOwn = gradf & vvf[own];
233 scalar vsfNei = gradf & vvf[nei];
235 scalar maxEdge =
max(vsfOwn, vsfNei);
236 scalar minEdge =
min(vsfOwn, vsfNei);
237 const scalar maxMinEdge = rk*(maxEdge - minEdge);
238 maxEdge += maxMinEdge;
239 minEdge -= maxMinEdge;
251 gradf = (Cf[edgei] -
C[nei]) &
g[nei];
253 vsfOwn = gradf & vvf[own];
254 vsfNei = gradf & vvf[nei];
256 maxEdge =
max(vsfOwn, vsfNei);
257 minEdge =
min(vsfOwn, vsfNei);
270 auto updateLimiter = [&](
const label patchi,
const vectorField&
fld) ->
void
273 const vectorField& pCf = Cf.boundaryField()[patchi];
277 const label own = pOwner[edgei];
279 const vector gradf((pCf[edgei] -
C[own]) &
g[own]);
281 const scalar vsfOwn = gradf & vvf[own];
282 const scalar vsfNei = gradf &
fld[edgei];
284 scalar maxEdge =
max(vsfOwn, vsfNei);
285 scalar minEdge =
min(vsfOwn, vsfNei);
286 const scalar maxMinEdge = rk*(maxEdge - minEdge);
287 maxEdge += maxMinEdge;
288 minEdge -= maxMinEdge;
308 updateLimiter(patchi, psf.patchNeighbourField());
310 else if (psf.fixesValue())
312 updateLimiter(patchi, psf);
321 Info<<
"gradient limiter for: " << vvf.name()
322 <<
" min = " <<
limits.min()
323 <<
" max = " <<
limits.max()
324 <<
" average: " << avg <<
endl;
328 g.correctBoundaryConditions();
static const Foam::dimensionedScalar C("", Foam::dimTemperature, 234.5)
Info<< nl;Info<< "Write faMesh in vtk format:"<< nl;{ vtk::uindirectPatchWriter writer(aMesh.patch(), fileName(aMesh.time().globalPath()/vtkBaseFileName));writer.writeGeometry();globalIndex procAddr(aMesh.nFaces());labelList cellIDs;if(UPstream::master()) { cellIDs.resize(procAddr.totalSize());for(const labelRange &range :procAddr.ranges()) { auto slice=cellIDs.slice(range);slice=identity(range);} } writer.beginCellData(4);writer.writeProcIDs();writer.write("cellID", cellIDs);writer.write("area", aMesh.S().field());writer.write("normal", aMesh.faceAreaNormals());writer.beginPointData(1);writer.write("normal", aMesh.pointAreaNormals());Info<< " "<< writer.output().name()<< nl;}{ vtk::lineWriter writer(aMesh.points(), aMesh.edges(), fileName(aMesh.time().globalPath()/(vtkBaseFileName+"-edges")));writer.writeGeometry();writer.beginCellData(4);writer.writeProcIDs();{ Field< scalar > fld(faMeshTools::flattenEdgeField(aMesh.magLe(), true))
const uniformDimensionedVectorField & g
GeometricBoundaryField< scalar, faPatchField, areaMesh > Boundary
virtual tmp< GeometricField< typename outerProduct< vector, Type >::type, faPatchField, areaMesh > > calcGrad(const GeometricField< Type, faPatchField, areaMesh > &vsf, const word &name) const
Return the gradient of the given field to the gradScheme::grad for optional caching.
static void correctBoundaryConditions(const GeometricField< Type, faPatchField, areaMesh > &, GeometricField< typename outerProduct< vector, Type >::type, faPatchField, areaMesh > &)
Correct the boundary values of the gradient using the patchField.
A Vector of values with scalar precision, where scalar is float/double depending on the compilation f...
#define makeFaGradScheme(SS)
Type gAverage(const FieldField< Field, Type > &f, const label comm)
The global arithmetic average of a FieldField.
label max(const labelHashSet &set, label maxValue=labelMin)
Find the max value in labelHashSet, optionally limited by second argument.
GeometricField< vector, faePatchField, edgeMesh > edgeVectorField
messageStream Info
Information stream (stdout output on master, null elsewhere).
GeometricField< tensor, faPatchField, areaMesh > areaTensorField
Field< scalar > scalarField
Specialisation of Field<T> for scalar.
faPatchField< vector > faPatchVectorField
Ostream & endl(Ostream &os)
Add newline and flush stream.
GeometricField< vector, faPatchField, areaMesh > areaVectorField
label min(const labelHashSet &set, label minValue=labelMax)
Find the min value in labelHashSet, optionally limited by second argument.
GeometricField< scalar, faPatchField, areaMesh > areaScalarField
Field< vector > vectorField
Specialisation of Field<T> for vector.
MinMax< Type > gMinMax(const FieldField< Field, Type > &f)
UList< label > labelUList
A UList of labels.
dimensioned< typename typeOfMag< Type >::type > magSqr(const dimensioned< Type > &dt)
faPatchField< scalar > faPatchScalarField
tmp< areaScalarField > limiter(const areaScalarField &phi)
#define forAll(list, i)
Loop across all elements in list.