Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “domain decomposition method”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 109 records · Page 6

A generalized massively parallel ultra-high order FFT-based Maxwell solver

Dispersion-free ultra-high order FFT-based Maxwell solvers have recently proven to be paramount to a large range of applications, including the high-fidelity modeling of high-intensity laser–matter interactions with Particle-In-Cell (PIC) codes. To enable a massively parallel scaling of these solvers, a novel parallelization technique was recently proposed, which consists in splitting the simulation domain into several processor sub-domains, with guard regions appended at each sub-domain boundary. Maxwell's equations are advanced independently on each sub-domain using local shared-memory FFTs (instead of a single distributed global FFT). This implies small truncation errors at sub-domain boundaries, the amplitude of which depends on guard regions sizes and order of the Maxwell solver. For moderate guard region sizes, this ’local’ technique proved to be highly scalable on up to a million cores and notably enabled the 3D modeling of so-called plasma mirrors, for which 8 guard cells only were enough to prevent truncation error growth. Yet, for other applications, the required number of guard cells might be much higher, which would severely limit the parallel efficiency of this technique due to the large volume of guard cells to be exchanged between sub-domains. In this context, we propose a novel parallelization technique that ensures very good scaling of FFT-based solvers with an arbitrarily high number of guard cells. Our ’hybrid’ technique consists in performing distributed FFTs on local groups of processors with guard regions now appended to boundaries of each group of processors. It uses a dual domain decomposition method for the Maxwell solver and other parts of the PIC cycle to keep the simulation load-balanced. This ’hybrid’ technique was implemented in the open source exascale library PICSAR. Benchmarks show that for a large number of guard cells (>16), the ’hybrid’ technique offers up to ×3 speed-up and ×8 memory savings compared to the ’local’ one.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Development of multi-hierarchy simulation model with non-uniform space grids for collisionless driven reconnection

A multi-hierarchy simulation model aimed at magnetic reconnection studies has been developed, in which macroscopic and microscopic physics are solved self-consistently and simultaneously. In this work, the previous multi-hierarchy model by these authors is extended to a more realistic one with non-uniform space grids. Based on the domain decomposition method, the multi-hierarchy model consists of three parts: a magnetohydrodynamics algorithm to express the macroscopic global dynamics, a particle-in-cell algorithm to describe the microscopic kinetic physics, and an interface algorithm to interlock macro and micro hierarchies. For its verification, plasma flow injection is simulated in this multi-hierarchy model and it is confirmed that the interlocking method can describe the correct physics. Furthermore, this model is applied to collisionless driven reconnection in an open system. Magnetic reconnection is found to occur in a micro hierarchy by injecting plasma from a macro hierarchy.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Magnetar giant flares in multipolar magnetic fields. II. Flux rope eruptions with current sheets

We propose a physical mechanism to explain giant flares and radio afterglows in terms of a magnetospheric model containing both a helically twisted flux rope and a current sheet (CS). With the appearance of a CS, we solve a mixed boundary value problem to get the magnetospheric field based on a domain decomposition method. We investigate properties of the equilibrium curve of the flux rope when the CS is present in background multipolar fields. In response to the variations at the magnetar surface, it quasi-statically evolves in stable equilibrium states. The loss of equilibrium occurs at a critical point and, beyond that point, it erupts catastrophically. New features show up when the CS is considered. In particular, we find two kinds of physical behaviors, i.e., catastrophic state transition and catastrophic escape. Magnetic energy would be released during state transitions. This released magnetic energy is sufficient to drive giant flares, and the flux rope would, therefore, go away from the magnetar quasi-statically, which is inconsistent with the radio afterglow. Fortunately, in the latter case, i.e., the catastrophic escape, the flux rope could escape the magnetar and go to infinity in a dynamical way. This is more consistent with radio afterglow observations of giant flares. We find that the minor radius of the flux rope has important implications for its eruption. Flux ropes with larger minor radii are more prone to erupt. We stress that the CS provides an ideal place for magnetic reconnection, which would further enhance the energy release during eruptions.

79 ASTRONOMY AND ASTROPHYSICS↗

