Search NASA⌕ Search

SEARCH · Search NASA

Results for “Iterative 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 469 records · Page 26

Attitude determination and parameter estimation using vector observations - Application

This paper presents tests of a new method for the simultaneous estimation of spacecraft attitude and sensor biases, based on a quaternion estimation algorithm minimizing Wahba's loss function. The new method is compared with a conventional batch least-squares differential correction algorithm. The estimates are based on data from strapdown gyros and star trackers, simulated with varying levels of Gaussian noise for both inertially-fixed and earth-pointing attitudes. Both algorithms solve for the spacecraft attitude and the gyro drift rate biases. In the majority of tests performed, the two methods converge to the same estimates in the same number of iterations, but the new algorithm requires about 60 percent more computational effort. Some cases were found in which the new method converges in fewer iterations than the differential correction, and some for which the differential correction requires fewer iterations.

Markley, F. Landis↗

Advanced development of the boundary element method for elastic and inelastic thermal stress analysis

The focus of this dissertation is on advanced development of the boundary element method for elastic and inelastic thermal stress analysis. New formulations for the treatment of body forces and nonlinear effects are derived. These formulations, which are based on particular integral theory, eliminate the need for volume integrals or extra surface integrals to account for these effects. The formulations are presented for axisymmetric, two and three dimensional analysis. Also in this dissertation, two dimensional and axisymmetric formulations for elastic and inelastic, inhomogeneous stress analysis are introduced. The derivatives account for inhomogeneities due to spatially dependent material parameters, and thermally induced inhomogeneities. The nonlinear formulation of the present work are based on an incremental initial stress approach. Two inelastic solutions algorithms are implemented: an iterative; and a variable stiffness type approach. The Von Mises yield criterion with variable hardening and the associated flow rules are adopted in these algorithms. All formulations are implemented in a general purpose, multi-region computer code with the capability of local definition of boundary conditions. Quadratic, isoparametric shape functions are used to model the geometry and field variables of the boundary (and domain) of the problem. The multi-region implementation permits a body to be modeled in substructured parts, thus dramatically reducing the cost of analysis. Furthermore, it allows a body consisting of regions of different (homogeneous) material to be studied. To test the program, results obtained for simple test cases are checked against their analytic solutions. Thereafter, a range of problems of practical interest are analyzed. In addition to displacement and traction loads, problems with body forces due to self-weight, centrifugal, and thermal loads are considered.

Henry, Donald P., Jr.↗

Quantum simulations in effective model spaces: Hamiltonian-learning variational quantum eigensolver using digital quantum computers and application to the Lipkin-Meshkov-Glick model

Quantum simulations offer the potential to predict the structure and dynamics of nuclear many-body systems that are beyond the capabilities of classical computing. Generally, preparing the ground state of strongly-interacting many-body systems relevant to nuclear physics is however inefficient, even using ideal quantum computers. In addition, currently available NISQ-era quantum devices possess modest numbers of qubits, limiting the size of quantum many-body systems that can be simulated. In this context, a reformulation of the quantum many-body problems using truncated model spaces and Hamiltonians is desirable to make them more amenable to near-term quantum computers. The importance of symmetries in low-energy theories, including effective field theories (EFTs), lattice quantum chromodynamics (QCD), and effective model spaces for nuclear systems, in particular their interplay with the reduction of active Hilbert spaces, is well known. Lesser known is the fact that the non-commutivity of some symmetries and truncations of the model space can be profitably combined with variational calculations to rearrange the entanglement into localized structures and enable more efficient simulations. Here, the goal of the present study is to explore and utilize the non-commutivity of symmetries and model-space truncations of quantum many-body systems important to nuclear physics, particularly in combination with variational algorithms for quantum simulations and effective Hamiltonian learning. We introduce an iterative hybrid classical-quantum algorithm, Hamiltonian learning variational quantum eigensolver (HL-VQE), that simultaneously optimizes an effective Hamiltonian, thereby rearranging entanglement into the effective model space, and the associated ground-state wavefunction. Quantum simulations, using classical computers and IBM's superconducting-qubit quantum computers, are performed to demonstrate the HL-VQE algorithm, in the context of the Lipkin-Meshkov-Glick (LMG) model of interacting fermions, where the Hamiltonian transformation corresponds to an orbital rotation. We use a mapping where the number of qubits scales with the $\log$ of the size of the effective model space, rather than the particle number. HL-VQE is found to provide an exponential improvement in LMG-model calculations of the ground-state energy and wavefunction, compared to naive truncations without Hamiltonian learning, throughout a significant fraction of the Hilbert space. In the context of EFT, this corresponds to counterterms scaling exponentially with the cut-off as opposed to power law. Implementations on IBM's QExperience quantum computers and simulators for 1- and 2-qubit effective model spaces are shown to provide accurate and precise results, reproducing classical predictions. For a range of parameters defining the LMG model, the HL-VQE algorithm is found to have better scaling of quantum resources requirements than previously explored algorithms. In particular, the HL-VQE scales efficiently over a large fraction of the model space, in contrast to VQE alone. This work constitutes a step in the development of entanglement-driven quantum algorithms for descriptions of nuclear many-body systems. This, in part, leverages the potential of noisy intermediate-scale quantum (NISQ) devices. The exponential scaling of counterterms observed in this study suggests the possibility of more general applicability to other non-perturbative EFTs.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Partitioned Quantum Subspace Expansion

