Search NASA⌕ Search

SEARCH · Search NASA

Results for “Iterative solvers”

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.

674 records · Page 38

Preconditioned least‐squares Petrov–Galerkin reduced order models

Abstract In this article, we introduce a methodology for improving the accuracy and efficiency of reduced order models (ROMs) constructed using the least‐squares Petrov–Galerkin (LSPG) projection method through the introduction of preconditioning. Unlike prior related work, which focuses on preconditioning the linear systems arising within the ROM numerical solution procedure to improve linear solver performance, our approach leverages a preconditioning matrix directly within the minimization problem underlying the LSPG formulation. Applying preconditioning in this way has the potential to improve ROM accuracy for several reasons. First, preconditioning the LSPG formulation changes the norm defining the residual minimization, which can improve the residual‐based stability constant bounding the ROM solution's error. The incorporation of a preconditioner into the LSPG formulation can have the additional effect of scaling the components of the residual being minimized to make them roughly of the same magnitude, which can be beneficial when applying the LSPG method to problems with disparate scales (e.g., dimensional equations, multi‐physics problems). Importantly, we demonstrate that an “ideal preconditioned” LSPG ROM (a ROM in which the preconditioner is the inverse of the Jacobian of its corresponding full order model) emulates projection of the full order model solution increment onto the reduced basis. This quantity defines a lower bound on the error of a ROM solution for a given reduced basis. By designing preconditioners that approximate the Jacobian inverse—as is common in designing preconditioners for solving linear systems—it is possible to obtain a ROM whose error approaches this lower bound. The proposed approach is evaluated on several mechanical and thermo‐mechanical problems implemented within the Albany HPC code and run in the predictive regime, with prediction across material parameter space. We demonstrate numerically that the introduction of simple Jacobi, Gauss‐Seidel, and ILU preconditioners into the proper orthogonal decomposition/LSPG formulation reduces significantly the ROM solution error, the reduced Jacobian condition number, the number of nonlinear iterations required to reach convergence, and the wall time (thereby improving efficiency). Moreover, our numerical results reveal that the introduction of preconditioning can deliver a robust and accurate solution for test cases in which the unpreconditioned LSPG method fails to converge.

Lindsay, Payton↗

Time-dependent runaway electron simulations: Ampere–Faraday equations implemented in CQL3D

The runaway electron (RE) distributions driven by a large toroidal electric field induced by the drop in the temperature profile due to disruption or pellets are comprehensively simulated by the 3D Fokker–Planck (FP) solver CQL3D (Harvey and McCoy 1992 Proc. of IAEA TCM ), recently coupled to the Ampere–Faraday (AF) equations. The evolution of the toroidal current in a plasma occurs on a resistive time scale, τ res = 4 πa 2 /( c 2 η ), which is typically of the order of seconds in present tokamaks. Here, a and η are respectively plasma radius or radial extent of a current density perturbation, and Ohmic resistivity. From the Faraday EM equation, the toroidal electric field is proportional to the time derivative of the poloidal magnetic field, which, from the Ampere equation, is proportional to the toroidal current. Thus, the toroidal electric field rapidly increases due to an abrupt temperature drop decrease in conductivity, to prevent change in the toroidal current faster than τ res . This is a example of Lenz's law. For example, in simulations with KPRAD (Whyte et al 2003 J. Nucl. Mater . 313–6 1239) of neon pellet injection into a DIII-D shot, T e drops from 2 keV to 10 eV in 0.1 ms and Z eff increases 1–4, giving that the electric field increases 3500× to 0.8 V cm -1 . As described in Harvey et al (2000 PoP 7 4590), this places much of the tail electron distribution beyond the Dreicer runaway velocity, giving so-called 'hot-tail runaways' which for a time are the dominant source of runaways, more so than the knockon source. In this prior calculation, performed for a single flux surface, the toroidal current density is held constant, on the basis that τ res is large. Most of the initial current can be converted to runaway current, which is then dangerous, particularly for ITER. A more comprehensive A–F model recently implemented in CQL3D, taking into account the time-development of the full-plasma-width toroidal electric field on time-scales of order τ res applies an iterative technique for the toroidal field previously developed for a different application (Kupfer et al 1996 PoP 3 3644), maintaining the implicit-in-time evolution of CQL3D. The degree of runaway current formation is reduced in AF augmented CQL3D, but the basic mechanism of 'hot-tail runaways' remains a dominant contribution to the REs at early times after the T e drop in these simulations. On the other hand, a NIMROD (Sovinec et al 2004 J. Comput. Phys. 195 355 ) simulation of shattered-pellet shutdown of DIII-D plasma (Kim 2018 APS/DPP Meeting), gives a slower thermal quench; when the plasma profiles and electric field are coupled one-way to CQL3D, the 'hot-tail' REs are much less, and growth of RE is dominated by the knockon process.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A Testbed of Parallel Kernels for Computer Science Research

