Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer algorithm”

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,171 records · Page 65
All sourcesNASA NTRSDOE OSTI
NASA NTRS2011

An Augmentation of G-Guidance Algorithms

The original G-Guidance algorithm provided an autonomous guidance and control policy for small-body proximity operations that took into account uncertainty and dynamics disturbances. However, there was a lack of robustness in regards to object proximity while in autonomous mode. The modified GGuidance algorithm was augmented with a second operational mode that allows switching into a safety hover mode. This will cause a spacecraft to hover in place until a mission-planning algorithm can compute a safe new trajectory. No state or control constraints are violated. When a new, feasible state trajectory is calculated, the spacecraft will return to standard mode and maneuver toward the target. The main goal of this augmentation is to protect the spacecraft in the event that a landing surface or obstacle is closer or further than anticipated. The algorithm can be used for the mitigation of any unexpected trajectory or state changes that occur during standard mode operations

Carson, John M. III↗
NASA NTRS2025

Generalized Reference Targeting for Spaceflight

For spaceflight programs to achieve some of the aggressive exploration initiatives such as visiting and landing on other celestial bodies, rendezvousing with other orbiting vehicles, and ultimately returning crew safely to Earth, an assortment of targeting algorithms to compute the necessary burns to strategically maneuver a spacecraft to a variety of destinations are required. Numerous examples exist, but rather than creating and implementing multiple targeting solutions, is it possible to have a general targeting model that can accommodate a variety of applications? Originally motivated for mission design and analysis purposes, this paper outlines a generalized reference targeting algorithm for spaceflight that may also have applications in on-orbit flight software. It accommodates arbitrary flight dynamics and both impulsive and finite burns for either absolute or relative targeting applications. It also allows for an arbitrary number of targeting design parameters such as multiple discrete correction burns or finite thrust parameters to satisfy numerous combinations of targeting constraints that can have fixed or variable time epochs. Given a reference trajectory, this targeting technique provides a general framework to quickly solve an assortment of targeting problems that may be well-defined, over-determined, or under-determined while naturally producing metrics providing insight into the controllability for a given problem formulation. Due to the derivation, speed, and accuracy of the algorithm, it lends to supporting rapid linear covariance analysis and robust trajectory design applications for a variety of flight phases such as rendezvous and docking, cislunar transfer, interplanetary flight, orbit maintenance, de-orbit, and powered descent and landing.

Targeting↗
NASA NTRS1990

Recursive dynamics for geared robot manipulators

The authors consider the dynamical modeling of robot manipulators whose joint actuators consist of motors driving the joints through gears. The dynamical models for such manipulators are significantly more complex than those for direct drive manipulators. The authors develop recursive O(n) inverse and forward dynamics algorithms as well as recursive O(n2) algorithms for the computation of the mass matrix for geared manipulators. It is shown that, despite the added complexity of the dynamical models for geared manipulators, the algorithms closely resemble the corresponding algorithms for direct drive manipulators, and that the additional algorithmic or computational complexity is relatively insignificant. As a consequence, with little additional cost, existing direct drive algorithms can be easily extended to handle the effects of gearing at the joints.

Jain, A.↗
DOE OSTI2018

Automatic Imagery Data Analysis for Proactive Computer-Based Workflow Management during Nuclear Power Plant Outages

