Search NASA⌕ Search

SEARCH · Search NASA

Results for “implicit”

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 1,639 records · Page 91

The Bloch equation for spin dynamics in electron storage rings: Computational and theoretical aspects

In this paper, we describe our work on spin polarization in high-energy electron storage rings which we base on the Full Bloch equation (FBE) for the polarization density and which aims towards the [Formula: see text] option of the proposed Future Circular Collider (FCC-ee) and the proposed Circular Electron Positron Collider (CEPC). The FBE takes into account non spin-flip and spin-flip effects due to synchrotron radiation including the spin-diffusion effects and the Sokolov–Ternov effect with its Baier–Katkov generalization as well as the kinetic-polarization effect. This mathematical model is an alternative to the standard mathematical model based on the Derbenev–Kondratenko formulas. For our numerical and analytical studies of the FBE, we develop an approximation to the latter to obtain an effective FBE. This is accomplished by finding a third mathematical model based on a system of stochastic differential equations (SDEs) underlying the FBE and by approximating that system via the method of averaging from perturbative ODE theory. We also give an overview of our algorithm for numerically integrating the effective FBE. This discretizes the phase space using spectral methods and discretizes time via the additive Runge–Kutta (ARK) method which is a high-order semi-implicit method. We also discuss the relevance of the third mathematical model for spin tracking.

Physics↗

On a nonlocal Cahn–Hilliard model permitting sharp interfaces

A nonlocal Cahn–Hilliard model with a non-smooth potential of double-well obstacle type that promotes sharp interfaces in the solution is presented. To capture long-range interactions between particles, a nonlocal Ginzburg–Landau energy functional is defined which recovers the classical (local) model as the extent of nonlocal interactions vanish. In contrast to the local Cahn–Hilliard problem that always leads to diffuse interfaces, the proposed nonlocal model can lead to a strict separation into pure phases of the substance. In this work, the lack of smoothness of the potential is essential to guarantee the aforementioned sharp-interface property. Mathematically, this introduces additional inequality constraints that, in a weak formulation, lead to a coupled system of variational inequalities which at each time instance can be restated as a constrained optimization problem. We prove the well-posedness and regularity of the semi-discrete and continuous in time weak solutions, and derive the conditions under which pure phases are admitted. Moreover, we develop discretizations of the problem based on finite element methods and implicit–explicit time-stepping methods that can be realized efficiently. Finally, we illustrate our theoretical findings through several numerical experiments in one and two spatial dimensions that highlight the differences in features of local and nonlocal solutions and also the sharp interface properties of the nonlocal model.

97 MATHEMATICS AND COMPUTING↗

Bound-preserving finite element approximations of the Keller–Segel equations

We report this paper aims to develop numerical approximations of the Keller–Segel equations that mimic at the discrete level the lower bounds and the energy law of the continuous problem. We solve these equations for two unknowns: the organism (or cell) density, which is a positive variable, and the chemoattractant density, which is a non-negative variable. We propose two algorithms, which combine a stabilized finite element method and a semi-implicit time integration. The stabilization consists of a nonlinear artificial diffusion that employs a graph-Laplacian operator and a shock detector that localizes local extrema. As a result, both algorithms turn out to be nonlinear and can generate cell and chemoattractant numerical densities fulfilling lower bounds. However, the first algorithm requires a suitable constraint between the space and time discrete parameters, whereas the second one does not. We design the latter to attain a discrete energy law on acute meshes. We report some numerical experiments to validate the theoretical results on blowup and nonblowup phenomena. In the blowup setting, we identify a locking phenomenon that relates the L ∞ (Ω)-norm to the L 1 (Ω)-norm limiting the growth of the singularity when supported on a macroelement.

97 MATHEMATICS AND COMPUTING↗

Scalable Pattern Matching in Metadata Graphs via Constraint Checking

