• Title/Summary/Keyword: a simple algorithm

Search Result 3,590, Processing Time 0.034 seconds

A Comparative Study of PISO, SIMPLE, SIMPLE-C Algorithms in 3-dimensional Generalized Coordinate Systems (3차원 일반 좌표계에서의 PISO, SIMPLE, SIMPLE-C 알고리즘의 비교)

  • Park J. Y.;Baek J. H.
    • Journal of computational fluids engineering
    • /
    • v.1 no.1
    • /
    • pp.26-34
    • /
    • 1996
  • The performance of the SIMPLE, SIMPLE-C and PISO algorithms for the treatment of the pressure-velocity coupling in fluid flow problems were examined by comparing the computational effort required to obtain the same level of the convergence. Example problems are circular duct and 90-degree bent square-duct. For circular duct case, laminar and turbulent flow were computed. For 90-degree bent square-duct case, laminar flow was simulated by the time-marching method as well as the iterative method. The convergence speed of the other two algorithms are not always superior to SIMPLE algorithm. SIMPLE algorithm is faster than SIMPLE-C algorithm in the simple laminar flow calculations. The application of the PISO algorithm in three dimensional general coordinates is not so effective as in two-dimensional ones. Since computational time of PISO algorithm is increased at each time step(or iterative step) in three dimension, the total convergence speed is not decreased. But PISO algorithm is stable for large time step by using time marching method,.

  • PDF

Modified SIMPLE Algorithm for the Numerical Analysis of Incompressible Flows with Free Surface (개량된 SIMPLE알고리듬을 이용한 비압축성 자유계면유동의 수치해석)

  • Hong Chun Pyo;Lee Jin ho;Mok Jin ho
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.29 no.5 s.236
    • /
    • pp.609-616
    • /
    • 2005
  • While the SIMPLE algorithm is most widely used for the simulations of flow phenomena that take place in the industrial equipments or the manufacturing processes, it is less adopted for the simulations of the free surface flow. Though the SIMPLE algorithm is free from the limitation of time step, the free surface behavior imposes the restriction on the time step. As a result, the explicit schemes are faster than the implicit scheme in terms of computation time when the same time step is applied to, since the implicit scheme includes the numerical method to solve the simultaneous equations in its procedure. If the computation time of SIMPLE algorithm can be reduced when it is applied to the unsteady free surface flow problems, the calculation can be carried out in the more stable way and, in the design process, the process variables can be controlled based on the more accurate data base. In this study, a modified SIMPLE algorithm is presented fur the free surface flow. The broken water column problem is adopted for the validation of the modified algorithm (MoSIMPLE) and for comparison to the conventional SIMPLE algorithm.

A Study on Optimal Design of Rocker Arm Shaft Using Improved Genetic Algorithm (개선된 유전자 알고리즘을 이용한 로커암 축의 최적설계에 관한 연구)

  • Lee Soo Jin;An Yong Su;Lee Dong Woo;Cho Seok Swoo;Joo Won Sik
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.29 no.6 s.237
    • /
    • pp.835-841
    • /
    • 2005
  • This study proposes a new optimization algorithm which is combined with genetic algorithm and ANOM. This improved genetic algorithm is not only faster than the simple genetic algorithm, but also gives a more accurate solution. The optimizing ability and convergence rate of a new optimization algorithm is identified by using a evaluation function which have several local optimum and an optimum design of rocker arm shaft. The calculation results are compared with the simple genetic algorithm.

Numerical Calculations of Compressible Flows using a SIMPLE Algorithm (Simple 알고리즘을 이용한 압축성유동해석)

  • Ahn Hee-Sub;Sohn Chnng-Hyun;Moon Su-Yeon
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2000.05a
    • /
    • pp.184-190
    • /
    • 2000
  • A well-known pressure correction method, a SIMPLE algorithm is extended to treat compressible flows. Collocated grids are used and density is linked to pressure via an equation of state. The influence of pressure on density in the case of compressible flows is implicitly incorporated into the extended SIMPLE algorithm. The first-order Upwind and high-order Quick scheme are compared with respect to an accuracy and convergence time at all speeds. The extended method is verified on a number of test cases and the results we compared with other numerical results available in the literature. The calculated results show that the Quick scheme improves accuracy at all speed and also reduces the calculation time at supersonic flows, compared with the Upwind scheme.

  • PDF

Numerical Calculations of Compressible Flows using a SIMPLE Algorithm (SIMPLE 알고리즘을 이용한 압축성유동해석)

  • Ahn Hee-Sub;Sohn Chang-Hyun;Moon Su-Yeon
    • Journal of computational fluids engineering
    • /
    • v.5 no.2
    • /
    • pp.1-8
    • /
    • 2000
  • A well-known pressure correction method, a SIMPLE algorithm, is extended to treat compressible flows. Collocated grids are used and density is linked to pressure via an equation of state. The influence of pressure on density in the case of compressible flows is implicitly incorporated into the extended SIMPLE algorithm. The first-order Upwind and high-order Quick scheme are compared with respect to an accuracy and convergence time at all speeds. The extended method is verified on a number of test cases and the results are compared with other numerical results available in the literature. The calculated results show that the Quick scheme improves accuracy at all speed and also reduces the calculation time at supersonic flows, compared with the Upwind scheme.

  • PDF