For several decades, computer scientists have sought guidance on how to evolve architectures, languages, and programming models for optimal performance, efficiency, and productivity. Unfortunately, this guidance is most often taken from the existing software/hardware ecosystem. Architects attempt to provide micro-architectural solutions to improve performance on fixed binaries. Researchers tweak compilers to improve code generation for existing architectures and implementations, and they may invent new programming models for fixed processor and memory architectures and computational algorithms. In today's rapidly evolving world of on-chip parallelism, these isolated and iterative improvements to performance may miss superior solutions in the same way gradient descent optimization techniques may get stuck in local minima. In an initial study, we have developed an alternate approach that, rather than starting with an existing hardware/software solution laced with hidden assumptions, defines the computational problems of interest and invites architects, researchers and programmers to implement novel hardware/ software co-designed solutions. Our work builds on the previous ideas of computational dwarfs, motifs, and parallel patterns by selecting a representative set of essential problems for which we provide: An algorithmic description; scalable problem definition; illustrative reference implementations; verification schemes. For simplicity, we focus initially on the computational problems of interest to the scientific computing community but proclaim the methodology (and perhaps a subset of the problems) as applicable to other communities. We intend to broaden the coverage of this problem space through stronger community involvement. Previous work has established a broad categorization of numerical methods of interest to the scientific computing, in the spirit of the NAS Benchmarks, which pioneered the basic idea of a 'pencil and paper benchmark' in the 1990s. The initial result of the more modern study was the seven dwarfs, which was subsequently extended to 13 motifs. These motifs have already been useful in defining classes of applications for architecture-software studies. However, these broad-brush problem statements often miss the nuance seen in individual kernels. For example, the computational requirements of particle methods vary greatly between the naive (but more accurate) direct calculations and the particle-mesh and particle-tree codes. Thus we commenced our study with an enumeration of problems, but then proceeded by providing not only reference implementations for each problem, but more importantly a mathematical definition that allows one to escape iterative approaches to software/hardware optimization. To ensure long term value, we have augmented each of our reference implementations with both a scalable problem generator and a verification scheme. In a paper we have prepared that documents our efforts, we describe in detail this process of problem definition, scalable input creation, verification, and implementation of reference codes for the scientific computing domain. Table 1 enumerates and describes the level of support we've developed for each kernel. We group these important kernels using the Berkeley dwarfs/motifs taxonomy using a red box in the appropriate column. As kernels become progressively complex, they build upon other, simpler computational methods. We note this dependency via orange boxes. After enumeration of the important numerical problems, we created a domain-appropriate high-level definition of each problem. To ensure future endeavors are not tainted by existing implementations, we specified the problem definition to be independent of both computer architecture and existing programming languages, models, and data types. Then, to provide context as to how such kernels productively map to existing architectures, languages and programming models, we produced reference implementations for most of the kernel (see table). These sample codes should be viewed as 'hints,' designed to show how other designers have mapped a problem's operands and operators to existing hardware and software. Since we wanted such implementations to be illustrative, we tried to ensure they were the most straightforward implementation in the easiest to understand languages using familiar architectures. To that end, most of the linear algebra-oriented computations are written in MATLAB using array indexing to process matrices, rather than one-line library calls to compute the same kernel. This ensures that the kernel's computation is explicit and readable in the implementation and not hidden behind a library. For other problems, such as the Barnes-Hut n-Body solver, the implementations were written in pure C, without any supporting library computations. Along this line, we have also created a scalable problem generator to accompany each computation.

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↗

Partnership for Edge Physics Simulation (EPSI)

