• International Journal of Aeronautical and Space Sciences
• /
• v.18 no.4
• /
• pp.601-613
• /
• 2017

An adjoint-based error estimation and mesh adaptation study is conducted for two-dimensional viscous flows on unstructured hybrid meshes. The error in an integral output functional of interest is estimated by a dot product of the residual vector and adjoint variable vector. Regions for the mesh to be adapted are selected based on the amount of local error at each nodal point. Triangular cells in the adaptive regions are refined by regular refinement, and quadrangular cells near viscous walls are bisected accordingly. The present procedure is applied to single-element airfoils such as the RAE2822 at a transonic regime and a diamond-shaped airfoil at a supersonic regime. Then the 30P30N multi-element airfoil at a low subsonic regime with a high incidence angle (${\alpha}=21deg.$) is analyzed. The same level of prediction accuracy for lift and drag is achieved with much less mesh points than the uniform mesh refinement approach. The detailed procedure of the adjoint-based mesh refinement for the multi-element airfoil case show that the basic flow features around the airfoil should be resolved so that the adjoint method can accurately estimate an output error.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.4
• /
• pp.347-358
• /
• 2000

The view dependency of typical spatial-partitioning based NC simulation methods is overcome by polygon rendering technique that generates polygons to represent the workpiece, thus enabling dynamic viewing transformations without reconstruction of the entire data structure. However, the polygon rendering technique still has difficulty in realizing real-time simulation due to unsatisfactory performance of current graphics devices. Therefore, it is necessary to develop a mesh decimation method that enables rapid rendering without loss of display quality. In this paper. we proposed a new mesh decimation algorithm thor a workpiece whose shape varies dynamically. In this algorithm, the 2-map data thor a given workpiece is divided into several regions, and a triangular mesh is constructed for each region first. Then, if any region it cut by the tool, its mesh is regenerated and decimated again. Since the range of mesh decimation is confined to a few regions, the reduced polygons for rendering can be obtained rapidly. Our method enables the polygon-rendering based NC simulation to be applied to the computers equipped with a wider range of graphics cards.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.6
• /
• pp.1004-1014
• /
• 2001

The fully automatic algorithm from initial finite element mesh generation to remeshing in two dimensional geometry is introduced using bubble packing method (BPM) for finite element analysis. BPM determines the node placement by force-balancing configuration of bubbles and the triangular meshes are made by Delaunay triangulation with advancing front concept. In BPM, we suggest two node-search algorithms and the adaptive/recursive bubble controls to search the optimal nodal position. To use the automatically generated mesh information in FEA, the new enhanced bandwidth minimization scheme with high efficiency in CPU time is developed. In the remeshing stage, the mesh refinement is incorporated by the control of bubble size using two parameters. And Superconvergent Patch Recovery (SPR) technique is used for error estimation. To verify the capability of this algorithm, we consider two elasticity problems, one is the bending problem of short cantilever beam and the tension problem of infinite plate with hole. The numerical results indicate that the algorithm by BPM is able to refine the mesh based on a posteriori error and control the mesh size easily by two parameters.

• International Journal of High-Rise Buildings
• /
• v.8 no.4
• /
• pp.255-264
• /
• 2019

This paper describes large eddy simulation of wind pressures on a square cylinder in a uniform flow and a high-rise building immersed in an atmospheric turbulent boundary layer. For the atmospheric boundary layer case, the inflow turbulence is generated by a numerical wind tunnel. In the numerical simulation, particular attention is devoted to the performance of an auto hexahedral non-structural mesh. Both simulations are performed for three grid systems: an auto hexahedral non-structured grid, a structured Cartesian grid and a non-structured triangular prism grid, and for three grid numbers. The present study shows that the auto hexahedral unstructured mesh achieves the best simulation results for wind pressures on the square cylinder and the high-rise building. When the grid number is sufficiently large, the differences among the results obtained from the three investigated grid systems are not significant. However, the advantage of the auto hexahedral unstructured mesh becomes clear when the grid number decreases, because it enables a balanced distribution of orthogonal grids. The results described in this paper demonstrate that the auto hexahedral non-structured mesh has good potential applicability to simulation of urban flows.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.33 no.8
• /
• pp.1-7
• /
• 2005

