• Title/Summary/Keyword: refinement

Search Result 1,668, Processing Time 0.026 seconds

An anisotropic mesh refinement for an unstructured finite volume method (비정렬 유한 체적법을 위한 비등방 격자 미세화 기법)

  • Lee K. S.;Baek J. H.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 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.

  • PDF

Efficient Motion Refinement Algorithm based on ASW for Reduced Frame-Rate Video Transcoder (시간해상도 감소 트랜스코딩을 위한 ASW움직임벡터 정밀화 알고리즘에 관한 연구)

  • 서동완;권혁민;최윤식
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.2044-2047
    • /
    • 2003
  • In this paper, we propose efficient motion vector refinement algorithm for frame-rate reduction transcoding. The proposed algorithm is to set the search range for motion refinement based on the incoming motion vector. The algorithm calculates the importance of motion vector of the skipped frame and then selects two motion vector to set search range. Through this process, we determine the accuracy of incoming motion vector and set the search range lot refinement adaptively by means of the accuracy. In experiments, we show efficiency of our algorithm to reduce the search points for refinement.

  • PDF

CYCLIC SUBMODULES AND MODULES ASSOCIATED WITH THEM

  • Park, Chin-Hong
    • Journal of applied mathematics & informatics
    • /
    • v.4 no.2
    • /
    • pp.563-571
    • /
    • 1997
  • In this paper we define CR(completely reachable), MICR(minimal cyclic refinement)and MACR(maximal cyclic refinement)-Modules. We have obtained equivalent statements for minimal cyclic submodule and maximal cyclic submodule. Also we have obtained necessary and sufficient conditions for a module M with MICR to be cyclic or strongly cyclic.

Strong-max cyclic submodules

  • Chin-Hong Park
    • Journal of the Korean Mathematical Society
    • /
    • v.35 no.1
    • /
    • pp.1-9
    • /
    • 1998
  • In this paper we define CR(completely reachable), MICR(minimal cyclic refinement) and MACR(maximal cyclic refinement)-Modules. We have obtained equivalent statements for minimal cyclic submodule and maximal cyclic submodule. Also, we have obtained necessary and sufficient conditions for a module M with MICR to be cyclic or strongly cyclic.

  • PDF

A new adaptive mesh refinement strategy based on a probabilistic error estimation

  • Ziaei, H.;Moslemi, H.
    • Structural Engineering and Mechanics
    • /
    • v.74 no.4
    • /
    • pp.547-557
    • /
    • 2020
  • In this paper, an automatic adaptive mesh refinement procedure is presented for two-dimensional problems on the basis of a new probabilistic error estimator. First-order perturbation theory is employed to determine the lower and upper bounds of the structural displacements and stresses considering uncertainties in geometric sizes, material properties and loading conditions. A new probabilistic error estimator is proposed to reduce the mesh dependency of the responses dispersion. The suggested error estimator neglects the refinement at the critical points with stress concentration. Therefore, the proposed strategy is combined with the classic adaptive mesh refinement to achieve an optimal mesh refined properly in regions with either high gradients or high dispersion of the responses. Several numerical examples are illustrated to demonstrate the efficiency, accuracy and robustness of the proposed computational algorithm and the results are compared with the classic adaptive mesh refinement strategy described in the literature.

Refinement of Protein NMR Structure under Membrane-like Environments with an Implicit Solvent Model

  • Jee, Jun-Goo;Ahn, Hee-Chul
    • Bulletin of the Korean Chemical Society
    • /
    • v.30 no.5
    • /
    • pp.1139-1142
    • /
    • 2009
  • Refinement of NMR structures by molecular dynamics (MD) simulations with a solvent model has improved the structural quality. In this study, we applied MD refinement with the generalized Born (GB) implicit solvent model to protein structure determined under membrane-like environments. Despite popularity of the GB model, its applications to the refinement of NMR structures of hydrophobic proteins, in which detergents or organic solvents enclose proteins, are limited, and there is little information on the use of another GB parameter for these cases. We carried out MD refinement of crambin NMR structure in dodecylphosphocholine (DPC) micelles (Ahn et al., J. Am. Chem. Soc. 2006, 128, 4398-4404) with GB/Surface area model and two different surface tension coefficients, one for aquatic and the other for hydrophobic conditions. Our data show that, of two structures by MD refinement with GB model, the one refined with the parameter to consider hydrophobic condition had the better qualities in terms of precision and solvent accessibility.

Polygonal finite element modeling of crack propagation via automatic adaptive mesh refinement

  • Shahrezaei, M.;Moslemi, H.
    • Structural Engineering and Mechanics
    • /
    • v.75 no.6
    • /
    • pp.685-699
    • /
    • 2020
  • Polygonal finite element provides a great flexibility in mesh generation of crack propagation problems where the topology of the domain changes significantly. However, the control of the discretization error in such problems is a main concern. In this paper, a polygonal-FEM is presented in modeling of crack propagation problems via an automatic adaptive mesh refinement procedure. The adaptive mesh refinement is accomplished based on the Zienkiewicz-Zhu error estimator in conjunction with a weighted SPR technique. Adaptive mesh refinement is employed in some steps for reduction of the discretization error and not for tracking the crack. In the steps that no adaptive mesh refinement is required, local modifications are applied on the mesh to prevent poor polygonal element shapes. Finally, several numerical examples are analyzed to demonstrate the efficiency, accuracy and robustness of the proposed computational algorithm in crack propagation problems.

Strategy for refinement of nodal densities and integration cells in EFG technique

  • Patel, Bhavana S.S.;Narayan, Babu K.S.;Venkataramana, Katta
    • Structural Engineering and Mechanics
    • /
    • v.59 no.5
    • /
    • pp.901-920
    • /
    • 2016
  • MeshFree methods have become popular owing to the ease with which high stress gradients can be identified and node density distribution can be reformulated to accomplish faster convergence. This paper presents a strategy for nodal density refinement with strain energy as basis in Element-Free Galerkin MeshFree technique. Two popular flat plate problems are considered for the demonstration of the proposed strategies. Issue of integration errors introduced during nodal density refinement have been addressed by suggesting integration cell refinement. High stress effects around two symmetrical semi-circular notches under in-plane axial load have been addressed in the first problem. The second considers crack propagation under mode I and mode II fracture loading by the way of introducing high stress intensity through line crack. The computational efficacy of the adaptive refinement strategies proposed has been highlighted.

Near-tip grid refinement for the effective and reliable natural element crack analysis

  • Cho, J.R.
    • 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.