Pattern matching is a fundamental tool for answering complex graph queries. Unfortunately, existing solutions have limited capabilities: They do not scale to process large graphs and/or support only a restricted set of search templates or usage scenarios. Moreover, the algorithms at the core of the existing techniques are not suitable for today’s graph processing infrastructures relying on horizontal scalability and shared-nothing clusters, as most of these algorithms are inherently sequential and difficult to parallelize. In this article we present an algorithmic pipeline that bases pattern matching on constraint checking. The key intuition is that each vertex and edge participating in a match has to meet a set of constraints implicitly specified by the search template. These constraints can be verified independently and typically are less expensive to compute than searching the full template. The pipeline we propose generates these constraints and iterates over them to eliminate all the vertices and edges that do not participate in any match, thus reducing the background graph to a subgraph that is the union of all template matches—the complete set of all vertices and edges that participate in at least one match. Additional analysis can be performed on this annotated, reduced graph, such as full match enumeration, match counting, or computing vertex/edge centrality. Furthermore, a vertex-centric formulation for constraint checking algorithms exists, and this makes it possible to harness existing high-performance, vertex-centric graph processing frameworks. This technique (i) enables highly scalable pattern matching in metadata (labeled) graphs; (ii) supports arbitrary patterns with 100% precision; (iii) enables tradeoffs between precision and time-to-solution, while always selects all vertices and edges that participate in matches, thus offering 100% recall; and (iv) supports a set of popular data analytics scenarios. We implement our approach on top of HavoqGT, an open-source asynchronous graph processing framework, and demonstrate its advantages through strong and weak scaling experiments on massive scale real-world (up to 257 billion edges) and synthetic (up to 4.4 trillion edges) labeled graphs, respectively, and at scales (1,024 nodes / 36,864 cores), orders of magnitude larger than used in the past for similar problems. This article serves two purposes: First, it synthesises the knowledge accumulated during a long-term project. Second, it presents new system features, usage scenarios, optimizations, and comparisons with related work that strengthen the confidence that pattern matching based on iterative pruning via constraint checking is an effective and scalable approach in practice. The new contributions include the following: (i) We demonstrate the ability of the constraint checking approach to efficiently support two additional search scenarios that often emerge in practice, interactive incremental search and exploratory search. (ii) We empirically compare our solution with two additional state-of-the-art systems, Arabsque and TriAD. (iii) We show the ability of our solution to accommodate a more diverse range of datasets with varying properties, e.g., scale, skewness, label distribution, and match frequency. (iv) We introduce or extend a number of system features (e.g., work aggregation, load balancing, and the ability to cap the generated traffic) and design optimizations and demonstrate their advantages with respect to improving performance and scalability. (v) We present bottleneck analysis and insights into artifacts that influence performance. (vi) We present a theoretical complexity argument that motivates the performance gains we observe.

97 MATHEMATICS AND COMPUTING↗

Trust-but-Verify in Cyber-Physical Systems

Cyber-physical systems span a wide spectrum, from long-lived legacy systems to more modern installations. Trust is an issue that arises across the spectrum, albeit with different variants of goals and constraints. On the one end of the spectrum, legacy systems are characterized by function-based designs in which trust is an implicitly in-built concept -- the operation is historically designed, implemented, and optimized in a benign stance with respect to intended use. On the other end of the spectrum, modern systems are characterized by offerings from manufacturers, vendors, and system installers -- the devices and deployments use a variety of security features that offer promises of increased trust. All along this spectrum of cyber-physical systems, extending trust beyond the traditional cyber portions to the arteries that connect the physical portions to the cyber portions is a major challenge. Here, we identify a Trust-but-Verify approach that spans this spectrum in addressing trust.

Perumalla, Kalyan↗

PERKS: a Locality-Optimized Execution Model for Iterative Memory-bound GPU Applications

Iterative memory-bound solvers commonly occur in HPC codes. Typical GPU implementations have a loop on the host side that invokes the GPU kernel as much as time/algorithm steps there are. The termination of each kernel implicitly acts the barrier required after advancing the solution every time step. We propose an execution model for running memory-bound iterative GPU kernels: PERsistent KernelS (PERKS). In this model, the time loop is moved inside persistent kernel, and device-wide barriers are used for synchronization. We then reduce the traffic to device memory by caching subset of the output in each time step in the unused registers and shared memory. PERKS can be generalized to any iterative solver: they largely independent of the solver's implementation. We explain the design principle of PERKS and demonstrate effectiveness of PERKS for a wide range of iterative 2D/3D stencil benchmarks (geomean speedup of 2.12x for 2D stencils and 1.24x for 3D stencils over state-of-art libraries), and a Krylov subspace conjugate gradient solver (geomean speedup of 4.86x in smaller SpMV datasets from SuiteSparse and 1.43x in larger SpMV datasets over a state-of-art library). All PERKS-based implementations available at: https://github.com/neozhang307/PERKS.

Zhang, Lingqi↗

Divergence Reduction in Monte Carlo Neutron Transport with On-GPU Asynchronous Scheduling

