A unifying grid approach for solving potential flows applicable to structured and unstructured grid configurations

Date

2008-01-01

Author

Cete, A. Ruhsen
Yuekselen, M. Adil
Kaynak, Uenver

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

285
views

0
downloads

In this study, an efficient numerical method is proposed for unifying the structured and unstructured grid approaches for solving the potential flows. The new method, named as the "alternating cell directions implicit - ACDI", solves for the structured and unstructured grid configurations equally well. The new method in effect applies a line implicit method similar to the Line Gauss Seidel scheme for complex unstructured grids including mixed type quadrilateral and triangle cells. To this end, designated alternating directions are taken along chains of contiguous cells, i.e. 'cell directions', and an ADI-like sweeping is made to update these cells using a Line Gauss Seidel like scheme. The algorithm makes sure that the entire flow field is updated by traversing each cell twice at each time step for unstructured quadrilateral grids that may contain triangular cells. In this study, a cell-centered finite volume formulation of the ACDI method is demonstrated. The solutions are obtained for incompressible potential flows around a circular cylinder and a forward step. The results are compared with the analytical solutions and numerical solutions using the implicit ADI and the explicit Runge-Kutta methods on single-and multi-block structured and unstructured grids. The results demonstrate that the present ACDI method is unconditionally stable, easy to use and has the same computational performance in terms of convergence, accuracy and run times for both the structured and unstructured grids.

Subject Keywords

General Engineering, General Computer Science

URI

https://hdl.handle.net/11511/66421

Journal

COMPUTERS & FLUIDS

DOI

https://doi.org/10.1016/j.compfluid.2007.01.011

Collections

Unclassified, Article

Suggestions

OpenMETU
Core

Fast cell determination of the DSMC molecules in multi-stage turbo molecular pump design Sengil, N.; Edis, Fırat Oğuz (Elsevier BV, 2011-06-01) In this study, an existing 2D parallel DSMC solver is modified, to analyze the multi-stage turbomolecular pumps more efficiently. Generally, molecule movements are traced cell-by-cell in DSMC solvers both in structured and unstructured meshes in order to determine which cell the DSMC molecule is positioned in. These calculations require time consuming trigonometric operations. If a nonrectangular physical domain can be converted into a rectangular computational domain using curvilinear coordinates, then it ...
A robust bi-objective mathematical model for disaster rescue units allocation and scheduling with learning effect Tirkolaee, Erfan Babaee; Aydin, Nadi Serhan; Ranjbar-Bourani, Mehdi; Weber, Gerhard Wilhelm (Elsevier BV, 2020-11-01) This paper proposes a novel bi-objective mixed-integer linear programming (MILP) model for allocating and scheduling disaster rescue units considering the learning effect. When a natural phenomenon (e.g., earthquake or flood) occurs, the presented decision support model is expected to help decision-makers of emergency relief centers to provide efficient planning for rescue units to minimize the total weighted completion time of rescue operations, as well as the total delay in rescue operations. The problem ...
Integrating estimation of distribution algorithms versus Q-learning into Meta-RaPS for solving the 0-1 multidimensional knapsack problem Arin, Arif; Rabadi, Ghaith (Elsevier BV, 2017-10-01) Finding near-optimal solutions in an acceptable amount of time is a challenge when developing sophisticated approximate approaches. A powerful answer to this challenge might be reached by incorporating intelligence into metaheuristics. We propose integrating two methods into Meta-RaPS (Metaheuristic for Randomized Priority Search), which is currently classified as a memoryless metaheuristic. The first method is the Estimation of Distribution Algorithms (EDA), and the second is utilizing a machine learning a...
Optimization of well placement in complex carbonate reservoirs using artifical intelligence Uraz, İrtek; Akın, Serhat; Department of Petroleum and Natural Gas Engineering (2004) This thesis proposes a framework for determining the optimum location of an injection well by using an inference method, Artificial Neural Networks and a search algorithm to create a search space and locate the global maxima. Theoretical foundation of the proposed framework is followed by description of the field for case study. A complex carbonate reservoir, having a recorded geothermal production history is used to evaluate the proposed framework ( Kizildere Geothermal field, Turkey). In the proposed fram...
Single machine scheduling with maximum earliness and number tardy Azizoğlu, Meral; Koksalan, M (Elsevier BV, 2003-08-01) In this paper, we study the bicriteria scheduling problem of minimizing the maximum earliness and the number of tardy jobs on a single machine. We assume idle time insertion is not allowed. We first examine the problem of minimizing maximum earliness while keeping the number of tardy jobs to its minimum value. We then propose a general procedure for <LF>generating all efficient schedules for bicriteria problems. We also develop a general procedure to find the efficient schedule that minimizes a composite fu...

Citation Formats

A. R. Cete, M. A. Yuekselen, and U. Kaynak, “A unifying grid approach for solving potential flows applicable to structured and unstructured grid configurations,” COMPUTERS & FLUIDS, pp. 35–50, 2008, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/66421.