Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “multiple time stepping”

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 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Accurate assessment of land–atmosphere coupling in climate models requires high-frequency data output

Land–atmosphere (L–A) interactions are important for understanding convective processes, climate feedbacks, the development and perpetuation of droughts, heatwaves, pluvials, and other land-centered climate anomalies. Local L–A coupling (LoCo) metrics capture relevant L–A processes, highlighting the impact of soil and vegetation states on surface flux partitioning and the impact of surface fluxes on boundary layer (BL) growth and development and the entrainment of air above the BL. A primary goal of the Climate Process Team in the Coupling Land and Atmospheric Subgrid Parameterizations (CLASP) project is parameterizing and characterizing the impact of subgrid heterogeneity in global and regional Earth system models (ESMs) to improve the connection between land and atmospheric states and processes. A critical step in achieving that aim is the incorporation of L–A metrics, especially LoCo metrics, into climate model diagnostic process streams. However, because land–atmosphere interactions span timescales of minutes (e.g., turbulent fluxes), hours (e.g., BL growth and decay), days (e.g., soil moisture memory), and seasons (e.g., variability in behavioral regimes between soil moisture and latent heat flux), with multiple processes of interest happening in different geographic regions at different times of year, there is not a single metric that captures all the modes, means, and methods of interaction between the land and the atmosphere. And while monthly means of most of the LoCo-relevant variables are routinely saved from ESM simulations, data storage constraints typically preclude routine archival of the hourly data that would enable the calculation of all LoCo metrics. Here, we outline a reasonable data request that would allow for adequate characterization of sub-daily coupling processes between the land and the atmosphere, preserving enough sub-daily output to describe, analyze, and better understand L–A coupling in modern climate models. A secondary request involves embedding calculations within the models to determine mean properties in and above the BL to further improve characterization of model behavior. Higher-frequency model output will (i) allow for more direct comparison with observational field campaigns on process-relevant timescales, (ii) enable demonstration of inter-model spread in L–A coupling processes, and (iii) aid in targeted identification of sources of deficiencies and opportunities for improvement of the models.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Algorithm advances and applications of time‐dependent first‐principles simulations for ultrafast dynamics

Abstract Far from equilibrium phenomenon is a central theme of contemporary material research. Such phenomenon can exhibit itself in atomic structure and dynamics, but very often it also happens as non‐equilibrium phenomenon in the electronic structure. In ab initio material simulation, density functional theory (DFT) has played an essential role in studying electronic ground state problems. For excited states, besides many‐body perturbation theory, another powerful tool is the time dependent DFT (TDDFT) method. In particular, the real‐time TDDFT (rt‐TDDFT) method can be used to simulate many non‐equilibrium phenomena directly. Here we introduce our works on some algorithm advances based on our recently rt‐TDDFT method. This method uses the plane‐wave basis set, and significantly accelerates its efficiency by increasing the time step from 0.1–1 as in traditional methods to 0.2–0.5 fs. The noncollinear magnetic moments and spin–orbit coupling have also been included in our rt‐TDDFT method. Furthermore, a Boltzmann‐TDDFT algorithm has been developed to solve the hot carrier overheating problem in Ehrenfest dynamics, and a natural orbital branching algorithm has been developed to overcome the mean‐field approximation in Ehrenfest dynamics nuclear trajectory, thus allows stochastic multiple paths in chemical reactions. Utilizing these methods, we have studied the photoinduced ultrafast demagnetization, ultrafast phase transition, energy transfer between plasmon and hot carriers, as well as the high‐energy ion implantation and low‐energy atomic diffusion in semiconductors. We believe the tools as the ones introduced here can enable us to study a wide range of phenomena which are of great interest in modern day material research. This article is categorized under: Structure and Mechanism > Computational Materials Science Electronic Structure Theory > Ab Initio Electronic Structure Methods Electronic Structure Theory > Density Functional Theory

Liu, Wen‐Hao↗
DOE OSTI2025

On the numerical sensitivity of cellular automata grain structure predictions to large thermal gradients and cooling rates

