• 한국전산유체공학회지
• /
• 제1권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,.

• 대한기계학회논문집B
• /
• 제29권5호
• /
• 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
• /
• 제29권6호
• /
• 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.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2000년도 춘계 학술대회논문집
• /
• 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.

• 한국전산유체공학회지
• /
• 제5권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.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2004년도 추계학술대회 논문집
• /
• 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.

• 한국지능시스템학회논문지
• /
• 제18권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.

• 한국해양공학회:학술대회논문집
• /
• 한국해양공학회 2001년도 춘계학술대회 논문집
• /
• 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.

• 한국전산유체공학회지
• /
• 제13권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.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2008년도 학술대회
• /
• 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.