We present an iterative generalisation of the quantum subspace expansion algorithm used with a Krylov basis. The iterative construction connects a sequence of subspaces via their lowest energy states. Diagonalising a Hamiltonian in a given Krylov subspace requires the same quantum resources in both the single step and sequential cases. We propose a variance-based criterion for determining a good iterative sequence and provide numerical evidence that these good sequences display improved numerical stability over a single step in the presence of finite sampling noise. Implementing the generalisation requires additional classical processing with a polynomial overhead in the subspace dimension. By exchanging quantum circuit depth for additional measurements the quantum subspace expansion algorithm appears to be an approach suited to near term or early error-corrected quantum hardware. Our work suggests that the numerical instability limiting the accuracy of this approach can be substantially alleviated in a parameter-free way.

97 MATHEMATICS AND COMPUTING↗

Photometric properties of lunar terrains derived from Hapke's equation

Hapke's bidirectional reflectance equations provide the most rigorous available description of photometric behavior in terms of physically meaningful parameters. The primary objective of this study was to derive Hapke parameters for the lunar surface from both disk-integrated and disk-resolved photometric data. Hapke's equation was fit to the disk-integrated phase curves and disk-resolved data for dark, average, and bright terrain classes using an iterative, nonlinear least squares algorithm described by Helfenstein. Parameters were initially determined from the disk-integrated data, and the result was applied as a first guess to the iterative solution of parameters for individual terrain classes. Plots are presented of the disk-resolved data normalized to corresponding brightnesses predicted from the disk-integrated solution under the same illumination and viewing geometries. Systematic trends in disk-resolved parameters can be identified. Values for single scattering albedo (w) of the dominantly anorthositic average and bright terrains are significantly larger than the value for the basaltic dark terrains (mare). Values for surge brightness parameters, particle phase function, and average topographic slope angle are also discussed.

Helfenstein, Paul↗

Iterative multi-task learning and inference from seismic images

Seismic interpretation aims to extract quantitative and interpretable attributes from a seismic image produced using some migration method to inform characteristics of a subsurface reservoir or target of interest. Current paradigms for computing seismic attributes mostly rely on single-task algorithms. We develop an iterative, multi-task machine learning method to learn and infer multiple attributes from a seismic image. This method is composed of two stages: a multi-task inference stage and a multi-modal, multi-task refinement stage. The basic mechanism of this method is that we train a multi-task inference neural network (NN) to estimate a set of attributes, including a relative geological time (RGT), a denoised higher-resolution (DHR) seismic image, and multiple fault attributes (including probability, dip, and strike), from a low-resolution, noisy seismic image; then we input the inferred attributes to a multi-task refinement NN to enhance the raw inference results iteratively. The two multi-task NNs are trained separately based on synthetic seismic images and associated attributes generated by a geological modeling algorithm. The software we intend to release is a PyTorch implementation of this multi-task learning method for both 2D and 3D cases along with scripts to run the training/validation. The algorithm and software can be a useful tool for automatic seismic interpretation.

Gao, Kai↗

Multi-Energy Differential Evolution Reconstruction (MEnDER 1D) for Proton Deflectometry