Cellular automata (CA) models of as-solidified grain structure, originally developed and applied to casting, have become a common means of predicting grain structure resulting from Additive Manufacturing (AM) processes. The majority of these models are based on the decentered octahedron approach, which attempts to correct for the effect of grid anisotropy on the prediction of competitive solidification of dendritic grains. However, AM solidification occurs under cooling rates ($\dot{T}$) and thermal gradients (G) that are orders of magnitude larger than those encountered in casting, and no systematic investigation on the effect of the CA model cell size (Δx) and time step (Δt) on AM microstructure predictions has been performed. Here, in this study, such an investigation is first performed via simulation of individual grains of various crystallographic orientations with a fixed, unidirectional G, showing that CA prediction of the steady-state undercooling matched the expected values based on the interfacial response function at small G and deviated from the expected values at large G. Simulation of competitive growth of multiple grains showed a weakening of the predicted texture as G and Δx became large. Simulation of solidification under AM conditions, where G and $\dot{T}$ vary spatially across the melt pools, showed that not only does grain selection weaken and deviate from expectations at large Δx, but grains with crystallographic $\langle$100$\rangle$ aligned with the grid directions are more adversely affected by the temperature field discontinuities than grains with other crystallographic orientations. Despite the fact that the exact grain competition results depended on Δt, the overall texture development was notably less sensitive to Δt than Δx, provided that a reasonable value of Δt is selected based on the ratio of Δx to the maximum local solidification velocity in the simulation domain. Finally, from the directional solidification and AM simulation results, an analysis of computational cost compared to simulation resolution is performed based on an equation derived to quantify the relatively inaccuracy in grain selection based on the model and temperature field inputs. From this analysis, it is concluded that there is a need for algorithmic improvements to improve CA grain competition accuracy for large G processing conditions as sufficiently small Δx to resolve the necessary competition is intractable for many AM processing conditions.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Efficient Mixed-Precision Matrix Factorization of the Inverse Overlap Matrix in Electronic Structure Calculations with AI-Hardware and GPUs

In recent years, a new kind of accelerated hardware has gained popularity in the artificial intelligence (AI) community which enables extremely high-performance tensor contractions in reduced precision for deep neural network calculations. In this article, we exploit Nvidia Tensor cores, a prototypical example of such AI-hardware, to develop a mixed precision approach for computing a dense matrix factorization of the inverse overlap matrix in electronic structure theory, S –1 . This factorization of S –1 , written as ZZT = S –1 , is used to transform the general matrix eigenvalue problem into a standard matrix eigenvalue problem. Here we present a mixed precision iterative refinement algorithm where Z is given recursively using matrix–matrix multiplications and can be computed with high performance on Tensor cores. To understand the performance and accuracy of Tensor cores, comparisons are made to GPU-only implementations in single and double precision. Additionally, we propose a nonparametric stopping criteria which is robust in the face of lower precision floating point operations. The algorithm is particularly useful when we have a good initial guess to Z, for example, from previous time steps in quantum-mechanical molecular dynamics simulations or from a previous iteration in a geometry optimization.

36 MATERIALS SCIENCE↗
NASA NTRS1984

Multiple steady states for characteristic initial value problems

The time dependent, isentropic, quasi-one-dimensional equations of gas dynamics and other model equations are considered under the constraint of characteristic boundary conditions. Analysis of the time evolution shows how different initial data may lead to different steady states and how seemingly anamolous behavior of the solution may be resolved. Numerical experimentation using time consistent explicit algorithms verifies the conclusions of the analysis. The use of implicit schemes with very large time steps leads to erroneous results.

Salas, M. D.↗
DOE OSTI2022

Fast and scalable quantum Monte Carlo simulations of electron-phonon models

We introduce methodologies for highly scalable quantum Monte Carlo simulations of electron-phonon models, and report benchmark results for the Holstein model on the square lattice. The determinant quantum Monte Carlo (DQMC) method is a widely used tool for simulating simple electron-phonon models at finite temperatures, but incurs a computational cost that scales cubically with system size. Alternatively, near-linear scaling with system size can be achieved with the hybrid Monte Carlo (HMC) method and an integral representation of the Fermion determinant. Here, we introduce a collection of methodologies that make such simulations even faster. To combat "stiffness" arising from the bosonic action, we review how Fourier acceleration can be combined with time-step splitting. To overcome phonon sampling barriers associated with strongly-bound bipolaron formation, we design global Monte Carlo updates that approximately respect particle-hole symmetry. To accelerate the iterative linear solver, we introduce a preconditioner that becomes exact in the adiabatic limit of infinite atomic mass. Finally, we demonstrate how stochastic measurements can be accelerated using fast Fourier transforms. Here, these methods are all complementary and, combined, may produce multiple orders of magnitude speedup, depending on model details.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

