• Transactions of Materials Processing
• /
• v.8 no.3
• /
• pp.284-293
• /
• 1999

The rigid-plastic finite element analysis requires a large amount of computation time due to its non-linearity. For economic computation, mismatching refinement, and efficient domain decomposition method with different mesh density for each sub domain, is developed. A modified velocity alternating scheme for the interface treatment is proposed in order to obtain good convergence and accuracy. As a numerical example, the axisymmetric extrusion process is analyzed. The results are discussed for the various velocity update schemes form the viewpoint of convergence and accuracy. The three-dimen-sional extrusion process with rectangular section is analyzed in order to verify the effectiveness of the proposed method. Comparing the results with those of the conventional method of full region analysis, the accuracy and the computational efficiency of the proposed method are then discussed.

• Structural Engineering and Mechanics
• /
• v.32 no.1
• /
• pp.37-53
• /
• 2009

In this paper the problem of calculating the probability that the responses of a wind-excited structure exceed specified thresholds within a given time interval is considered. The failure domain of the problem can be expressed as a union of elementary failure domains whose boundaries are of quadratic form. The Domain Decomposition Method (DDM) is employed, after being appropriately extended, to solve this problem. The probability estimate of the overall failure domain is given by the sum of the probabilities of the elementary failure domains multiplied by a reduction factor accounting for the overlapping degree of the different elementary failure domains. The DDM is extended with the help of Line Sampling (LS), from its original presentation where the boundary of the elementary failure domains are of linear form, to the current case involving quadratic elementary failure domains. An example involving an along-wind excited steel building shows the accuracy and efficiency of the proposed methodology as compared with that obtained using standard Monte Carlo simulations (MCS).

• 한국전산유체공학회:학술대회논문집
• /
• 1998.11a
• /
• pp.147-152
• /
• 1998

2-D flow fields are studied by using a shared memory parallel computer with a parallel flow analysis program which uses domain decomposition method and MPI library for data exchange at overlapped interface. Especially, effects of directional domain decomposition on parallel efficiency are studied for 2-D Lid-Driven cavity flow and flow through square cavity. It is known from the present study that domain decomposition along the main flow direction gives better parallel efficiency in 1-D partitioning than along the other direction. 2-D partitioning, however, is less sensitive to flow directions and gives good parallel efficiency for most of the cases considered.

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

• International Journal of CAD/CAM
• /
• v.11 no.1
• /
• pp.11-17
• /
• 2011

A new method has been developed in this paper for automatic quadrilateral mesh generation for a two-dimensional domain. The method is named 'centering method' because it centers a point at the domain and then divides it into sub-domains using cutting lines from the center point. Each of the cutting lines is selected based on the criterion using the angles between the boundary of the domain and the cutting line. The decomposition of the domain into sub-domains is repeated until every subdomain has four or six nodes. Pre-defined splitters are used to divide six-node domains into quadrilateral elements depending on their configuration and presence on the boundary of the initial domain. Arbitrary domains are meshed as examples to verify the robustness of the new method.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.26 no.4
• /
• pp.323-332
• /
• 2022

This paper presents a numerical study on multigrid algorithms of V-cycle type for problems posed in the Hilbert space H(curl) in three dimensions. The multigrid methods are designed for discrete problems originated from the discretization using the hexahedral Nédélec edge element of the lowest-order. Our suggested methods are associated with smoothers constructed by substructuring based on domain decomposition methods of nonoverlapping type. Numerical experiments to demonstrate the robustness and the effectiveness of the suggested algorithms are also provided.

• Journal of the Korean GEO-environmental Society
• /
• v.25 no.4
• /
• pp.21-28
• /
• 2024

In this study, a polyhedral domain decomposition method for Smoothed Particle Hydrodynamics (SPH) analysis is introduced. SPH which is one of meshless methods is a numerical analysis method for fluid flow simulation. It can be useful for analyzing fluidic soil or fluid-structure interaction problems. SPH is a particle-based method, where increased particle count generally improves accuracy but diminishes numerical efficiency. To enhance numerical efficiency, parallel processing algorithms are commonly employed with the Cartesian coordinate-based domain decomposition method. However, for parallel analysis of complex geometric shapes or fluidic problems under dynamic boundary conditions, the Cartesian coordinate-based domain decomposition method may not be suitable. The introduced polyhedral domain decomposition technique offers advantages in enhancing parallel efficiency in such problems. It allows partitioning into various forms of 3D polyhedral elements to better fit the problem. Physical properties of SPH particles are calculated using information from neighboring particles within the smoothing length. Methods for sharing particle information physically separable at partitioning and sharing information at cross-points where parallel efficiency might diminish are presented. Through numerical analysis examples, the proposed method's parallel efficiency approached 95% for up to 12 cores. However, as the number of cores is increased, parallel efficiency is decreased due to increased information sharing among cores.

• 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 Institute of Telematics and Electronics S
• /
• v.34S no.1
• /
• pp.115-123
• /
• 1997

In this paper we present a polynomial matrix decomposition algorithm that determines a polynomial matix M(z) which satisfies the relation V(z)=M(z) for a given polynomial matrix V(z) which is paraconjugate hermitian matrix with normal rank r and is positive semidenfinite on the unit circle of z-plane. All the decomposition procedures in this proposed method are performed in the digitral domain. We also discuss how to apply the polynomial matirx decomposition in realizing MIMO LBR two-pairs.

• Nuclear Engineering and Technology
• /
• v.48 no.3
• /
• pp.635-641
• /
• 2016

Because of prohibitive data storage requirements in large-scale simulations, the memory problem is an obstacle for Monte Carlo (MC) codes in accomplishing pin-wise three-dimensional (3D) full-core calculations, particularly for whole-core depletion analyses. Various kinds of data are evaluated and quantificational total memory requirements are analyzed based on the Reactor Monte Carlo (RMC) code, showing that tally data, material data, and isotope densities in depletion are three major parts of memory storage. The domain decomposition method is investigated as a means of saving memory, by dividing spatial geometry into domains that are simulated separately by parallel processors. For the validity of particle tracking during transport simulations, particles need to be communicated between domains. In consideration of efficiency, an asynchronous particle communication algorithm is designed and implemented. Furthermore, we couple the domain decomposition method with MC burnup process, under a strategy of utilizing consistent domain partition in both transport and depletion modules. A numerical test of 3D full-core burnup calculations is carried out, indicating that the RMC code, with the domain decomposition method, is capable of pin-wise full-core burnup calculations with millions of depletion regions.