• Title/Summary/Keyword: 3-D Domain Decomposition

Search Result 52, Processing Time 0.021 seconds

Computational Efficiency of 3-D Contact Analysis by Domain/Boundary Decomposition Formulation (영역/경계 분할 정식화에 의한 삼차원 접촉 해석의 효율성 검토)

  • Shin, Eui-Sup;Kim, Yong-Uhn;Ryu, Han-Yeol
    • 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.

  • PDF

Domain decomposition for GPU-Based continuous energy Monte Carlo power reactor calculation

  • Choi, Namjae;Joo, Han Gyu
    • 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.

Parallel Finite Element Analysis System Based on Domain Decomposition Method Bridges (영역분할법에 기반을 둔 병렬 유한요소해석 시스템)

  • Lee, Joon-Seong;Shioya, Ryuji;Lee, Eun-Chul;Lee, Yang-Chang
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.22 no.1
    • /
    • pp.35-44
    • /
    • 2009
  • This paper describes an application of domain decomposition method for parallel finite element analysis which is required to large scale 3D structural analysis. A parallel finite element method system which adopts a domain decomposition method is developed. Node is generated if its distance from existing node points is similar to the node spacing function at the point. The node spacing function is well controlled by the fuzzy knowledge processing. The Delaunay triangulation method is introduced as a basic tool for element generation. Domain decomposition method using automatic mesh generation system holds great benefits for 3D analyses. Aa parallel numerical algorithm for the finite element analyses, domain decomposition method was combined with an iterative solver, i.e. the conjugate gradient(CG) method where a whole analysis domain is fictitiously divided into a number of subdomains without overlapping. Practical performance of the present system are demonstrated through several examples.

Computational Efficiency of 3-D Contact Analysis by Domain/Boundary Decomposition Formulation (영역/경계 분할 정식화에 의한 삼차원 접촉 해석의 효율성 검토)

  • Kim, Yong-Uhn;Ryu, Han-Yeol;Shin, Eui-Sup
    • 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.

MULTIGRID METHODS FOR 3D H(curl) PROBLEMS WITH NONOVERLAPPING DOMAIN DECOMPOSITION SMOOTHERS

  • Duk-Soon Oh
    • Journal of the Korean Mathematical Society
    • /
    • v.61 no.4
    • /
    • pp.659-681
    • /
    • 2024
  • We propose V-cycle multigrid methods for vector field problems arising from the lowest order hexahedral Nédélec finite element. Since the conventional scalar smoothing techniques do not work well for the problems, a new type of smoothing method is necessary. We introduce new smoothers based on substructuring with nonoverlapping domain decomposition methods. We provide the convergence analysis and numerical experiments that support our theory.

Domain Decomposition Strategy for Pin-wise Full-Core Monte Carlo Depletion Calculation with the Reactor Monte Carlo Code

  • Liang, Jingang;Wang, Kan;Qiu, Yishu;Chai, Xiaoming;Qiang, Shenglong
    • 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.

Construction of a CPU Cluster and Implementation of a 3-D Domain Decomposition Parallel FDTD Algorithm (CPU 클러스터 구축 및 3차원 공간분할 병렬 FDTD 알고리즘 구현)

  • Park, Sungmin;Chu, Kwang-Uk;Ju, Saehoon;Park, Yoon-Mi;Kim, Ki-Baek;Jung, Kyung-Young
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.25 no.3
    • /
    • pp.357-364
    • /
    • 2014
  • In this work, we construct a CPU cluster to implement a parallel finite-difference time domain(FDTD) algorithm for fast electromagnetic analyses. This parallel FDTD algorithm can reduce the computational time significantly and also analyze electrically larger structures, compared to a single FDTD counterpart. The parallel FDTD algorithm needs communication between neighboring processors, which is performed by the MPI(Message Passing Interface) library and a 3-D domain decomposition is employed to decrease the communication time between neighboring processors. Compared to a single-processor FDTD, the speed up factor of a-CPU-cluster-based parallel FDTD algorithm is investigated for the normal mode and the hypermode and finally analyze an electrically large concrete structure by the developed parallel algorithm.