This report is being submitted for the task “Final Report” of DOE NEUP Project 15-8121 “Automatic Imagery Data Analysis for Proactive Computer-Based Workflow Management during Nuclear Power Plant Outages.” Typical nuclear power plant (NPP) outages always involve thousands of maintenance and refueling activities and a large number of workers in limited workspaces, while having tight schedules and zero-tolerance for accidents. During an outage, thousands of workers will be working in various workspaces across the NPP. High outage costs and expensive delays (approximately 1.5 million dollars of loss per day of delay) in NPP maintenance demand tight outage schedules. In packed workspaces, an automatic system that monitors human behaviors in real-time and provides insights about current and pending schedule deviations from the plan is critical for ensuring: 1) effective collaboration among workers and worker teams from different trades; 2) less waste of time and resources due to the lack of situational awareness; and 3) proactive outage project control. The overall goal of this project is to test the hypothesis that real-time imagery-based object tracking and spatial analysis, as well as human behavior modeling of outage participants, will significantly improve the efficiency of outage control while lowering the rates of accidents and incidents. Three objectives of this project are: 1) Establish real-time object tracking and spatiotemporal analysis methods that automatically assess the productivity of field activities and detect anomalous spatiotemporal relationships among activities that cause inefficiencies and risks; 2) Establish realtime human tracking and human factor modeling methods for automatically diagnosing unexpected actions of and interactions between outage participants, those which cause inefficient collaborations between Advanced Outage Control Center (AOCC), satellite outage centers, NPP workers, and maintenance service providers; and 3) Test the proposed automated object tracking, human behavior modeling, and spatiotemporal analysis methods in outage control case studies in order to characterize the effectiveness of automated imagery-data-driven methods in proactively improving the efficiency and safety of workflows in outage coordination and risk management. Recent studies of detailed human behavior monitoring on construction sites have examined the potential of applying advanced computer vision algorithms in detecting and tracking anomalous workers (i.e., workers who do not wear hard hats or safety vests) for ensuring job site safety. Some studies of human factor studies revealed the importance of modeling detailed interactions between individuals within and across teams in better understanding the impact of human in proactive project control. Other studies in the construction domain have developed computational simulation frameworks that formalize detailed spatiotemporal interactions between tasks in order to simulate the impacts of individual tasks on the performance of workflows. While integrated analyses that combine human factor assessment, as well as image processing and simulation, are in demand for effective decision-making, limited studies have examined the potential of such integrated analyses in NPP outage control. This research project has examined an automatic outage monitoring and control system that integrates human factor analysis, computer vision techniques, and simulation methods in order to enable engineers to better understand the interactions between humans, resources, and workflows during outage processes. The project aims at providing NPP maintenance agencies insights into more efficient use of limited resources in extending the life of a nuclear plant, as well as reducing waste while ensuring sufficient generation of electricity. This study is significant for the safety of nuclear plants, sustainable electricity generation for livable communities, and cost savings for maintaining electricity infrastructures in the United States.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2019

Quantum-classical hybrid algorithm using an error-mitigating N -representability condition to compute the Mott metal-insulator transition

Quantum algorithms for molecular electronic structure have been developed with lower computational scaling than their classical counterparts, but emerging quantum hardware is far from being capable of the coherence, connectivity, and gate errors required for their experimental realization. Here we propose a class of quantumclassical hybrid algorithms that computes the energy from a two-electron reduced density matrix (2-RDM). The 2-RDM is constrained by $N$-representability conditions, constraints for representing an $N$-electron wave function, which mitigate noise from the quantum circuit. We compute the strongly correlated dissociation of doublet H 3 into three hydrogen atoms. The hybrid quantum-classical computer matches the energies from full configuration interaction to 0.1 kcal/mol, one-tenth of “chemical accuracy,” even in the strongly correlated limit of dissociation. Furthermore, the spatial locality of the computed one-electron RDM reveals that the quantum computer accurately predicts the Mott metal-insulator transition.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Computable and Operationally Meaningful Multipartite Entanglement Measures

Multipartite entanglement is an essential resource for quantum communication, quantum computing, quantum sensing, and quantum networks. The utility of a quantum state |ψ$\rangle$ for these applications is often directly related to the degree or type of entanglement present in |ψ$\rangle$. Therefore, efficiently quantifying and characterizing multipartite entanglement is of paramount importance. Here, in this work, we introduce a family of multipartite entanglement measures, called concentratable entanglements. Several well-known entanglement measures are recovered as special cases of our family of measures, and hence we provide a general framework for quantifying multipartite entanglement. We prove that the entire family does not increase, on average, under local operations and classical communications. We also provide an operational meaning for these measures in terms of probabilistic concentration of entanglement into Bell pairs. Finally, we show that these quantities can be efficiently estimated on a quantum computer by implementing a parallelized SWAP test, opening up a research direction for measuring multipartite entanglement on quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1986

Cloud cover estimation using bispectral satellite measurements

An algorithm has been developed for cloud cover estimation using bispectral satellite measurements. Based on the distribution of pixels in albedo-brightness temperature space, a number of threshold values are applied to identify those pixels which are most likely totally cloud filled. Mean cloudy-column albedo in a region much larger than a single pixel is then estimated and cloud cover computed. The algorithm has been applied to the International Satellite Cloud Climatology Project Geostationary Meteorological Satellite B2 data. Locations of tropical convective cells and the passage of fronts in higher latitudes are identified. Since these features represent the states of large-scale atmospheric circulations, it is concluded that the algorithm can yield consistent cloud data sets useful for climate studies.