A Study on Optimal Design of Rocker Arm Shaft using Genetic Algorithm (유전자 알고리즘을 이용한 로커암 축의 최적설계에 관한 연구)

  • 안용수;이수진;이동우;홍순혁;조석수;주원식
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2004.10a
    • /
    • pp.198-202
    • /
    • 2004
  • This study proposes a new optimization algorithm which is combined with genetic algorithm and ANOM. This improved genetic algorithm is not only faster than the simple genetic algorithm, but also gives a more accurate solution. The optimizing ability and convergence rate of a new optimization algorithm is identified by using a test function which have several local optimum and an optimum design of rocker arm shaft. The calculation results are compared with the simple genetic algorithm.

  • PDF

A Novel Optimization Algorithm Inspired by Bacteria Behavior Patterns

  • Jung, Sung-Hoon;Kim, Tae-Geon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.3
    • /
    • pp.392-400
    • /
    • 2008
  • This paper proposes a novel optimization algorithm inspired by bacteria behavior patterns for foraging. Most bacteria can trace attractant chemical molecules for foraging. This tracing capability of bacteria called chemotaxis might be optimized for foraging because it has been evolved for few millenniums. From this observation, we developed a new optimization algorithm based on the chemotaxis of bacteria in this paper. We first define behavior and decision rules based on the behavior patterns of bacteria and then devise an optimization algorithm with these behavior and decision rules. Generally bacteria have a quorum sensing mechanism that makes it possible to effectively forage, but we leave its implementation as a further work for simplicity. Thereby, we call our algorithm a simple bacteria cooperative optimization (BCO) algorithm. Our simple BCO is tested with four function optimization problems on various' parameters of the algorithm. It was found from experiments that the simple BCO can be a good framework for optimization.

A Study on the Piece Auto-Nesting Using Genetic Algorithm (유전자 알고리즘을 이용한 부재 자동배치에 관한 연구)

  • 조민철;박제웅
    • Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
    • /
    • 2001.05a
    • /
    • pp.65-69
    • /
    • 2001
  • In this paper, consider the three cases of decide for appling point a general Simple Genetic Algorithm about heuristic method(Bottom and Left Sliding) at the piece auto-nesting on the row plate. The 1st case, about only using the Simple Genetic Algorithm. The 2nd case, applied the heuristic method to the genetic operating of the Simple Genetic Algorithm. The 3rd case, applied the heuristic method to the final result of the Simple Genetic Algorirhm. The estimation of final result were proceed to developed simulation program in this research.

  • PDF

NUMERICAL METHOD FOR TWO-PHASE FLOW ANALYSIS USING SIMPLE-ALGORITHM ON AN UNSTRUCTURED MESH (비정렬격자 SIMPLE 알고리즘기반 이상유동 수치해석 기법)

  • Kim, Jong-Tae;Park, Ik-Kyu;Cho, Hyung-Kyu;Kim, Kyung Doo;Jeong, Jae-Jun
    • Journal of computational fluids engineering
    • /
    • v.13 no.4
    • /
    • pp.86-95
    • /
    • 2008
  • For analyses of multi-phase flows in a water-cooled nuclear power plant, a three-dimensional SIMPLE-algorithm based hydrodynamic solver CUPID-S has been developed. As governing equations, it adopts a two-fluid three-field model for the two-phase flows. The three fields represent a continuous liquid, a dispersed droplets, and a vapour field. The governing equations are discretized by a finite volume method on an unstructured grid to handle the geometrical complexity of the nuclear reactors. The phasic momentum equations are coupled and solved with a sparse block Gauss-Seidel matrix solver to increase a numerical stability. The pressure correction equation derived by summing the phasic volume fraction equations is applied on the unstructured mesh in the context of a cell-centered co-located scheme. This paper presents the numerical method and the preliminary results of the calculations.

NUMERICAL METHOD FOR TWO-PHASE FLOW ANALYSIS USING SIMPLE-ALGORITHM ON AN UNSTRUCTURED MESH (비정렬격자 SIMPLE 알고리즘기반 이상유동 수치해석 기법)

  • Kim, Jong-tae;Park, Ik-Kyu;Cho, Hyung-Kyu;Kim, Kyung-Doo;Jeong, Jae-Jun
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2008.03a
    • /
    • pp.71-78
    • /
    • 2008
  • For analyses of multi-phase flows in a water-cooled nuclear power plant, a three-dimensional SIMPLE-algorithm based hydrodynamic solver CUPID-S has been developed. As governing equations, it adopts a two-fluid three-field model for the two-phase flows. The three fields represent a continuous liquid, a dispersed droplets, and a vapour field. The governing equations are discretized by a finite volume method on an unstructured grid to handle the geometrical complexity of the nuclear reactors. The phasic momentum equations are coupled and solved with a sparse block Gauss-Seidel matrix solver to increase a numerical stability. The pressure correction equation derived by summing the phasic volume fraction equations is applied on the unstructured mesh in the context of a cell-centered co-located scheme. This paper presents the numerical method and the preliminary results of the calculations.

  • PDF