In this paper, data compressions of pre-/post-files of large-scale flow computations are discussed within a framework of the Building-Cube Method (BCM), that was proposed aimed for DNS around real geometries with an expectation of near-future high-performance computers. In the BCM, a flow field is described as an assemblage of building blocks of cuboids, named ‘Cube’. Each cube is a sub-domain of the flow computation and an equallyspaced Cartesian mesh is used in it. All cubes have the same number of grid points and the geometrical size of each cube is determined by adapting to the geometry and the flow features so as to fit the grid spacing to the local flow scale. The grid data are compressed using the run-length technique, combined with the cube framework and the simple treatment of the wall boundaries. The solution data of each time frame of an unsteady flow are compressed by a technique similar to the vector quantization method proposed for image-data compressions. The present method is applied to two airfoils whose results reveal the detailed vortex motions in the boundary layers and shows the importance to use the isotropic, high-density mesh in the boundary layer.
[1]
Kazuhiro Nakahashi,et al.
Building-Cube Method for Flow Problems with Broadband Characteristic Length
,
2003
.
[2]
Satoru Yamamoto,et al.
Higher-order-accurate upwind schemes for solving the compressible Euler and Navier-Stokes equations
,
1993
.
[3]
Kazuhiro Nakahashi,et al.
An automatic Euler solver using the unstructured upwind method
,
1991
.
[4]
Kazuhiro Nakahashi,et al.
Some challenges of realistic flow simulations by unstructured grid CFD
,
2003
.
[5]
S. Obayashi,et al.
Convergence acceleration of a Navier-Stokes solver for efficient static aeroelastic computations
,
1995
.
[6]
Kazuhiro Nakahashi,et al.
Building-Cube Method for Large-Scale, High Resolution Flow Computations
,
2004
.
[7]
Allen Gersho,et al.
Vector quantization and signal compression
,
1991,
The Kluwer international series in engineering and computer science.
[8]
Improvement and assessment of an arbitrary-high-order time-accurate algorithm
,
1993
.