|
[Sponsors] |
April 22, 2003, 02:46 |
Middlecoff-Thomas
|
#1 |
Guest
Posts: n/a
|
1) I implemented the Middlecoff-Thomas procedure for a 2D elliptic grid generator; the grid that outcomes loses the orthogonality at the boundaries! Is it ordinary???
2) Which kind of linear solver do you use to invert the matrix of an elliptic grid generator? |
|
April 22, 2003, 22:59 |
Re: Middlecoff-Thomas
|
#2 |
Guest
Posts: n/a
|
If the grid point number is huge, Iterative methods are better than direct ones. I use point Gauss-Seidal, or line Gauss-Seidel, both with a multigrid acceleration. It seems work well for elliptic grid generator.
|
|
May 4, 2003, 16:38 |
Re: Middlecoff-Thomas
|
#3 |
Guest
Posts: n/a
|
> 1) I implemented the Middlecoff-Thomas procedure
: for a 2D elliptic grid generator; the grid that : outcomes loses the orthogonality at the boundaries! : Is it ordinary??? Yes, this is the expected behavior. Thomas-Middlecoff primarily impacts clustering on the grid's interior so that it mimics boundary clustering. A seconary effect is smoothness. There is little in T-M to control orthogonality at the boundaries. For that you need a technique like Steger-Sorenson or von Lavante - Hilgenstock - White. |
|
|
|
Similar Threads | ||||
Thread | Thread Starter | Forum | Replies | Last Post |
Is there an alternative method for TDMA (Thomas algorithm) | katakgoreng | Main CFD Forum | 4 | January 19, 2010 06:23 |
thomas algorithm | cvkeshav | Main CFD Forum | 2 | March 29, 2009 05:37 |
C question | kar | OpenFOAM Running, Solving & CFD | 26 | May 20, 2008 06:05 |
Thomas Algorithm Testing | Out of Ideas | Main CFD Forum | 3 | February 8, 2001 22:45 |
Why Thomas Algorithm for tridiagonal systems? | Yogesh Talekar | Main CFD Forum | 6 | July 15, 1999 13:56 |