• East Asian mathematical journal
• /
• v.40 no.1
• /
• pp.109-118
• /
• 2024

This paper proposes a numerical method based on domain decomposition to find approximate solutions for one-dimensional convection-diffusion equations with Neumann boundary conditions. First, the equations are transformed into convection-diffusion equations with Dirichlet conditions. Second, the author introduces the Prediction/Correction Domain Decomposition (PCDD) method and estimates errors for the interface prediction scheme, interior scheme, and correction scheme using known error estimations. Finally, the author compares the PCDD algorithm with the fully explicit scheme (FES) and the fully implicit scheme (FIS) using three examples. In comparison to FES and FIS, the proposed PCDD algorithm demonstrates good results.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.18 no.4
• /
• pp.305-316
• /
• 2014

The Hodge-Helmholtz decomposition splits a vector field into the unique sum of a divergence-free vector field (solenoidal part) and a gradient field (irrotational part). In a bounded domain, a boundary condition needs to be supplied to the decomposition. The decomposition with the non-penetration boundary condition is equivalent to solving the Poisson equation with the Neumann boundary condition. The Gibou-Min method is an application of the Poisson solver by Purvis and Burkhalter to the decomposition. Using the $L^2$-orthogonality between the error vector and the consistency, the convergence for approximating the divergence-free vector field was recently proved to be $O(h^{1.5})$ with step size h. In this work, we analyze the convergence of the irrotattional in the decomposition. To the end, we introduce a discrete version of the Poincare inequality, which leads to a proof of the O(h) convergence for the scalar variable of the gradient field in a domain with general intersection property.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2007.04a
• /
• pp.471-474
• /
• 2007

A domain/boundary decomposition technique is applied to carry out efficient finite element analyses of 3-D contact problems. Appropriate penalty functions are selected for connecting an interface and contact interfaces with neighboring subdomains that satisfy continuity constraints. As a consequence, all the effective stiffness matrices have positive definiteness, and computational efficiency can be improved to a considerable degree. If necessary, any complex-shaped 3-D domain can be divided into several simple-shaped subdomains without considering the conformity of meshes along the interface. With a set of numerical examples, the basic characteristics of computational efficiency are investigated carefully.

• Journal of applied mathematics & informatics
• /
• v.8 no.1
• /
• pp.27-44
• /
• 2001

A fast Poisson solver on irregular domains, based on bound-ary methods, is presented. The harmonic polynomial approximation of the solution of the associated homogeneous problem provides a good practical boundary method which allows a trivial parallel processing for solution evaluation or straightfoward computations of the interface values for domain decomposition/embedding. AMS Mathematics Subject Classification : 65N35, 65N55, 65Y05.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.2
• /
• pp.153-161
• /
• 2009

A domain/boundary decomposition method is applied for efficient analyses of thermo-elasto-viscoplastic damage and contact problems under the assumption of infinitesimal deformation. For the decomposition of a whole domain and contact boundaries, all the equality constraints on the interface and contact interfaces are restated with simple penalty functional. Therefore, the non-linearity of the problem is localized within finite element matrices in a few subdomains and on contact interfaces. By setting up suitable solution algorithms, the computational efficiency can be improved considerably. The general tendency of the computational efficiency is illustrated with some numerical experiments.

• Nuclear Engineering and Technology
• /
• v.52 no.11
• /
• pp.2667-2677
• /
• 2020

A domain decomposition (DD) scheme for GPU-based Monte Carlo (MC) calculation which is essential for whole-core depletion is introduced within the framework of the modified history-based tracking algorithm. Since GPU-offloaded MC calculations suffer from limited memory capacity, employing DDMC is inevitable for the simulation of depleted cores which require large storage to save hundreds of newly generated isotopes. First, an automated domain decomposition algorithm named wheel clustering is devised such that each subdomain contains nearly the same number of fuel assemblies. Second, an innerouter iteration algorithm allowing overlapped computation and communication is introduced which enables boundary neutron transactions during the tracking of interior neutrons. Third, a bank update scheme which is to include the boundary sources in a way to be adequate to the peculiar data structures of the GPU-based neutron tracking algorithm is presented. The verification and demonstration of the DDMC method are done for 3D full-core problems: APR1400 fresh core and a mock-up depleted core. It is confirmed that the DDMC method performs comparably with the standard MC method, and that the domain decomposition scheme is essential to carry out full 3D MC depletion calculations with limited GPU memory capacities.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.39 no.1
• /
• pp.1-8
• /
• 2011

A coupled thermal/structural analysis of mechanical ablation is performed based on domain/boundary decomposition and finite element method. The ablative material non-linearity and boundary non-linearity can be easily localized within a few subdomains and/or on the boundary interfaces. An enthalpy method is applied to simplify the effect of heat of pyrolysis in the ablative subdomains. In addition, maximum in-plane shear stress is considered as a surface recession criterion for the mechanical ablation simulation. The basic characteristics of the proposed method are examined carefully through numerical experiments.

• 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 the Korean Society for Aeronautical & Space Sciences
• /
• v.35 no.5
• /
• pp.404-411
• /
• 2007

new domain/boundary decomposition method is suggested to perform efficient finite element analyses of contact problems. A penalty method is used for connecting an interface or contact interfaces with neighboring subdomains that satisfy continuity conditions. As a result, the derived effective stiffness matrices are always positive definite, and computational efficiency can be improved to a considerable degree. Moreover, any complex-shaped domain can be divided into independently modeled subdomains without considering the conformity of meshes along the interface. Using a computer code based on the present method, these advantageous features are confirmed through a set of numerical examples.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.20 no.4
• /
• pp.469-476
• /
• 2007

A domain/boundary decomposition technique is applied to carry out efficient finite element analyses of 3-D contact problems. Appropriate penalty functions are selected for connecting an interface and contact interfaces with neighboring subdomains that satisfy continuity constraints. As a consequence, all the effective stiffness matrices have positive definiteness, and computational efficiency can be improved to a considerable degree. If necessary, any complex-shaped 3-D domain can be divided into several simple-shaped subdomains without considering the conformity of meshes along the interface. With a set of numerical examples, the basic characteristics of computational efficiency are investigated carefully.