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,801 records · Page 100
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

An Adaptive Tracking Algorithm for Convection in Simulated and Remote Sensing Data

A robust and computationally efficient object tracking algorithm is developed by incorporating various tracking techniques. Physical properties of the objects, such as brightness temperature or reflectivity, are not considered. Therefore, the algorithm is adaptable for tracking convection-like features in simulated data and remotely sensed two-dimensional images. In this algorithm, a first guess of the motion, estimated using the Fourier phase shift, is used to predict the candidates for matching. A disparity score is computed for each target–candidate pair. The disparity also incorporates overlapping criteria in the case of large objects. Then the Hungarian method is applied to identify the best pairs by minimizing the global disparity. The high-disparity pairs are unmatched, and their target and candidate are declared expired and newly initiated objects, respectively. They are tested for merger and split on the basis of their size and overlap with the other objects. The sensitivity of track duration is shown for different disparity and size thresholds. The report highlights the algorithm’s ability to study convective life cycles using radar and simulated data over Darwin, Australia. The algorithm skillfully tracks individual convective cells (a few pixels in size) and large convective systems. The duration of tracks and cell size are found to be lognormally distributed over Darwin. The evolution of size and precipitation types of isolated convective cells is presented in the Lagrangian perspective. This algorithm is part of a vision for a modular platform [viz., TINT is not TITAN (TINT) and Tracking and Object-Based Analysis of Clouds (tobac)] that will evolve into a sustainable choice to analyze atmospheric features.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2018

Large-scale GW calculations on pre-exascale HPC systems

The ab initio GW approach is a rigorous Green’s-function-based framework that can be employed to compute electronic excitation properties of a wide variety of materials such as extended systems, molecules, as well as confined and nanostructured materials with a very satisfactory accuracy. However, GW calculations on complex systems are often hindered by the high computational cost associated with the method. Here, in this study, we demonstrate how to significantly speedup GW calculations with a novel algorithm for the computationally intense kernel based on a non-blocking chunked cyclic communication scheme that minimizes latency in MPI messages, allows for overlapping of communication and computation, and improves cache usage in matrix multiplication operations. The optimized version of the code, implemented in the BerkeleyGW software package, is capable of scaling well to the full Cori computer at NERSC (Cray XC40) and achieves over 11 Peta FLOP/s of sustained performance. We showcase our work by performing large-scale GW calculations of defect structures on silicon, which require simulation cells containing over 1700 atoms, and which can now be efficiently executed in just a few minutes on large pre-exascale high-performance computing systems.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1984

The evaluation of failure detection and isolation algorithms for restructurable control

Three failure detection and identification techniques were compared to determine their usefulness in detecting and isolating failures in an aircraft flight control system; excluding sensor and flight control computer failures. The algorithms considered were the detection filter, the Generalized Likelihood Ratio test and the Orthogonal Series Generalized Likelihood Ratio test. A modification to the basic detection filter is also considered which uses secondary filtering of the residuals to produce unidirectional failure signals. The algorithms were evaluated by testing their ability to detect and isolate control surface failures in a nonlinear simulation of a C-130 aircraft. It was found that failures of some aircraft controls are difficult to distinguish because they have a similar effect on the dynamics of the vehicle. Quantitative measures for evaluating the distinguishability of failures are considered. A system monitoring strategy for implementing the failure detection and identification techniques was considered. This strategy identified the mix of direct measurement of failures versus the computation of failure necessary for implementation of the technology in an aircraft system.

Motyka, P.↗
NASA NTRS1993

The development of a scalable parallel 3-D CFD algorithm for turbomachinery

Two algorithms capable of computing a transonic 3-D inviscid flow field about rotating machines are considered for parallel implementation. During the study of these algorithms, a significant new method of measuring the performance of parallel algorithms is developed. The theory that supports this new method creates an empirical definition of scalable parallel algorithms that is used to produce quantifiable evidence that a scalable parallel application was developed. The implementation of the parallel application and an automated domain decomposition tool are also discussed.

Luke, Edward Allen↗
NASA NTRS2006

Bioinformatics for Exploration

