Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithm development”

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,477 records · Page 82
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

SREMI: Super-resolution electromagnetic imaging with single-channel ground-penetrating radar

High-resolution near-surface imaging has important applications in civil engineering, infrastructure inspection, military threat detection, geological characterization, and lunar and planetary exploration. Zero-offset, singlechannel ground penetrating radar (GPR) imaging is an established technique for near-surface target imaging and sensing but often suffers from low spatial resolution and imaging artifacts, especially of deep structures. In response, we formulate the GPR imaging as a dual-sparsity optimization problem, and develop a super-resolution electromagnetic imaging method based on a fast iterative shrinkage-thresholding algorithm. We develop our GPR imaging method in the framework of electromagnetic exploding-reflectors simulation theory, therefore the imaging method is computationally efficient. In this work, we demonstrate through synthetic and field data examples that our method can produce sharper, more reliable images with fewer artifacts compared with single-pass reverse-time migration GPR method, thus leading to improved near-surface interpretation and object identification.

58 GEOSCIENCES↗
DOE OSTI2020

A quantum algorithm for evolving open quantum dynamics on quantum computing devices

Abstract Designing quantum algorithms for simulating quantum systems has seen enormous progress, yet few studies have been done to develop quantum algorithms for open quantum dynamics despite its importance in modeling the system-environment interaction found in most realistic physical models. In this work we propose and demonstrate a general quantum algorithm to evolve open quantum dynamics on quantum computing devices. The Kraus operators governing the time evolution can be converted into unitary matrices with minimal dilation guaranteed by the Sz.-Nagy theorem. This allows the evolution of the initial state through unitary quantum gates, while using significantly less resource than required by the conventional Stinespring dilation. We demonstrate the algorithm on an amplitude damping channel using the IBM Qiskit quantum simulator and the IBM Q 5 Tenerife quantum device. The proposed algorithm does not require particular models of dynamics or decomposition of the quantum channel, and thus can be easily generalized to other open quantum dynamical models.

42 ENGINEERING↗
DOE OSTI2022

Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning

We present an algorithmic framework for quantum-inspired classical algorithms on close-to-low-rank matrices, generalizing the series of results started by Tang’s breakthrough quantum-inspired algorithm for recommendation systems [STOC’19]. Motivated by quantum linear algebra algorithms and the quantum singular value transformation (SVT) framework of Gilyén et al. [STOC’19], we develop classical algorithms for SVT that run in time independent of input dimension, under suitable quantum-inspired sampling assumptions. Our results give compelling evidence that in the corresponding QRAM data structure input model, quantum SVT does not yield exponential quantum speedups. Since the quantum SVT framework generalizes essentially all known techniques for quantum linear algebra, our results, combined with sampling lemmas from previous work, suffice to generalize all prior results about dequantizing quantum machine learning algorithms. In particular, our classical SVT framework recovers and often improves the dequantization results on recommendation systems, principal component analysis, supervised clustering, support vector machines, low-rank regression, and semidefinite program solving. We also give additional dequantization results on low-rank Hamiltonian simulation and discriminant analysis. Our improvements come from identifying the key feature of the quantum-inspired input model that is at the core of all prior quantum-inspired results: ℓ 2 -norm sampling can approximate matrix products in time independent of their dimension. We reduce all our main results to this fact, making our exposition concise, self-contained, and intuitive.

Computer Science↗
NASA NTRS1989

A scheme for fault tolerance in earth sensors

A system is presented that uses dual-redundant earth sensors to measure pitch and roll errors of a three-axis stabilized spacecraft, with provision for (1) autonomously detecting and identifying a faulty earth sensor, and (2) automatically selecting the outputs of the fault-free sensor for closed-loop attitude control, before failures cause major problems. A brief description is given of the system, and various failure modes of earth sensors and their effects are discussed. Novel techniques and algorithms for automatic fault detection, identification, and reconfiguration (FDIR) of dual-redundant earth sensors are developed. The algorithms are validated through computer simulations, and the results are presented. The proposed scheme can easily be implemented without much penalty on hardware, power consumption, and processing time.

Murugesan, S.↗
NASA NTRS1990

Advanced detection, isolation, and accommodation of sensor failures in turbofan engines: Real-time microcomputer implementation

The objective of the Advanced Detection, Isolation, and Accommodation Program is to improve the overall demonstrated reliability of digital electronic control systems for turbine engines. For this purpose, an algorithm was developed which detects, isolates, and accommodates sensor failures by using analytical redundancy. The performance of this algorithm was evaluated on a real time engine simulation and was demonstrated on a full scale F100 turbofan engine. The real time implementation of the algorithm is described. The implementation used state-of-the-art microprocessor hardware and software, including parallel processing and high order language programming.

Delaat, John C.↗
NASA NTRS1991

The improved robustness of multigrid elliptic solvers based on multiple semicoarsened grids

