|
[Sponsors] |
August 22, 2007, 14:20 |
fast penta diagonal solver
|
#1 |
Guest
Posts: n/a
|
hi all,
It is obvious that when we discretise Navier-Stokes equations with central differencing scheme, the resulting matrix will be of penta-diagonal. There are number of special solvers to handle this like Stones algorithm and its variants, Krylov solver etc. Which has the fastest convergence rate among all these solver types from your experience? thanks for your reply... |
|
August 22, 2007, 16:38 |
Re: fast penta diagonal solver
|
#2 |
Guest
Posts: n/a
|
I assume that you are talking about implicit algorithms.There are two ways to handle the penta diagonal solver.One is the direct inversion of the pentadiagonal system.The other possible way is to use the approximate factorization to split it into two tridiagonal systems which are much faster to invert than the pentadiagonal system.
|
|
August 22, 2007, 16:42 |
Re: fast penta diagonal solver
|
#3 |
Guest
Posts: n/a
|
Or you could use Gauss-Seidel or another iterative approach.
|
|
August 22, 2007, 18:24 |
Re: fast penta diagonal solver
|
#4 |
Guest
Posts: n/a
|
Also uncoupled and two space dimensions?
|
|
August 23, 2007, 01:23 |
Re: fast penta diagonal solver
|
#5 |
Guest
Posts: n/a
|
hi otd, yes. I am dealing with uncoupled 2D flows only.. I know there are number of iterative schemes to solve penta diagonal matrix.. I need to know which of these has fastest convergence rate.. thanks
|
|
August 23, 2007, 09:11 |
Re: fast penta diagonal solver
|
#6 |
Guest
Posts: n/a
|
Do you mean, for a given precision e, which algorithm can solve the pentadiagonal fastest?
I think multigrid should be the fastest for this type of problem. ILU/GS will eventually stagnate when the low wave number component of residual is dominant. I've seen somewhere that multigrid+SIP(strongly implicit) is pretty good. One question, is it positive definite? If so preconditioning CG should be very effective. |
|
August 23, 2007, 09:18 |
Re: fast penta diagonal solver
|
#7 |
Guest
Posts: n/a
|
Actually the best, and quickest, method of solving this is by considering the pentadiagonal system as a tridiagonal system whose entries are 2x2 matrices. The resulting block tridiagonal system can be solved using a variant of the standard tridiagonal solver.
|
|
August 23, 2007, 09:36 |
Re: fast penta diagonal solver
|
#8 |
Guest
Posts: n/a
|
thank you friends.. I will look at CG and multi-gird methods.. If you get to know more details regarding this, kindly post a reply..
|
|
August 23, 2007, 13:20 |
Re: fast penta diagonal solver
|
#9 |
Guest
Posts: n/a
|
Before talking about improvements, you need to look for appropriate methods depending on the matrix properties. You can see in this link a very good introductory in this matter :
http://netlib2.cs.utk.edu/linalg/htm...Templates.html When a method is working, no matter how long it takes, then you can look for preconditionners. |
|
|
|
Similar Threads | ||||
Thread | Thread Starter | Forum | Replies | Last Post |
thobois class engineTopoChangerMesh error | Peter_600 | OpenFOAM | 4 | August 2, 2014 10:52 |
smoothSolver diverges - solution in using PBiCG solver? | makaveli_lcf | OpenFOAM Running, Solving & CFD | 3 | September 11, 2013 13:44 |
Working directory via command line | Luiz | CFX | 4 | March 6, 2011 21:02 |
Using a user-defined solver in OF | ozzythewise | OpenFOAM Running, Solving & CFD | 3 | February 8, 2011 16:28 |
Getting too many iterations by velocity solving (aborting). Changing U - Solver? | suitup | OpenFOAM Running, Solving & CFD | 0 | January 20, 2010 08:45 |