Is there an alternative method for TDMA (Thomas algorithm)

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

 January 18, 2010, 02:29 Is there an alternative method for TDMA (Thomas algorithm) #1 Member   Join Date: Dec 2009 Posts: 49 Rep Power: 9 Sponsored Links I'm using TDMA to solve for the SIMPLE algorithm. For small grid, the TDMA converged quite fast but for large grid the convergence rate is killing me. Is there an alternative to TDMA that is simple to code and give faster convergence apart from Gauss elimination (consume alot of memory)?

 January 18, 2010, 13:03 #2 Senior Member   Join Date: Nov 2009 Posts: 411 Rep Power: 12 Try an iterative solver - check lapack library for example, you can find some hints about what solver you can use for a linear system in the book of Peric. BTW TDMA is just a specialized Gauss elimination for tridiagonal system. Do

 January 18, 2010, 13:29 #3 Member   Join Date: Dec 2009 Posts: 49 Rep Power: 9 Thanks alot..really appreciate your response..

 January 19, 2010, 00:33 #4 Senior Member   Julien de Charentenay Join Date: Jun 2009 Location: Australia Posts: 230 Rep Power: 11 I am slightly puzzled by the use of the term "convergence"... The Thomas algorithm is a direct solver (i.e not iterative), as pointed out. I think that the Thomas algorithm is part of an algorithm that itself takes a while to converge (ADI, under-relaxation, treatment of non-orthogonal terms, other). You may want to have a check of the algorithm as well. Hope this help. Julien

 January 19, 2010, 07:23 Krylov with Schur-complement preconditioning #5 Member   Jed Brown Join Date: Mar 2009 Posts: 56 Rep Power: 12 Classical SIMPLE is really not a very robust algorithm, a much better approach is to discretize implicitly in time and solve the linear systems with a Krylov method (like GMRES) preconditioned with a Schur-complement scheme. For example, Code: ```@article{elman2008tcp, title={{A taxonomy and comparison of parallel block multi-level preconditioners for the incompressible Navier-Stokes equations}}, author={Elman, H.C. and Howle, V.E. and Shadid, J. and Shuttleworth, R. and Tuminaro, R.}, journal={Journal of Computational Physics}, volume={227}, number={1}, pages={1790--1808}, year={2008}, publisher={Academic Press} }``` As for software, Lapack offers only dense/banded direct solvers (contrary to DoHander's suggestion). I recommend using PETSc because it offers a great deal of composability so that you can try very exotic schemes with low effort (usually without touching your source code).

 Thread Tools Display Modes Linear Mode

 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 OffTrackbacks are On Pingbacks are On Refbacks are On Forum Rules

 Similar Threads Thread Thread Starter Forum Replies Last Post yang Main CFD Forum 1 February 25, 2006 12:28 yang Main CFD Forum 2 February 23, 2006 18:11 Skumar Main CFD Forum 0 November 14, 2005 15:16 Abhijit Tilak Main CFD Forum 7 March 20, 2001 01:01 Out of Ideas Main CFD Forum 3 February 8, 2001 23:45