A Block-Based Triangle Counting Algorithm on Heterogeneous Environments

Triangle counting is a fundamental building block in graph algorithms. In this article, we propose a block-based triangle counting algorithm to reduce data movement during both sequential and parallel execution. Our block-based formulation makes the algorithm naturally suitable for heterogeneous architectures. The problem of partitioning the adjacency matrix of a graph is well-studied. Our task decomposition goes one step further: it partitions the set of triangles in the graph. By streaming these small tasks to compute resources, we can solve problems that do not fit on a device. We demonstrate the effectiveness of our approach by providing an implementation on a compute node with multiple sockets, cores and GPUs. The current state-of-the-art in triangle enumeration processes the Friendster graph in 2.1 seconds, not including data copy time between CPU and GPU. Using that metric, our approach is 20 percent faster. When copy times are included, our algorithm takes 3.2 seconds. This is 5.6 times faster than the fastest published CPU-only time.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A Block-Based Triangle Counting Algorithm on Heterogeneous Environments

Triangle counting is a fundamental building block in graph algorithms. In this paper, we propose a block-based triangle counting algorithm to reduce data movement during both sequential and parallel execution. Our block-based formulation makes the algorithm naturally suitable for heterogeneous architectures. The problem of partitioning the adjacency matrix of a graph is well-studied. Our task decomposition goes one step further: it partitions the set of triangles in the graph. By streaming these small tasks to compute resources, we can solve problems that do not fit on a device. We demonstrate the effectiveness of our approach by providing an implementation on a compute node with multiple sockets, cores and GPUs. The current state-of-the-art in triangle enumeration processes the Friendster graph in 2.1 seconds, not including data copy time between CPU and GPU. Using that metric, our approach is 20 percent faster. When copy times are included, our algorithm takes 3.2 seconds. This is 5.6 times faster than the fastest published CPU-only time.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2003

Performance Characteristics of the Multi-Zone NAS Parallel Benchmarks

We describe a new suite of computational benchmarks that models applications featuring multiple levels of parallelism. Such parallelism is often available in realistic flow computations on systems of grids, but had not previously been captured in bench-marks. The new suite, named NPB Multi-Zone, is extended from the NAS Parallel Benchmarks suite, and involves solving the application benchmarks LU, BT and SP on collections of loosely coupled discretization meshes. The solutions on the meshes are updated independently, but after each time step they exchange boundary value information. This strategy provides relatively easily exploitable coarse-grain parallelism between meshes. Three reference implementations are available: one serial, one hybrid using the Message Passing Interface (MPI) and OpenMP, and another hybrid using a shared memory multi-level programming model (SMP+OpenMP). We examine the effectiveness of hybrid parallelization paradigms in these implementations on three different parallel computers. We also use an empirical formula to investigate the performance characteristics of the multi-zone benchmarks.

Jin, Haoqiang↗
NASA NTRS1998

Finite Element and Plate Theory Modeling of Acoustic Emission Waveforms

A comparison was made between two approaches to predict acoustic emission waveforms in thin plates. A normal mode solution method for Mindlin plate theory was used to predict the response of the flexural plate mode to a point source, step-function load, applied on the plate surface. The second approach used a dynamic finite element method to model the problem using equations of motion based on exact linear elasticity. Calculations were made using properties for both isotropic (aluminum) and anisotropic (unidirectional graphite/epoxy composite) materials. For simulations of anisotropic plates, propagation along multiple directions was evaluated. In general, agreement between the two theoretical approaches was good. Discrepancies in the waveforms at longer times were caused by differences in reflections from the lateral plate boundaries. These differences resulted from the fact that the two methods used different boundary conditions. At shorter times in the signals, before reflections, the slight discrepancies in the waveforms were attributed to limitations of Mindlin plate theory, which is an approximate plate theory. The advantages of the finite element method are that it used the exact linear elasticity solutions, and that it can be used to model real source conditions and complicated, finite specimen geometries as well as thick plates. These advantages come at a cost of increased computational difficulty, requiring lengthy calculations on workstations or supercomputers. The Mindlin plate theory solutions, meanwhile, can be quickly generated on personal computers. Specimens with finite geometry can also be modeled. However, only limited simple geometries such as circular or rectangular plates can easily be accommodated with the normal mode solution technique. Likewise, very limited source configurations can be modeled and plate theory is applicable only to thin plates.