Chou, M.-D.↗
DOE OSTI2018

Microstructure Characterization and Modeling for Improved Electrode Design

As part of DOE's Computer-Aided Engineering of Batteries Program, the National Renewable Energy Laboratory is developing detailed models capturing the influence of lithium-ion battery electrode design, recipe and processing on the electrode's microstructure and relating that microstructure to device-level performance. Given the difficulty in obtaining 3D microstructural images of the electrode's inert components, team member Purdue University developed an algorithm to computationally generate the so-called carbon-binder domain (CBD) for any given recipe. Mesoscale models explore the device-level impact of the CBD phase on multiple idealized and actual electrode geometries. With the inclusion of this CBD phase, microstructure models are used to predict the tortuosity of 14 different graphite and NMC electrode designs. Tortuosity predictions are shown in good agreement with experimental direct measurement and electrochemical rate studies.

25 ENERGY STORAGE↗
DOE OSTI2020

The Locus Algorithm IV: Performance metrics of a grid computing system used to create catalogues of optimised pointings

This paper discusses the requirements for and performance metrics of the the Grid Computing system used to implement the Locus Algorithm to identify optimum pointings for differential photometry of 61,662,376 stars and 23,779 quasars. Initial operational tests indicated a need for a software system to analyse the data and a High Performance Computing system to run that software in a scalable manner. Practical assessments of the performance of the software in a serial computing environment were used to provide a benchmark against which the performance metrics of the HPC solution could be compared, as well as to indicate any bottlenecks in performance. These performance metrics indicated a distinct split in the performance dictated more by differences in the input data than by differences in the design of the systems used. This indicates a need for experimental analysis of system performance, and suggests that algorithmic complexity analyses may lead to incorrect or naive conclusions, especially in systems with high data I/O overhead such as grid computing. Further, it implies that systems which reduce or eliminate this bottleneck such as in-memory processing could lead to a substantial increase in performance.

Creaner, Oisín↗
DOE OSTI2023

Domain Aware Deep-learning Algorithms Integrated with Scientific-computing Technologies (DADAIST)

This technical report summarized the contribution of the DADAIST project funded by the Data Model Convergence Initiative via the Laboratory Directed Research and Development (LDRD) investments at Pacific Northwest National Laboratory (PNNL). Specifically, we report the development of the NeuroMANCER (Neural Modules with Adaptive Nonlinear Constraints and Efficient Regularizations), a new open-source Scientific Machine Learning library for formulating and solving parametric constrained optimization problems, physics-informed system identification, and parametric optimal control problems. NeuroMANCER is using differentiable programming to combine modern data-driven models and optimization modeling language into a coherent algorithmic and software framework. NeuroMANCER is a Pytorch-based framework and adopts much of its philosophy focused on research and development, rapid prototyping, and streamlined deployment. Strong emphasis is given to extensibility, interoperability with the PyTorch ecosystem, and quick adaptability to custom domain problems. Neuromancer repository contains a comprehensive library of differentiable modules, including custom activation functions, matrix factorizations, deep learning architectures, neural differential equations, differential equation solvers, implicit layers such as iterative solvers, high-level API for symbolic expressions, API for modeling and control of dynamical systems, and extensive set of tutorial code examples in the form of python scripts and jupyter notebooks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Randomized Cholesky Preconditioning for Graph Partitioning Applications

A graph is a mathematical representation of a network; we say it consists of a set of vertices, which are connected by edges. Graphs have numerous applications in various fields, as they can model all sorts of connections, processes, or relations. For example, graphs can model intricate transit systems or the human nervous system. However, graphs that are large or complicated become difficult to analyze. This is why there is an increased interest in the area of graph partitioning, reducing the size of the graph into multiple partitions. For example, partitions of a graph representing a social network might help identify clusters of friends or colleagues. Graph partitioning is also a widely used approach to load balancing in parallel computing. The partitioning of a graph is extremely useful to decompose the graph into smaller parts and allow for easier analysis. There are different ways to solve graph partitioning problems. For this work, we focus on a spectral partitioning method which forms a partition based upon the eigenvectors of the graph Laplacian (details presented in Acer, et. al.). This method uses the LOBPCG algorithm to compute these eigenvectors. LOBPCG can be accelerated by an operator called a preconditioner. For this internship, we evaluate a randomized Cholesky (rchol) preconditioner for its effectiveness on graph partitioning problems with LOBPCG. We compare it with two standard preconditioners: Jacobi and Incomplete Cholesky (ichol). This research was conducted from August to December 2021 in conjunction with Sandia National Laboratories.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A Contrast Calibration Protocol for X-ray Speckle Visibility Spectroscopy

