• Title/Summary/Keyword: Coarse Grid Method

Search Result 37, Processing Time 0.03 seconds

A Coarse Grid Method for the Real-Time Route Search in a Large Network (복잡한 대규모의 도로망에서 실시간 경로 탐색을 위한 단계별 세분화 방법)

  • Kim, Seong-In;Kim, Hyun-Gi
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.5
    • /
    • pp.61-73
    • /
    • 2004
  • The efficiency of the real-time route guidance system(RGS) depends largely on the quality of route search algorithms. In this paper, we implement the coarse grid method(CGM) in mathematical programming for finding a good quality route of real-time RGS in large-scale networks. The proposed CGM examines coarser and wider networks as the search phase proceeds, in stead of searching the whole network at once. Naturally, we can significantly reduce computational efforts in terms of search time and memory requirement. We demonstrate the practical effectiveness of the proposed CGM with nationwide real road network simulation.

A MULTISCALE MORTAR MIXED FINITE ELEMENT METHOD FOR SLIGHTLY COMPRESSIBLE FLOWS IN POROUS MEDIA

  • Kim, Mi-Young;Park, Eun-Jae;Thomas, Sunil G.;Wheeler, Mary F.
    • Journal of the Korean Mathematical Society
    • /
    • v.44 no.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.

Combination of Preconditioned Krylov Subspace Methods and Multi-grid Method for Convergence Acceleration of the incompressible Navier-Stokes Equations (비압축성 Navier-Stokes 방정식의 수렴 가속을 위한 예조건화 Krylov 부공간법과 다중 격자법의 결합)

  • Maeng Joo Sung;Choi IL Kon;Lim Youn Woo
    • 한국전산유체공학회:학술대회논문집
    • /
    • 1999.05a
    • /
    • 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.

  • PDF

Analysis of the Flow in Square Cavity Using CIP Method in Non-staggered Grid Arrangement (비엇갈림 격자계에서 CIP법을 이용한 캐비티내의 유동해석)

  • Lee, Jung-Hee;Kang, Joon;Im, Do-Kiun;Kim, Charn-Jung
    • Proceedings of the KSME Conference
    • /
    • 2003.04a
    • /
    • 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.

  • PDF

Numerical Analysis of Three-dimensional Sloshing Flow Using Least-square and Level-set Method (최소자승법과 Level-set 방법을 적용한 3차원 슬로싱 유동의 수치해석)

  • Jeon, Byoung Jin;Choi, Hyoung Gwon
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.41 no.11
    • /
    • pp.759-765
    • /
    • 2017
  • In this study, a three-dimensional least-square, level-set-based two-phase flow code was developed for the simulation of three-dimensional sloshing problems using finite element discretization. The code was validated by solving some benchmark problems. The proposed method was found to provide improved results against other existing methods, by using a coarser mesh. The results of the numerical experiments conducted during the course of this study showed that the proposed method was both robust and accurate for the simulation of three-dimensional sloshing problems. Using a substantially coarse grid, historical results of the dynamic pressure at a selected position corresponded with existing experimental data. The pressure history with a finer grid was similar to that of a coarse grid; however, a fine grid provided higher peak pressures. The present method could be extended to the analysis of a sloshing problem in a complex geometrical configuration using unstructured meshes owing to the features of FEM.

A TWO-LEVEL FINITE ELEMENT METHOD FOR THE STEADY-STATE NAVIER-STOKES/DARCY MODEL

  • Fang, Jilin;Huang, Pengzhan;Qin, Yi
    • Journal of the Korean Mathematical Society
    • /
    • v.57 no.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(H4-𝜖). 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.

Mesh size refining for a simulation of flow around a generic train model

  • Ishak, Izuan Amin;Alia, Mohamed Sukri Mat;Salim, Sheikh Ahmad Zaki Shaikh
    • Wind and Structures
    • /
    • v.24 no.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.

Recent developments in the GENESIS code based on the Legendre polynomial expansion of angular flux method

  • Yamamoto, Akio;Giho, Akinori;Endo, Tomohiro
    • Nuclear Engineering and Technology
    • /
    • v.49 no.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.

Numerical Simulation of Three Dimensional Incompressible Flows Using the Navier-Stokes Equations with the Artificial Dissipation Terms and a Multigrid Method (다중격자와 인공점성항을 이용한 3차원 비압축성 흐름에 관한 수치모형 해석)

  • Park, Ki-Doo;Lee, Kil-Seong
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2007.05a
    • /
    • 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).

  • PDF

Compressive sensing-based two-dimensional scattering-center extraction for incomplete RCS data

  • Bae, Ji-Hoon;Kim, Kyung-Tae
    • ETRI Journal
    • /
    • v.42 no.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.