• 대한교통학회지
• /
• 제22권5호
• /
• pp.61-73
• /
• 2004

복잡한 대규모의 도로망에서 방대한 정보를 분석하여 실시간으로 최적 경로를 탐색해야 하는 경로 안내 시스템에서는 탐색 효율이 필수적이다. 리를 위하여 많은 연구들이 탐색 대상이 되는 노드와 링크의 수를 줄이려고 노력해왔다. 이 논문에서는 일부 영역만이 탐색으로 함수의 최적값을 찾는 단계별 세분화 방법(Coarse Grid Method)의 원리를 도로망에 응용한ㄴ다. 처음에는 간선 도로망, 다음에는 주요 도로망, 그 다음에는 세부 도로망 등으로 그 대상을 단계적으로 세분화함으로써 동시에 수많은 노드들간의 경로를 찾는 기존 방법에서의 탐색시간을 단축한다. 이 시스템을 우리나라 전국 규모의 충분히 세분화된 실제 도로망에 적용하여 시스템의 효율성, 실용성과 실시간 운영 가능성을 경로의 탐색 시간, 경로의 적합성 등에서 입증한다.

• 대한수학회지
• /
• 제44권5호
• /
• pp.1103-1119
• /
• 2007

We consider multiscale mortar mixed finite element discretizations for slightly compressible Darcy flows in porous media. This paper is an extension of the formulation introduced by Arbogast et al. for the incompressible problem [2]. In this method, flux continuity is imposed via a mortar finite element space on a coarse grid scale, while the equations in the coarse elements (or subdomains) are discretized on a fine grid scale. Optimal fine scale convergence is obtained by an appropriate choice of mortar grid and polynomial degree of approximation. Parallel numerical simulations on some multiscale benchmark problems are given to show the efficiency and effectiveness of the method.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 1999년도 춘계 학술대회논문집
• /
• pp.106-112
• /
• 1999

In this article, combination of the FAS-FMG multi-grid method and the Krylov subspace method was presented in solving two dimensional driven-cavity flows. Three algorithms of the Krylov subspace method, CG, CGSTAB(Bi-CG Stabilized) and GMRES method were tested with MILU preconditioner. As a smoother of the pressure correction equation, the MILU-CG is recommended rather than MILU-GMRES(k) or MILU-CGSTAB, since the MILU-GMRES(k) preconditioner has too much computation on the coarse grid compared to the MILU-CG one. As for the momentum equation, relatively cheap smoother like SIP solver may be sufficient.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2003년도 춘계학술대회
• /
• pp.1821-1826
• /
• 2003

In this study, we discuss CIP method, which can treat compressible/incompressible problem and multi-phase problem. We can apply this method to the general equations by using CCUP. In this paper, non-staggered grid arrangement and predictor-corrector method are used to enhance later development and the solution accuracy and convergence performance. To validate the numerical algorithm proposed in this paper, the two-dimensional unsteady flow in the driven cavity is simulated. The numerical results of this subject using the present algorithm are compared with other numerical results. As a result, it is prived that the present scheme gives stable and improved solutions, and the results even coarse grid are in good agreement with other result using a fine grid arrangement.

• 대한기계학회논문집B
• /
• 제41권11호
• /
• pp.759-765
• /
• 2017

본 연구에서는 유한요소 최소자승법에 기반한 level-set 방정식의 이류방정식과 재초기화 방정식의 이산화기법을 3차원 슬로싱 문제에 적용한 코드를 개발하고, 그 성능을 평가한다. 사용된 수치기법은 정렬 격자계를 이용하여 다양한 표준 예제들에 대하여 검증이 수행되었다. 제안된 방법은 상대적으로 성긴 격자계에서 다른 기법들에 비하여 개선된 해를 줌을 확인하였다. 두 가지의 격자계에 대하여 수행한 3차원 슬로싱 해석은 상당히 성긴 격자계에서도 압력의 시간 이력이 실험결과와 잘 일치함을 보여주며, 조밀한 격자계에서는 최대압력의 크기가 크게 예측이 됨을 확인하였다. 한편, 본 연구에서 개발한 기법은 유한요소법의 특성에 의해서 비정렬 격자계를 이용하여 복잡한 형상을 가지는 용기 내의 슬로싱 문제의 해석으로 바로 확장할 수 있다.