This code is designed to reconstruct magnetic field deflections, and thus the path-integrated magnetic field, from sets of proton images at two distinct proton probe energies. A differential evolution (DE) algorithm is used to iteratively update a population of solution candidates of the magnetic deflections of the protons for reconstructing the input images, selecting improved candidates as they are discovered. This algorithm was written using MATLAB (R2019a) and makes use of the Image Processing and Parallel Processing Toolboxes.

Levesque, Joseph↗

A review of nonstatistical techniques for the estimation of vertical atmospheric structure from remote infrared measurements

Mathematical techniques used in atmospheric profile inversion are reviewed, with the discussion limited to methods that do not require extensive information on the statistical properties of the profiles. The basic problem of the calculation of vertical profiles from noise contaminated infrared spectral measurements is examined. Three specific examples of methods of solution are given: the iterative minimum estimation method, a second linear iterative method, and the algorithm of Chahine. Satellite data are used in an empirical comparison of the methods. Several factors are considered, including the stability of solutions, convergence behavior of the iterative methods, and dependence of the solutions on the first guess, a factor that is particularly important in the treatment of data from other planets.

Conrath, B. J.↗

A Universal Tare Load Prediction Algorithm for Strain-Gage Balance Calibration Data Analysis

An algorithm is discussed that may be used to estimate tare loads of wind tunnel strain-gage balance calibration data. The algorithm was originally developed by R. Galway of IAR/NRC Canada and has been described in the literature for the iterative analysis technique. Basic ideas of Galway's algorithm, however, are universally applicable and work for both the iterative and the non-iterative analysis technique. A recent modification of Galway's algorithm is presented that improves the convergence behavior of the tare load prediction process if it is used in combination with the non-iterative analysis technique. The modified algorithm allows an analyst to use an alternate method for the calculation of intermediate non-linear tare load estimates whenever Galway's original approach does not lead to a convergence of the tare load iterations. It is also shown in detail how Galway's algorithm may be applied to the non-iterative analysis technique. Hand load data from the calibration of a six-component force balance is used to illustrate the application of the original and modified tare load prediction method. During the analysis of the data both the iterative and the non-iterative analysis technique were applied. Overall, predicted tare loads for combinations of the two tare load prediction methods and the two balance data analysis techniques showed excellent agreement as long as the tare load iterations converged. The modified algorithm, however, appears to have an advantage over the original algorithm when absolute voltage measurements of gage outputs are processed using the non-iterative analysis technique. In these situations only the modified algorithm converged because it uses an exact solution of the intermediate non-linear tare load estimate for the tare load iteration.

balance calibration analysis↗

Next-Generation Aura/OMI NO2 and SO2 Products

The measurement of both SO2 and NO2 gases are recognized as an essential component of atmospheric composition missions. We describe current capabilities and limitations of the operational Aura/OMI NO2 and SO2 data that have been used by a large number of researchers. Analyses of the data and validation studies have brought to light a number of areas in which these products can be expanded and improved. Major improvements for new NASA standard (SP) NO2 product include more accurate tropospheric and stratospheric column amounts, along with much improved error estimates and diagnostics. Our approach uses a monthly NO2 climatology based on the NASA Global Modeling Initiative (GMI) chemistry-transport model and takes advantage of OMI data from cloudy scenes to find clean areas where the contribution from the trap NO2 column is relatively small. We then use a new filtering, interpolation and smoothing techniques for separating the stratospheric and tropospheric components of NO2, minimizing the influence of a priori information. The new algorithm greatly improves the structure of stratospheric features relative to the original SP. For the next-generation OMI SO2 product we plan to implement operationally the offline iterative spectral fitting (ISF) algorithm and re-process the OMI Level-2 SO2 dataset using a priori SO2 and aerosol profiles, clouds, and surface reflectivity appropriate for observation conditions. This will improve the ability to detect and quantify weak tropospheric SO2 loadings. The new algorithm is validated using aircraft in-situ data during field campaigns in China (2005 and 2008) and in Maryland (Frostburg, 2010 and DISCOVER-AQ in July 2011). The height of the SO2 plumes will also be estimated for high SO2 loading cases (e.g., volcanic eruptions). The same SO2 algorithm will be applied to the data from OMPS sensor to be launched on NPP satellite later this year. The next-generation NO2 and SO2 products will provide critical information (e.g., averaging kernels) for evaluation of chemistry-transport models, for data assimilation, and to impose top-down constraints on the SO2 and NO2 emission sources.