For the purpose of this paper, bioinformatics is defined as the application of computer technology to the management of biological information. It can be thought of as the science of developing computer databases and algorithms to facilitate and expedite biological research. This is a crosscutting capability that supports nearly all human health areas ranging from computational modeling, to pharmacodynamics research projects, to decision support systems within autonomous medical care. Bioinformatics serves to increase the efficiency and effectiveness of the life sciences research program. It provides data, information, and knowledge capture which further supports management of the bioastronautics research roadmap - identifying gaps that still remain and enabling the determination of which risks have been addressed.

Johnson, Kathy A.↗
NASA NTRS2019

Coordinated Turn Trajectory Generation and Tracking Control for Multi-rotors Operating in Urban Environment

The paper presents an efficient trajectory generation and tracking approach for multi-rotor air vehicles operating in urban environment, which takes into account uncertainties in the urban wind field and in the vehicle's parameters. Generated trajectories are sufficiently smooth, based on the differential flatness of the vehicle's dynamics and optimal in the sense of minimum agility and time. They pass through given set of way points, guarantee flight without a side-slip, and satisfy vehicle's dynamics and actuator constraints. In addition, an algorithm is presented to compute the required power to traverse the generated trajectory. Presented algorithms are implementable in real time using on-board computers. They do not take into account the vehicle's existing flight controller, hence there is no guarantee that the controller will be able to provide acceptable tracking of the generated trajectory, especially in the presence of atmospheric disturbances. To this end, we propose an adaptive augmentation algorithm to improve vehicle's performance by taking into account the effects of disturbances and on-line estimates of vehicle's existing flight controller's gains. The algorithms have been verified by simulations using DJI S1000 octocopter's model.

Stepanyan, Vahram↗
NASA NTRS2019

Coordinated Turn Trajectory Generation and Tracking Control for Multi-Rotors Operating in Urban Environment

The paper presents an efficient trajectory generation and tracking approach for multi-rotor air vehicles operating in urban environment, which takes into account uncertainties in the urban wind field and in the vehicle's parameters. Generated trajectories are sufficiently smooth, based on the differential flatness of the vehicle's dynamics and optimal in the sense of minimum agility and time. They pass through given set of way points, guarantee flight without a side-slip, and satisfy vehicle's dynamics and actuators constraints. In addition, an algorithm is presented to compute the required power to traverse the generated trajectory. Presented algorithms are implementable in real time using on-board computers. They do not take into account the vehicle's existing flight controller, hence there is no guarantee that the controller will be able to provide acceptable tracking of the generated trajectory, especially in the presence of atmospheric disturbances. To this end, we propose an adaptive augmentation algorithm to improve vehicle's performance by taking into account the effects of disturbances and on-line estimates of vehicle's existing flight controller's gains. The algorithms have been verified by simulations using DJI S1000 octocopter's model.

Stepanyan, Vahram↗
DOE OSTI2020

The Relationship Between Dose Rate and Decay Heat for Spent Nuclear Fuel Casks

Decay heat and dose rate are two important limits used for determining the allowable contents of spent fuel (SNF) in dry storage systems and transportation packages. While the decay heat limit is used to maintain fuel cladding integrity and ensure retrievability, dose rates are used to demonstrate compliance with regulatory requirements on radiation protection. Because both dose rate and decay heat result from decay of radioisotopes in SNF, this study is an attempt to examine the relationship between dose rate and decay heat for a given cask design. Dose rates were evaluated for 198 cask configurations, that include various SNF system designs (e.g., storage, transfer, transport), SNF characteristics (e.g., fuel types, burnup, cooling time), and loading maps (e.g., uniform loading, zone loading), while a constant decay heat was maintained. The decay heat was calculated using US Nuclear Regulatory Commission (NRC) Regulatory Guide (RG) 3.54, Revision 2, and verified using ORIGEN sequence within SCALE code system. The ORIGEN outputs were used as source terms in the dose analysis using 198 different configurations. A computer script was developed to calculate the cooling time necessary to achieve a given decay heat for a given enrichment, assembly average burnup, assembly mass, and in-core history using a rootfinder algorithm. Initially the computer script was developed to provide cooling time and burnup calculations directly to the analysis of dose rates and decay heats, so a comparison between Used Nuclear Fuel-Storage Transportation and Disposal Analysis Resource Data System (UNF-ST&DARDS) results and RG3.54 data was made; results are included in the appendix to this document. However, an iterative approach was used to compute cooling time, and its accuracy did not depend on the results of the RG3.54r2 algorithm, although the algorithm was still used. The results of the evaluation presented herein clearly demonstrate that a given decay heat does not correspond to a unique dose rate for a variety of cask and package designs. There is no clear pattern to develop a correlation between decay heat and the source terms. Depending on burnup, enrichment, cask type, and loading pattern, dose rates varied for the exact same decay heat—in some cases by 400% for a given cask. For cases in which decay heat was held constant through selection of the appropriate cooling time, dose rates would decrease with increasing burnup, and in other cases, dose rates would increase. The large variation in dose rates for a constant decay heat indicates that casks loaded based on decay heat—that is allowing any burnup, cooling time, and enrichment combinations that yield the qualified decay heat limit(s) —cannot ensure that an Independent Spent Fuel Storage Installation or a spent fuel transportation package will meet the regulatory limits set forth by the respective regulations, i.e., 10 CFR 72 or 10 CFR 71.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2022

