A Large-Scale Magnetostatic Analysis Using an Iterative Domain Decomposition Method Based on the Minimal Residual Method

2012 ◽  
Vol 16 (4) ◽  
pp. 496-502 ◽  
Author(s):  
Masao Ogino ◽  
◽  
Shin-ichiro Sugimoto ◽  
Seigo Terada ◽  
Yanqing Bao ◽  
...  
Keyword(s):  
Domain Decomposition ◽  
Decomposition Method ◽  
Degrees Of Freedom ◽  
Large Scale ◽  
Domain Decomposition Method ◽  
Computation Time ◽  
Interface Problem ◽  
Stable Convergence ◽  
Magnetostatic Analysis ◽  
Minimal Residual

This paper describes a large-scale 3D magnetostatic analysis using the Domain Decomposition Method (DDM). To improve the convergence of the interface problem of DDM, a DDM approach based on the Conjugate Residual (CR) method or the MINimal RESidual (MINRES) method is proposed. The CR or MINRES method improved the convergence rate and showed more stable convergence behavior in solving the interface problem than the Conjugate Gradient (CG) method, and reduced computation time for a large-scale problem with about 10 million degrees of freedom.

scholarly journals Large Scale Simulation of Hydrogen Dispersion by a Stabilized Balancing Domain Decomposition Method

2014 ◽  
Vol 2014 ◽  
pp. 1-10
Author(s):  
Qing-He Yao ◽  
Xin Pan
Keyword(s):  
Domain Decomposition ◽  
Decomposition Method ◽  
Large Scale ◽  
Open Space ◽  
Stokes Equations ◽  
Domain Decomposition Method ◽  
Concentration Field ◽  
Numerical Results ◽  
Interface Problem ◽  
Balancing Domain Decomposition

The dispersion behaviour of leaking hydrogen in a partially open space is simulated by a balancing domain decomposition method in this work. An analogy of the Boussinesq approximation is employed to describe the connection between the flow field and the concentration field. The linear systems of Navier-Stokes equations and the convection diffusion equation are symmetrized by a pressure stabilized Lagrange-Galerkin method, and thus a balancing domain decomposition method is enabled to solve the interface problem of the domain decomposition system. Numerical results are validated by comparing with the experimental data and available numerical results. The dilution effect of ventilation is investigated, especially at the doors, where flow pattern is complicated and oscillations appear in the past research reported by other researchers. The transient behaviour of hydrogen and the process of accumulation in the partially open space are discussed, and more details are revealed by large scale computation.

