Abstract
In this paper, requirements for the next generation CFD in the near-future computational environment is discussed and a new approach named Building-Cube Method is proposed aimed for large-scale, high resolution computations around a complex geometry. In the present method, a flow field is divided into a number of cubes (squares in 2D) of various sizes. Each cube is a computational sub-domain with Cartesian mesh of equal spacing and equal number of nodes. The geometrical size of each cube is determined by adapting to geometry and flow features so as to cope with broadband characteristic length of the flow. Equal spacing and equal number of Cartesian grid in each cube make it easy to parallelize the flow solver and to handle huge data output. The approach is tested for a shock/boundary layer interacting problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
K. Nakahashi: ‘Progress in Unstructured- Grid CFD’. Proc. 1st ICCFD, Computational Fluid Dynamics 2000, Ed. by N. Satofuka, Springer, pp. 3–13, (2000).
N. Hasuike, A. Oyama, K. Nakahashi, S. Obayashi: ‘CFD Stall Prediction of 2D Airfoils’. J. Japan Society for Aeronautical and Space Sciences, 50, 577 (2002).
D.D. Zeeuw, K. G. Powell:’An Adaptively Refined Cartesian Mesh Solver for the Euler Equation’. J. Comp. Phys., 104, pp. 56–68, (1993).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nakahashi, K. (2003). Building-Cube Method for Flow Problems with Broadband Characteristic Length. In: Armfield, S.W., Morgan, P., Srinivas, K. (eds) Computational Fluid Dynamics 2002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59334-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-59334-5_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63938-8
Online ISBN: 978-3-642-59334-5
eBook Packages: Springer Book Archive