Prosser, W. H.↗
NASA NTRS1992

GRAPEVINE: Grids about anything by Poisson's equation in a visually interactive networking environment

A proven 3-D multiple-block elliptic grid generator, designed to run in 'batch mode' on a supercomputer, is improved by the creation of a modern graphical user interface (GUI) running on a workstation. The two parts are connected in real time by a network. The resultant system offers a significant speedup in the process of preparing and formatting input data and the ability to watch the grid solution converge by replotting the grid at each iteration step. The result is a reduction in user time and CPU time required to generate the grid and an enhanced understanding of the elliptic solution process. This software system, called GRAPEVINE, is described, and certain observations are made concerning the creation of such software.

Sorenson, Reese L.↗
NASA NTRS2008

ATHLETE's Feet: Mu1ti-Resolution Planning for a Hexapod Robot

ATHLETE is a large six-legged tele-operated robot. Each foot is a wheel; travel can be achieved by walking, rolling, or some combination of the two. Operators control ATHLETE by selecting parameterized commands from a command dictionary. While rolling can be done efficiently with a single command, any motion involving steps is cumbersome - walking a few meters through difficult terrain can take hours. Our goal is to improve operator efficiency by automatically generating sequences of motion commands. There is increasing uncertainty regarding ATHLETE s actual configuration over time and decreasing quality of terrain data farther away from the current position. This, combined with the complexity that results from 36 degrees of kinematic freedom, led to an architecture that interleaves planning and execution at multiple levels, ranging from traditional configuration space motion planning algorithms for immediate moves to higher level task and path planning algorithms for overall travel. The modularity of the architecture also simplifies the development process and allows the operator to interact with and control the system at varying levels of autonomy depending on terrain and need.

Smith, Tristan B.↗
NASA NTRS2018

Command and Control Software Development

The future of the National Aeronautics and Space Administration (NASA) depends on its innovation and efficiency in the coming years. With ambitious goals to reach Mars and explore the vast universe, correct steps must be taken to ensure our space program reaches its destination safely. The interns in the Exploration Systems and Operations Division at the Kennedy Space Center (KSC) have been tasked with building command line tools to ease the process of managing and testing the data being produced by the ground control systems while its recording system is not in use. While working alongside full-time engineers, we were able to create multiple programs that reduce the cost and time it takes to test the subsystems that launch rockets to outer space.

Wallace, Michael↗
DOE OSTI2020

Sensor Fusion: Comprehensive Real-Time, On-Line Monitoring for Process Control via Visible, Near-Infrared, and Raman Spectroscopy

On-line monitoring based on optical spectroscopy provides unprecedented insight into the chemical composition of process streams or batches. Amplifying this approach through utilizing multiple forms of optical spectroscopy in sensor fusion can greatly expand the number and type of chemical species that can be identified and quantified. This is demonstrated herein, on the analysis of used nuclear fuel recycling streams: highly complex processes with multiple target and interfering analytes. The optical techniques of visible absorbance, near infrared absorbance, and Raman spectroscopy were combined to quantify plutonium (III, IV, VI), uranium (IV, VI), neptunium (IV, V, VI), and nitric acid. Chemometric modeling was used to quantify analytes in process streams in real-time and results were successfully used to enable immediate process control and generation of a product stream at a set composition ratio. This represents a significant step forward in the ability to monitor and control complex chemical processes occurring in harsh chemical environments.

47 OTHER INSTRUMENTATION↗
NASA NTRS1999

Performance and Application of Parallel OVERFLOW Codes on Distributed and Shared Memory Platforms