While Monte Carlo Neutron Transport (MCNT) is near-embarrasingly parallel, the effectively unpredictable lifetime of neutrons can lead to divergence when MCNT is evaluated on GPUs. Divergence is the phenomenon of adjacent threads in a warp executing different control flow paths; on GPUS, it reduces performance because each work group may only execute one path at a time. The process of Thread Data Remapping (TDR) resolves these discrepancies by moving data across hardware such that data in the same warp will be processed through similar paths. A common issue among prior implementations of TDR is the synchronous nature of its remapping and processing cycles, which exhaustively sort data produced by prior processing passes and exhaustively evaluate the sorted data. In another work, we defined a method of remapping data through an asynchronous scheduler which allows for work to be stored in shared memory and deferred arbitrarily until that work is a viable option for low-divergence evaluation. This article surveys a wider set of cases, with the goal of characterizing performance trends across a more comprehensive set of parameters. These parameters include cross sections of scattering/capturing/fission, use of implicit capture, source neutron counts, simulation time spans, and tuned memory allocations. Across these cases, we have recorded minimum and average execution times, as well as a heuristically tuned near-optimal memory allocation size for both synchronous and asynchronous scheduling. Across the collected data, it is shown that the asynchronous method is faster and more memory efficient in the majority of cases, and that it requires less tuning to achieve competitive performance.

Computer Science↗

The Role of Data Filtering in Open Source Software Ranking and Selection

Faced with more than 100M open source projects, a more manageable small subset is needed for most empirical investigations. More than half of the research papers in leading venues investigated filtering projects by some measure of popularity with explicit or implicit arguments that unpopular projects are not of interest, may not even represent "real" software projects, or that less popular projects are not worthy of study. However, such filtering may have enormous effects on the results of the studies if and precisely because the sought-out response or prediction is in any way related to the filtering criteria.This paper exemplifies the impact of this common practice on research outcomes, specifically how filtering of software projects on GitHub based on inherent characteristics affects the assessment of their popularity. Using a dataset of over 100,000 repositories, we used multiple regression to model the number of stars -a commonly used proxy for popularity- based on factors such as the number of commits, the duration of the project, the number of authors and the number of core developers. Our control model included the entire dataset, while a second filtered model considered only projects with ten or more authors. The results indicated that while certain characteristics of the repository consistently predict popularity, the filtering process significantly alters the relationships between these characteristics and the response. We found that the number of commits exhibited a positive correlation with popularity in the control sample but showed a negative correlation in the filtered sample. These findings highlight the potential biases introduced by data filtering and emphasize the need for careful sample selection in empirical research of mining software repositories. We recommend that empirical work should either analyze complete datasets such as World of Code, or employ stratified random sampling from a complete dataset to ensure that filtering is not biasing the results.

Malviya Thakur, Addi↗

A Simple, Scalable Large Deformation Solid Mechanics Implementation in the MOOSE Framework

This article describes a large deformation solid mechanics solver implemented as part of the freely available and open source MOOSE finite element simulation framework. The article documents the choices made in developing the solid mechanics framework and describes novel formulations for the gradient operator and constitutive modeling framework made to simplify implementations of different coordinate systems, stabilized gradient operators, and different constitutive model inputs and outputs. In the process, the article describes a new formulation that casts objective integration of the Cauchy stress as a linear transformation of the small stress rate. Finally, the article presents key implementation details and examines the parallel efficiency of the solid mechanics solver implemented in MOOSE. The implementation retains a good weak scaling efficiency beyond 1,000 parallel processes. The article includes a discussion of the factors limiting the parallel efficiency of implicit, large deformation solid mechanics codes on current high-performance computers, with the main current limitation being the scalability of the algebraic multigrid methods used to solve the linearized equilibrium equations.

Applied computing → Computer-aided design↗

Computational Studies of Solubilities of LiO 2 and Li 2 O 2 in Aprotic Solvents

Knowledge of the solubilities of Li 2 O 2 and LiO 2 in aprotic solvents is important for insight into the discharge and charge processes of Li-O 2 batteries, but these quantities are not well known. In this contribution, the solvation free energies of molecular LiO 2 and Li 2 O 2 in various organic solvents were calculated using various explicit and implicit solvent models, as well as ab initio molecular dynamics (AIMD) methods. Best estimates for the solvation energies from these calculations along with calculated lattice energies of Li 2 O 2 and LiO 2 were used to determine the solubility of bulk LiO 2 and Li 2 O 2 . The computed solubility of LiO 2 (1.8 × 10 -2 M) is about 15 orders higher than that of Li 2 O 2 (2.0 × 10 -17 M) due to a much less negative lattice energy of bulk LiO 2 compared to that of Li 2 O 2 . The difference in solubilities between LiO 2 and Li 2 O 2 likely will affect the nucleation and growth mechanisms and resulting morphologies of the products formed during battery discharge, influencing the performance of the battery cell. In conclusion, the calculated LiO 2 and Li 2 O 2 solubilities provide important information for fundamental studies of discharge and charge chemistries in Li-O 2 batteries.

25 ENERGY STORAGE↗

Comment on 'Numerical modeling of tokamak breakdown phase driven by pure Ohmic heating under ideal conditions'

