Search NASA⌕ Search

SEARCH · Search NASA

Results for “advanced algorithms”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Advanced Algorithms for Scrutiny of Mandatory State Reports Declarations to the IAEA (Final Project Report)

The International Atomic Energy Agency (IAEA, or Agency) has an interest in applying machine learning to safeguards problems. However, the lack of machine training data for outside researchers is a significant impediment for progress in including advanced algorithms in safeguards practices. Information about a State’s inventory and movements of nuclear material is highly sensitive, both from a commercial perspective and from a security perspective. States (and commercial entities) do not freely divulge this information, and the IAEA–which receives detailed information from States as accounting reports–considers all information concerning nuclear materials location and composition to be Safeguards Confidential. Even within the Agency, information marked as safeguards confidential can be accessed only on a direct need-to-know basis by those who analyze and summarize the information for that particular State.

97 MATHEMATICS AND COMPUTING↗
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 OSTI2021

An Orthogonal Recursive Bisection (ORB) Based Time Advancement Algorithm for CFD-DEM Solvers

The time integration of the granular phase in coupled computational fluid dynamics (CFD) – discrete element method (DEM) simulations presents a unique computational challenge brought about by the large variations in particle collisional time scales. Particles in the dilute regions of the computational domain can be advanced with large time steps while dense regions require much smaller time increments. However, the time step size in most solvers is globally set as the limit for accuracy and stability imposed by the collisions and is typically orders of magnitude less than that required away from collisions. This work addresses this precise issue and provides a strategy to avoid the use of a global conservative small time step size for the entire set of particles.A novel time stepping algorithm for CFD-DEM solvers using a partitioning approach using orthogonal recursive bisection (ORB) that allows for variable time steps among particles is described and its computational performance is compared against baseline explicit methods, typically used in several CFD-DEM solvers. ORB has advantages of being relatively quick and easy to update incrementally and has the required heuristic behavior (i.e., it will split the region in half with a cluster on each side) when groups of particles are well separated (clustered). The algorithm presented in this work uses a local time stepping approach to resolve collisional time scales for subsets of particles that are present at the leaves of the ORB, thereby resulting in substantial reduction of computational cost. The parallel implementation of this method where a ``knapsack” algorithm is used in tandem with ORB for effective load-balancing is also presented, where a best possible partitioning is obtained based on number of particles and local time-stepping costs. The algorithm is tested against benchmark problems with varying particle distributions that include fluidized bed and riser flow scenarios. Preliminary results indicate that the approach is 2-3X faster than traditional explicit methods for problems that involve both dense and dilute regions, while maintaining the same level of accuracy.

adaptive timestepping↗
DOE OSTI2025

Algorithmic Advancements for High-Order Self-Gravitating Hydrodynamics

Self-gravity plays a key role in the formation and evolution of many astronomical objects. Though gravity is often dominant at large scales, other forces (e.g., gas pressure gradients, radiation, and/or magnetic fields) often compete. It is therefore essential for numerical simulations to evaluate their interplay accurately and robustly. Hanawa & Mullen derived a 4th-order accurate finite volume scheme to solve the equations of self-gravitating hydrodynamics on a uniform Cartesian grid. In this work, we supply improvements to the algorithm that (1) mitigate spurious gravitational circulation and (2) greatly simplify the evaluation of the high order corrections. The proposed algorithm provides the gravitational acceleration (ρg) and the gravitational energy release (ρv · g) as source terms for the hydrodynamic equations, all while preserving conservation of linear momentum. Spurious heating and/or cooling associated with truncation error in the numerical evaluation of the gravitational energy release decreases in proportion to the fourth power of the cell width. We demonstrate fourth order convergence on smooth problems (e.g., 3D inclined sound wave propagation and 3D equilibria). An application test tracks the spherical collapse of a polytrope by an imposed, sudden decrease of the central gas pressure; a bounce and second collapse (associated with a spherical accretion shock) are robustly captured by the high order algorithm.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Advanced Algorithms for Scrutiny of Mandatory State Reports Declarations to the IAEA (Final Project Report)