Integrating a ponderomotive guiding center algorithm into a quasi-static particle-in-cell code based on azimuthal mode decomposition

High fidelity modeling of plasma based acceleration (PBA) requires the use of three dimensional, fully nonlinear, and kinetic descriptions based on the particle-in-cell (PIC) method. In PBA an intense particle beam or laser (driver) propagates through a tenuous plasma whereby it excites a plasma wave wake. Three-dimensional PIC algorithms based on the quasi-static approximation (QSA) have been successfully applied to efficiently model the interaction between relativistic charged particle beams and plasma. In a QSA PIC algorithm, the plasma response to a charged particle beam or laser driver is calculated based on forces from the driver and self-consistent forces from the QSA form of Maxwell's equations. These fields are then used to advance the charged particle beam or laser forward by a large time step. Since the time step is not limited by the regular Courant-Friedrichs-Lewy (CFL) condition that constrains a standard 3D fully electromagnetic PIC code, a 3D QSA PIC code can achieve orders of magnitude speedup in performance. Recently, a new hybrid QSA PIC algorithm that combines another speedup technique known as an azimuthal Fourier decomposition has been proposed and implemented. This hybrid algorithm decomposes the electromagnetic fields, charge and current density into azimuthal harmonics and only the Fourier coefficients need to be updated, which can reduce the algorithmic complexity of a 3D code to that of a 2D code. Modeling the laser-plasma interaction in a full 3D electromagnetic PIC algorithm is very computationally expensive due the enormous disparity of physical scales to be resolved. In the QSA the laser is modeled using the ponderomotive guiding center (PGC) approach. We describe how to implement a PGC algorithm compatible for the QSA PIC algorithms based on the azimuthal mode expansion. Here this algorithm permits time steps orders of magnitude larger than the cell size and it can be asynchronously parallelized. Details on how this is implemented into the QSA PIC code that utilizes an azimuthal mode expansion, QPAD, are also described. Benchmarks and comparisons between a fully 3D explicit PIC code (OSIRIS), as well as a few examples related to laser wakefield acceleration, are presented.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1998

Parallel Directionally Split Solver Based on Reformulation of Pipelined Thomas Algorithm

In this research an efficient parallel algorithm for 3-D directionally split problems is developed. The proposed algorithm is based on a reformulated version of the pipelined Thomas algorithm that starts the backward step computations immediately after the completion of the forward step computations for the first portion of lines This algorithm has data available for other computational tasks while processors are idle from the Thomas algorithm. The proposed 3-D directionally split solver is based on the static scheduling of processors where local and non-local, data-dependent and data-independent computations are scheduled while processors are idle. A theoretical model of parallelization efficiency is used to define optimal parameters of the algorithm, to show an asymptotic parallelization penalty and to obtain an optimal cover of a global domain with subdomains. It is shown by computational experiments and by the theoretical model that the proposed algorithm reduces the parallelization penalty about two times over the basic algorithm for the range of the number of processors (subdomains) considered and the number of grid nodes per subdomain.

Povitsky, A.↗
NASA NTRS1991

A special purpose silicon compiler for designing supercomputing VLSI systems

