All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
DiagonalPreconditioner.C
Go to the documentation of this file.
1 /*---------------------------------------------------------------------------*\
2  ========= |
3  \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
4  \\ / O peration | Website: https://openfoam.org
5  \\ / A nd | Copyright (C) 2011-2018 OpenFOAM Foundation
6  \\/ M anipulation |
7 -------------------------------------------------------------------------------
8 License
9  This file is part of OpenFOAM.
10 
11  OpenFOAM is free software: you can redistribute it and/or modify it
12  under the terms of the GNU General Public License as published by
13  the Free Software Foundation, either version 3 of the License, or
14  (at your option) any later version.
15 
16  OpenFOAM is distributed in the hope that it will be useful, but WITHOUT
17  ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
18  FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
19  for more details.
20 
21  You should have received a copy of the GNU General Public License
22  along with OpenFOAM. If not, see <http://www.gnu.org/licenses/>.
23 
24 \*---------------------------------------------------------------------------*/
25 
26 #include "DiagonalPreconditioner.H"
27 
28 // * * * * * * * * * * * * * * * * Constructors * * * * * * * * * * * * * * //
29 
30 template<class Type, class DType, class LUType>
32 (
33  const typename LduMatrix<Type, DType, LUType>::solver& sol,
34  const dictionary&
35 )
36 :
38  rD(sol.matrix().diag().size())
39 {
40  DType* __restrict__ rDPtr = rD.begin();
41  const DType* __restrict__ DPtr = this->solver_.matrix().diag().begin();
42 
43  label nCells = rD.size();
44 
45  // Generate inverse (reciprocal for scalar) diagonal
46  for (label cell=0; cell<nCells; cell++)
47  {
48  rDPtr[cell] = inv(DPtr[cell]);
49  }
50 }
51 
52 
53 // * * * * * * * * * * * * * * * Member Functions * * * * * * * * * * * * * //
54 
55 template<class Type, class DType, class LUType>
57 {}
58 
59 
60 template<class Type, class DType, class LUType>
62 (
63  Field<Type>& wA,
64  const Field<Type>& rA
65 ) const
66 {
67  Type* __restrict__ wAPtr = wA.begin();
68  const Type* __restrict__ rAPtr = rA.begin();
69  const DType* __restrict__ rDPtr = rD.begin();
70 
71  label nCells = wA.size();
72 
73  for (label cell=0; cell<nCells; cell++)
74  {
75  wAPtr[cell] = dot(rDPtr[cell], rAPtr[cell]);
76  }
77 }
78 
79 
80 // ************************************************************************* //
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
Definition: label.H:59
A list of keyword definitions, which are a keyword followed by any number of values (e...
Definition: dictionary.H:156
dimensionedSphericalTensor inv(const dimensionedSphericalTensor &dt)
void size(const label)
Override size to be inconsistent with allocated storage.
Definition: ListI.H:164
virtual void precondition(Field< Type > &wA, const Field< Type > &rA) const
Return wA the preconditioned form of residual rA.
const LduMatrix< Type, DType, LUType > & matrix() const
Definition: LduMatrix.H:235
void dot(FieldField< Field1, typename innerProduct< Type1, Type2 >::type > &f, const FieldField< Field1, Type1 > &f1, const FieldField< Field2, Type2 > &f2)
Pre-declare SubField and related Field type.
Definition: Field.H:56
Abstract base-class for LduMatrix preconditioners.
Definition: LduMatrix.H:361
iterator begin()
Return an iterator to begin traversing the UList.
Definition: UListI.H:216
Abstract base-class for LduMatrix solvers.
Definition: LduMatrix.H:112
A cell is defined as a list of faces with extra functionality.
Definition: cell.H:56
DiagonalPreconditioner(const typename LduMatrix< Type, DType, LUType >::solver &sol, const dictionary &preconditionerDict)
Construct from matrix components and preconditioner data dictionary.
virtual void read(const dictionary &preconditionerDict)
Read and reset the preconditioner parameters from the given.