Cited 4 time in
Three-Dimensional Building-Cube Method for Inviscid Compressible Flow Computations
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kim, Lae-Sung | - |
| dc.contributor.author | Nakahashi, Kazuhiro | - |
| dc.contributor.author | Xu, Zhe-Zhu | - |
| dc.contributor.author | Xiao, Hong | - |
| dc.contributor.author | Lyu, Sung-Ki | - |
| dc.date.accessioned | 2022-12-26T21:24:58Z | - |
| dc.date.available | 2022-12-26T21:24:58Z | - |
| dc.date.issued | 2015-12 | - |
| dc.identifier.issn | 2234-7593 | - |
| dc.identifier.issn | 2005-4602 | - |
| dc.identifier.uri | https://scholarworks.gnu.ac.kr/handle/sw.gnu/16886 | - |
| dc.description.abstract | In this study, the Building-Cube method (BCM) devised for calculating large-scale flows and getting rid of the grid dependencies of computational results is extended to perform 3D inviscid compressible fluid flow simulations. The proposed scheme divides a computational domain into a large number of cubes with different sizes, and each individual cube is a sub-flow field simulated with a Cartesian grid of uniform spacing and an equal number of cells and nodes. Through the proposed scheme, we determine the geometric size of individual cube by Adapting the flow characteristics and geometrical shapes using an adaptively refining Cartesian grid approaches. The uniform spacing and equal number of cells and nodes in the Cartesian grid of individual cubes ensure a good performance for parallel computations; large result data can be handled efficiently. Further, an algorithm to solve the inviscid flow equations on the Building-Cube mesh for three-dimensional (3D) geometries is presented. The validation and performance of the proposed 3D BCM are demonstrated through comparisons of the computed results with the experimental data for the ONERA M6 wing and ONERA M5 wing-fuselage configurations. | - |
| dc.format.extent | 9 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | KOREAN SOC PRECISION ENG | - |
| dc.title | Three-Dimensional Building-Cube Method for Inviscid Compressible Flow Computations | - |
| dc.type | Article | - |
| dc.publisher.location | 대한민국 | - |
| dc.identifier.doi | 10.1007/s12541-015-0342-4 | - |
| dc.identifier.scopusid | 2-s2.0-84949209875 | - |
| dc.identifier.wosid | 000368025200009 | - |
| dc.identifier.bibliographicCitation | INTERNATIONAL JOURNAL OF PRECISION ENGINEERING AND MANUFACTURING, v.16, no.13, pp 2673 - 2681 | - |
| dc.citation.title | INTERNATIONAL JOURNAL OF PRECISION ENGINEERING AND MANUFACTURING | - |
| dc.citation.volume | 16 | - |
| dc.citation.number | 13 | - |
| dc.citation.startPage | 2673 | - |
| dc.citation.endPage | 2681 | - |
| dc.type.docType | Article | - |
| dc.identifier.kciid | ART002049074 | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | scie | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.description.journalRegisteredClass | kci | - |
| dc.relation.journalResearchArea | Engineering | - |
| dc.relation.journalWebOfScienceCategory | Engineering, Manufacturing | - |
| dc.relation.journalWebOfScienceCategory | Engineering, Mechanical | - |
| dc.subject.keywordPlus | HIGH-ORDER | - |
| dc.subject.keywordPlus | CFD | - |
| dc.subject.keywordPlus | EQUATIONS | - |
| dc.subject.keywordPlus | GRIDS | - |
| dc.subject.keywordAuthor | Building-Cube method | - |
| dc.subject.keywordAuthor | Three-dimensional inviscid compressible flows | - |
| dc.subject.keywordAuthor | Cartesian mesh | - |
| dc.subject.keywordAuthor | Parallel computation | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Gyeongsang National University Central Library, 501, Jinju-daero, Jinju-si, Gyeongsangnam-do, 52828, Republic of Korea+82-55-772-0532
COPYRIGHT 2022 GYEONGSANG NATIONAL UNIVERSITY LIBRARY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