Distributed Dynamic State Estimation with Extended Kalman Filter

Increasing complexity associated with large-scale renewable resources and novel smart-grid technologies necessitates real-time monitoring and control. Our previous work applied the extended Kalman filter (EKF) with the use of phasor measurement data (PMU) for dynamic state estimation. However, high computation complexity creates significant challenges for real-time applications. In this paper, the problem of distributed dynamic state estimation is investigated. One domain decomposition method is proposed to utilize decentralized computing resources. The performance of distributed dynamic state estimation is tested on a 16-machine, 68-bus test system.

42 ENGINEERING↗

Decoupling the Stationary Navier-Stokes-Darcy System with the Beavers-Joseph-Saffman Interface Condition

This paper proposes a domain decomposition method for the coupled stationary Navier-Stokes and Darcy equations with the Beavers-Joseph-Saffman interface condition in order to improve the efficiency of the finite element method. The physical interface conditions are directly utilized to construct the boundary conditions on the interface and then decouple the Navier-Stokes and Darcy equations. Newton iteration will be used to deal with the nonlinear systems. Numerical results are presented to illustrate the features of the proposed method.

Cao, Yong↗

Multitasking domain decomposition fast Poisson solvers on the Cray Y-MP

The results of multitasking implementation of a domain decomposition fast Poisson solver on eight processors of the Cray Y-MP are presented. The object of this research is to study the performance of domain decomposition methods on a Cray supercomputer and to analyze the performance of different multitasking techniques using highly parallel algorithms. Two implementations of multitasking are considered: macrotasking (parallelism at the subroutine level) and microtasking (parallelism at the do-loop level). A conventional FFT-based fast Poisson solver is also multitasked. The results of different implementations are compared and analyzed. A speedup of over 7.4 on the Cray Y-MP running in a dedicated environment is achieved for all cases.

Chan, Tony F.↗

Extending substructure based iterative solvers to multiple load and repeated analyses

Direct solvers currently dominate commercial finite element structural software, but do not scale well in the fine granularity regime targeted by emerging parallel processors. Substructure based iterative solvers--often called also domain decomposition algorithms--lend themselves better to parallel processing, but must overcome several obstacles before earning their place in general purpose structural analysis programs. One such obstacle is the solution of systems with many or repeated right hand sides. Such systems arise, for example, in multiple load static analyses and in implicit linear dynamics computations. Direct solvers are well-suited for these problems because after the system matrix has been factored, the multiple or repeated solutions can be obtained through relatively inexpensive forward and backward substitutions. On the other hand, iterative solvers in general are ill-suited for these problems because they often must restart from scratch for every different right hand side. In this paper, we present a methodology for extending the range of applications of domain decomposition methods to problems with multiple or repeated right hand sides. Basically, we formulate the overall problem as a series of minimization problems over K-orthogonal and supplementary subspaces, and tailor the preconditioned conjugate gradient algorithm to solve them efficiently. The resulting solution method is scalable, whereas direct factorization schemes and forward and backward substitution algorithms are not. We illustrate the proposed methodology with the solution of static and dynamic structural problems, and highlight its potential to outperform forward and backward substitutions on parallel computers. As an example, we show that for a linear structural dynamics problem with 11640 degrees of freedom, every time-step beyond time-step 15 is solved in a single iteration and consumes 1.0 second on a 32 processor iPSC-860 system; for the same problem and the same parallel processor, a pair of forward/backward substitutions at each step consumes 15.0 seconds.

Farhat, Charbel↗

Progress in incompressible Navier-Stokes computations for propulsion flows and its dual-use applications

