38 lduMatrix::preconditioner::
39 addasymMatrixConstructorToTable<DILUPreconditioner>
53 rD_(sol.matrix().
diag().size())
70 solveScalar* __restrict__ rDPtr = rD.
begin();
75 const scalar*
const __restrict__ upperPtr = matrix.
upper().
begin();
76 const scalar*
const __restrict__ lowerPtr = matrix.
lower().
begin();
86 const label nCells = rD.
size();
102 solveScalar* __restrict__ wAPtr = wA.
begin();
103 const solveScalar* __restrict__ rAPtr = rA.
begin();
104 const solveScalar* __restrict__ rDPtr = rD_.begin();
106 const label*
const __restrict__ uPtr =
107 solver_.matrix().lduAddr().upperAddr().begin();
108 const label*
const __restrict__ lPtr =
109 solver_.matrix().lduAddr().lowerAddr().begin();
110 const label*
const __restrict__ losortPtr =
111 solver_.matrix().lduAddr().losortAddr().begin();
113 const scalar*
const __restrict__ upperPtr =
114 solver_.matrix().upper().begin();
115 const scalar*
const __restrict__ lowerPtr =
116 solver_.matrix().lower().begin();
118 const label nCells = wA.
size();
119 const label
nFaces = solver_.matrix().upper().
size();
120 const label nFacesM1 =
nFaces - 1;
129 const label sface = losortPtr[
face];
130 wAPtr[uPtr[sface]] -=
131 rDPtr[uPtr[sface]]*lowerPtr[sface]*wAPtr[lPtr[sface]];
149 solveScalar* __restrict__ wTPtr = wT.
begin();
150 const solveScalar* __restrict__ rTPtr = rT.
begin();
151 const solveScalar* __restrict__ rDPtr = rD_.begin();
153 const label*
const __restrict__ uPtr =
154 solver_.matrix().lduAddr().upperAddr().begin();
155 const label*
const __restrict__ lPtr =
156 solver_.matrix().lduAddr().lowerAddr().begin();
157 const label*
const __restrict__ losortPtr =
158 solver_.matrix().lduAddr().losortAddr().begin();
160 const scalar*
const __restrict__ upperPtr =
161 solver_.matrix().upper().begin();
162 const scalar*
const __restrict__ lowerPtr =
163 solver_.matrix().lower().begin();
165 const label nCells = wT.
size();
166 const label
nFaces = solver_.matrix().upper().
size();
167 const label nFacesM1 =
nFaces - 1;
183 const label sface = losortPtr[
face];
184 wTPtr[lPtr[sface]] -=
185 rDPtr[lPtr[sface]]*lowerPtr[sface]*wTPtr[uPtr[sface]];
Simplified diagonal-based incomplete LU preconditioner for asymmetric matrices. The reciprocal of the...
virtual void preconditionT(solveScalarField &wT, const solveScalarField &rT, const direction cmpt=0) const
Return wT the transpose-matrix preconditioned form of residual rT.
virtual void precondition(solveScalarField &wA, const solveScalarField &rA, const direction cmpt=0) const
Return wA the preconditioned form of residual rA.
static void calcReciprocalD(solveScalarField &, const lduMatrix &)
Calculate the reciprocal of the preconditioned diagonal.
iterator begin() noexcept
Return an iterator to begin traversing the UList.
void size(const label n)
Older name for setAddressableSize.
A cell is defined as a list of faces with extra functionality.
A list of keyword definitions, which are a keyword followed by a number of values (eg,...
A face is a list of labels corresponding to mesh vertices.
virtual const labelUList & upperAddr() const =0
Return upper addressing.
virtual const labelUList & lowerAddr() const =0
Return lower addressing.
Abstract base-class for lduMatrix solvers.
const lduMatrix & matrix() const noexcept
lduMatrix is a general matrix class in which the coefficients are stored as three arrays,...
const lduAddressing & lduAddr() const
Return the LDU addressing.
#define defineTypeNameAndDebug(Type, DebugSwitch)
Define the typeName and debug information.
const labelList nFaces(UPstream::listGatherValues< label >(aMesh.nFaces()))
lduMatrix::preconditioner::addasymMatrixConstructorToTable< DILUPreconditioner > addDILUPreconditionerAsymMatrixConstructorToTable_
void diag(pointPatchField< vector > &, const pointPatchField< tensor > &)