CFD Online Logo CFD Online URL
www.cfd-online.com
[Sponsors]
Home > Forums > General Forums > Main CFD Forum

Limits of SIMPLE algorithm

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

Reply
 
LinkBack Thread Tools Search this Thread Display Modes
Old   June 10, 2009, 05:13
Default Limits of SIMPLE algorithm
  #1
New Member
 
Fernando Herrera
Join Date: Mar 2009
Posts: 18
Rep Power: 17
Benzaa is on a distinguished road
Hi,

I was wondering if someone knows the limits of the SIMPLE algorithm.

What is the maximum speed that it can work with?
Is it limited by the Reynolds number?

I'm asking these questions because of my code. I've developed a small code that calculates the flow field in 2D. But, I've noticed that if the entry speed is high, the code goes bananas. Now my code is stable with entry speeds below 2 m/s and density of 1.

I haven't found a proper reason for this. I've been reading the books by Versteeg and Anderson, but I cannot find something that I can use to justify the behavior.

Please, I will appreciate any help, or the name of a book that I could read.
Benzaa is offline   Reply With Quote

Old   June 10, 2009, 12:42
Default
  #2
jed
Member
 
Jed Brown
Join Date: Mar 2009
Posts: 56
Rep Power: 19
jed is on a distinguished road
SIMPLE is pretty terrible for many purposes. A more general approach which contains SIMPLE as a special case are preconditioners based on block factorization. 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}
}
or the comprehensive

Code:
@article{benzi2005nss,
  title={{Numerical solution of saddle point problems}},
  author={Benzi, M. and Golub, G.H. and Liesen, J.},
  journal={Acta Numerica},
  volume={14},
  pages={1--137},
  year={2005},
  publisher={Cambridge Univ Press}
}
If you are concerned about efficiency with small subdomains on massively parallel archituctures, you may want to look at Vanka smoothers for multigrid or multilevel domain decomposition that respects indefiniteness, but the block preconditioners in Elman's paper provide an excellent framework for robust solvers and they have been shown to scale nearly linearly to 65k processes and 40B degrees of freedom.
jed is offline   Reply With Quote

Reply

Thread Tools Search this Thread
Search this Thread:

Advanced Search
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 Off
Pingbacks are On
Refbacks are On


Similar Threads
Thread Thread Starter Forum Replies Last Post
SIMPLE algorithm in 3D cylindrical coordinates zouchu Main CFD Forum 1 January 20, 2014 18:02
SIMPLE algorithm for collocated storage alex Main CFD Forum 4 April 9, 2008 00:48
About Phase Coupled SIMPLE (PC-SIMPLE) algorithm Yan Kai Main CFD Forum 0 April 18, 2007 04:48
About Phase Coupled SIMPLE (PC-SIMPLE) algorithm Yan Kai FLUENT 0 April 14, 2007 00:17
SIMPLE algorithm Jonathan Castro Main CFD Forum 3 December 10, 1999 05:59


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