Design of general/special purpose supercomputing VLSI systems for numeric algorithm execution involves tackling two important aspects, namely their computational and communication complexities. Development of software tools for designing such systems itself becomes complex. Hence a novel design methodology has to be developed. For designing such complex systems a special purpose silicon compiler is needed in which: the computational and communicational structures of different numeric algorithms should be taken into account to simplify the silicon compiler design, the approach is macrocell based, and the software tools at different levels (algorithm down to the VLSI circuit layout) should get integrated. In this paper a special purpose silicon (SPS) compiler based on PACUBE macrocell VLSI arrays for designing supercomputing VLSI systems is presented. It is shown that turn-around time and silicon real estate get reduced over the silicon compilers based on PLA's, SLA's, and gate arrays. The first two silicon compiler characteristics mentioned above enable the SPS compiler to perform systolic mapping (at the macrocell level) of algorithms whose computational structures are of GIPOP (generalized inner product outer product) form. Direct systolic mapping on PLA's, SLA's, and gate arrays is very difficult as they are micro-cell based. A novel GIPOP processor is under development using this special purpose silicon compiler.

Venkateswaran, N.↗
NASA NTRS1986

Recent developments in rotary-wing aerodynamic theory

Current progress in the computational analysis of rotary-wing flowfields is surveyed, and some typical results are presented in graphs. Topics examined include potential theory, rotating coordinate systems, lifting-surface theory (moving singularity, fixed wing, and rotary wing), panel methods (surface singularity representations, integral equations, and compressible flows), transonic theory (the small-disturbance equation), wake analysis (hovering rotor-wake models and transonic blade-vortex interaction), limitations on computational aerodynamics, and viscous-flow methods (dynamic-stall theories and lifting-line theory). It is suggested that the present algorithms and advanced computers make it possible to begin working toward the ultimate goal of turbulent Navier-Stokes calculations for an entire rotorcraft.

Johnson, W.↗
DOE OSTI2018

A Fast Scalable Quasi-Static Time Series Analysis Method for PV Impact Studies Using Linear Sensitivity Model

Understanding the impact of distributed photovoltaic (PV) resources on various elements of the distribution feeder is imperative for their cost effective integration. A year-long quasi-static time series (QSTS) simulation at 1-second granularity is often necessary to fully study these impacts. However, the significant computational burden associated with running QSTS simulations is a major challenge to their adoption. In this paper, we propose a fast scalable QSTS simulation algorithm that is based on a linear sensitivity model for estimating voltage-related PV impact metrics of a three-phase unbalanced, nonradial distribution system with various discrete step control elements including tap changing transformers and capacitor banks. Here, the algorithm relies on computing voltage sensitivities while taking into account all the effects of discrete controllable elements in the circuit. Consequently, the proposed sensitivity model can accurately estimate the state of controllers at each time step and the number of control actions throughout the year. For the test case of a real distribution feeder with 2969 buses (5469 nodes), 6 load/PV time series power profiles, and 9 voltage regulating elements including controller delays, the proposed algorithm demonstrates a dramatic time reduction, more than 180 times faster than traditional QSTS techniques.

14 SOLAR ENERGY↗
NASA NTRS1987

Solving very large, sparse linear systems on mesh-connected parallel computers

The implementation of Pan and Reif's Parallel Nested Dissection (PND) algorithm on mesh connected parallel computers is described. This is the first known algorithm that allows very large, sparse linear systems of equations to be solved efficiently in polylog time using a small number of processors. How the processor bound of PND can be matched to the number of processors available on a given parallel computer by slowing down the algorithm by constant factors is described. Also, for the important class of problems where G(A) is a grid graph, a unique memory mapping that reduces the inter-processor communication requirements of PND to those that can be executed on mesh connected parallel machines is detailed. A description of an implementation on the Goodyear Massively Parallel Processor (MPP), located at Goddard is given. Also, a detailed discussion of data mappings and performance issues is given.

Opsahl, Torstein↗
DOE OSTI2025

A New Hybrid Quantum-Classical Algorithm for Solving the Unit Commitment Problem