In compliance with their Comprehensive Safeguards Agreements, based on INFCIRC/153 (corrected) (International Atomic Energy Agency, 1972), States Party to the Treaty on the NonProliferation of Nuclear Weapons (NPT) are obligated to declare to the International Atomic Energy Agency (IAEA) all changes in their nuclear material inventory as well as movement of the material across boundaries of IAEA recognized material balance areas (MBA), inventories and nuclear material balances. This project addresses capabilities to detect irregularities in State reports, thus ensuring their accuracy and completeness, and in the broader context, States’ compliance with safeguards obligations of the NPT. A recent study (Henzl et al., 2022) (lead by this project’s PI) demonstrated how analysis of dynamic correlations in nuclear material movement within the entire fuel cycle of a State (viewed as a single system) can reveal variances consistent with and indicative of “irregular” activities. Expanding on this concept, novel ways to analyze State declarations themselves—again, for the State as a whole entity—will help the IAEA draw accurate safeguards conclusions and trust the validity and authenticity of Stategenerated declaration reports. Introducing new declaration analyses capabilities explored in this project will help to provide credible assurance of both the non-diversion of nuclear material from declared activities and of the absence of undeclared nuclear material and activities in the State in general.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗
DOE OSTI2020

Perspectives on the FESAC transformative enabling capabilities: Priorities, plans, and Status

In early 2017, the Fusion Energy Sciences Advisory Committee (FESAC), an advisory committee to the United States Department of Energy, was charged with identifying transformative enabling capabilities (TECs) “that could promote efficient advance toward fusion energy, building on burning plasma science and technology.” A subcommittee with broad expertise was formed and sought feedback from scientific experts, including experts from outside the fusion community. Three workshops were conducted, and a report was approved by FESAC in 2018 that identified four of the “most promising” TECs: advanced algorithms, high-critical-temperature superconductors, advanced materials and manufacturing, and novel technologies for tritium fuel cycle control. In addition, one “promising” TEC was identified: fast flowing liquid metal plasma-facing components. This paper will give details on the promising TECs and an overview on considerations of these TECs in the United States since the publication of the report.

Lumsdaine, Arnold↗
DOE OSTI2022

Using dorsal surface for individual identification of dairy calves through 3D deep learning algorithms

Advances in machine learning techniques have allowed the development of computer vision systems (CVS) that can accurately predict several phenotypes of interest for livestock operations. In this context, 3D images taken from a top-down view are particularly useful for estimating body condition score, growth development, and body biometrics in cattle. Frequently, such CVS rely on identification (ID) systems, such as electronic tags, as a way to match animal ID and the predicted phenotype. However, the same 3D images used to predict body weight and other animal biometrics could be adopted for animal recognition as well. Such alternative would optimize CVS to recognize animal ID and monitor growth development simultaneously while leveraging the same hardware infrastructure. Furthermore, this strategy could be used to recognize animals with similar color patterns. Nonetheless, growing animals are continuously changing body shape, which could limit its use as an invariant feature for pattern recognition. Thus, the objectives of this study were: (1) to compare algorithms for different 3D object representations to identify individual animals; and (2) to evaluate how short-term changes in body shape due to animal growth affect the predictive performance of these algorithms. For objective 1, the algorithms were trained (n = 4,558) and tested (n = 1,139) using images from 38 Holstein calves. For objective 2, we designed three different experiments using images (n = 2,347) from five Holstein calves taken over six weeks during their growing period, always training and testing on different weeks. Each experiment evaluated how changing a different parameter of the image capturing procedure affected the predictive ability of the trained algorithms. In the first experiment, we varied the total number of images per animal in the training set; in the second experiment, we varied the number of weeks while keeping a fixed number of images in the training set; and in the third experiment, we skipped weeks between images in the training and test sets. The F 1 score for objective (1) was up to 0.804 when testing with the last frames of each video, and up to 0.959 when using random frames for testing. For objective (2), the F 1 score was up to 0.947 for the first experiment when using 130 images per animal; up to 0.979 for the second experiment when using all five weeks; and up to 0.917 when not skipping weeks between training and testing. In conclusion, these results show that deep learning algorithms can be used to identify individual animals through their dorsal area 3D surfaces, and, from our experiments using calves in their growing period, that they are robust enough to account for changes in body shape and size, making them a promising tool for animal recognition during growth.

3D neural networks↗
DOE OSTI2023

pystorms: A simulation sandbox for the development and evaluation of stormwater control algorithms

Advances in cyber–physical technologies have enabled real-time sensing and adaptive control of stormwater infrastructure. These smart stormwater systems allow for inexpensive, minimally-invasive stormwater control interventions in lieu of new construction. Importantly, however promising the area of smart stormwater control, there still remain barriers – for experts and novices alike – to access shared tools and methods for investigating, developing, and contributing to it. In an effort to make smart stormwater control research more methodical and accessible, we present pystorms, an open-source Python-based simulation sandbox that facilitates the quantitative evaluation and comparison of control strategies. pystorms consists of a collection of real world-inspired smart stormwater control scenarios on which any number of control strategies can be applied and tested via an accompanying Python programming interface and coupled stormwater simulator. pystorms provides a framework for the rigorous and efficient evaluation of smart stormwater control methodologies across diverse watersheds with only a few lines of code.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Inferring safety critical events from vehicle kinematics in naturalistic driving environment: Application of deep learning Algorithms

