38 lduMatrix::preconditioner::
39 addsymMatrixConstructorToTable<DICPreconditioner>
53 rD_(sol.matrix().
diag().size())
70 solveScalar* __restrict__ rDPtr = rD.
begin();
74 const scalar*
const __restrict__ upperPtr = matrix.
upper().
begin();
77 const label nFaces = matrix.
upper().
size();
85 const label nCells = rD.
size();
87 for (label cell=0; cell<nCells; cell++)
101 solveScalar* __restrict__ wAPtr = wA.begin();
102 const solveScalar* __restrict__ rAPtr = rA.begin();
103 const solveScalar* __restrict__ rDPtr = rD_.begin();
105 const label*
const __restrict__ uPtr =
106 solver_.matrix().lduAddr().upperAddr().begin();
107 const label*
const __restrict__ lPtr =
108 solver_.matrix().lduAddr().lowerAddr().begin();
109 const scalar*
const __restrict__ upperPtr =
110 solver_.matrix().upper().begin();
112 const label nCells = wA.size();
113 const label nFaces = solver_.matrix().upper().
size();
114 const label nFacesM1 = nFaces - 1;
116 for (label cell=0; cell<nCells; cell++)
118 wAPtr[cell] = rDPtr[cell]*rAPtr[cell];
121 for (label face=0; face<nFaces; face++)
123 wAPtr[uPtr[face]] -= rDPtr[uPtr[face]]*upperPtr[face]*wAPtr[lPtr[face]];
126 for (label face=nFacesM1; face>=0; face--)
128 wAPtr[lPtr[face]] -= rDPtr[lPtr[face]]*upperPtr[face]*wAPtr[uPtr[face]];
const scalarField & diag() const
void size(const label n)
Older name for setAddressableSize.
static void calcReciprocalD(solveScalarField &, const lduMatrix &)
Calculate the reciprocal of the preconditioned diagonal.
A face is a list of labels corresponding to mesh vertices.
Field< solveScalar > solveScalarField
A list of keyword definitions, which are a keyword followed by a number of values (eg...
const lduMatrix & matrix() const noexcept
virtual const labelUList & lowerAddr() const =0
Return lower addressing.
virtual void precondition(solveScalarField &wA, const solveScalarField &rA, const direction cmpt=0) const
Return wA the preconditioned form of residual rA.
lduMatrix::preconditioner::addsymMatrixConstructorToTable< DICPreconditioner > addDICPreconditionerSymMatrixConstructorToTable_
void diag(pointPatchField< vector > &, const pointPatchField< tensor > &)
DICPreconditioner(const lduMatrix::solver &, const dictionary &solverControlsUnused)
Construct from matrix components and preconditioner solver controls.
virtual const labelUList & upperAddr() const =0
Return upper addressing.
Abstract base-class for lduMatrix solvers.
iterator begin() noexcept
Return an iterator to begin traversing the UList.
defineTypeNameAndDebug(combustionModel, 0)
lduMatrix is a general matrix class in which the coefficients are stored as three arrays...
const scalarField & upper() const
const lduAddressing & lduAddr() const
Return the LDU addressing.
A cell is defined as a list of faces with extra functionality.
Simplified diagonal-based incomplete Cholesky preconditioner for symmetric matrices (symmetric equiva...