• 한국전산유체공학회:학술대회논문집
• /
• 2004.03a
• /
• pp.77-82
• /
• 2004

A new anisotropic mesh refinement method is proposed. The new method is based on a simple second order interpolation error indicator. Therefore, it is methodologically direct and intuitive as compared with traditional anisotropic refinement strategies. Moreover, it does not depend on the mesh type. The error indicator is face-wisely calculated for all faces in a mesh and the cell refinement type is determined by the configuration of face markings with a given threshold. For the sake of simplicity, an application for a poisson equation on a triangle mesh is considered. The error field and resultant mesh refinement pattern are compared and effects of the threshold selection are discussed. Applying anisotropic refinement with various thresholds, we observed higher convergence rates than those in the uniform refinement cases.

• Journal of Korean Port Research
• /
• v.10 no.2
• /
• pp.61-68
• /
• 1996

The main problems in structural analysis by Finite Eelement Method are difficulty in making data file and error estimation. For decreasing these problems' pays. have been suggesting the adaptive mesh refinement and error estimation method. Posteriory error estimation methods suggested by Jang[1], Babuska[2,3], Ohtsubo[8,9], and this paper. Comparing these methods and examine their properties. According this paper, In the problem supposed having singularity, the method suggested by this paper is good, But the problem supposed having no singularity, the method suggested by Jang[1] is good. For decreasing the effect of initial mesh in p-refinement, make application h-refinement at first and apply p-refinement, and confine polynomial's degree to two, for making program simply by plural mesh models are not needed.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.9 no.5
• /
• pp.50-56
• /
• 2010

Meshfree methods show many advantages over finite element method(FEM) in the class of problems for which the remeshing process is inevitable when the conventional FEM used, such as propagating crack problems, large deformation and so on. One of the promising applications of meshfree methods is the adaptive refinement for problems having multi-scale nature. In this study, an adaptive node generation procedure is proposed and several numerical examples are also presented to illustrate the efficiency of proposed method.

• Structural Engineering and Mechanics
• /
• v.70 no.3
• /
• pp.279-287
• /
• 2019

This paper intends to introduce a near-tip grid refinement and to explore its usefulness in the crack analysis by the natural element method (NEM). As a sort of local h-refinement in FEM, a NEM grid is locally refined around the crack tip showing the high stress singularity. This local grid refinement is completed in two steps in which grid points are added and Delaunay triangles sharing the crack tip node are divided. A plane-state plate with symmetric edge cracks is simulated to validate the proposed local grid refinement and to examine its usefulness in the crack analysis. The crack analysis is also simulated using a uniform NEM grid for the sake of comparison. The near-tip stress distributions and SIFs that are obtained using a near-tip refined NEM grid are compared with the exact values and those obtained using uniform NEM grid. The convergence rates of global relative error to the total number of grid points between the refined and non-refined NEM grids are also compared.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.39 no.5
• /
• pp.415-423
• /
• 2015

In this study, we present a grid refinement model in the lattice Boltzmann method (LBM) for two-dimensional incompressible fluid flow. That is, the model combines the desirable features of the lattice Boltzmann method and stream function-vorticity formulations. In order to obtain an accurate result, very fine grid (or lattice) is required near the solid boundary. Therefore, the grid refinement model is used in the lattice Boltzmann method for stream function-vorticity formulation. This approach is more efficient in that it can obtain the same accurate solution as that in single-block approach even if few lattices are used for computation. In order to validate the grid refinement approach for the stream function-vorticity formulation, the numerical simulations of lid-driven cavity flows were performed and good results were obtained.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.12
• /
• pp.97-105
• /
• 2016

Network-Centric Operational Environment(NCOE) service becomes critical in today's military environment network because reusability of service and interaction are being increasingly important as well in business process. However, the refinement of service by semantic similarity and functional similarity at the business process was not detailed yet. In order to enhance accuracy of refining of business service, in this study, the authors introduce a method for refining service by semantic similarity and functional similarity in BPMN model. The business process are designed in a BPMN model. In this model, candidated services are refined through binding related activities by the analysis result of semantic similarity based on word-net and functional similarity based on properties specification between activities. Then, the services are identified through refining the candidated service. The proposed method is expected to enhance the service identification with accuracy and modularity. It also can accelerate more standardized service refinement developments by the proposed method.

