• 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,.

• 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.

• Fire Science and Engineering
• /
• v.6 no.1
• /
• pp.17-22
• /
• 1992

We have derived the general transfer equation for governing the continuity, energy transfer, mass and momentum transfer, and turbulent energy dissipation rate within the fire compartment which has the 800t fire source at the center of the floor. The governing transfer equations have been descretized using the finite volume approach and numerically experimented under the SIMPLE algorithm. In order for the SIMPLE algorithm approach to be physically reliable, the test results are compared with those of Morita's SOR Method using Conjugate Residual Method and found to be close to physical values though the computational convergence time still remains to be upgraded. The treatment of source terms in the system of finite difference equations has been critical in order to converge the governing equations within the appropriate time steps. The criteria of convergence allowance for the whole domain have been checked and the sudden change of the non-linear effects from the source term have been avoided. The criteria has been allowed to be for 5$\times$10$^{-5}$ .

• Journal of the Korean Statistical Society
• /
• v.21 no.2
• /
• pp.201-207
• /
• 1992

The algorithm for obtaining the isotonic regression in simple tree order, the most basic and simplest model next to the simple order, is considered. We propose to call it "Pool-the-Maximum-Violators" algorithm (PMVA) in conjunction with the "Pool-Adjacent-Violators" algorithm (PAVA) in the simple order. The dual problem of obtaining the isotonic regression in simple tree order is our main concern. An intuitively appealing relation between the primal and the dual problems is demonstrated. The interesting difference is that in simple order the required number of pooling is at least the number of initial violating pairs and any path leads to the solution, whereas in the simple tree order it is at most the number of initial violators and there is only one advisable path although there may be some others leading to the same solution.o the same solution.

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

• 한국전산유체공학회:학술대회논문집
• /
• 2010.05a
• /
• pp.397-403
• /
• 2010

The Immersed boundary method(IBM) is one of CFD techniques which can simulate flow field around complex objectives using simple Cartesian grid system. In the previous studies the IBM has mostly been implemented to fractional step method based Navier-Stokes solvers. In these cases, pressure buildup near IB was found to occur when linear interpolation and stadard mass conservation is used and the interpolation scheme became complicated when higher order of interpolation is adopted. In this study, we implement the IBM to an incompressible Navier-Stokes solver which uses SIMPLE algorithm. Bi-linear and quadratic interpolation equations were formulated by using only geometric information of boundary to reconstruct velocities near IB. Flow around 2D circular cylinder at Re=40 and 100 was solved by using these formulations. It was found that the pressure buildup was not observed even when the bi-linear interpolation was adopted. The use of quadratic interpolation made the predicted aerodynamic forces in good agreement with those of previous studies.

• 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.

• 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.

• 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.

• 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.