We propose to develop advanced simulation codes, based upon an extreme parallelism, first principles kinetic approach, to address the challenges associated with the edge region of magnetically confined plasmas. This work is relevant to both existing magnetic fusion facilities and essential for next-generation burning plasma experiments, such as ITER where success is critically dependent upon H-mode operation achieving an edge pedestal of sufficient height for good core plasma performance without producing deleterious large scale edge localized instabilities. The plasma edge presents a well-known set of multi-physics, multi-scale problems involving complex 3D magnetic geometry. Perhaps the greatest computational challenge is the lack of scale separation – temporal scales for drift waves, Alfven waves, ELM dynamics for example have strong overlap. Similar overlap occurs on the spatial scales for the ion poloidal gyro-radius, drift wave and pedestal width. The traditional approach of separating fusion problems into weakly interacting spatial or temporal domains clearly breaks down in the edge. A full kinetic model (full-f model) must be solved to understand and predict the edge physics including non-equilibrium thermodynamic issues arising from the magnetic topology (the open field lines producing a spatially sensitive velocity hole), plasma wall interactions, neutral and atomic physics. The plan here is to model these phenomena within a comprehensive first principles set of equations without the need for the insurmountable multiple-codes coupling issues by building on the XGC1 code developed under the SciDAC Proto-FSP Center for Plasma Edge Simulation (CPES). This proposal includes the critical participants in the XGC1 development. We propose enhancing the capability of XGC1 by including all the important turbulence physics contained in kinetic ion and electron electromagnetic dynamics, by extending the PIC technology to incorporate several positive features found in the Eulerian grid technology, combining the coarse grained XGC0 code into it with a multiscale projective time integration technique to be developed in the project for experimental time scale simulation of the edge multi-physics, and by implementing modern computational technologies to move forward with the extreme scale heterogeneous hardware/software platform development. Ultra-fast edge localized instabilities, involving compressional Alven modes, will be studied using a proper MHD or two-fluid codes employing kinetic closure information from XGC. The proposed research integrates the most important physical processes on overlapping temporal and spatial scales, to study (i) transitions and thresholds for enhanced confinement regimes, (ii) the predictive understanding of the edge pedestal formation, structure and dynamics, (iii) the effect of the edge plasma on the core confinement, (iv) the physics of Edge Localized Modes and their suppression or mitigation via external control techniques, and (v) the heat load on the material wall. Our approach will implement physical models that are valid in their relevant collisionality regimes for current experiments and future burning plasma devices. Comparisons with experimental data will be made at multiple levels including characterization of turbulence dynamics, flux-gradient responses in the energy, particle and momentum channels, and observations of global phenomena such as L-H transitions, momentum generation, ELM dynamics, ELM-free regimes and the tokamak density limit. The proposal team has established strong connections, through joint membership, with other organizations that will be critical for success. These include FASTMath, SUPER and QUEST Institutes respectively for meshing tools and solvers; code performance tuning and uncertainty quantification as well as a proposed Data Management and Visualization Institute.. We will also be teaming with ongoing fusion SciDAC’s: CSWPI for RF-edge plasmas interactions; CEMM for the M3D MHD simulations and with PEPSC for incorporation of energetic particle physics. Finally, the team includes representatives from each of the major U.S. experimental facilities who will coordinate the validation program and the development of synthetic diagnostics.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A high-order gas-kinetic Navier-Stokes flow solver

The foundation for the development of modern compressible flow solver is based on the Riemann solution of the inviscid Euler equations. The high-order schemes are basically related to high-order spatial interpolation or reconstruction. In order to overcome the low-order wave interaction mechanism due to the Riemann solution, the temporal accuracy of the scheme can be improved through the Runge-Kutta method, where the dynamic deficiencies in the first-order Riemann solution is alleviated through the sub-step spatial reconstruction in the Runge-Kutta process. The close coupling between the spatial and temporal evolution in the original nonlinear governing equations seems weakened due to its spatial and temporal decoupling. Many recently developed high-order methods require a Navier-Stokes flux function under piece-wise discontinuous high-order initial reconstruction. However, the piece-wise discontinuous initial data and the hyperbolic-parabolic nature of the Navier-Stokes equations seem inconsistent mathematically, such as the divergence of the viscous and heat conducting terms due to initial discontinuity. In this paper, based on the Boltzmann equation, we are going to present a time-dependent flux function from a high-order discontinuous reconstruction. The theoretical basis for such an approach is due to the fact that the Boltzmann equation has no specific requirement on the smoothness of the initial data and the kinetic equation has the mechanism to construct a dissipative wave structure starting from an initially discontinuous flow condition on a time scale being larger than the particle collision time. The current high-order flux evaluation method is an extension of the second-order gas-kinetic BGK scheme for the Navier-Stokes equations (BGK-NS). The novelty for the easy extension from a second-order to a higher order is due to the simple particle transport and collision mechanism on the microscopic level. This paper will present a hierarchy to construct such a high-order method. The necessity to couple spatial and temporal evolution nonlinearly in the flux evaluation can be clearly observed through the numerical performance of the scheme for the viscous flow computations.

97 MATHEMATICS AND COMPUTING↗

Adagio 4.16 user s guide.