Development of an incompressible Navier-Stokes solution procedure was performed for the analysis of a liquid rocket engine pump components and for the mechanical heart assist devices. The solution procedure for the propulsion systems is applicable to incompressible Navier-Stokes flows in a steadily rotating frame of reference for any general complex configurations. The computer codes were tested on different complex configurations such as liquid rocket engine inducer and impellers. As a spin-off technology from the turbopump component simulations, the flow analysis for an axial heart pump was conducted. The baseline Left Ventricular Assist Device (LVAD) design was improved by adding an inducer geometry by adapting from the liquid rocket engine pump. The time-accurate mode of the incompressible Navier-Stokes code was validated with flapping foil experiment by using different domain decomposition methods. In the flapping foil experiment, two upstream NACA 0025 foils perform high-frequency synchronized motion and generate unsteady flow conditions for a downstream larger stationary foil. Fairly good agreement was obtained between unsteady experimental data and numerical results from two different moving boundary procedures. Incompressible Navier-Stokes code (INS3D) has been extended for heat transfer applications. The temperature equation was written for both forced and natural convection phenomena. Flow in a square duct case was used for the validation of the code in both natural and forced convection.

Kiris, Cetin↗

BDDC for nonsymmetric positive definite and symmetric indefinite problems

The balancing domain decomposition methods by constraints are extended to solving both nonsymmetric, positive definite and symmetric, indefinite linear systems. In both cases, certain nonstandard primal constraints are included in the coarse problems of BDDC algorithms to accelerate the convergence. Under the assumption that the subdomain size is small enough, a convergence rate estimate for the GMRES iteration is established that the rate is independent of the number of subdomains and depends only slightly on the subdomain problem size. Numerical experiments for several two-dimensional examples illustrate the fast convergence of the proposed algorithms.

97 MATHEMATICS AND COMPUTING↗

A Domain Decomposition Parallelization of the Fast Marching Method

In this paper, the first domain decomposition parallelization of the Fast Marching Method for level sets has been presented. Parallel speedup has been demonstrated in both the optimal and non-optimal domain decomposition case. The parallel performance of the proposed method is strongly dependent on load balancing separately the number of nodes on each side of the interface. A load imbalance of nodes on either side of the domain leads to an increase in communication and rollback operations. Furthermore, the amount of inter-domain communication can be reduced by aligning the inter-domain boundaries with the interface normal vectors. In the case of optimal load balancing and aligned inter-domain boundaries, the proposed parallel FMM algorithm is highly efficient, reaching efficiency factors of up to 0.98. Future work will focus on the extension of the proposed parallel algorithm to higher order accuracy. Also, to further enhance parallel performance, the coupling of the domain decomposition parallelization to the G(sub 0)-based parallelization will be investigated.

Herrmann, M.↗

Domain decomposition and multiscale mortar mixed finite element methods for linear elasticity with weak stress symmetry

Two non-overlapping domain decomposition methods are presented for the mixed finite element formulation of linear elasticity with weakly enforced stress symmetry. The methods utilize either displacement or normal stress Lagrange multiplier to impose interface continuity of normal stress or displacement, respectively. By eliminating the interior subdomain variables, the global problem is reduced to an interface problem, which is then solved by an iterative procedure. The condition number of the resulting algebraic interface problem is analyzed for both methods. A multiscale mortar mixed finite element method for the problem of interest on non-matching multiblock grids is also studied. It uses a coarse scale mortar finite element space on the non-matching interfaces to approximate the trace of the displacement and impose weakly the continuity of normal stress. A priori error analysis is performed. It is shown that, with appropriate choice of the mortar space, optimal convergence on the fine scale is obtained for the stress, displacement, and rotation, as well as some superconvergence for the displacement. Computational results are presented in confirmation of the theory of all proposed methods.

Mathematics↗

Robust parallel iterative solvers for linear and least-squares problems (Final Technical Report)