Krotkov, Nickolay↗

Linear pose estimation from points or lines

We present a general framework which allows for a novel set of linear solutions to the pose estimation problem for both n points and n lines. We present a number of simulations which compare our results to two other recent linear algorithm as well as to iterative approaches.

pose estimation algorithms↗

Advanced applications of BEM to inelastic analysis of solids

Newly evolved boundary element solution algorithms are utilized for solving a range of elastoplastic and thermoplastic problems. The first algorithm is the typical iterative procedure in which the unknown boundary solution and the initial stress (or strain) rates are found together in an incremental iterative fashion. The second one is a variable stiffness type approach in which the incremental boundary solution is obtained in a direct (noniterative) manner. The third procedure differs from the two prior algorithms in that volume integration is not needed to incorporate the nonlinear effects in the analysis. Instead, initial stress rates are introduced in the boundary element system by way of particular integrals. The methodology is used in a general purpose, multiregion system that employs quadratic isoparametric shape functions to model the geometry and field variables of the body and can admit up to 15 substructured areas of different material properties.

Banerjee, P. K.↗

Flight test evaluation of a digital controller used in a VTOL automatic approach and landing system

As part of the NASA Langley Research Center's effort to develop technology for VTOL operation in the air transportation system in the late 1980's and beyond, research has been conducted aimed at developing digital controller design procedures. This paper describes the verification of one design procedure by the flight evaluation of an advanced digital control algorithm. The control algorithm, operating at 10 iterations per second, follows step guidance commands with zero steady state error and thus provides an autotrim capability for the nonlinear vehicle. Changes in vehicle dynamics are accounted for using a gain scheduling technique. This control algorithm is combined with sensor filters, a trajectory generator, and a closed loop guidance algorithm to form a VTOL autoland system. A CH-47 tandem rotor helicopter which contains a set of sensors, onboard digital flight computers and electro-hydraulic actuators is used in the evaluation. All software, except input-output routines, is coded in FORTRAN using floating point arithmetic and executed in the flight computer. This autoland system is exercised by automatically flying straight-in descending decelerating trajectories typical of VFR manual approaches to a predetermined landing pad.

Downing, D. R.↗

Spectral-Spatial Classification of Hyperspectral Images Using Hierarchical Optimization

A new spectral-spatial method for hyperspectral data classification is proposed. For a given hyperspectral image, probabilistic pixelwise classification is first applied. Then, hierarchical step-wise optimization algorithm is performed, by iteratively merging neighboring regions with the smallest Dissimilarity Criterion (DC) and recomputing class labels for new regions. The DC is computed by comparing region mean vectors, class labels and a number of pixels in the two regions under consideration. The algorithm is converged when all the pixels get involved in the region merging procedure. Experimental results are presented on two remote sensing hyperspectral images acquired by the AVIRIS and ROSIS sensors. The proposed approach improves classification accuracies and provides maps with more homogeneous regions, when compared to previously proposed classification techniques.

Tarabalka, Yuliya↗

Picasso: Memory-Efficient Graph Coloring Using Palettes With Applications in Quantum Computing

A coloring of a graph is an assignment of colors to vertices such that no two neighboring vertices have the same color. The need for memory-efficient coloring algorithms is motivated by their application in computing clique partitions of graphs arising in quantum computations where the objective is to map a large set of Pauli strings into a compact set of unitaries. We present Picasso, a randomized memory-efficient iterative parallel graph coloring algorithm with theoretical sublinear space guarantees under practical assumptions. The parameters of our algorithm provide a trade-off between coloring quality and resource consumption. To assist the user, we also propose a machine learning model to predict the coloring algorithm’s parameters considering these trade-offs. We provide a sequential and a parallel implementation of the proposed algorithm. We perform an experimental evaluation on a 64-core AMD CPU equipped with 512 GB of memory and an Nvidia A100 GPU with 40GB of memory. For a small dataset where existing coloring algorithms can be executed within the 512 GB memory budget, we show up to 68× memory savings. On massive datasets we demonstrate that GPU-accelerated Picasso can process inputs with 49.5× more Pauli strings (vertex set in our graph) and 2,478× more edges than state-of-the-art parallel approaches.

artificial intelligence, quantum computing↗