• Title/Summary/Keyword: implicit scheme

Search Result 429, Processing Time 0.034 seconds

Fully-Implicit Decoupling Method for Incompressible Navier-Stokes Equations (비압축성 나비어-스톡스 방정식의 완전 내재적 분리 방법)

  • Kim, Kyoung-Youn;Baek, Seung-Jin;Sung, Hyung-Jin
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.24 no.10
    • /
    • pp.1317-1325
    • /
    • 2000
  • A new efficient numerical method for computing three-dimensional, unsteady, incompressible flows is presented. To eliminate the restriction of CFL condition, a fully-implicit time advancement in which the Crank-Nicolson method is used for both the diffusion and convection terms, is adopted. Based on an approximate block LU decomposition method, the velocity -pressure decoupling is achieved. The additional decoupling of the intermediate velocity components in the convection term is made for the fully -implicit time advancement scheme. Since the iterative procedures for the momentum equations are not required, the velocity components decouplings bring forth the reduction of computational cost. The second-order accuracy in time of the present numerical algorithm is ascertained by computing decaying vortices. The present decoupling method is applied to minimal channel flow unit with DNS (Direct Numerical Simulation).

Parallelization of an Unstructured Implicit Euler Solver (내재적 방법을 이용한 비정렬 유동해석 기법의 병렬화)

  • Kim J. S.;Kang H. J.;Park Y. M.;Kwon O. J.
    • Journal of computational fluids engineering
    • /
    • v.5 no.2
    • /
    • pp.20-27
    • /
    • 2000
  • An unstructured implicit Euler solver is parallelized on a Cray T3E. Spatial discretization is accomplished by a cell-centered finite volume formulation using an upwind flux differencing. Time is advanced by the Gauss-Seidel implicit scheme. Domain decomposition is accomplished by using the k-way n-partitioning method developed by Karypis. In order to analyze the parallel performance of the solver, flows over a 2-D NACA 0012 airfoil and 3-D F-5 wing were investigated.

  • PDF

A Numerical Study on Efficiency and Convergence for Various Implicit Approximate Factorization Algorithms in Compressible Flow Field. (다양한 근사인수분해 알고리즘을 이용하여 압축성 유동장의 수렴성 및 유용성에 대한 연구)

  • Gwon Chang-O;Song Dong-Ju
    • 한국전산유체공학회:학술대회논문집
    • /
    • 1999.11a
    • /
    • pp.17-22
    • /
    • 1999
  • Convergence characteristics and efficiency of three implicit approximate factorization schemes(ADI, DDADI and MAF) are examined using 2-Dimensional compressible upwind Navier-Stokes code. Second-order CSCM(Conservative Supra Characteristic Method) upwind flux difference splitting method with Fromm scheme is used for the right-hand side residual evaluation, while generally first-order upwind differencing is used for the implicit operator on the left-hand side. Convergence studies are performed using an example of the flow past a NACA0012 airfoil at steady transonic flow condition, i. e. Mach number 0.8 at $1.25^{\circ}$ angle of attack. The results were compared with other computational results in order to validate the current numerical analysis. The results from the implicit AF algorithms were compared well in low surface with the other computational results; however, not well in upper surface. It might be due to lack of the grid around the shock position. Because the algorithm minimizes the errors of the approximate decomposition, the improved convergence rate with MAF were observed.

  • PDF

Parallelization of an Unstructured Implicit Euler Solver (내재적 방법을 이용한 비정렬 유동해석 기법의 병렬화)

  • Kim J. S.;Kang H. J.;Park Y. M.;Kwon O. J.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 1999.11a
    • /
    • pp.193-200
    • /
    • 1999
  • An unstructured implicit Euler solver is parallelized on a Cray T3E. Spatial discretization is accomplished by a cell-centered finite volume formulation using an unpwind flux differencing. Time is advanced by the Gauss-Seidel implicit scheme. Domain decomposition is accomplished by using the k-way N-partitioning method developed by Karypis. In order to analyze the parallel performance of the solver, flows over a 2-D NACA 0012 airfoil and a 3-D F-5 wing were investigated.

  • PDF