Numerical flow computation around aeroelastic 3D square cylinder using inflow turbulence

  • Kataoka, Hiroto;Mizuno, Minoru
    • Wind and Structures
    • /
    • v.5 no.2_3_4
    • /
    • pp.379-392
    • /
    • 2002
  • Numerical flow computations around an aeroelastic 3D square cylinder immersed in the turbulent boundary layer are shown. Present computational code can be characterized by three numerical aspects which are 1) the method of artificial compressibility is adopted for the incompressible flow computations, 2) the domain decomposition technique is used to get better grid point distributions, and 3) to achieve the conservation law both in time and space when the flow is computed a with moving and transformed grid, the time derivatives of metrics are evaluated using the time-and-space volume. To provide time-dependant inflow boundary conditions satisfying prescribed time-averaged velocity profiles, a convenient way for generating inflow turbulence is proposed. The square cylinder is modeled as a 4-lumped-mass system and it vibrates with two-degree of freedom of heaving motion. Those blocks which surround the cylinder are deformed according to the cylinder's motion. Vigorous oscillations occur as the vortex shedding frequency approaches cylinder's natural frequencies.

Automatic Generation System for Quadrilateral Meshes on NURBS Surfaces (NURBS 곡면에서 사각형 요소망의 자동생성 시스템)

  • Kim, Hyung-Il;Park, Jang-Won;Kwon, Ki-Youn;Cho, Yun-Won;Chae, Soo-Won
    • Proceedings of the KSME Conference
    • /
    • 2000.04a
    • /
    • pp.894-899
    • /
    • 2000
  • An automatic mesh generation system with unstructured quadrilateral elements on trimmed NURBS surfaces has been developed.. In this paper, NURBS surface geometries in the IGES format have been used to represent model shape. NURBS surface is represented as parametric surface. So each surface could be mapped to a 2D parametric plane through the parametric domain. And then meshes with quadrilateral elements are constructed in this plane. Finally, the constructed meshes are mapped back to the original 3D surface through the parametric domain. In this paper, projection plane, quasi-expanded plane and parametric Plane are used as 2D mesh generation plane. For mapping 3D surface to parametric domain, Newton-Rhapson Method is employed. For unstructured mesh generation with quadrilateral elements on 2D plane, a domain decomposition algorithm using loop operators has been employed. Sample meshes are represented to demonstrate the effectiveness of the proposed algorithm.

  • PDF

Three-Dimensional Finite Element Analysis for Hollow Section Extrusion of the Underframe of a Railroad Vehicle Using Mismatching Refinement with Domain Decomposition (영역분할에 의한 격자세분화기법을 사용한 철도차량 마루부재 압출공정의 3차원 유한요소해석)

  • Park, K.;Lee, Y.K.;Yang, D.Y.;Lee, D.H.
    • Transactions of Materials Processing
    • /
    • v.9 no.4
    • /
    • pp.362-371
    • /
    • 2000
  • In order to reduce weight of a high-speed railroad vehicle, the main body has been manufactured by hollow section extrusion using aluminum alloys. A porthole die has utilized for the hollow section extrusion process, which causes complicated die geometry and flow characteristics. Design of porthole die is very difficult due to such a complexity. The three-dimensional finite element analysis for hollow section is also an arduous job from the viewpoint of appropriate mesh construction and tremendous computation time. In the present work, mismatching refinement, an efficient domain decomposition method with different mesh density for each subdomain, is implemented for the analysis of the hollow section extrusion process. In addition, a modified grid-based approach with the surface element layer is utilized lot three-dimensional mesh generation of a complicated shape with hexahedral elements. The effects of porthole design are discussed through the simulation for extrusion of an underframe part of a railroad vehicle. An experiment has also been carried out for the comparison. Comparing the velocity distribution at the outlet with the thickness variation of the extruded part, it is concluded that the analysis results can provide reliable measures whether the die design is acceptable to obtain uniform part thickness. The analysis results are then successfully reflected on the industrial porthole die design.

  • PDF