X-ray free electron lasers, with their ultrashort highly coherent pulses, opened up the opportunity of probing ultrafast nano- and atomic-scale dynamics in amorphous and disordered material systems via speckle visibility spectroscopy. However, the anticipated count rate in a typical experiment is usually low. Therefore, visibility needs to be extracted via photon statistics analysis, i.e., by estimating the probabilities of multiple photons per pixel events using pixelated detectors. Considering the realistic X-ray detector responses including charge cloud sharing between pixels, pixel readout noise, and gain non-uniformity, speckle visibility extraction relying on photon assignment algorithms are often computationally demanding and suffer from systematic errors. In this paper, we present a systematic study of the commonly-used algorithms by applying them to an experimental data set containing small-angle coherent scattering with visibility levels ranging from below 1% to ∼60%. We also propose a contrast calibration protocol and show that a computationally lightweight algorithm can be implemented for high-speed correlation evaluation.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

Robust Measurements of n -Point Correlation Functions of Driven-Dissipative Quantum Systems on a Digital Quantum Computer

We propose and demonstrate a unified hierarchical method to measure n -point correlation functions that can be applied to driven, dissipative, or otherwise open or nonequilibrium quantum systems. In this method, the time evolution of the system is repeatedly interrupted by interacting an ancilla qubit with the system through a controlled operation, and measuring the ancilla immediately afterward. We discuss the robustness of this method as compared to other ancilla-based interferometric techniques (such as the Hadamard test), and highlight its advantages for near-term quantum simulations of open quantum systems. We implement the method on a quantum computer in order to measure single-particle Green’s functions of a driven-dissipative fermionic system. This Letter shows that dynamical correlation functions for driven-dissipative systems can be robustly measured with near-term quantum computers. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1986

Dynamic remapping of parallel computations with varying resource demands

A large class of computational problems is characterized by frequent synchronization, and computational requirements which change as a function of time. When such a problem must be solved on a message passing multiprocessor machine, the combination of these characteristics lead to system performance which decreases in time. Performance can be improved with periodic redistribution of computational load; however, redistribution can exact a sometimes large delay cost. We study the issue of deciding when to invoke a global load remapping mechanism. Such a decision policy must effectively weigh the costs of remapping against the performance benefits. We treat this problem by constructing two analytic models which exhibit stochastically decreasing performance. One model is quite tractable; we are able to describe the optimal remapping algorithm, and the optimal decision policy governing when to invoke that algorithm. However, computational complexity prohibits the use of the optimal remapping decision policy. We then study the performance of a general remapping policy on both analytic models. This policy attempts to minimize a statistic W(n) which measures the system degradation (including the cost of remapping) per computation step over a period of n steps. We show that as a function of time, the expected value of W(n) has at most one minimum, and that when this minimum exists it defines the optimal fixed-interval remapping policy. Our decision policy appeals to this result by remapping when it estimates that W(n) is minimized. Our performance data suggests that this policy effectively finds the natural frequency of remapping. We also use the analytic models to express the relationship between performance and remapping cost, number of processors, and the computation's stochastic activity.

Nicol, D. M.↗
NASA NTRS1992

Linear system identification via backward-time observer models

Presented here is an algorithm to compute the Markov parameters of a backward-time observer for a backward-time model from experimental input and output data. The backward-time observer Markov parameters are decomposed to obtain the backward-time system Markov parameters (backward-time pulse response samples) for the backward-time system identification. The identified backward-time system Markov parameters are used in the Eigensystem Realization Algorithm to identify a backward-time state-space model, which can be easily converted to the usual forward-time representation. If one reverses time in the model to be identified, what were damped true system modes become modes with negative damping, growing as the reversed time increases. On the other hand, the noise modes in the identification still maintain the property that they are stable. The shift from positive damping to negative damping of the true system modes allows one to distinguish these modes from noise modes. Experimental results are given to illustrate when and to what extent this concept works.

Juang, Jer-Nan↗
DOE OSTI2025

Simulation Center for Runaway Electron Avoidance and Mitigation (SCREAM SciDAC) (Technical Final Report)

