Search NASA⌕ Search

SEARCH · Search NASA

Results for “nested iteration”

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 37 records · Page 2

Tau-REx I: A next generation retrieval code for exoplanetary atmospheres

Spectroscopy of exoplanetary atmospheres has become a well established method for the characterization of extrasolar planets. We here present a novel inverse retrieval code for exoplanetary atmospheres. T-REx(Tau Retrieval for Exoplanets) is a line-by-line radiative transfer fully Bayesian retrieval framework. T-REx includes the following features:(1) the optimized use of molecular line lists from the ExoMol project; (2) an unbiased atmospheric composition prior selection, through custom built pattern recognition software; (3) the use of two independent algorithms to fully sample the Bayesian likelihood space: nested sampling as well as a more classical Markov Chain Monte Carlo approach; (4) iterative Bayesian parameter and model selection using the full Bayesian Evidence as well as the Savage–Dickey Ratio for nested models; and (5) the ability to fully map very large parameter spaces through optimal code parallelization and scalability to cluster computing. In this publication we outline the T-REx framework and demonstrate, using a theoretical hot-Jupiter transmission spectrum, the parameter retrieval and model selection. We investigate the impact of signal-to-noise ratio and spectral resolution on the retrievability of individual model parameters, both in terms of error bars on the temperature and molecular mixing ratios as well as its effect on the model’s global Bayesian evidence.

79 ASTRONOMY AND ASTROPHYSICS↗

The ITER 3D Magnetic Diagnostic Response to Applied n=3 and n=4 RMP's

The ITER magnetic diagnostic response to applied n=3 and n=4 RMPs has been calculated for the 15MA scenario. The VMEC code was utilized to calculate free boundary 3D ideal MHD equilibria, where the non-stellarator symmetric terms were included in the calculation. This allows an assessment to be made of the possible boundary displacements due to RMP application in ITER. As the VMEC code assumes a continuous set of nested flux surface, the possibility of island and stochastic region formation is ignored. At the start of the current at-top (L-Mode) application of n = 4 RMP's indicates approximately 1 cm peak-to-peak displacements on the low field side of the plasma while later in the shot (H-mode) perturbations as large as 3 cm are present. Forward modeling of the ITER magnetic diagnostics indicates significant non-axisymmetric plasma response, exceeding 10% the axisymmetric signal in many of the flux loops. Magnetic field probes seem to indicate a greater robustness to 3D effects but still indicate large sensitivities to 3D effects in a number of sensors. Forward modeling of the diagnostics response to 3D equilibria allows assessment of diagnostics design and control scenarios.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Hierarchical Krylov and nested Krylov methods for extreme-scale computing

The solution of large, sparse linear systems is typically a dominant phase of computation for simulations based on partial differential equations, which are ubiquitous in scientific and engineering applications. While preconditioned Krylov methods are widely used and provide many advantages for solving sparse linear systems that do not have highly convergent, geometric multigrid solvers or specialized fast solvers, Krylov methods encounter well-known scaling difficulties for over 10,000 processor cores because each iteration requires at least one vector inner product, which in turn requires a global synchronization that scales poorly because of internode latency. To aid in overcoming these difficulties, we have developed hierarchical Krylov methods and nested Krylov methods in the PETSc library that reduce the number of global inner products required across the entire system (where they are expensive), though freely allow vector inner products across smaller subsets of the entire system (where they are inexpensive) or use inner iterations that do not invoke vector inner products at all. Nested Krylov methods are a generalization of inner-outer iterative methods with two or more layers. Hierarchical Krylov methods are a generalization of block Jacobi and overlapping additive Schwarz methods, where each block itself is solved by Krylov methods on smaller blocks. Conceptually, the hierarchy can continue recursively to an arbitrary number of levels of smaller and smaller blocks. As a specific case, we introduce the hierarchical FGMRES method, or h-FGMRES, and we demonstrate the impact of two-level h-FGMRES with a variable preconditioner on the PFLOTRAN subsurface flow application. We also demonstrate the impact of nested FGMRES, BiCGStab and Chebyshev methods. These hierarchical Krylov methods and nested Krylov methods significantly reduced overall PFLOTRAN simulation time on the Cray XK6 when using 10,000 through 224,000 cores through the combined effects of reduced global synchronization due to fewer global inner products and stronger inner hierarchical or nested preconditioners.

97 MATHEMATICS AND COMPUTING↗

A DG-IMEX Method for Two-moment Neutrino Transport: Nonlinear Solvers for Neutrino–Matter Coupling

