• Title/Summary/Keyword: adaptive mesh

Search Result 254, Processing Time 0.027 seconds

2-D Magnetostatic Field Analysis Using Adaptive Boundary Element Method (적응 경계요소법을 이용한 2차원 정자장 해석)

  • Koh, Chang-Seop;Jeon, Ki-Eock;Hahn, Song-Yop;Jung, Hyun-Kyo
    • Proceedings of the KIEE Conference
    • /
    • 1990.11a
    • /
    • pp.23-27
    • /
    • 1990
  • Adaptive mesh refinement scheme is incorporated with the Boundary Element Method (BEM) in order to get accurate solution with relatively fewer unknowns for the case of magnetostatic field analysis and A new and simple posteriori local error estimation method is presented. The local error is defined as integration over the element of the difference between solutions acquired us ing second order and first order interpolation function and is used as the criterion for mesh refinement at given grid. Case study for two dimensional problems with singular point reveals that meshes are concentrated on the neighbor of singular point and the error is decreased gradually and the solutions calculated on the domain are converged to the analytic solution as the number of unknowns increases. The adaptive mesh gives much better rate of convergence in global errors than the uniform mesh.

  • PDF

Finite element analysis of magnetic clutch using adaptive mesh refinement technique (적응요소분할법에 의한 자기클러치 전자력의 유한요소해석)

  • Kim, Han;Ahn, Chang-Hoi
    • Proceedings of the KIEE Conference
    • /
    • 1996.07a
    • /
    • pp.112-114
    • /
    • 1996
  • In this paper a simple mesh refinement technique for finite element method is proposed using error estimation only on the material boundaries. The boundary errors are estimated by the continuity conditions of normal B field and tangential B field. From the error estimation fine meshes are accomplished on the boundary and propagate to the near region by Delanunay mesh tessellation. This adaptive mesh refinement technique is applied to the force calculation of magnetic clutch composed by several material regions and makes good convergence.

  • PDF

Unstructured discretisation of a non-local transition model for turbomachinery flows

  • Ferrero, Andrea;Larocca, Francesco;Bernaschek, Verena
    • Advances in aircraft and spacecraft science
    • /
    • v.4 no.5
    • /
    • pp.555-571
    • /
    • 2017
  • The description of transitional flows by means of RANS equations is sometimes based on non-local approaches which require the computation of some boundary layer properties. In this work a non-local Laminar Kinetic Energy model is used to predict transitional and separated flows. Usually the non-local term of this model is evaluated along the grid lines of a structured mesh. An alternative approach, which does not rely on grid lines, is introduced in the present work. This new approach allows the use of fully unstructured meshes. Furthermore, it reduces the grid-dependence of the predicted results. The approach is employed to study the transitional flows in the T106c turbine cascade and around a NACA0021 airfoil by means of a discontinuous Galerkin method. The local nature of the discontinuous Galerkin reconstruction is exploited to implement an adaptive algorithm which automatically refines the mesh in the most significant regions.

Numerical Analysis of Helicopter Rotor Blade in Forward Flight Using Unstructured Adaptive Meshes (비정렬 적응격자 기법을 이용한 전진비행하는 헬리콥터 로터 블레이드의 수치 해석)

  • Park Y. M.;Lee J. Y.;Kwon O. J.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2003.08a
    • /
    • pp.95-101
    • /
    • 2003
  • A three dimensional inviscid parallel flow solver has been developed for the simulation of rotor blades in forward flight. The computational domain is divided into stationary and rotating zones for the more efficient mesh adaptation. The conservative mesh treatment algorithm is used for the convection of flow variables and fluxes across the sliding boundary. A deforming mesh algorithm using modified spring analogy is used for the blade motion. In the present paper, detail descriptions of numerical analysis for forward flight are introduced. Some results are presented for a two bladed AH-1G rotor and compared with experimental data.

  • PDF

AUTOMATED ADAPTIVE TETRAHEDRAL ELEMENT GENERATION FOR THREE-DIMENSIONAL METAL FORMING SIMULATION (삼차원 소성가공 공정 시뮬레이션을 위한 지능형 사면체 요소망 자동생성)

  • Lee M. C.;Joun M. S.
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 2005.05a
    • /
    • pp.203-208
    • /
    • 2005
  • In this paper, an automated adaptive mesh generation scheme, based on an advancing-front-Delaunay method, is developed for finite element simulation of three dimensional bulk metal forming processes. During the simulation, the finite element mesh system is adaptively remeshed whenever the mesh is unacceptable. Several schemes are developed such as curvature compensation scheme to minimize volume loss, optimal smoothing scheme to improve element quality, etc. The presented approach is evaluated and applied to automatic forging simulation in order to demonstrate the effect of the developed schemes.

  • PDF