Solving problems related to planning and operations of large-scale power systems is challenging on classical computers due to their inherent nature as mixed-integer and nonlinear problems. Quantum computing provides new avenues to approach these problems. We develop a hybrid quantum-classical algorithm for the Unit Commitment (UC) problem in power systems which aims at minimizing the total cost while optimally allocating generating units to meet the hourly demand of the power loads. The hybrid algorithm combines a variational quantum algorithm (VQA) with a classical Benders-type heuristic. The resulting algorithm computes approximate solutions to UC in three stages: i) a collection of UC vectors capable meeting the power demand with lowest possible operating costs is generated based on VQA; ii) a classical sequential least squares programming (SLSQP) routine is leveraged to find the optimal power level corresponding to a predetermined number of candidate vectors; iii) in the last stage, the approximate solution of UC along with generating units power level combination is given. To demonstrate the effectiveness of the presented method, three different systems with 3 generating units, 10 generating units, and 26 generating units were tested for different time periods. In addition, convergence of the hybrid quantum-classical algorithm for select time periods is proven out on IonQ's Forte system.

Aboumrad, Willie [IonQ, Inc]↗
DOE OSTI2021

Progress on the National Solar Radiation Data Base (NSRDB): A New DNI Computation

This study introduces a new technique to compute direct normal irradiance (DNI) for improving the National Solar Radiation Data Base (NSRDB). A finite-surface integration algorithm is developed to compute solar radiation in differential solid angles and efficiently infer its contribution to a surface perpendicular to the solar direction. A lookup table of cloud bi-directional transmittance distribution function (BTDF) is developed by use of the discrete ordinates radiative transfer (DISORT) model for possible solar and observing directions and various cloud optical and microphysical properties. In each solar incident direction, DNI is given by the cloud BTDFs from approximately 200 differential solid angles. The simulated DNI is calibrated and evaluated using surface observations at the National Renewable Energy Laboratory's (NREL's) Solar Energy Research Laboratory (SRRL) and the Atmospheric Radiation Measurement (ARM) Southern Great Plains (SGP) facility.

41 EE - Solar Energy Technologies Office (EE-4S)↗
NASA NTRS1986

Viscous compressible flow direct and inverse computation and illustrations

An algorithm for laminar and turbulent viscous compressible two dimensional flows is presented. For the application of precise boundary conditions over an arbitrary body surface, a body-fitted coordinate system is used in the physical plane. A thin-layer approximation of tne Navier-Stokes equations is introduced to keep the viscous terms relatively simple. The flow field computation is performed in the transformed plane. A factorized, implicit scheme is used to facilitate the computation. Sample calculations, for Couette flow, developing pipe flow, an isolated airflow, two dimensional compressor cascade flow, and segmental compressor blade design are presented. To a certain extent, the effective use of the direct solver depends on the user's skill in setting up the gridwork, the time step size and the choice of the artificial viscosity. The design feature of the algorithm, an iterative scheme to correct geometry for a specified surface pressure distribution, works well for subsonic flows. A more elaborate correction scheme is required in treating transonic flows where local shock waves may be involved.

Yang, T. T.↗
DOE OSTI2022

Diagnosing Barren Plateaus with Tools from Quantum Optimal Control

Variational Quantum Algorithms (VQAs) have received considerable attention due to their potential for achieving near-term quantum advantage. However, more work is needed to understand their scalability. One known scaling result for VQAs is barren plateaus, where certain circumstances lead to exponentially vanishing gradients. It is common folklore that problem-inspired ansatzes avoid barren plateaus, but in fact, very little is known about their gradient scaling. In this work we employ tools from quantum optimal control to develop a framework that can diagnose the presence or absence of barren plateaus for problem-inspired ansatzes. Such ansatzes include the Quantum Alternating Operator Ansatz (QAOA), the Hamiltonian Variational Ansatz (HVA), and others. With our framework, we prove that avoiding barren plateaus for these ansatzes is not always guaranteed. Specifically, we show that the gradient scaling of the VQA depends on the degree of controllability of the system, and hence can be diagnosed through the dynamical Lie algebra $\mathfrak{g}$ obtained from the generators of the ansatz. We analyze the existence of barren plateaus in QAOA and HVA ansatzes, and we highlight the role of the input state, as different initial states can lead to the presence or absence of barren plateaus. Taken together, our results provide a framework for trainability-aware ansatz design strategies that do not come at the cost of extra quantum resources. Moreover, we prove no-go results for obtaining ground states with variational ansatzes for controllable system such as spin glasses. Our work establishes a link between the existence of barren plateaus and the scaling of the dimension of $\mathfrak{g}$.

97 MATHEMATICS AND COMPUTING↗

Refine your search to explore more results.