Neutrino-matter interactions play an important role in core-collapse supernova (CCSN) explosions as they contribute to both lepton number and/or four-momentum exchange between neutrinos and matter, and thus act as the agent for neutrino-driven explosions. Due to the multiscale nature of neutrino transport in CCSN simulations, an implicit treatment of neutrino-matter interactions is desired, which requires solutions of coupled nonlinear systems in each step of the time integration scheme. In this paper we design and compare nonlinear iterative solvers for implicit systems with energy coupling neutrino-matter interactions commonly used in CCSN simulations. Specifically, we consider electron neutrinos and antineutrinos, which interact with static matter configurations through the Bruenn 85 opacity set. The implicit systems arise from the discretization of a nonrelativistic two-moment model for neutrino transport, which employs the discontinuous Galerkin (DG) method for phase-space discretization and an implicit-explicit (IMEX) time integration scheme. In the context of this DG-IMEX scheme, we propose two approaches to formulate the nonlinear systems — a coupled approach and a nested approach. For each approach, the resulting systems are solved with Anderson-accelerated fixedpoint iteration and Newton’s method. The performance of these four iterative solvers has been compared on relaxation problems with various degree of collisionality, as well as proto-neutron star deleptonization problems with several matter profiles adopted from spherically symmetric CCSN simulations. Here, numerical results suggest that the nested Anderson-accelerated fixed-point solver is more efficient than other tested solvers for solving implicit nonlinear systems with energy coupling neutrino-matter interactions.

79 ASTRONOMY AND ASTROPHYSICS↗

The Reverse Cuthill-McKee Algorithm in Distributed-Memory

Ordering vertices of a graph is key to minimize fill-in and data structure size in sparse direct solvers, maximize locality in iterative solvers, and improve performance in graph algorithms. Except for naturally parallelizable ordering methods such as nested dissection, many important ordering methods have not been efficiently mapped to distributed-memory architectures. In this paper, we present the first-ever distributed-memory implementation of the reverse Cuthill-McKee (RCM) algorithm for reducing the profile of a sparse matrix. Our parallelization uses a two-dimensional sparse matrix decomposition. We achieve high performance by decomposing the problem into a small number of primitives and utilizing optimized implementations of these primitives. Our implementation shows strong scaling up to 1024 cores for smaller matrices and up to 4096 cores for larger matrices.

97 MATHEMATICS AND COMPUTING↗

SIESTA: A scalable iterative equilibrium solver for toroidal applications

A new solver for rapidly obtaining magnetohydrodynamic (MHD) equilibria in toroidal systems in the presence of islands and stochastic regions is described. It is based on the Kulsrud-Kruskal MHD energy minimization principle. To carry out this minimization, small displacements are made around a convenient set of curvilinear coordinates obtained from a nearby three-dimensional equilibrium that assumes nested surfaces. Because the changes of the magnetic fields and pressure are small, corresponding to small changes in the initial magnetic and kinetic energies, solutions for the linearized perturbations can be used to rapidly and iteratively find lower energy states with magnetic islands. A physics-based preconditioner is developed to accelerate the convergence of the iterative procedure to obtain an ideal MHD equilibrium with broken magnetic surfaces (islands).

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Vector Field Decompositions Using Multiscale Poisson Kernel

Extraction of multiscale features using scale-space is one of the fundamental approaches to analyze scalar fields. However, similar techniques for vector fields are much less common, even though it is well known that, for example, turbulent flows contain cascades of nested vortices at different scales. The challenge is that the ideas related to scale-space are based upon iteratively smoothing the data to extract features at progressively larger scale, making it difficult to extract overlapping features. Instead, we consider spatial regions of influence in vector fields as scale, and introduce a new approach for the multiscale analysis of vector fields. Rather than smoothing the flow, we use the natural Helmholtz-Hodge decomposition to split it into small-scale and large-scale components using progressively larger neighborhoods. Our approach creates a natural separation of features by extracting local flow behavior, for example, a small vortex, from large-scale effects, for example, a background flow. We demonstrate our technique on large-scale, turbulent flows, and show multiscale features that cannot be extracted using state-of-the-art techniques.

97 MATHEMATICS AND COMPUTING↗

Leveraging Anderson Acceleration for improved convergence of iterative solutions to transport systems

In this note we demonstrate that using Anderson Acceleration (AA) in place of a standard Picard iteration can not only increase the convergence rate but also make the iteration more robust for two transport applications. We also compare the convergence acceleration provided by AA to that provided by moment-based acceleration methods. Additionally, we demonstrate that those two acceleration methods can be used together in a nested fashion. We begin by describing the AA algorithm. At this point, we will describe two application problems, one from neutronics and one from plasma physics, on which we will apply AA. We provide computational results which highlight the benefits of using AA, namely that we can compute solutions using fewer function evaluations, larger time-steps, and achieve a more robust iteration.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Experimental inference of flux tunneling between magnetic island chains in tokamaks

