An efficient SIMPLER-revised algorithm for incompressible flow with unstructured grids
| Autor: | Jie Li, Quan Zhang, Zhiqiang (John) Zhai |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Numerical Analysis
Push–relabel maximum flow algorithm Dinic's algorithm Parallel algorithm Out-of-kilter algorithm 02 engineering and technology Condensed Matter Physics 01 natural sciences Computer Science Applications 010101 applied mathematics Nondeterministic algorithm 020303 mechanical engineering & transports 0203 mechanical engineering Mechanics of Materials Modeling and Simulation Algorithmics In-place algorithm 0101 mathematics Difference-map algorithm Algorithm Mathematics |
| Zdroj: | Numerical Heat Transfer, Part B: Fundamentals. 71:425-442 |
| ISSN: | 1521-0626 1040-7790 |
| DOI: | 10.1080/10407790.2017.1293965 |
| Popis: | This paper proposes an efficient segregated solution procedure for the two-dimensional incompressible fluid flow on unstructured grids. The new algorithm is called SIMPLERR (SIMPLERR-revised algorithm). It includes an inner iterative process that consists of a pressure equation solution and an explicit velocity correction, and then, the pressure field is obtained by another solving process for the pressure equation. The features and advantages of the SIMPLERR algorithm are demonstrated by solving a benchmark flow problem, and the results indicate that the SIMPLERR algorithm can maintain a strong stability as the IDEAL algorithm and can converge faster than the SIMPLER algorithm or even than the IDEAL algorithm. The advantage of the SIMPLERR algorithm is especially evident for high-Re and fine-mesh fluid flow cases, where the SIMPLERR algorithm and the IDEAL algorithm can obtain a convergence result but the SIMPLER algorithm cannot. The SIMPLERR algorithm is about two times faster than the IDEAL al... |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|