The primary goal of this project is to study and develop robust iterative methods for solving linear systems of equations and least squares systems. The focus of the Minnesota team is on algorithms development, robustness issues, and on tests and validation of the methods on realistic problems. 1. The project begun with an investigation on how to practically update a preconditioner obtained from an ILU-type factorization, when the coefficient matrix changes. 2. We investigated strategies to improve robustness in parallel preconditioners in a specific case of a PDE with discontinuous coefficients. 3. We explored ways to adapt standard preconditioners for solving linear systems arising from the Helmholtz equation. These are often difficult linear systems to solve by iterative methods. 4. We have also worked on purely theoretical issues related to the analysis of Krylov subspace methods for linear systems. 5. We developed an effective strategy for performing ILU factorizations for the case when the matrix is highly indefinite. The strategy uses shifting in some optimal way. The method was extended to the solution of Helmholtz equations by using complex shifts, yielding very good results in many cases. 6. We addressed the difficult problem of preconditioning sparse systems of equations on GPUs. 7. A by-product of the above work is a software package consisting of an iterative solver library for GPUs based on CUDA. This was made publicly available. It was the first such library that offers complete iterative solvers for GPUs. 8. We considered another form of ILU which blends coarsening techniques from Multigrid with algebraic multilevel methods. 9. We have released a new version on our parallel solver - called pARMS [new version is version 3]. As part of this we have tested the code in complex settings - including the solution of Maxwell and Helmholtz equations and for a problem of crystal growth.10. As an application of polynomial preconditioning we considered the problem of evaluating f(A)v which arises in statistical sampling. 11. As an application to the methods we developed, we tackled the problem of computing the diagonal of the inverse of a matrix. This arises in statistical applications as well as in many applications in physics. We explored probing methods as well as domain-decomposition type methods. 12. A collaboration with researchers from Toulouse, France, considered the important problem of computing the Schur complement in a domain-decomposition approach. 13. We explored new ways of preconditioning linear systems, based on low-rank approximations.

97 MATHEMATICS AND COMPUTING↗

Algebraic multigrid domain and range decomposition (AMG-DD / AMG-RD)*

In modern large-scale supercomputing applications, algebraic multigrid (AMG) is a leading choice for solving matrix equations. However, the high cost of communication relative to that of computation is a concern for the scalability of traditional implementations of AMG on emerging architectures. This paper introduces two new algebraic multilevel algorithms, algebraic multigrid domain decomposition (AMG-DD) and algebraic multigrid range decomposition (AMG-RD), that replace traditional AMG V-cycles with a fully overlapping domain decomposition approach. While the methods introduced here are similar in spirit to the geometric methods developed by Brandt and Diskin [Multigrid solvers on decomposed domains, in Domain Decomposition Methods in Science and Engineering, Contemp. Math. 157, AMS, Providence, RI, 1994, pp. 135--155], Mitchell [Electron. Trans. Numer. Anal., 6 (1997), pp. 224--233], and Bank and Holst [SIAM J. Sci. Comput., 22 (2000), pp. 1411--1443], they differ primarily in that they are purely algebraic: AMG-RD and AMG-DD trade communication for computation by forming global composite “grids” based only on the matrix, not the geometry. (As is the usual AMG convention, “grids” here should be taken only in the algebraic sense, regardless of whether or not it corresponds to any geometry.) Another important distinguishing feature of AMG-RD and AMG-DD is their novel residual communication process that enables effective parallel computation on composite grids, avoiding the all-to-all communication costs of the geometric methods. The main purpose of this paper is to study the potential of these two algebraic methods as possible alternatives to existing AMG approaches for future parallel machines. As a result, this paper develops some theoretical properties of these methods and reports on serial numerical tests of their convergence properties over a spectrum of problem parameters.

97 MATHEMATICS AND COMPUTING↗

Interface PINNs (I-PINNs): A physics-informed neural networks framework for interface problems

Here, we present a novel physics-informed neural networks (PINNs) framework for modeling interface problems, termed Interface PINNs (I-PINNs). I-PINNs uses different neural networks for any two subdomains separated by a sharp interface such that the neural networks differ only through their activation functions while the other parameters remain identical. The performance of I-PINNs, conventional PINNs, and other existing domain-decomposition PINNs methods such as extended PINNs (XPINNs) and multi-domain PINN (M-PINN) is compared through several one-dimensional, two-dimensional, and three-dimensional benchmark elliptic interface problems. The results demonstrate that I-PINNs provides a root-mean-square-error accuracy, at least two orders of magnitude better than conventional PINNs and XPINNs at approximately one-tenth of the computational cost of conventional PINNs and half the cost of XPINNs. Additionally, while I-PINNs and M-PINN provide comparable accuracies, M-PINN is found to be approximately 50% more expensive.

42 ENGINEERING↗