This paper proposes a local improvement method that combines extended topological clean up and optimization-based smoothing for homogenizing triangular grid system. First extended topological clean up procedures are applied to improve the connectivities of grid elements. Then, local optimization-based smoothing is performed for maximizing the distortion metric that measures grid quality. Using the local improvement strategy, we implement the grid homogenizations for two triangular grid examples. It is shown that the suggested algorithm improves the quality of the triangular grids to a great degree in an efficient manner and also can be easily applied to the remeshing algorithm in adaptive mesh refinement technique.

• Journal of computational fluids engineering
• /
• v.12 no.4
• /
• pp.68-73
• /
• 2007

Computational Fluid Dynamics (CFD) approach is now playing an important role in the engineering process in these days. Generating proper grid system in time for the region of interest is prerequisite for the efficient numerical calculation of flow physics using CFD approach. Grid generation is, however, usually considered as a major obstacle for a routine and successful application of numerical approaches in the engineering process. CFD approach based on the unstructured grid system is gaining popularity due to its simplicity and efficiency for generating grid system compared to the structured grid approaches, especially for complex geometries. In this paper an automated triangular surface grid generation using CAD(Computer Aided Design) surface data is proposed. According to the present method, the CAD surface data imported in the STL(Stereo-lithography) format is processed to identify feature edges defining the topology and geometry of the surface shape first. When the feature edges are identified, node points along the edges are distributed. The initial fronts which connect those feature edge nodes are constructed and then they are advanced along the CAD surface data inward until the surface is fully covered by triangular surface grid cells using Advancing Front Method. It is found that this approach can be implemented in an automated way successfully saving man-hours and reducing human-errors in generating triangular surface grid system.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.14 no.1
• /
• pp.27-32
• /
• 2003

This paper describes to extend the fast algorithm fur the capacitance extraction of large three-dimensional object. The triangular meshes are used and refined adaptively in the area where the heavy charges reside in each iterative solving. This technique is applied to the capacitance extraction of a 68-pin cerquad package. The results show fast convergence, and this adaptive technique coupled with the fast algorithm is efficient to reduce the number of elements and computing time with least additional computational efforts in large three dimensional problems.

• Journal of the Korea Computer Graphics Society
• /
• v.21 no.1
• /
• pp.13-21
• /
• 2015

We present a robust GPU algorithm constructing a sweep volume boundary for a triangular mesh model. Sweeping geometric entities of a triangular mesh object is first approximated to a set of triangles, the envelope of which becomes the outer boundary of the sweep volume. We find the envelope by computing the arrangement of the triangle set and extracting its outmost boundary. To ensure robustness of the algorithm, we adopt random perturbation of sweep vertices and the interval arithmetic using multi-level precisions. The algorithm is implemented to perform most computation on GPU, and as a result it runs two orders of magnitude faster than other algorithms.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.13 no.1
• /
• pp.80-86
• /
• 2002

This paper describes to extend the MLFMA(Multi-Level Fast Multipole Algorithm) for three-dimensional capacitance computation in the case of conductors embedded in an arbitrary dielectric medium. The triangular meshes are used and refined in the area which has heavy charge density. This technique is applied to the capacitance extraction of three-dimensional structures with multiple dielectrics. The results show good convergence with the comparable accuracy, and this adaptive technique coupled with MLFMA is useful to reduce computing time and the number of elements with least additional computational efforts in large three dimensional problems.

• Nuclear Engineering and Technology
• /
• v.55 no.6
• /
• pp.2172-2194
• /
• 2023

A variational nodal method (VNM) with unstructured-mesh is presented for solving steady-state and dynamic neutron diffusion equations. Orthogonal polynomials are employed for spatial discretization, and the stiffness confinement method (SCM) is implemented for temporal discretization. Coordinate transformation relations are derived to map unstructured triangular nodes to a standard node. Methods for constructing triangular prism space trial functions and identifying unique nodes are elaborated. Additionally, the partitioned matrix (PM) and generalized partitioned matrix (GPM) methods are proposed to accelerate the within-group and power iterations. Neutron diffusion problems with different fuel assembly geometries validate the method. With less than 5 pcm eigenvalue (k_eff) error and 1% relative power error, the accuracy is comparable to reference methods. In addition, a test case based on the kilowatt heat pipe reactor, KRUSTY, is created, simulated, and evaluated to illustrate the method's precision and geometrical flexibility. The Dodds problem with a step transient perturbation proves that the SCM allows for sufficiently accurate power predictions even with a large time-step of approximately 0.1 s. In addition, combining the PM and GPM results in a speedup ratio of 2-3.