A Study on Efficient Analysis of Delamination Buckling of Composite Structures (효율적인 복합재료구조물의 delamination buckling 해석기법에 관한 연구)

  • 황재웅;김용협
    • Proceedings of the Korean Society For Composite Materials Conference
    • /
    • 2000.04a
    • /
    • pp.80-84
    • /
    • 2000
  • A mesh superposition technique is presented for an efficient analysis of structural behavior. Refined child mesh is superimposed over parent elements for the region of interest. It is a kind of adaptive mesh refinement, which allows locally refined mesh without introducing transition region or multipoint constraints. Proper boundary condition is necessary to avoid redundant rigid body motion and kinematic compatibility between neighbor elements. Delamination buckling analysis is conducted to demonstrate accuracy and efficiency of the present method.

  • PDF

Generation of a adaptive tetrahedral refinement mesh for GaAs full band monte carlo simulation (풀밴드 GaAs monte carlo 시뮬레이션을 위한 최적사면체격자의 발생)

  • 정학기
    • Journal of the Korean Institute of Telematics and Electronics D
    • /
    • v.34D no.7
    • /
    • pp.37-44
    • /
    • 1997
  • A dadaptive refinement tetrahedron mesh has been presented for using in full band GaAs monte carlo simulation. A uniform tetrahedron mesh is used without regard to energy values and energy variety in case of the past full band simulation. For the uniform tetrahedron mesh, a fine tetrahedron is demanded for keeping up accuracy of calculation in the low energy region such as .GAMMA.-valley, but calculation time is vast due to usin gthe same tetrahedron in the high energy region. The mesh of this study, thererfore, is consisted of the fine mesh in the low energy and large variable energy region and rough mesh n the high energy. The density of states (DOS) calculated with this mesh is compared with the one of the uniform mesh. The DOS of this mesh is improved th efive times or so in root mean square error and the ten times in the correlation coefficient than the one of a uniform mesh. This refinement mesh, therefore, can be used a sthe basic mesh for the full band GaAs monte carlo simulation.

  • PDF

Adaptive Wireless Network Coding for Infrastructure Wireless Mesh Networks

  • Carrillo, Ernesto;Ramos, Victor
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.7
    • /
    • pp.3470-3493
    • /
    • 2019
  • IEEE 802.11s-based infrastructure Wireless Mesh Networks (iWMNs) are envisaged as a promising solution to provide ubiquitous wireless Internet access. The limited network capacity is a problem mainly caused by the medium contention between mesh users and the mesh access points (MAPs), which gets worst when the mesh clients employ the Transmission Control Protocol (TCP). To mitigate this problem, we use wireless network coding (WNC) in the MAPs. The aim of this proposal is to take advantage of the network topology around the MAPs, to alleviate the contention and maximize the use of the network capacity. We evaluate WNC when is used in MAPs. We model the formation of coding opportunities and, using computer simulations, we evaluate the formation of such coding opportunities. The results show that as the users density grows, the coding opportunities increase up to 70%; however, at the same time, the coding delay increments significantly. In order to reduce such delay, we propose to adaptively adjust the time that a packet can wait to catch a coding opportunity in an MAP. We assess the performance of moving-average estimation methods to forecast this adaptive sojourn time. We show that using moving-average estimation methods can significantly decrease the coding delay since they consider the traffic density conditions.

Adaptive Delaunay Mesh Generation Technique Based on a Posteriori Error Estimation and a Node Density Map (오차 예측과 격자밀도 지도를 이용한 적응 Delaunay 격자생성방법)

  • 홍진태;이석렬;박철현;양동열
    • Transactions of Materials Processing
    • /
    • v.13 no.4
    • /
    • pp.334-341
    • /
    • 2004
  • In this study, a remeshing algorithm adapted to the mesh density map using the Delaunay mesh generation method is developed. In the finite element simulation of forging process, the numerical error increases as the process goes on because of discrete property of the finite elements and distortion of elements. Especially, in the region where stresses and strains are concentrated, the numerical error will be highly increased. However, it is not desirable to use a uniformly fine mesh in the whole domain. Therefore, it is necessary to reduce the analysis error by constructing locally refined mesh at the region where the error is concentrated such as at the die corner. In this paper, the point insertion algorithm is used and the mesh size is controlled by using a mesh density map constructed with a posteriori error estimation. An optimized smoothing technique is adopted to have smooth distribution of the mesh and improve the mesh element quality.

An Adaptive Analysis in the Element-free Galerkin Method Using Bubble Meshing Technique (Bubble Mesh기법을 이용한 적응적 EFG해석)

  • 정흥진;이계희;최창근
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.15 no.1
    • /
    • pp.85-94
    • /
    • 2002
  • In this study an adaptive node generation procedure in the Element-free Galerkin (EFG) method using bubble-meshing technique is Proposed. Since we construct the initial configuration of nodes by subdivision of background cell, abrupt changes of inter-nodal distance between higher and lower error regions are unavoidable. This unpreferable nodal spacing induces additional errors. To obtain the smooth nodal configuration the nodal configurations are regenerated by bubble-meshing technique. This bubble meshing technique was originally developed to generate a set of well-shaped triangles and tetrahedra. In odder to evaluate the effect of abrupt changes of nodal spacing, one-dimensional problems with various nodal configurations mere investigated. To demonstrate the performance of proposed scheme, the sequences of making optimal nodal configuration with bubble meshing technique are investigated for several problems.