scholarly journals Study of Indoor Ventilation Based on Large-Scale [DNS by a Domain Decomposition Method

Symmetry ◽  
2019 ◽  
Vol 11 (11) ◽  
pp. 1416
Author(s):  
Jiang ◽  
Jiang ◽  
Kwan ◽  
Liu ◽  
Yao
Keyword(s):  
Domain Decomposition ◽  
Decomposition Method ◽  
Large Scale ◽  
Stokes Equations ◽  
Domain Decomposition Method ◽  
Numerical Data ◽  
Transient Behavior ◽  
Preconditioned Conjugate Gradient ◽  
Interface Problem ◽  
Indoor Airflow

This paper presents a large-scale Domain Decomposition Method (DDM) based Direct Numerical Simulation (DNS) for predicting the behavior of indoor airflow, where the aim is to design a comfortable and efficient indoor air environment of modern buildings. An analogy of the single-phase convection problems is applied, and the pressure stabilized domain decomposition method is used to symmetrize the linear systems of Navier-Stokes equations and the convection-diffusion equation. Furthermore, a balancing preconditioned conjugate gradient method is utilized to deal with the interface problem caused by domain decomposition. The entire simulation model is validated by comparing the numerical results with that of recognized experimental and numerical data from previous literature. The transient behavior of indoor airflow and its complexity in the ventilated room are discussed; the velocity and vortex distribution of airflow are investigated, and its possible influence on particle accumulation is classified.

scholarly journals Parallel Multiphysics Simulation of Package Systems Using an Efficient Domain Decomposition Method

Electronics ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 158
Author(s):  
Weijie Wang ◽  
Yannan Liu ◽  
Zhenguo Zhao ◽  
Haijing Zhou
Keyword(s):  
Domain Decomposition ◽  
Antenna Arrays ◽  
Electromagnetic Interference ◽  
Decomposition Method ◽  
High Performance ◽  
Large Scale ◽  
Electromagnetic Compatibility ◽  
Domain Decomposition Method ◽  
Computation Time ◽  
Multiphysics Simulations

With the continuing downscaling in feature sizes, the thermal impact on material properties and geometrical deformations can no longer be ignored in the analysis of the electromagnetic compatibility or electromagnetic interference of package systems, including System-in-Package and antenna arrays. We present a high-performance numerical simulation program that is intended to perform large-scale multiphysics simulations using the finite element method. An efficient domain decomposition method was developed to accelerate the multiphysics loops of electromagnetic–thermal stress simulations by considering the fact that the electromagnetic field perturbations caused by geometrical deformation are small and constrained in one or a few subdomains. The multi-level parallelism of the algorithm was also obtained based on an in-house developed parallel infrastructure. Numerical examples showed that our algorithm is able to enable simulation with multiple processors in parallel and, more importantly, achieve a significant reduction in computation time compared with traditional methods.

scholarly journals Coupling Parareal with Non-Overlapping Domain Decomposition Method

2016 ◽  
Vol Volume 23 - 2016 - Special... ◽  
Author(s):  
Rim GUETAT
Keyword(s):  
Domain Decomposition ◽  
Convergence Analysis ◽  
Numerical Experiments ◽  
Decomposition Method ◽  
Domain Decomposition Method ◽  
Time Dependent ◽  
Interface Problem ◽  
Time Interval ◽  
Overlapping Domain Decomposition ◽  
Time Dependent Problems

In this paper, we present a new parallel algorithm for time dependent problems based on coupling parareal with non-overlapping domain decomposition method in order to increase parallelism in time and in space. For this we focus on the iterative methods of parallization in space to solve the interface problem like Neumann-Neumann method. In the new algorithm, the coarse temporel propagator is defined on the global domain and the Neumann-Neumann method is chosen as a fine propagator with a few iterations. We present the rigorous convergence analysis of the new coupled algorithm on bounded time interval. Numerical experiments illustrate the performance of this new algorithm and confirm our analysis. RÉSUMÉ. Dans ce papier, nous présentons un nouvel algorithme parallèle pour les problèmes dé-pendant du temps basé sur le couplage du pararéel avec les méthodes de décomposition de domaine sans recouvrement afin d'augmenter le parallélisme dans le temps et l'espace. Nous nous concen-trons sur les méthodes itératives de parallélisation en espace pour résoudre le problème d'interface par la méthode de Neumann-Neumann. Dans ce nouvel algorithme, le propagateur grossier est dé-finie sur le domaine global et la méthode de Neumann-Neumann est choisi pour le propagateur fin avec quelques itérations. Nous présentons l'analyse rigoureuse de convergence du nouvel algorithme couplé sur un intervalle de temps borné. Des expèriences numériques illustrent les performances de ce nouvel algorithme et confirment notre analyse. Dans ce papier, nous présentons un nouvel algorithme parallèle pour les problèmes dépendantdu temps basé sur le couplage du pararéel avec les méthodes de décomposition de domainesans recouvrement afin d’augmenter le parallélisme dans le temps et l’espace. Nous nous concentronssur les méthodes itératives de parallélisation en espace pour résoudre le problème d’interfacepar la méthode de Neumann-Neumann. Dans ce nouvel algorithme, le propagateur grossier est définiesur le domaine global et la méthode de Neumann-Neumann est choisi pour le propagateur finavec quelques itérations. Nous présentons l’analyse rigoureuse de convergence du nouvel algorithmecouplé sur un intervalle de temps borné. Des expèriences numériques illustrent les performances dece nouvel algorithme et confirment notre analyse.

Sign in / Sign up

Export Citation Format

Share Document