Runaway electrons can severely damage the plasma facing components on ITER during a major disruption and pose a major risk for tokamak fusion. It has been recognized that an adequate disruption mitigation system (DMS) is essential for the safe operation of ITER. The United States is responsible for the design and implementation of the disruption mitigation system on ITER, and in July 2016 the Simulation Center for Runaway Electron Avoidance and Mitigation (SCREAM) was launched by DOE, in a joint Fusion Energy Sciences (FES) and Advanced Scientific Computing Research (ASCR) collaboration. SCREAM was a comprehensive theory and simulation SciDAC center that provided physics guidance in the avoidance and mitigation of runaway electrons, and in tandem with domestic and international experiments, helped establish the qualitative and quantitative bases for safe operational scenarios and viable mitigation techniques. The SCREAM center assembled a national team of experts in runaway electron physics, tokamak disruptions, magnetohydrodynamic (MHD) simulation, and advanced algorithms and computing. The team combined advanced simulation and analysis capability facilitated by direct participation of ASCR SciDAC institutes with theoretical models and code development by FES scientists to focus on the runaway risk for ITER and tokamaks in general. The research scope was focussed on integrated simulations of kinetic runaway electrons, including MHD and fluid models of impurity transport, within a research plan guided by theory. The specific research tasks were (1) establish the fundamental physics of runaway generation, saturation, and dynamical evolution in a tokamak; (2) examine the critical path toward runaway avoidance; and (3) investigate the viability and effectiveness of the leading candidate schemes for runaway mitigation. In all three areas, members of the team carried out scoping studies that established the readiness for rapid and critical advances, especially in the deployment and further development of large-to extreme-scale simulation tools. Our multi-pronged computational approach included (1) relativistic Fokker-Planck solvers with discretization in phase space, (2) self-consistent particle-in-cell techniques, (3) particle-based Monte-Carlo, and (4) MHD-particle hybrid simulations. Cross-check between these different methods provided an additional means for verification and further bolstered the fidelity of our physics prediction. Validation against experimental results brings confidence to the predictive capability for ITER and frequently leads to new ideas for understanding and mitigating the thermal quench driven runaway electron phenomenon.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2019

Machine Learning Applied to Star–Galaxy–QSO Classification and Stellar Effective Temperature Regression

In modern astrophysics, machine learning has increasingly gained popularity with its incredibly powerful ability to make predictions or calculated suggestions for large amounts of data. We describe an application of the supervised machine-learning algorithm, random forests (RF), to the star/galaxy/QSO classification and the stellar effective temperature regression based on the combination of Large Sky Area Multi-Object Fiber Spectroscopic Telescope and Sloan Digital Sky Survey spectroscopic data. This combination enables us to obtain reliable predictions with one of the largest training samples ever used. The training samples are built with a nine-color data set of about three million objects for the classification and a seven-color data set of over one million stars for the regression. The performance of the classification and regression is examined with validation and blind tests on the objects in the RAdial Velocity Extension, 6dFGS, UV-bright Quasar Survey and Apache Point Observatory Galactic Evolution Experiment surveys. We demonstrate that RF is an effective algorithm, with classification accuracies higher than 99% for stars and galaxies, and higher than 94% for QSOs. These accuracies are higher than machine-learning results in former studies. The total standard deviations of the regression are smaller than 200 K, which is similar to those of some spectrum-based methods. The machine-learning algorithm with the broad-band photometry provides us with a more efficient approach for dealing with massive amounts of astrophysical data than do traditional color cuts and spectral energy distribution fits.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS2020

Robustness Computation of Dynamic Controllability in Probabilistic Temporal Networks with Ordinary Distributions

Most existing works in Probabilistic Simple Temporal Networks (PSTNs) base their frameworks on well-defined probability distributions. This paper addresses on PSTN Dynamic Controllability (DC) robustness measure, i.e. the execution success probability of a network under dynamic control.We consider PSTNs where the probability distributions of the contingent edges are ordinary distributed (e.g. non-parametric, non-symmetric). We introduce the concepts of dispatching protocol (DP) as well as DP-robustness, the probability of success under a predefined dynamic policy.We propose a fixed-parameter pseudo-polynomial time algorithm to compute the exact DP-robustness of any PSTN under \textit{NextFirst} protocol, and apply to various PSTN datasets, including the real case of planetary exploration in the context of the Mars 2020 rover, and propose an original structural analysis.

Saint-Guillain, Michael↗