Advances in sensing technology has enabled the collection of countless terabytes of second-by-second kinematics data. Such data provides opportunities for real-time monitoring of driving behavior and identification of safety critical events (SCEs) including crashes and near crashes. The concept of volatility is relevant in this context, which identifies instability and erratic variations in driving behavior prior to involvement in SCEs. This study utilized vehicle kinematics from a large-scale naturalistic driving data to develop a deep learning approach based on 1D convolutional neural networks (CNN) for inferring SCEs. The data are unique in the sense that such accurate pre-crash data at high fidelity are not available in traditional crash repositories. This study contributes to the literature by providing a first attempt at predicting responses to SCEs by developing deep learning-based CNN architectures using novel driving volatility based kinematic thresholds for a sample of 9553 events. The key contribution lies in developing a volatility-based CNN input layout that is acceptable to CNN schemes and represents the motion kinematics such as speed, acceleration and volatility measures. Several 1D-CNN architectures were developed using layers, numbers of convolutions, layer patterns, and kernels. Shallow and deep architectures were tested, revealing higher accuracy of shallow architectures in detecting SCEs. The optimal number of epochs were identified using an early stopping method while the CNN performance was improved by increasing the number of epochs. The ensemble CNN had the highest predictive accuracy of 95.6% for detection of crashes and near crashes, which was 2.5% higher than the optimal CNN using 20% hold out test data. The ensemble CNN also outperformed classical machine learning models and model performance reported in past studies on detection of SCEs. Finally, these results have implications for identification of safety hotspots and providing real-time alerts and warnings in connected and highly automated vehicle environment including society of automotive engineers levels 3–5.

42 ENGINEERING↗
DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Performance Evaluation of an Advanced Distributed Energy Resource Management Algorithm

This paper presents performance evaluation of a new distributed energy resource management system (DERMS) algorithm via an advanced hardware-in-the-loop (HIL) platform. The HIL platform provides realistic testing in a laboratory environment, including the accurate modeling of sub-transmission and distribution networks, the DERMS software controller, and 84 power hardware solar photovoltaic (PV) inverters, standard communication protocols, and a capacitor bank controller. The DERMS algorithm is also called, Grid-Optimization of Solar (GO-Solar) platform which includes predictive state estimation (PSE) and online multiple objective optimization (OMOO) to dispatch the legacy devices and distributed energy resources (e.g., PV). The voltage regulation performance is evaluated under three scenarios, volt-var smart inverter (baseline), and DERMS control for 100% and 30% of PV. The results show that controlling 30% of PV systems with the GO-Solar platform may provide the best balance of control performance and implementation cost.

distributed energy resource management system (DER↗
DOE OSTI2022

Advanced Inversion Algorithms for Scientific Data Analysis [Slides]

Accurate subsurface characterization is crucial for all subsurface energy exploration. Accurate characterization of uncertain subsurface properties is also critical for monitoring storage of CO 2 , estimating pathways of subsurface contaminant transport, and monitoring potential nuclear explosions for treaty verification. This research will advance our world-leading subsurface sensing capabilities that are crucial for LANL missions in energy security (geothermal energy, oil/gas resource exploration, geologic carbon storage) and nuclear security (facility monitoring, detonation detection).

47 OTHER INSTRUMENTATION↗
DOE OSTI2021

Algorithm-Driven Advances for Scientific CT Instruments: From model-based to deep learning-based approaches

Multiscale 3D characterization is widely used by materials scientists to further their understanding of the relationships between microscopic structure and macroscopic function. Scientific computed tomography (SCT) instruments are one of the most popular choices for 3D nondestructive characterization of materials at length scales ranging from the angstrom scale to the micron scale. These instruments typically have a source of radiation (such as electrons, X-rays, or neutrons) that interacts with the sample to be studied and a detector assembly to capture the result of this interaction (see Figure 1 ). A collection of such high-resolution measurements is made by reorienting the sample, which is mounted on a specially designed stage/holder after which reconstruction algorithms are used to produce the final 3D volume of interest. The specific choice of which instrument to use depends on the desired resolution and properties of the materials being imaged. Additionally, the end goal of SCT scans includes determining the morphology, chemical composition, or dynamic behavior of materials when subjected to external stimuli. In summary, SCT instruments are powerful tools that enable 3D characterization across multiple length scales and play a critical role in furthering the understanding of the structure–function relationships of different materials.

42 ENGINEERING↗