Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.11851/6183
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cete, A. Ruhsen | - |
dc.contributor.author | Yükselen, M. Adil | - |
dc.contributor.author | Kaynak, Ünver | - |
dc.date.accessioned | 2021-09-11T15:35:12Z | - |
dc.date.available | 2021-09-11T15:35:12Z | - |
dc.date.issued | 2008 | en_US |
dc.identifier.issn | 0045-7930 | - |
dc.identifier.uri | https://doi.org/10.1016/j.compfluid.2007.01.011 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.11851/6183 | - |
dc.description.abstract | 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. (C) 2007 Elsevier Ltd. All rights reserved. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Pergamon-Elsevier Science Ltd | en_US |
dc.relation.ispartof | Computers & Fluids | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | [No Keywords] | en_US |
dc.title | A Unifying Grid Approach for Solving Potential Flows Applicable To Structured and Unstructured Grid Configurations | en_US |
dc.type | Article | en_US |
dc.department | Faculties, Faculty of Engineering, Department of Mechanical Engineering | en_US |
dc.department | Fakülteler, Mühendislik Fakültesi, Makine Mühendisliği Bölümü | tr_TR |
dc.identifier.volume | 37 | en_US |
dc.identifier.issue | 1 | en_US |
dc.identifier.startpage | 35 | en_US |
dc.identifier.endpage | 50 | en_US |
dc.identifier.wos | WOS:000250909800004 | en_US |
dc.identifier.scopus | 2-s2.0-34548823247 | en_US |
dc.institutionauthor | Kaynak, Ünver | - |
dc.identifier.doi | 10.1016/j.compfluid.2007.01.011 | - |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.identifier.scopusquality | Q1 | - |
item.openairetype | Article | - |
item.languageiso639-1 | en | - |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
crisitem.author.dept | 02.7. Department of Mechanical Engineering | - |
Appears in Collections: | Makine Mühendisliği Bölümü / Department of Mechanical Engineering Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
CORE Recommender
SCOPUSTM
Citations
5
checked on Dec 21, 2024
WEB OF SCIENCETM
Citations
7
checked on Aug 31, 2024
Page view(s)
84
checked on Dec 23, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.