CFD Online Logo CFD Online URL
www.cfd-online.com
[Sponsors]
Home > Forums > OpenFOAM Running, Solving & CFD

Question about the fvmatrix and Laplacian operator

Register Blogs Members List Search Today's Posts Mark Forums Read

Like Tree1Likes
  • 1 Post By hjasak

Reply
 
LinkBack Thread Tools Display Modes
Old   December 28, 2007, 01:39
Default I have a question about the LD
  #1
New Member
 
Liu Huafei
Join Date: Mar 2009
Location: Shanghai, China
Posts: 20
Rep Power: 8
liuhuafei is on a distinguished road
I have a question about the LDUMatrix.

LDUMatrix contains the coefficients, lowerPtr,upperPtr,diagPtr ,and the address reference, uPtr and lPtr.

My questions are as follows:
1) Does the lPtr mean the owner of face and uPtr the neigbour of the face as done in the polyMesh?
In some mesh class in openfoam, owner's index(P)
is lower than neighbor index(N).

2) Does the upperPtr store the contribution of the neighbour cell(N) to the owner cell(P) and
the lowerPtr store the contribution of the owner(P) to the neighbour(N).

In Hoperations.C // H operator
template<class>
tmp<field<type> > lduMatrix::H(const ield<type>& ) const
{
.........
const scalarField& Lower = lower();
const scalarField& Upper = upper();

// Take refereces to addressing
const unallocLabelList& l = lduAddr_.lowerAddr();
const unallocLabelList& u = lduAddr_.upperAddr();

for (register label face=0; face<l.size(); face++) {
Hphi[u[face]] -= Lower[face]*sf[l[face]];
Hphi[l[face]] -= Upper[face]*sf[u[face]];
}
}

From this code, I guess the LowerAddr is owner list and UpperAddr is neighbour list,
Lower is the contribution of the owner (P) to the neighbour (N), Upper is the contribution of
the neighbour(N) to the owner.

if the matrix is
AD1 AU1 AU2 AU3 AU4
AL1 AD2 AU5 AU6 AU7
AL2 AL5 AD3 AU8 AU9
AL3 AL6 AL8 AD4 AU10
AL4 AL7 AL9 AL10 AD5

But in fvMatrix, the implementation of function negSumDiag() is as follows
negSumDiag:
for (register label face=0; face<l.size(); face++)
{
Diag[l[face]] -= Lower[face];
Diag[u[face]] -= Upper[face];
}
Diag[i] should be substract the contribution from all its neighbouring cell, why not the following code?
for (register label face=0; face<l.size(); face++)
{
Diag[l[face]] -= Upper[face];
Diag[u[face]] -= Lower[face];
}


3) For the implementation of FVM laplacian operator,only the fvm.upper is calculated,
why not the fvm.lower?
template<class>
tmp<fvmatrix<type> >
gaussLaplacianScheme<type>::fvmLaplacianUncorrecte d
(
const surfaceScalarField& gammaMagSf,
GeometricField<type,>& vf
)
{
.......
fvMatrix<type>& fvm = tfvm();

fvm.upper() = deltaCoeffs.internalField()*gammaMagSf.internalFie ld();

! why not the fvm.lower()
fvm.negSumDiag();

}

Thanks in advance!
Liu Huafei
liuhuafei is offline   Reply With Quote

Old   December 28, 2007, 11:31
Default Liu, I could take a guess at
  #2
Member
 
David P. Schmidt
Join Date: Mar 2009
Posts: 70
Rep Power: 8
schmidt_d is on a distinguished road
Liu,
I could take a guess at question #3. Wouldn't the Laplacian produce a symmetric matrix? Until you have created asymmetric terms in the matrix, you could get away with only storing and calculating half the matrix. I haven't dug through the code, so this is just a guess.
David
schmidt_d is offline   Reply With Quote

Old   May 29, 2009, 07:12
Default
  #3
N2a
New Member
 
Benjamin
Join Date: May 2009
Posts: 5
Rep Power: 8
N2a is on a distinguished road
Hello,

I try to solve an equation with the term " gamma *laplacian(rAUf, pd) ", I don't understand how to apply fvm for this kind of term.

May be someone can help me.

Thanks.
N2a is offline   Reply With Quote