In this comment, we point out possible critical numerical flaws of recent particle simulation studies (Jiang et al 2016 Nucl. Fusion 56 126017, Peng et al 2018 Nucl. Fusion 58 026007) on the electrical gas breakdown in a simple one-dimensional periodic slab geometry. We show that their observations on the effects of the ambipolar electric fields during the breakdown, such as the sudden reversal of the ion flow direction, could not be real physical phenomena but resulting from numerical artifacts violating the momentum conservation law. We show that an incomplete implementation of the direct-implicit scheme can cause the artificial electric fields and plasma transports resulting in fallacies in simulation results. We also discuss that their simple plasma model without considering poloidal magnetic fields seriously mislead the physical mechanism of the electrical gas breakdown because it cannot reflect important dominant plasma dynamics in the poloidal plane (Yoo et al 2018 Nat. Commun. 9 3523).

tokamak↗

Panzer

Panzer is a finite element assembly engine used for research on solving partial differential equations (PDEs). Panzer takes a physics model implemented by a user and creates and populates the linear algrbra objects, such as residuals and Jacobians, for use in implicit finite element methods. Panzer can be considered "glue code" that pulls together the capabilities of a number of open-source Trilinos packages (Epetra, Intrepid, Sacado, FEI, and Phalanx). This code provides a generic framework for describing a set of partial differential equations. Panzer provides a simple example driver that solves the undergraduate textbook partial differential equation of heat transfer in a solid (see for example, "Transport Phenomena" by Bird Stewart, and Lightfoot 1960). Panzer is intended as a tool to simplify the use of the discretization tools in Trilinos (Intrepid and Phalanx) and is meant to aid in fundamental research on discretizations. Panzer will be released open-source as a package in Trilinos under a BSD license.

Pawlowski, Roger↗

Tusas, Version 1.0

Tusas is a general / flexible software framework for solving coupled systems of onlinear partial differential equations. Tusas was originally developed for phase-field simulation of solidification. In order for Tusas to be effective, the PDEs must be compatible with structured or unstructured Lagrange (nodal) finite element discretizations and explicit (Euler) or implicit (Euler, Trapezoid, BDF2) temporal discretizations.

Newman, ChristopherK.↗

Kinetic Learning vo.1

New synthetic biology capabilities hold the promise of dramatically improving our ability to engineer biological systems. However, a fundamental hurdle in realizing this potential is our inability to accurately predict biological behavior after modifying the corresponding genotype. Kinetic models have traditionally been used to predict pathway dynamics in bioengineered systems, but they take significant time to develop, and rely heavily on domain expertise. This software implements a method to effectively predict pathway dynamics in an automated fashion using a combination of machine learning and abundant multiomics data (proteomics and metabolomics). The new method outperforms a classical kinetic model, and produces qualitative and quantitative predictions that can be used to productively guide bioengineering efforts. This method systematically leverages arbitrary amounts of new data to improve predictions, and does not assume any particular interactions, but rather implicitly chooses the most predictive ones.

Martin, HectorGarcia↗

ExaConstit

The principal purpose of this code is to determine bulk constitutive properties and response of polycrystalline materials. This is a nonlinear quasi-static, implicit solid mechanics code built on the MFEM library based on an updated Lagrangian formulation (velocity based). Within this context, there is flexibility in the type of constitutive model employed, with the code allowing for various UMATs to be interfaced within the code framework or for the use of the ExaCMech library. Using crystal-mechanics-based constitutive models, the code can be used, for example, to compute homogenized response behavior over a polycrystal.

Carson, RobertA↗

SERAC

The purpose of this code is to enable collaborative research in simulation of large deformation structural mechanics. Particularly, it will be used to investigate abstract physics coupling methods and algorithms for implicit solves on emerging computing hardware.

Bramwell, JamieA↗

Tempus v. 1.0

Tempus is a software framework for the time integration of ordinary differential equations (ODEs), partial differential equations (PDEs), and differential-algebraic equations (DAEs). Examples of time-integration methods available are Forward Euler, Backward Euler, Explicit Runge-Kutta and Implicit Runge-Kutta methods. Tempus can be used from small systems of equations (e.g., single ODEs for the time evolution of plasticity models) to large-scale transient simulations requiring exascale computing (e.g., flow fields around reentry vehicles and magneto-hydrodynamics). Tempus will be released as part of Trilinos under a BSD open source license.

Obert, CurtisC.↗

Adaptive Sparse Grid Discretization (ASGarD)

This code solves the Vlasov-Poisson equations in 6-dimensions without approximation. It uses sparse grid discretization to solve the high-dimensional PDEs. The code functions as a discontinuous Galerkin finite element solver. Advantages/benefits include no approximations, supports high-dimensionality, leadership-scale capability, and implicit time advance.

Hahn, Steven [Oak Ridge National Laboratory (ORNL)↗