Explicit and Implicit Dynamic Analysis Using MLS Difference scheme (이동최소제곱 차분법을 이용한 explicit 및 implicit 2차원 동적해석)

  • Kim, Kyeong-Hwan;Lee, Sang-Ho;Yoon, Young-Cheol
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2011.04a
    • /
    • pp.719-722
    • /
    • 2011
  • 본 연구에서는 이동최소제곱 차분법을 2차원 동적고체문제를 해석하기 위하여 확장시켰으며 Newmark ${\beta}$ 방법을 통해 explicit와 implicit 시간적분법을 모두 적용하여 그 차이를 비교하였다. 이동최소제곱 차분법은 Taylor 다항식을 이용하여 미분계산을 근사화 함으로써 내부 및 경계에서도 강형식을 그대로 이용할 수 있다. 그래서 계산이 빠르고 수치적분이 필요하지 않아 무요소법의 장점을 잘 살릴 수 있고 해석차수를 손쉽게 조정할 수 있어 cubic 등의 고차 근사계산이 간편하다. 두 가지 수치예제를 통하여 동적해석에 대한 이동최소제곱 차분법의 적용성과 안정성을 검증하였다.

  • PDF

A study on ECQV applied the butterfly key expansion algorithm (Butterfly key expansion 알고리즘을 적용한 ECQV에 관한 연구)

  • Sun, Seol-hee;Kim, Eun-gi
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.10a
    • /
    • pp.762-764
    • /
    • 2016
  • The ECQV(Elliptic Curve Qu-Vanstone) is a implicit certificate scheme based on ECC(Elliptic Curve Cryptography). Implicit certificates are smaller and faster than a traditional explicit certificate. Therefore, it can be used in a memory or bandwidth constraint communication environments. Also, the butterfly key expansion algorithm is a method to issue many certificates by using only one public key. In this study, by applying the butterfly key expansion algorithm to ECQV, we suggest a new useful issuing certificate method that can be used in vehicular communication environments.

  • PDF

NON-ITERATIVE DOMAIN DECOMPOSITION METHOD FOR THE CONVECTION-DIFFUSION EQUATIONS WITH NEUMANN BOUNDARY CONDITIONS

  • Younbae Jun
    • East Asian mathematical journal
    • /
    • v.40 no.1
    • /
    • pp.109-118
    • /
    • 2024
  • This paper proposes a numerical method based on domain decomposition to find approximate solutions for one-dimensional convection-diffusion equations with Neumann boundary conditions. First, the equations are transformed into convection-diffusion equations with Dirichlet conditions. Second, the author introduces the Prediction/Correction Domain Decomposition (PCDD) method and estimates errors for the interface prediction scheme, interior scheme, and correction scheme using known error estimations. Finally, the author compares the PCDD algorithm with the fully explicit scheme (FES) and the fully implicit scheme (FIS) using three examples. In comparison to FES and FIS, the proposed PCDD algorithm demonstrates good results.

Cloth Modeling using Implicit Constraint Enforcement (묵시적 제한방법을 이용한 옷 모델링 방법)

  • Hong, Min;Lee, Seung-Hyun;Park, Doo-Soon
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.4
    • /
    • pp.516-524
    • /
    • 2008
  • This paper presents a new modeling technique for the simulation of cloth specific characteristics with a set of hard constraints using an implicit constraint enforcement scheme. A conventional explicit Baumgarte constraint stabilization method has several defects. It requires users to pick problem-dependent coefficients to achieve fast convergence and has inherent stabilization limits. The proposed implicit constraint enforcement method is stable with large time steps, does not require problem dependent feed-back parameters, and guarantees the natural physics-based motion of an object. In addition, its computational complexity is the same as the explicit Baumgarte method. This paper describes a formulation of implicit constraint enforcement and provides a constraint error analysis. The modeling technique for complex components of cloth such as seams, buttons, sharp creases, wrinkles, and prevention of excessive elongation are explained. Combined with an adaptive constraint activation scheme, the results using the proposed method show the substantial enhancement of the realism of cloth simulations with a corresponding savings in computational cost.

  • PDF

Development of the LMFBR Accident Analysis Computer Code (고속증식로 사고분석 코드의 개발)

  • Hee Cheon No
    • Nuclear Engineering and Technology
    • /
    • v.16 no.2
    • /
    • pp.47-57
    • /
    • 1984
  • Mathematically-rigorous time-volume averaged conservation equations were simplified to established the differential equations of THERMIT-6S, which is a two-fluid 3-D code. The difference equations of THERMIT-6S were obtained by discretizing the proceeding set of differential equations. The spatial discretization is characterized by a first-order spatial scheme, donor cell method, and staggered mesh layout. For time discretization, a first order semi-implicit scheme treats implictly sonic terms and terms relating to local transport phenomena and explicitly convective terms. The results were linearized by the Newton-Raphson method. In order to construct the reduced pressure equation, the linearized equations were manipulated so that all variables are coupled between mesh cells through only the pressure variable. By simulating numerically the OPERA-15 experiment, it was found that THERMIT-6S is a very powerful code in predicting reactor behavior after sodium boiling including flow coastdown, reversal flow and flow oscillation.

  • PDF