Adagio is a three-dimensional, implicit solid mechanics code with a versatile element library, nonlinear material models, and capabilities for modeling large deformation and contact. Adagio is a parallel code, and its nonlinear solver and contact capabilities enable scalable solutions of large problems. It is built on the SIERRA Framework [1, 2]. SIERRA provides a data management framework in a parallel computing environment that allows the addition of capabilities in a modular fashion. The Adagio 4.16 User's Guide provides information about the functionality in Adagio and the command structure required to access this functionality in a user input file. This document is divided into chapters based primarily on functionality. For example, the command structure related to the use of various element types is grouped in one chapter; descriptions of material models are grouped in another chapter. The input and usage of Adagio is similar to that of the code Presto [3]. Presto, like Adagio, is a solid mechanics code built on the SIERRA Framework. The primary difference between the two codes is that Presto uses explicit time integration for transient dynamics analysis, whereas Adagio is an implicit code. Because of the similarities in input and usage between Adagio and Presto, the user's guides for the two codes are structured in the same manner and share common material. (Once you have mastered the input structure for one code, it will be easy to master the syntax structure for the other code.) To maintain the commonality between the two user's guides, we have used a variety of techniques. For example, references to Presto may be found in the Adagio user's guide and vice versa, and the chapter order across the two guides is the same. On the other hand, each of the two user's guides is expressly tailored to the features of the specific code and documents the particular functionality for that code. For example, though both Presto and Adagio have contact functionality, the content of the chapter on contact in the two guides differs. Important references for both Adagio and Presto are given in the references section at the end of this chapter. Adagio was preceded by the codes JAC and JAS3D; JAC is described in Reference 4; JAS3D is described in Reference 5. Presto was preceded by the code Pronto3D. Pronto3D is described in References 6 and 7. Some of the fundamental nonlinear technology used by both Presto and Adagio are described in References 8, 9, and 10. Currently, both Presto and Adagio use the Exodus II database and the XDMF database; Exodus II is more commonly used than XDMF. (Other options may be added in the future.) The Exodus II database format is described in Reference 11, and the XDMF database format is described in Reference 12. Important information about contact is provided in the reference document for ACME [13]. ACME is a third-party library for contact. One of the key concepts for the command structure in the input file is a concept referred to as scope. A detailed explanation of scope is provided in Section 1.2. Most of the command lines in Chapter 2 are related to a certain scope rather than to some particular functionality.

97 MATHEMATICS AND COMPUTING↗

Adagio 4.14 user s guide.

This document is a user's guide for the code Adagio. Adagio is a three-dimensional, implicit solid mechanics code with a versatile element library, nonlinear material models, and capabilities for modeling large deformation and contact. Adagio is a parallel code, and its nonlinear solver and contact capabilities enable scalable solutions of large problems. It is built on the SIERRA Framework [1, 2]. SIERRA provides a data management framework in a parallel computing environment that allows the addition of capabilities in a modular fashion. The Adagio 4.14 User's Guide provides information about the functionality in Adagio and the command structure required to access this functionality in a user input file. This document is divided into chapters based primarily on functionality. For example, the command structure related to the use of various element types is grouped in one chapter; descriptions of material models are grouped in another chapter. The input and usage of Adagio is similar to that of the code Presto [3]. Presto, like Adagio, is a solid mechanics code built on the SIERRA Framework. The primary difference between the two codes is that Presto uses explicit time integration for transient dynamics analysis, whereas Adagio is an implicit code. Because of the similarities in input and usage between Adagio and Presto, the user's guides for the two codes are structured in the same manner and share common material. (Once you have mastered the input structure for one code, it will be easy to master the syntax structure for the other code.) To maintain the commonality between the two user's guides, we have used a variety of techniques. For example, references to Presto may be found in the Adagio user's guide and vice versa, and the chapter order across the two guides is the same. On the other hand, each of the two user's guides is expressly tailored to the features of the specific code and documents the particular functionality for that code. For example, though both Presto and Adagio have contact functionality, the content of the chapter on contact in the two guides differs. Important references for both Adagio and Presto are given in the references section at the end of this chapter. Adagio was preceded by the codes JAC and JAS3D; JAC is described in Reference 4; JAS3D is described in Reference 5. Presto was preceded by the code Pronto3D. Pronto3D is described in References 6 and 7. Some of the fundamental nonlinear technology used by both Presto and Adagio are described in References 8, 9, and 10. Currently, both Presto and Adagio use the Exodus II database and the XDMF database; Exodus II is more commonly used than XDMF. (Other options may be added in the future.) The Exodus II database format is described in Reference 11, and the XDMF database format is described in Reference 12. Important information about contact is provided in the reference document for ACME [13]. ACME is a third-party library for contact. One of the key concepts for the command structure in the input file is a concept referred to as scope. A detailed explanation of scope is provided in Section 1.2. Most of the command lines in Chapter 2 are related to a certain scope rather than to some particular functionality.

97 MATHEMATICS AND COMPUTING↗