Old   June 19, 2009, 07:21
Default
  #4
N2a
New Member
 
Benjamin
Join Date: May 2009
Posts: 5
Rep Power: 8
N2a is on a distinguished road
Quote:
Originally Posted by N2a View Post
Hello,

I try to solve an equation with the term " gamma *laplacian(rAUf, pd) ", I don't understand how to apply fvm for this kind of term.

May be someone can help me.

Thanks.
Hello,
I tried an other way to solve it, but now I have to turn back on this equation.
On the programmer Guide, il's mentioned that fvMatrix autorizes * operator.
So I tried to write the term above as:
fvm::Sp(gamma,pd) * fvm::laplacian(rAUf, pd)) which would be what I want, it doesn't work. I tried also with the inner product & without success.

Hoping to have someone who can guide me,

Thanks,
N2a is offline   Reply With Quote

Old   October 2, 2009, 08:39
Default
  #5
Member
 
Joern Bader
Join Date: Mar 2009
Posts: 33
Rep Power: 8
joern is on a distinguished road
Quote:
3) For the implementation of FVM laplacian operator,only the fvm.upper is calculated,
why not the fvm.lower?
template<class>
tmp<fvmatrix<type> >
gaussLaplacianScheme<type>::fvmLaplacianUncorrecte d
(
const surfaceScalarField& gammaMagSf,
GeometricField<type,>& vf
)
{
.......
fvMatrix<type>& fvm = tfvm();

fvm.upper() = deltaCoeffs.internalField()*gammaMagSf.internalFie ld();

! why not the fvm.lower()
fvm.negSumDiag();

}
It want to ask this question again.
I tried to understand the matrix, produced by fvmlaplacianuncorrected for two days now, but i dont get it.

every discretisation for a diffusion (laplacian) term produces a sum over the faces. i looked into versteeg an in jasak's PhD.
If i want to reconstruct the matrix this way i get Terms:
- u_P + u_W + u_E + u_N + u_S = 0
(like in versteeg)
That produces a matrix with terms in upper, diag an lower.

If i look into OF code the laplacian Term only produces an upper-diagonal matrix. The lower part is 0.
For me it looks like the code only uses the faces that are not owed by the cells.
All my trys to construct or reverse-engeneer this matrix where useless.

can anyone tell me, why you just can look at the upper part (some of the faces)?

thx,
Joern
joern is offline   Reply With Quote

Old   October 3, 2009, 06:21
Default
  #6
Senior Member
 
Hrvoje Jasak
Join Date: Mar 2009
Location: London, England
Posts: 1,762
Rep Power: 21
hjasak will become famous soon enough
Easy: if you only set the upper, the code assumes the matrix is SYMMETRIC and that you (clever trick) choose to store only one half of coefficients to save the memory and speed up the solver.

For asymmetric matrices you have no choice and have to store all coefficients. Otherwise, a_ij = a_ji and the pressure solver (the most expensive part of a segregated solver) runs much faster.

So here, the secret is out

Hope this helps,

Hrv
fumiya likes this.
__________________
Hrvoje Jasak
Providing commercial FOAM/OpenFOAM and CFD Consulting: http://wikki.co.uk
hjasak is offline   Reply With Quote

Old   October 3, 2009, 06:58
Default
  #7
Member
 
Joern Bader
Join Date: Mar 2009
Posts: 33
Rep Power: 8
joern is on a distinguished road
thx a lot.
this helps. now i can work on...
joern is offline   Reply With Quote

Reply

Thread Tools
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Trackbacks are On
Pingbacks are On
Refbacks are On


Similar Threads
Thread Thread Starter Forum Replies Last Post
FvMatrix coefficients shrina OpenFOAM Running, Solving & CFD 10 October 3, 2013 14:38
How to look at the coefficients from fvMatrix marco7 OpenFOAM Running, Solving & CFD 2 September 11, 2008 03:58
Question about fvmlaplacian operator cosimobianchini OpenFOAM Running, Solving & CFD 0 February 1, 2007 14:40
Material interfaces and the laplacian operator cliffoi OpenFOAM Running, Solving & CFD 8 November 8, 2006 09:57
Material interfaces using the laplacian operator cliffoi OpenFOAM 0 November 6, 2006 11:42


All times are GMT -4. The time now is 11:01.