We report confinement bifurcations due to flux tunneling in magnetic islands in toroidal plasmas. This occurs in 2/1 islands, triggered by decoupling of non-overlapping adjacent 5/2 islands. While subject to electron cyclotron current drive (ECCD), the temperature at the 2/1 O-point is flat before but peaks after decoupling. Here, this is shown to be due to a bifurcation from stochastic to nested magnetic structure, caused by the removal of flux tunneling through intersecting manifolds of overlapping heteroclinic tangles. 2/1 island stability correlates with coupling events in an ITER baseline scenario plasma where ECCD can not stabilize the coupled islands, showing the critical impact of flux tunneling on disruption avoidance in tokamaks.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Addressing Over-Solving in Multiphysics Codes with Nested Solvers

Examples of multiphysics problems in the field of nuclear engineering are numerous. For light water reactors the coupling of neutronics with thermal-hydraulics is the most predominant. Often this coupling is modeled by combining existing codes in a Picard Iteration scheme, that is, by solving one physics then using that answer to solve the other and iterating until both answers stabilize. However, simply solving to a high precision on every Picard (multiphysics) iteration is much less efficient than progressively solving to higher precisions. This unneeded work is known as over-solving. Over-solving in single-physics solvers has been studied previously for the Newton method and Chebyshev iteration. Both of these methods solve an inner linear problem that determines the next update step for the outer loop. If the inner problem is solved to a high precision in every outer iteration, the result will be substantially more computational expense (over-solving) and a higher probability of reaching the 'wrong' solution. Methods for reducing over-solving in partitioned multiphysics codes have only been developed recently. This work introduces further improvements, including an investigation of over-solving methods on both the multiphysics and single-physics levels.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations

Here, we propose a new algorithm for the fast solution of large, sparse, symmetric positive-definite linear systems, spaND (sparsified Nested Dissection). It is based on nested dissection, sparsification, and low-rank compression. After eliminating all interiors at a given level of the elimination tree, the algorithm sparsifies all separators corresponding to the interiors. This operation reduces the size of the separators by eliminating some degrees of freedom but without introducing any fill-in. This is done at the expense of a small and controllable approximation error. The result is an approximate factorization that can be used as an efficient preconditioner. We then perform several numerical experiments to evaluate this algorithm. We demonstrate that a version using orthogonal factorization and block-diagonal scaling takes fewer CG iterations to converge than previous similar algorithms on various kinds of problems. Furthermore, this algorithm is provably guaranteed to never break down and the matrix stays symmetric positive-definite throughout the process. We evaluate the algorithm on some large problems show it exhibits near-linear scaling. The factorization time is roughly $\mathcal{O}$(N), and the number of iterations grows slowly with N.

97 MATHEMATICS AND COMPUTING↗

The fusion code XGC: Enabling kinetic study of multi-scale edge turbulent transport in ITER [Book Chapter]

The XGC fusion gyrokinetic code combines state-of-the-art, portable computational and algorithmic technologies to enable complicated multiscale simulations of turbulence and transport dynamics in ITER edge plasma on the largest US open-science computer, the CRAY XK7 Titan, at its maximal heterogeneous capability, which have not been possible before due to a factor of over 10 shortage in the time-to-solution for less than 5 days of wall-clock time for one physics case. Frontier techniques such as nested OpenMP parallelism, adaptive parallel I/O, staging I/O and data reduction using dynamic and asynchronous applications interactions, dynamic repartitioning for balancing computational work in pushing particles and in grid related work, scalable and accurate discretization algorithms for non-linear Coulomb collisions, and communication-avoiding subcycling technology for pushing particles on both CPUs and GPUs are also utilized to dramatically improve the scalability and time-to-solution, hence enabling the difficult kinetic ITER edge simulation on a present-day leadership class computer.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Profile etching for prefiguring X-ray mirrors

A method to pre-shape mirror substrates through etching with a broad-beam ion source and a contoured mask is presented. A 100 mm-long elliptical cylinder substrate was obtained from a super-polished flat Si substrate with a 48 nm root-mean-square (r.m.s.) figure error and a 1.5 Å r.m.s. roughness after one profile-etching process at a beam voltage of 600 V without iteration. A follow-up profile coating can be used to achieve a final mirror. Profile etching and profile coating combined provide an economic way to make X-ray optics, such as nested Kirkpatrick–Baez mirrors.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A scalable block-preconditioning strategy for divergence-conforming B-spline discretizations of the Stokes problem