• 대한수학회지
• /
• 제57권4호
• /
• pp.915-933
• /
• 2020

A two-level finite element method based on the Newton iterative method is proposed for solving the Navier-Stokes/Darcy model. The algorithm solves a nonlinear system on a coarse mesh H and two linearized problems of different loads on a fine mesh h = O(H^4-𝜖). Compared with the common two-grid finite element methods for the considered problem, the presented two-level method allows for larger scaling between the coarse and fine meshes. Moreover, we prove the stability and convergence of the considered two-level method. Finally, we provide numerical experiment to exhibit the effectiveness of the presented method.

• Wind and Structures
• /
• 제24권3호
• /
• pp.223-247
• /
• 2017

By using numerical simulation, vast and detailed information and observation of the physics of flow over a train model can be obtained. However, the accuracy of the numerical results is questionable as it is affected by grid convergence error. This paper describes a systematic method of computational grid refinement for the Unsteady Reynolds Navier-Stokes (URANS) of flow around a generic model of trains using the OpenFOAM software. The sensitivity of the computed flow field on different mesh resolutions is investigated in this paper. This involves solutions on three different grid refinements, namely fine, medium, and coarse grids to investigate the effect of grid dependency. The level of grid independence is evaluated using a form of Richardson extrapolation and Grid Convergence Index (GCI). This is done by comparing the GCI results of various parameters between different levels of mesh resolutions. In this study, monotonic convergence criteria were achieved, indicating that the grid convergence error was progressively reduced. The fine grid resolution's GCI value was less than 1%. The results from a simulation of the finest grid resolution, which includes pressure coefficient, drag coefficient and flow visualization, are presented and compared to previous available data.

• Nuclear Engineering and Technology
• /
• 제49권6호
• /
• pp.1143-1156
• /
• 2017

This paper describes recent development activities of the GENESIS code, which is a transport code for heterogeneous three-dimensional geometry, focusing on applications to reactor core analysis. For the treatment of anisotropic scattering, the concept of the simplified Pn method is introduced in order to reduce storage of flux moments. The accuracy of the present method is verified through a benchmark problem. Next, the iteration stability of the GENESIS code for the highly voided condition, which would appear in a severe accident (e.g., design extension) conditions, is discussed. The efficiencies of the coarse mesh finite difference and generalized coarse mesh rebalance acceleration methods are verified with various stabilization techniques. Use of the effective diffusion coefficient and the artificial grid diffusion coefficients are found to be effective to stabilize the acceleration calculation in highly voided conditions.

• 한국수자원학회:학술대회논문집
• /
• 한국수자원학회 2007년도 학술발표회 논문집
• /
• pp.1392-1396
• /
• 2007

The governing equations in generalized curvilinear coordinates for 3D laminar flow are the Incompressible Navier-Stokes (INS) equations with the artificial dissipative terms. and continuity equation discretized using a second-order accurate, finite volume method on the nonstaggered computational grid. This method adopts a dual or pseudo time-stepping Artificial Compressibility (AC) method integrated in pseudo-time. Multigrid methods are also applied because solving the equations on the coarse grids requires much less computational effort per iteration than on the fine grid. The algorithm yields practically identical velocity profiles and secondary flows that are in excellent overall agreement with an experimental measurement (Humphrey et al., 1977).

• ETRI Journal
• /
• 제42권6호
• /
• pp.815-826
• /
• 2020

We propose a two-dimensional (2D) scattering-center-extraction (SCE) method using sparse recovery based on the compressive-sensing theory, even with data missing from the received radar cross-section (RCS) dataset. First, using the proposed method, we generate a 2D grid via adaptive discretization that has a considerably smaller size than a fully sampled fine grid. Subsequently, the coarse estimation of 2D scattering centers is performed using both the method of iteratively reweighted least square and a general peak-finding algorithm. Finally, the fine estimation of 2D scattering centers is performed using the orthogonal matching pursuit (OMP) procedure from an adaptively sampled Fourier dictionary. The measured RCS data, as well as simulation data using the point-scatterer model, are used to evaluate the 2D SCE accuracy of the proposed method. The results indicate that the proposed method can achieve higher SCE accuracy for an incomplete RCS dataset with missing data than that achieved by the conventional OMP, basis pursuit, smoothed L0, and existing discrete spectral estimation techniques.