The presentation discusses recent studies on the performance of the two parallel versions of the aerodynamics CFD code, OVERFLOW_MPI and _MLP. Developed at NASA Ames, the serial version, OVERFLOW, is a multidimensional Navier-Stokes flow solver based on overset (Chimera) grid technology. The code has recently been parallelized in two ways. One is based on the explicit message-passing interface (MPI) across processors and uses the _MPI communication package. This approach is primarily suited for distributed memory systems and workstation clusters. The second, termed the multi-level parallel (MLP) method, is simple and uses shared memory for all communications. The _MLP code is suitable on distributed-shared memory systems. For both methods, the message passing takes place across the processors or processes at the advancement of each time step. This procedure is, in effect, the Chimera boundary conditions update, which is done in an explicit "Jacobi" style. In contrast, the update in the serial code is done in more of the "Gauss-Sidel" fashion. The programming efforts for the _MPI code is more complicated than for the _MLP code; the former requires modification of the outer and some inner shells of the serial code, whereas the latter focuses only on the outer shell of the code. The _MPI version offers a great deal of flexibility in distributing grid zones across a specified number of processors in order to achieve load balancing. The approach is capable of partitioning zones across multiple processors or sending each zone and/or cluster of several zones into a single processor. The message passing across the processors consists of Chimera boundary and/or an overlap of "halo" boundary points for each partitioned zone. The MLP version is a new coarse-grain parallel concept at the zonal and intra-zonal levels. A grouping strategy is used to distribute zones into several groups forming sub-processes which will run in parallel. The total volume of grid points in each group are approximately balanced. A proper number of threads are initially allocated to each group, and in subsequent iterations during the run-time, the number of threads are adjusted to achieve load balancing across the processes. Each process exploits the multitasking directives already established in Overflow.

Djomehri, M. Jahed↗
DOE OSTI2021

User Role Identification in Software Vulnerability Discussions over Social Networks

Understanding and early awareness of software vulnerabilities is vital for preventing and mitigating potential impacts from cybersecurity events. One step toward early characterization of software vulnerabilities may involve analyzing discussion and spread of information in online social networks. Prior work has used information from such discussions over multiple online forums to develop dynamic networks among users followed by analysis of structure, spread, and information evolution. In this work, we advance the state-of-the-art by focusing on data-driven learning of types, roles, and transition of roles exhibited by users over time. In social networks, users take on particular roles based on their actions and structure of the network. Identifying “meaningful” roles can help separate potential users of interest from the larger community, and identify patterns in a network. We will identify and compare roles found in online forums (e.g., Twitter) using techniques such as feature-based Non-negative Matrix Factorization coupled with topological and influence-based measures of centrality. Since users’ activities change over time, we also analyze role evolution in dynamic networks.

Jones, Rebecca D.↗
DOE OSTI2022

Super-Resolution Approaches in Three-Dimensions for Classification and Screening of Commercial-Off-The-Shelf Components

X-ray computed tomography is generally a primary step in characterization of defective electronic components, but is generally too slow to screen large lots of components. Super-resolution imaging approaches, in which higher-resolution data is inferred from lower-resolution images, have the potential to substantially reduce collection times for data volumes accessible via x-ray computed tomography. Here we seek to advance existing two-dimensional super-resolution approaches directly to three-dimensional computed tomography data. Multiple scan resolutions over a half order of magnitude of resolution were collected for four classes of commercial electronic components to serve as training data for a deep-learning, super-resolution network. A modular python framework for three-dimensional super-resolution of computed tomography data has been developed and trained over multiple classes of electronic components. Initial training and testing demonstrate the vast promise for these approaches, which have the potential for more than an order of magnitude reduction in collection time for electronic component screening.

47 OTHER INSTRUMENTATION↗
NASA NTRS1992

Large eddy simulation of compressible turbulent channel flows

The development of turbulence within rocket propulsion chamber flows remains a difficult problem to predict. Within solid propellant rockets, the flow can exhibit multiple regions of transition to turbulence, and is susceptible to various modes of aero-acoustic interaction. The objective is to formulate, develop, and validate, a large eddy simulation (LES) method for compressible channel flows. The LES method separates the resolvable scale motions from the unresolvable scales by applying a spatial filter to the compressible Navier-Stokes equations. The equations are solved numerically using a modified four-step Runge-Kutta procedure in time and second or fourth order finite differences in space. The current simulations have validated the algorithm in the incompressible limit and have demonstrated the ability of the method to simulate high subsonic Mach number flows.

Beddini, Robert A.↗