Multigrid convergence rates degenerate on problems with stretched grids or anisotropic operators, unless one uses line or plane relaxation. For 3-D problems, only plane relaxation suffices, in general. While line and plane relaxation algorithms are efficient on sequential machines, they are quite awkward and inefficient on parallel machines. A new multigrid algorithm is presented based on the use of multiple coarse grids, that eliminates the need for line or plane relaxation in anisotropic problems. This algorithm was developed and the standard multigrid theory was extended to establish rapid convergence for this class of algorithms. The new algorithm uses only point relaxation, allowing easy and efficient parallel implementation, yet achieves robustness and convergence rates comparable to line and plane relaxation multigrid algorithms. The algorithm described is a variant of Mulder's multigrid algorithm for hyperbolic problems. The latter uses multiple coarse grids to achieve robustness, but is unsuitable for elliptic problems, since its V-cycle convergence rate goes to one as the number of levels increases. The new algorithm combines the contributions from the multiple coarse grid via a local switch, based on the strength of the discrete operator in each coordinate direction.

Naik, Naomi H.↗
NASA NTRS1991

COBE ground segment gyro calibration

Discussed here is the calibration of the scale factors and rate biases for the Cosmic Background Explorer (COBE) spacecraft gyroscopes, with the emphasis on the adaptation for COBE of an algorithm previously developed for the Solar Maximum Mission. Detailed choice of parameters, convergence, verification, and use of the algorithm in an environment where the reference attitudes are determined form the Sun, Earth, and star observations (via the Diffuse Infrared Background Experiment (DIRBE) are considered. Results of some recent experiments are given. These include tests where the gyro rate data are corrected for the effect of the gyro baseplate temperature on the spacecraft electronics.

Freedman, I.↗
NASA NTRS1991

Small convolution kernels for high-fidelity image restoration

An algorithm is developed for computing the mean-square-optimal values for small, image-restoration kernels. The algorithm is based on a comprehensive, end-to-end imaging system model that accounts for the important components of the imaging process: the statistics of the scene, the point-spread function of the image-gathering device, sampling effects, noise, and display reconstruction. Subject to constraints on the spatial support of the kernel, the algorithm generates the kernel values that restore the image with maximum fidelity, that is, the kernel minimizes the expected mean-square restoration error. The algorithm is consistent with the derivation of the spatially unconstrained Wiener filter, but leads to a small, spatially constrained kernel that, unlike the unconstrained filter, can be efficiently implemented by convolution. Simulation experiments demonstrate that for a wide range of imaging systems these small kernels can restore images with fidelity comparable to images restored with the unconstrained Wiener filter.

Reichenbach, Stephen E.↗
NASA NTRS1991

On convexity of H-infinity Riccati solutions

The authors revealed several important eigen properties of the stabilizing solutions of the two H-infinity Riccati equations and their product. Among them, the most prominent one is that the spectral radius of the product of these two Riccati solutions is a continuous, nonincreasing, convex function of gamma in the domain of interest. Based on these properties, quadratically convergent algorithms are developed to compute the optimal H-infinity norm. Two examples are used to illustrate the algorithms.

Li, X. P.↗
NASA NTRS1993

Space marching calculations about hypersonic configurations using a solution-adaptive mesh algorithm

A solution-adaptive marching algorithm is developed and applied to a three-dimensional parabolized Navier-Stokes equation solver. The resulting algorithm obtains accurate solutions by using a spatial-marching/adaptive grid procedure. The adaptation step redistributes grid points line by line in both crossflow directions, with grid point motion controlled by forces analogous to tensional and torsional spring forces with the tensional force proportional to the error measure or weighting functions. The solution-adaptive marching procedure is applied to the hypersonic flow about two generic aircraft configurations. The first of these is an all-body-type geometry with elliptical cross sections and is studied at angles of attack of 0.5, and 15 deg. The second geometry is a generic blended-wing-body design. Results are presented that demonstrate the improvements in flowfield resolution obtainable with the solution-adaptive marching procedure over conventional fixed grid techniques. Computed pitot pressure profiles obtained using the solution-adaptive algorithm show improved agreement with experimental data compared to predictions obtained using a fixed grid.

Harvey, Albert D.↗
NASA NTRS2001

GPS/Magnetometer Based Satellite Navigation and Attitude Determination

In recent years algorithms were developed for orbit, attitude and angular-rate determination of Low Earth Orbiting (LEO) satellites. Those algorithms rely on measurements of magnetometers, which are standard, relatively inexpensive, sensors that are normally installed on every LEO satellite. Although magnetometers alone are sufficient for obtaining the desired information, the convergence of the algorithms to the correct values of the satellite orbital parameters, position, attitude and angular velocity is very slow. The addition of sun sensors reduces the convergence time considerably. However, for many LEO satellites the sun data is not available during portions of the orbit when the spacecraft (SC) is in the earth shadow. It is here where the GPS space vehicles (SV) can provide valuable support. This is clearly demonstrated in the present paper. Although GPS measurements alone can be used to obtain SC position, velocity, attitude and angular-rate, the use of magnetometers improve the results due to the synergistic effect of sensor fusion. Moreover, it is possible to obtain these results with less than three SVs. In this paper we introduce an estimation algorithm, which is a combination of an Extended Kalman Filter (EKF) and a Pseudo Linear Kalman Filter (PSELIKA).

Deutschmann, Julie↗
NASA NTRS2015

IPRT Polarized Radiative Transfer Model Intercomparison Project-Phase A

The polarization state of electromagnetic radiation scattered by atmospheric particles such as aerosols, cloud droplets, or ice crystals contains much more information about the optical and microphysical properties than the total intensity alone. For this reason an increasing number of polarimetric observations are performed from space, from the ground and from aircraft. Polarized radiative transfer models are required to interpret and analyse these measurements and to develop retrieval algorithms exploiting polarimetric observations. In the last years a large number of new codes have been developed, mostly for specific applications. Benchmark results are available for specific cases, but not for more sophisticated scenarios including polarized surface reflection and multi-layer atmospheres. The International Polarized Radiative Transfer (IPRT) working group of the International Radiation Commission (IRC) has initiated a model intercomparison project in order to fill this gap. This paper presents the results of the first phase A of the IPRT project which includes ten test cases, from simple setups with only one layer and Rayleigh scattering to rather sophisticated setups with a cloud embedded in a standard atmosphere above an ocean surface. All scenarios in the first phase A of the intercomparison project are for a one-dimensional plane-parallel model geometry. The commonly established benchmark results are available at the IPRT website

radiative transfer↗
NASA NTRS2017

Radar Autofocus Algorithm Incorporating a priori Terrain Knowledge for Correction of Mars’ Ionospheric Distortion in MARSIS Observations

Low-frequency subsurface radar observations of Mars’ polar ice deposits by MARSIS (Mars Advanced Radar for Subsurface and Ionosphere Sounding) are heavily impacted by the electron content of Mars’ ionosphere. The resulting ionospheric distortion can be represented as attenuation and bulk delay, in addition to higher-order frequency dispersion effects. Baseline, uncorrected images are often unusable when the solar zenith angle is less than 90◦ (day side). In this work, a radar autofocus algorithm is developed that estimates and inverts ionospheric distortion, producing a focused radargram of the ice deposit subsurface. Previously published autofocus algorithms have sought to maximize peak-to-noise contrast, which may yield sub-optimal results for complex terrain. Instead, a maximum likelihood approach is developed that incorporates simulated surface clutter returns for the current spacecraft position, based on the Mars Orbiter Laser Altimeter (MOLA) elevation model of the Martian surface. An ancillary product is a surface-only clutter simulation for each orbit, which is necessary to identify true subsurface features.

McMichael, Joseph G.↗
DOE OSTI2022

A Quantum-Inspired Tensor Network Algorithm for Constrained Combinatorial Optimization Problems

Combinatorial optimization is of general interest for both theoretical study and real-world applications. Fast-developing quantum algorithms provide a different perspective on solving combinatorial optimization problems. In this paper, we propose a quantum-inspired tensor-network-based algorithm for general locally constrained combinatorial optimization problems. Our algorithm constructs a Hamiltonian for the problem of interest, effectively mapping it to a quantum problem, then encodes the constraints directly into a tensor network state and solves the optimal solution by evolving the system to the ground state of the Hamiltonian. We demonstrate our algorithm with the open-pit mining problem, which results in a quadratic asymptotic time complexity. Our numerical results show the effectiveness of this construction and potential applications in further studies for general combinatorial optimization problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS2009

Systematic Benchmarking of Diagnostic Technologies for an Electrical Power System

Automated health management is a critical functionality for complex aerospace systems. A wide variety of diagnostic algorithms have been developed to address this technical challenge. Unfortunately, the lack of support to perform large-scale V&V (verification and validation) of diagnostic technologies continues to create barriers to effective development and deployment of such algorithms for aerospace vehicles. In this paper, we describe a formal framework developed for benchmarking of diagnostic technologies. The diagnosed system is the Advanced Diagnostics and Prognostics Testbed (ADAPT), a real-world electrical power system (EPS), developed and maintained at the NASA Ames Research Center. The benchmarking approach provides a systematic, empirical basis to the testing of diagnostic software and is used to provide performance assessment for different diagnostic algorithms.

Kurtoglu, Tolga↗
NASA NTRSDate not supplied

Relative Navigation for Spacecraft in Nearly Rectilinear Halo Orbits

Lunar orbit missions are of great interest to the space exploration community. This paper is focused on the research, development, and feasibility of spacecraft docking within Nearly Rectilinear Halo Orbits (NRHO). In this work, a proximity estimation algorithm is developed using the Circular Restricted Three Body Problem (CR3BP) equations of motion, which can be used to estimate the proximity between a follower spacecraft and leader spacecraft while docking in NRHOs around the Moon. Promising initial simulation results are provided and discussed. This proximity estimation algorithm is shown to to provide useful tracking estimates which can be fed to the spacecraft control system and will help ensure mission success.

Luke J. Miller↗