• Journal of computational fluids engineering
• /
• v.21 no.1
• /
• pp.36-42
• /
• 2016

One of the obstacles on the grid generation for complex geometries with multi-block structured grids is the domain decomposition. In this paper, the domain decomposition for two-dimensional flow is studied using the flow characteristics. The potential flow equation with the source distribution on the panel surface is solved to extract the information of the flow. The current approach is applied to a two-dimensional cylinder and Bi-NACA0012 problems. The generated grids are applied to generic flow solvers and reasonable results are obtained. It can be concluded that the current methods is useful in the domain decomposition for the multi-block structured grid.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2009.04a
• /
• pp.534-535
• /
• 2009

This paper deals with BEM analysis of transient elastodynamic problems using domain decomposition method and particular integrals. The particular method is used to approximate the acceleration term in the governing equation. The domain decomposition method is examined to consider multi-region problems. The domain of the original problem is subdivided into sub-regions, which are modeled by the particular integral BEM. The iterative coupling employing Schwarz algorithm is used for the successive update of the interface boundary conditions until convergence is achieved. The numerical results, compared with those by ABAQUS, demonstrate the validity of the present formulation.

• Journal of computational fluids engineering
• /
• v.20 no.4
• /
• pp.44-50
• /
• 2015

The computational efficiency of flow simulations with Multi-resolution analysis (MRA) was enhanced via the boundary treatment of the computational domain. In MRA, an adaptive dataset to a solution is constructed through data decomposition with interpolating polynomial and thresholding. During the decomposition process, the basis points of interpolation should exceed the boundary of the computational domain. In order to resolve this problem, the weight coefficients of interpolating polynomial were adjusted near the boundaries. By this boundary treatment, the computational efficiency of MRA was enhanced while the numerical accuracy of a solution was unchanged. This modified MRA was applied to two-dimensional steady Euler equations and the enhancement of computational efficiency and the maintenance of numerical accuracy were assessed.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.27 no.6
• /
• pp.753-765
• /
• 2003

A finite element code for the numerical solution of the Navier-Stokes equation is parallelized by vertex-oriented domain decomposition. To accelerate the convergence of iterative solvers like conjugate gradient method, parallel block ILU, iterative block ILU, and distributed ILU methods are tested as parallel preconditioners. The effectiveness of the algorithms has been investigated when P1P1 finite element discretization is used for the parallel solution of the Navier-Stokes equation. Two-dimensional and three-dimensional Laplace equations are calculated to estimate the speedup of the preconditioners. Calculation domain is partitioned by one- and multi-dimensional partitioning methods in structured grid and by METIS library in unstructured grid. For the domain-decomposed parallel computation of the Navier-Stokes equation, we have solved three-dimensional lid-driven cavity and natural convection problems in a cube as benchmark problems using a parallelized fractional 4-step finite element method. The speedup for each parallel preconditioning method is to be compared using upto 64 processors.

• Journal of The Korean Astronomical Society
• /
• v.52 no.2
• /
• pp.49-55
• /
• 2019

The New Vacuum Solar Telescope (NVST) is the largest solar telescope in China. When using CCDs for imaging, equal-thickness fringes caused by thin-film interference can occur. Such fringes reduce the quality of NVST data but cannot be removed using standard flat fielding. In this paper, a correction method based on multi-scale decomposition and adaptive partitioning is proposed. The original image is decomposed into several sub-scales by multi-scale decomposition. The region containing fringes is found and divided by an adaptive partitioning method. The interference fringes are then filtered by a frequency-domain Gaussian filter on every partitioned image. Our analysis shows that this method can effectively remove the interference fringes from a solar image while preserving useful information.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.31 no.7
• /
• pp.9-14
• /
• 2003

In this work, a multi-block/multi-partitioning method is suggested for a multi-block parallelization. It has an advantage of uniform load balance via subdividing of each block on each processor. To make a comparison of parallel efficiency according to domain decomposition method, a multi-block/single-partitioning and a multi-block/ multi-partitioning methods are applied to the flow analysis solver. The multi-block/ multi-partitioning method has more satisfactory parallel efficiency because of optimized load balancing. Finally, it has applied to the CFDS code. As a result, the computing speed with sixteen processors is over twelve times faster than that of sequential solver.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.23 no.5
• /
• pp.475-482
• /
• 2010

In this paper, an efficient two-level parallel domain decomposition algorithm is suggested to solve large-DOF structural problems. Each subdomain is composed of the coarse problem and local problem. In the coarse problem, displacements at coarse nodes are computed by the iterative method that does not need to assemble a stiffness matrix for the whole coarse problem. Then displacements at local nodes are computed by Multi-Frontal Sparse Solver. A parallel version of PCG(Preconditioned Conjugate Gradient Method) is developed to solve the coarse problem iteratively, which minimizes the data communication amount between processors to increase the possible problem DOF size while maintaining the computational efficiency. The test results show that the suggested algorithm provides scalability on computing performance and an efficient approach to solve large-DOF structural problems.

• Nuclear Engineering and Technology
• /
• v.46 no.5
• /
• pp.655-666
• /
• 2014

The CUPID code has been developed at KAERI for a transient, three-dimensional analysis of a two-phase flow in light water nuclear reactor components. It can provide both a component-scale and a CFD-scale simulation by using a porous media or an open media model for a two-phase flow. In this paper, recent advances in the CUPID code are presented in three sections. First, the domain decomposition parallel method implemented in the CUPID code is described with the parallel efficiency test for multiple processors. Then, the coupling of CUPID-MARS via heat structure is introduced, where CUPID has been coupled with a system-scale thermal-hydraulics code, MARS, through the heat structure. The coupled code has been applied to a multi-scale thermal-hydraulic analysis of a pool mixing test. Finally, CUPID-SG is developed for analyzing two-phase flows in PWR steam generators. Physical models and validation results of CUPID-SG are discussed.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.595-598
• /
• 2002

This paper proposes neighborhood reduction techniques in local search of the customer decomposition subproblem in the Multi Depots Vehicle Routing Problem with Time Windows (MDVRPTW) by using geospatial relation among depots and customers. The neighborhood of the customer decomposition subproblem can be simply and well defined but it should include excessively bad solution candidates. Our techniques find such candidates by using information of the problem domain, geographical relation. We use our techniques in Tabu Search and evaluate the effectiveness in computer experiment.

• Geomechanics and Engineering
• /
• v.7 no.2
• /
• pp.149-164
• /
• 2014

One of the most advanced classes of techniques for ground response analysis is based on the use of Transfer Functions. They represent the ratio of Fourier spectrum of amplitude motion at the free surface to the corresponding spectrum of the bedrock motion and they are applied in frequency domain usually by FFT method. However, Fourier spectrum only shows the dominant frequency in each time step and is unable to represent all frequency contents in every time step and this drawback leads to inaccurate results. In this research, this process is optimized by decomposing the input motion into different frequency sub-bands using Wavelet Multi-level Decomposition. Each component is then processed with transfer Function relating to the corresponding component frequency. Taking inverse FFT from all components, the ground motion can be recovered by summing up the results. The nonlinear behavior is approximated using an iterative procedure with nonlinear soil properties. The results of this procedure show better accuracy with respect to field observations than does the Conventional method. The proposed method can also be applied to other engineering disciplines with similar procedure.