• Korean Journal of Computational Design and Engineering
• /
• v.22 no.2
• /
• pp.110-117
• /
• 2017

Delaunay refinement algorithm is a classical method to generate quality triangular meshes when point cloud and/or constrained edges are given in two- or three-dimensional space. It computes the Delaunay triangulation for given points and edges to obtain an initial solution, and update the triangulation by inserting steiner points one by one to get an improved quality triangulation. This process repeats until it satisfies given quality criteria. The efficiency of the algorithm depends on the criteria and point insertion method. In this paper, we propose a method to accelerate the Delaunay refinement algorithm by applying geometric hashing technique called bucketing when inserting a new steiner point so that it can localize necessary computation. We have tested the proposed method with a few types of data sets, and the experimental result shows strong linear time behavior.

• Structural Engineering and Mechanics
• /
• v.39 no.6
• /
• pp.767-793
• /
• 2011

An efficient edge-based smoothed finite element method (ES-FEM) has been recently developed for solving solid mechanics problems. The ES-FEM uses triangular elements that can be generated easily for complicated domains. In this paper, the complexity study of the ES-FEM based on triangular elements is conducted in detail, which confirms the ES-FEM produces higher computational efficiency compared to the FEM. Therefore, the ES-FEM offers an excellent platform for adaptive analysis, and this paper presents an efficient adaptive procedure based on the ES-FEM. A smoothing domain based energy (SDE) error estimate is first devised making use of the features of the ES-FEM. The present error estimate differs from the conventional approaches and evaluates error based on smoothing domains used in the ES-FEM. A local refinement technique based on the Delaunay algorithm is then implemented to achieve high efficiency in the mesh refinement. In this refinement technique, each node is assigned a scaling factor to control the local nodal density, and refinement of the neighborhood of a node is accomplished simply by adjusting its scaling factor. Intensive numerical studies, including an actual engineering problem of an automobile part, show that the proposed adaptive procedure is effective and efficient in producing solutions of desired accuracy.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.23 no.3
• /
• pp.331-340
• /
• 2010

The basic theory and application of new adaptive finite element algorithm have been proposed in this study including the adaptive hp-refinement strategy, and the effective method for constructing hp-approximation. The hp-adaptive finite element concept needs the integrals of Legendre shape function, nonuniform p-distribution, and suitable constraint of continuity in conjunction with irregular node connection. The continuity of hp-adaptive mesh is an important problem at the common boundary of element interface. To solve this problem, the constraint of continuity has been enforced at the common boundary using the connectivity mapping matrix. The effective method for constructing of the proposed algorithm has been developed by using hierarchical nature of the integrals of Legendre shape function. To verify the proposed algorithm, the problem of simple cantilever beam has been solved by the conventional h-refinement and p-refinement as well as the proposed hp-refinement. The result obtained by hp-refinement approach shows more rapid convergence rate than those by h-refinement and p-refinement schemes. It it noted that the proposed algorithm may be implemented efficiently in practice.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.11
• /
• pp.1844-1853
• /
• 2001

In the present investigation, it was attempted to design the rolling pass schedule fur a clean steel of 0.1C-1.5Mn-0.25Si with the objective of the austenite grain refinement. As the method of approach, a coupled mathematical modeling technique was proposed which consists of a recrystallization model and a flow stress modes. The validity of the coupled model was examined through comparison with results of continuous and discontinuous compression tests at various temperatures, strains and strain rates. The coupled model was incorporated with the finite element method to set up a systematic design methodology far the rolling path schedule for austenite grain refinement. Two path schedules were obtained and discussed in the paper with regard to rolling path time, average grain size, grain size deviation in thickness, etc.