The recently introduced divergence-conforming B-spline discretizations allow the construction of smooth discrete velocity–pressure pairs for viscous incompressible flows that are at the same time inf–sup stable and pointwise divergence-free. When applied to the discretized Stokes problem, these spaces generate a symmetric and indefinite saddle-point linear system. The iterative method of choice to solve such system is the Generalized Minimum Residual Method. This method lacks robustness, and one remedy is to use preconditioners. For linear systems of saddle-point type, a large family of preconditioners can be obtained by using a block factorization of the system. In this paper, we show how the nesting of “black-box” solvers and preconditioners can be put together in a block triangular strategy to build a scalable block preconditioner for the Stokes system discretized by divergence-conforming B-splines. Lastly, besides the known cavity flow problem, we used for benchmark flows defined on complex geometries: an eccentric annulus and hollow torus of an eccentric annular cross-section.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Elimination of MHD current sheets by modifications to the plasma wall in a fixed boundary model

Models of magnetohydrodynamic (MHD) equilibia that for computational convenience assume the existence of a system of nested magnetic flux surfaces tend to exhibit singular current sheets. These sheets are located on resonant flux surfaces that are associated with rational values of the rotational transform. We study the possibility of eliminating these singularities by suitable modifications of the plasma boundary, which we prescribe in a fixed boundary setting. We find that relatively straightforward iterative procedures can be used to eliminate weak current sheets that are generated at resonant flux surfaces by the nonlinear interactions of resonating wall harmonics. These types of procedures may prove useful in the design of fusion devices with configurations that enjoy improved stability and transport properties.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

The fusion code XGC: Enabling kinetic study of multi-scale edge turbulent transport in ITER

The XGC fusion gyrokinetic code combines state-of-the-art, portable computational and algorithmic technologies to enable complicated multiscale simulations of turbulence and transport dynamics in ITER edge plasma on the largest US open-science computer, the CRAY XK7 Titan, at its maximal heterogeneous capability, which have not been possible before due to a factor of over 10 shortage in the time-to-solution for less than 5 days of wall-clock time for one physics case. Frontier techniques such as nested OpenMP parallelism, adaptive parallel I/O, staging I/O and data reduction using dynamic and asynchronous applications interactions, dynamic repartitioning.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Extreme-Scale Algorithms & Software Resilience (EASIR) Architecture-Aware Algorithms for Scalable Performance and Resilience on Heterogeneous Architectures

This project addresses both communication-avoiding algorithms, and reproducible floating-point computation. Communication, i.e. moving data, either between levels of memory or processors over a network, is much more expensive per operation than arithmetic (measured in time or energy), so we seek algorithms that greatly reduce communication. We developed many new algorithms for both dense and sparse, and both direct and iterative linear algebra, attaining new communication lower bounds, and getting large speedups in many cases. We also extended this work in several ways: (1) We minimize writes separately from reads, since writes may be much more expensive than reads on emerging memory technologies, like Flash, sometimes doing asymptotically fewer writes than reads. (2) We extend the lower bounds and optimal algorithms to arbitrary algorithms that may be expressed as perfectly nested loops accessing arrays, where the array subscripts may be arbitrary affine functions of the loop indices (eg A(i), B(i,j+k, k+3*m-7, …) etc.). (3) We extend our communication-avoiding approach to some machine learning algorithms, such as support vector machines. This work has won a number of awards. We also address reproducible floating-point computation. We define reproducibility to mean getting bitwise identical results from multiple runs of the same program, perhaps with different hardware resources or other changes that should ideally not change the answer. Many users depend on reproducibility for debugging or correctness. However, dynamic scheduling of parallel computing resources, combined with nonassociativity of floating point addition, makes attaining reproducibility a challenge even for simple operations like summing a vector of numbers, or more complicated operations like the Basic Linear Algebra Subprograms (BLAS). We describe an algorithm that computes a reproducible sum of floating point numbers, independent of the order of summation. The algorithm depends only on a subset of the IEEE Floating Point Standard 754-2008, uses just 6 words to represent a “reproducible accumulator,” and requires just one read-only pass over the data, or one reduction in parallel. New instructions based on this work are being considered for inclusion in the future IEEE 754-2018 floating-point standard, and new reproducible BLAS are being considered for the next version of the BLAS standard.

97 MATHEMATICS AND COMPUTING↗

Explicit modeling of pebble temperature in the porous-media model for pebble-bed reactors

In this study, we developed a multiscale model to include an explicit pebble-temperature model nested in the porous-media model for pebble-bed reactor applications. The multiscale solid-phase energy balance model, including the pebble surface energy balance equation and an explicit modeling of pebble temperature, can predict the macroscopic (pebble bed) and microscopic (pebble) temperature distributions under both steady-state and transient conditions. The proposed multiscale model is solved in a fully coupled manner using the Newton- Krylov method, and therefore iterations between the macroscopic (pebble-bed-scale) and microscopic (pebble- scale) model are avoided. Extensive code verifications, validation, and demonstrations have been performed for this newly developed model. By explicitly modeling pebble temperatures, this new model addresses a major deficiency of the basic porous-media model, which assumes homogeneous solid-phase temperature and is not appropriate for pebble-bed reactor design and safety analyses.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