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

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↗

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↗

Advanced Algorithms and High-Performance Testbed for Large-Scale Site Characterization and Subsurface Target Detecting Using Airborne Ground Penetrating SAR

A team of US Army Corps of Engineers, Omaha District and Engineering and Support Center, Huntsville, let Propulsion Laboratory (JPL), Stanford Research Institute (SRI), and Montgomery Watson is currently in the process of planning and conducting the largest ever survey at the Former Buckley Field (60,000 acres), in Colorado, by using SRI airborne, ground penetrating, Synthetic Aperture Radar (SAR). The purpose of this survey is the detection of surface and subsurface Unexploded Ordnance (UXO) and in a broader sense the site characterization for identification of contaminated as well as clear areas. In preparation for such a large-scale survey, JPL has been developing advanced algorithms and a high-performance restbed for processing of massive amount of expected SAR data from this site. Two key requirements of this project are the accuracy (in terms of UXO detection) and speed of SAR data processing. The first key feature of this testbed is a large degree of automation and a minimum degree of the need for human perception in the processing to achieve an acceptable processing rate of several hundred acres per day. For accurate UXO detection, novel algorithms have been developed and implemented. These algorithms analyze dual polarized (HH and VV) SAR data. They are based on the correlation of HH and VV SAR data and involve a rather large set of parameters for accurate detection of UXO. For each specific site, this set of parameters can be optimized by using ground truth data (i.e., known surface and subsurface UXOs). In this paper, we discuss these algorithms and their successful application for detection of surface and subsurface anti-tank mines by using a data set from Yuma proving Ground, A7, acquired by SRI SAR.

Fijany, Amir↗

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↗

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↗

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↗

Advanced algorithm for orbit computation

Computational and analytical techniques which simplify the solution of complex problems in orbit mechanics, Astrodynamics and Celestial Mechanics were developed. The major tool of the simplification is the substitution of transformations in place of numerical or analytical integrations. In this way the rather complicated equations of orbit mechanics might sometimes be reduced to linear equations representing harmonic oscillators with constant coefficients.

Szenbehely, V.↗

Retrieving LAI and FPAR from MERIS Data With Advanced Algorithms

The primary motivation of this research activity is to document the feasibility of deriving global fields of LAI (leaf area index) and FPAR (fraction of photosynthetically active radiation absorbed by vegetation) from atmosphere corrected ESA (European Space Agency) MERIS (Medium Resolution Imaging Spectrometer) data, validate and evaluate the MERIS LAI and FPAR products by intercomparison with MODIS (Moderate Resolution Imaging Spectrometer) LAI and FPAR products and with field data collected at the EOS Core sites distributed around the world. Our activities during Year 1 (January through December, 2001) have focused on the modification of the MODIS LAI/FPAR algorithm to facilitate its ability to process MERIS data. We considered a related but wider problem, i.e., fusion of biophysical parameters derived from data acquired by spectroradiometers of different spectral bands and different resolutions.

Myneni, Ranga B.↗

NAS Applications and Advanced Algorithms

This paper examines the applications most commonly run on the supercomputers at the Numerical Aerospace Simulation (NAS) facility. It analyzes the extent to which such applications are fundamentally oriented to vector computers, and whether or not they can be efficiently implemented on hierarchical memory machines, such as systems with cache memories and highly parallel, distributed memory systems.

Bailey, David H.↗

Experimental Validation of Advanced Dispersed Fringe Sensing (ADFS) Algorithm Using Advanced Wavefront Sensing and Correction Testbed (AWCT)

Large aperture telescope commonly features segment mirrors and a coarse phasing step is needed to bring these individual segments into the fine phasing capture range. Dispersed Fringe Sensing (DFS) is a powerful coarse phasing technique and its alteration is currently being used for JWST.An Advanced Dispersed Fringe Sensing (ADFS) algorithm is recently developed to improve the performance and robustness of previous DFS algorithms with better accuracy and unique solution. The first part of the paper introduces the basic ideas and the essential features of the ADFS algorithm and presents the some algorithm sensitivity study results. The second part of the paper describes the full details of algorithm validation process through the advanced wavefront sensing and correction testbed (AWCT): first, the optimization of the DFS hardware of AWCT to ensure the data accuracy and reliability is illustrated. Then, a few carefully designed algorithm validation experiments are implemented, and the corresponding data analysis results are shown. Finally the fiducial calibration using Range-Gate-Metrology technique is carried out and a <10nm or <1% algorithm accuracy is demonstrated.

Dispersed Fringe Sensing (DFS)↗

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↗

Advanced MHD Algorithm for Solar and Space Science: lst Year Semi Annual Progress Report

We report progress for the development of MH4D for the first and second quarters of FY2004, December 29, 2002 - June 6, 2003. The present version of MH4D can now solve the full viscous and resistive MHD equations using either an explicit or a semi-implicit time advancement algorithm. In this report we describe progress in the following areas. During the two last quarters we have presented poster at the EGS-AGU-EUG Joint Assembly in Nice, France, April 6-11, 2003, and a poster at the 2003 International Sherwood Theory Conference in Corpus Christi, Texas, April 28-30 2003. In the area of code development, we have implemented the MHD equations and the semi-implicit algorithm. The new features have been tested.

Schnack, Dalton D.↗