Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation 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,279 records · Page 71

FY21 Proxy App Suite Release: Report for ECP Proxy App Project Milestone ADCD504-12

The FY21 Proxy App Suite Release milestone includes the following activities: Curate a collection of proxy applications that represents the breadth of ECP applications, including application domains, programming models, supporting libraries, numerical methods, etc. Identify gaps in coverage and work with application teams to commission or develop proxies to cover gaps. From within this collection, designate the "ECP Proxy Application Suite" of 12-15 proxies that balance breadth of coverage with ease of use and quality of implementation. Also designate approximately 8-10 proxies to form the \ECP Machine Learning Proxy Suite". The ML suite will represent algorithms, use cases, and programming methods typically used by ECP science workloads to incorporate machine learning into their workflows.

97 MATHEMATICS AND COMPUTING↗

FY22 Proxy App Suite Release

The FY22 Proxy App Suite Release milestone includes the following activities: Curate a collection of proxy applications that represents the breadth of ECP applications, including application domains, programming models, supporting libraries, numerical methods, etc. Identify gaps in coverage and work with application teams to commission or develop proxies to cover gaps. From within this collection, designate the ”ECP Proxy Application Suite” of 10–15 proxies that balance breadth of coverage with ease of use and quality of implementation. Also designate approximately 6–10 proxies to form the “ECP Machine Learning Proxy Suite”. The ML suite will represent algorithms, use cases, and programming methods typically used by ECP science workloads to incorporate machine learning into their workflows.

97 MATHEMATICS AND COMPUTING↗

Uncertainty based Online Ensemble on Non-Stationary Data for Fusion Science

Machine Learning (ML) is poised to play a pivotal role in the development and operation of next-generation fusion devices. Fusion data shows non-stationary behavior due to drifts in the data. The drifts can arise from both experimental evolution and machine wear-and-tear. ML models assume stationary distribution and fail to maintain performance when encountered with non-stationary data streams.Online learning can be used to continuously adapt the models with new data as it is acquired. However, traditional online learning can suffer from short-term performance degradation, as ground truth are not available before making the prediction. To address this challenge, we propose uncertainty aware ensemble approach for online learning. We use Deep Gaussian Process Approximation (DGPA) technique for calibrated uncertainty estimation and use the uncertainty values to guide a meta-algorithm that produces predictions based on ensemble of learners. Moreover, DGPA also provides uncertainty estimation along with the predictions for decision makers. This paper demonstrates that the proposed method outperforms traditional online learning approach, and a naive ensemble without uncertainty guidance by about 7% and 6%, respectively, on B-coil deflection prediction at DIII-D Fusion Facility.

Rajput, Kishansingh [Thomas Jefferson National Acc↗

Near-optimal ground state preparation

Preparing the ground state of a given Hamiltonian and estimating its ground energy are important but computationally hard tasks. However, given some additional information, these problems can be solved efficiently on a quantum computer. We assume that an initial state with non-trivial overlap with the ground state can be efficiently prepared, and the spectral gap between the ground energy and the first excited energy is bounded from below. With these assumptions we design an algorithm that prepares the ground state when an upper bound of the ground energy is known, whose runtime has a logarithmic dependence on the inverse error. When such an upper bound is not known, we propose a hybrid quantum-classical algorithm to estimate the ground energy, where the dependence of the number of queries to the initial state on the desired precision is exponentially improved compared to the current state-of-the-art algorithm proposed in [Ge et al. 2019]. These two algorithms can then be combined to prepare a ground state without knowing an upper bound of the ground energy. We also prove that our algorithms reach the complexity lower bounds by applying it to the unstructured search problem and the quantum approximate counting problem.

97 MATHEMATICS AND COMPUTING↗

Propeller design by numerical optimization

A computer program designed to optimize propeller characteristics was developed by combining two main programs: the first is the optimization program based on the gradient algorithm; the second is based on a propeller blade element theory and uses an aerodynamics subprogram to approximate the lift and drag characteristics of the NACA 16-series airfoil section. To evaluate the propeller program alone (with its aerodynamics subprogram), propeller characteristics were computed and compared to those from wind tunnel investigations conducted on three different NACA propellers. Although the thrust and power coefficients which were computed using the blade element theory were generally higher than the experimental results for two of the three propellers, the corresponding efficiencies showed good agreement for all three propellers. The propeller optimization program was then used to study the NACA 4-(5)(08)-03 propeller at various Mach numbers from 0.175 to 0.60. Improvements in propeller efficiency and thrust were obtained through the use of the propeller optimization program.

Mendoza, J. P.↗

Reconstruction of the 1st Space Shuttle (STS-1) entry trajectory

A discussion of the generation of the best estimate trajectory (BET) of the first Space Shuttle Orbiter entry flight is presented. The BET defines a time history of the state, attitude, and atmospheric relative parameters throughout the Shuttle entry from an altitude of approximately 183 km to rollout. The inertial parameters were estimated utilizing a weighted least squares batch filter algorithm. Spacecraft angular rate and acceleration data derived from the Inertial Measurement Unit were utilized to predict the state and attitude which was constrained in a weighted least squares process to fit external tracking data consisting of ground based S-band and C-band data. Refined spacecraft altitude and velocity during and post rollout were obtained by processing artificial altimeter and Doppler data. The BET generation process is discussed. Software and data interface discussions are included. The variables and coordinate systems utilized are defined. STS-1 mission peculiar inputs are summarized. A listing of the contents of the actual BET is provided.

Findlay, J. T.↗

Comparison of starting values for iterative solutions to a universal Kepler's equation

General starting values for the iterative numerical solution of a universal Kepler's equation for position in a conic orbit at a specified time are investigated. Three starting values based on recent refinements of previously obtained bounds on the solution are derived and tested numerically. Of these, a simple starting value based on a cubic approximation to Kepler's equation provides the most rapid convergence using both first and second order Newton algorithms. The performance of the starting values are compared with similar studies which used the restricted case of elliptical orbits with the initial epoch at periapse.

Bergam, M. J.↗

A search for equilibrium states

An efficient search algorithm is described for the location of equilibrium states in a search set of states which differ from one another only by the choice of pure phases. The algorithm has three important characteristics: (1) it ignores states which have little prospect for being an improved approximation to the true equilibrium state; (2) it avoids states which lead to singular iteration equations; (3) it furnishes a search history which can provide clues to alternative search paths.

Zeleznik, F. J.↗

Selecting step sizes in sensitivity analysis by finite differences

This paper deals with methods for obtaining near-optimum step sizes for finite difference approximations to first derivatives with particular application to sensitivity analysis. A technique denoted the finite difference (FD) algorithm, previously described in the literature and applicable to one derivative at a time, is extended to the calculation of several simultaneously. Both the original and extended FD algorithms are applied to sensitivity analysis for a data-fitting problem in which derivatives of the coefficients of an interpolation polynomial are calculated with respect to uncertainties in the data. The methods are also applied to sensitivity analysis of the structural response of a finite-element-modeled swept wing. In a previous study, this sensitivity analysis of the swept wing required a time-consuming trial-and-error effort to obtain a suitable step size, but it proved to be a routine application for the extended FD algorithm herein.

Iott, J.↗

A three-dimensional upwind parabolized Navier-Stokes code for chemically reacting flows

A new upwind, parabolized Navier-Stokes (PNS) code has been developed to compute the three-dimensional flow of chemically reacting air around hypersonic vehicles. The code is a modification of the perfect gas, three-dimensional UPS code of Lawrence et al. (1986) which has been extended in the present study to permit the calculation of hypersonic, viscous flows in chemical nonequilibrium. The algorithm solves the PNS equations using a finite-volume, upwind TVD method based on Roe's approximate Riemann solver that has been modified to account for real gas effects. The present code solves the fluid dynamic and species continuity equations in a loosely-coupled manner. The fluid medium is assumed to be a chemically reacting mixture of thermally perfect (but calorically imperfect) gases in thermal equilibrium. Results are presented for the hypersonic laminar flow over a cone at 0- and 10-deg angles of attack and for a generic hypersonic vehicle. Calculations are performed assuming either perfect gas, equilibrium air, or finite-rate chemistry.

Buelow, Philip E.↗

Structural factoring approach for analyzing stochastic networks

The problem of finding the distribution of the shortest path length through a stochastic network is investigated. A general algorithm for determining the exact distribution of the shortest path length is developed based on the concept of conditional factoring, in which a directed, stochastic network is decomposed into an equivalent set of smaller, generally less complex subnetworks. Several network constructs are identified and exploited to reduce significantly the computational effort required to solve a network problem relative to complete enumeration. This algorithm can be applied to two important classes of stochastic path problems: determining the critical path distribution for acyclic networks and the exact two-terminal reliability for probabilistic networks. Computational experience with the algorithm was encouraging and allowed the exact solution of networks that have been previously analyzed only by approximation techniques.

Hayhurst, Kelly J.↗

A three-dimensional upwind PNS code for chemically reacting scramjet flowfields

A new upwind, parabolized Navier-Stokes (PNS) code has been developed to compute the three-dimensional (3D) chemically reacting flow in scramjet (supersonic combustion ramjet) engines. The code is a modification of the 3D upwind PNS (UPS) airflow code which has been extended in the present study to permit internal flow calculations with hydrogen-air chemistry. With these additions, the new code has the capability of computing aerodynamic and propulsive flowfields simultaneously. The algorithm solves the PNS equations using a finite-volume, upwind TVD method based on Roe's approximate Riemann solver that has been modified to account for 'real gas' effects. The fluid medium is assumed to be a chemically reacting mixture of thermally perfect (but calorically imperfect) gases in thermal equilibrium. The new code has been applied to two test cases. These include the Burrows-Kurkov supersonic combustion experiment and a generic 3D scramjet flowfield. The computed results compare favorably with the available experimental data.

Wadawadigi, Ganesh↗

Atmospheric Infrared Sounder

The microwave 'first-guess' algorithm was run on the cloudy test simulations. Eight datasets were considered in the cloudy test, comprising approximately 360 retrievals, of which one failed to converge. Retrievals were done on the AMSU-A grid. Examination of the true profiles (provided for the A, C and D tracks) showed numerous cases of very pronounced temperature inversion layers in the troposphere which the retrieval does not have enough vertical resolution to reproduce. A typical example with an inversion layer near 700 mbar is shown in Figure 1. The inversion layers also exhibit strong vertical gradients of water vapor which are not resolved in the retrieval. (Water vapor volume density is given in g/sq cm per layer. Layer thickness is 20 mb from 200 to 400 mb, and 25 mb from 400 to 1,000 mb.) The retrievals do reproduce the overall smoothed shape of the profiles, and therefore as a first guess should be within the range of linear methods for IR retrievals using AIRS.

Rosenkranz, Philip W.↗

Profiling of Atmospheric Water Vapor from the SSM/T-2 Radiometric Measurements

An advantage of using the millimeter-wave measurements for water vapor profiling is the ability to probe beyond a moderate cloud cover. Such a capability has been demonstrated from an airborne MIR (Millimeter-wave Imaging Radiometer) flight over the Pacific Ocean during an intense observation period of TOGA/COARE (Tropical Ocean Global Atmosphere/ Couple Ocean Atmospheric Response Experiment) in early 1993. A Cloud Lidar System (CLS) and MODIS Airborne Simulator (MAS) were on board the same aircraft to identify the presence of clouds and cloud type. The retrieval algorithm not only provides output of a water vapor profile, but also the cloud liquid water and approximate cloud altitude required to satisfy convergence of the retrieval. The validity of these cloud parameters has not been verified previously. In this document, these cloud parameters are compared with those derived from concurrent measurements from the CLS and AMPR (Advanced Microwave Precipitation Radiometer).

Wang, J. R.↗

Preservation and Enhancement of the Spacewatch Data Archives

In March of 1998, the asteroid 1997 XF11 was announced to be potentially hazardous after being tracked over 90 days. A potential two year wait for confirming observations was shortened to under 24 hours because of the existence of archived photographic prediscovery images. Spacewatch was a pioneer in using CCD scanning and possesses a valuable digital archive of its scans. Unfortunately these data are aging on magnetic tape and will soon be lost. Since 1990, the Spacewatch project gathered some 1.5 Terabytes of scan data covering roughly 75,000 degrees of sky to a limiting magnitude of V = 21.5. The data have not yet been mined for all of their asteroids for scientific studies and orbit determination. Spacewatch's real-time motion detection program MODP was constrained by the computers of the era to use simplified image processing algorithms at a reduced efficiency. Jedicke and Herron estimated MODP's efficiency at finding asteroids to be approximately 60 percent to V=18 and improving somewhat thereafter. This lead to a substantial bias correction in their analyses. Larsen has developed a MODP replacement capable in excess of 90 percent efficiency in the same range and able to push a magnitude fainter in completeness. We propose a program of post-processing and re-archiving Spacewatch data. Our scans would be transferred from tape to CD-ROMs and converted to FITS images -- establishing a consistent data format and media for both past and future Spacewatch observations. Larsen's MODP replacement would mine these data for previously undetected motions, which would be made available to the Minor Planet Center and our ongoing asteroid population studies. A searchable observation record would be made generally available for prediscovery work. We estimate the net asteroid yield of this proposal is equivalent to three full years of Spacewatch operations.

Larsen, Jeffrey A.↗

Design of Neural Networks for Fast Convergence and Accuracy

A novel procedure for the design and training of artificial neural networks, used for rapid and efficient controls and dynamics design and analysis for flexible space systems, has been developed. Artificial neural networks are employed to provide a means of evaluating the impact of design changes rapidly. Specifically, two-layer feedforward neural networks are designed to approximate the functional relationship between the component spacecraft design changes and measures of its performance. A training algorithm, based on statistical sampling theory, is presented, which guarantees that the trained networks provide a designer-specified degree of accuracy in mapping the functional relationship. Within each iteration of this statistical-based algorithm, a sequential design algorithm is used for the design and training of the feedforward network to provide rapid convergence to the network goals. Here, at each sequence a new network is trained to minimize the error of previous network. The design algorithm attempts to avoid the local minima phenomenon that hampers the traditional network training. A numerical example is performed on a spacecraft application in order to demonstrate the feasibility of the proposed approach.

Maghami, Peiman G.↗

On the relationshop between polarimetric parameters and soil moisture

In this paper, we examine the relationship between polarimetric parameters and soil moisture. For example, the co-polarization ratio is independent of surface roughness to the first order of the small perturbation approximation. As surface roughness increases, it can be shown that the co-polarization ratio depends on the surface slope under the tilted Bragg approximation. The coupling of the surface roughness to the co-polarization ratio is theoretically investigated. An algorithm to compensate the surface slope effect will be discussed. We will also study other polarimetric parameters such as the average alpha angle and eigenvalues to understand their relationship with soil moisture.

polarimetric parameters soil moisture↗

Fast Image Texture Classification Using Decision Trees

Texture analysis would permit improved autonomous, onboard science data interpretation for adaptive navigation, sampling, and downlink decisions. These analyses would assist with terrain analysis and instrument placement in both macroscopic and microscopic image data products. Unfortunately, most state-of-the-art texture analysis demands computationally expensive convolutions of filters involving many floating-point operations. This makes them infeasible for radiation- hardened computers and spaceflight hardware. A new method approximates traditional texture classification of each image pixel with a fast decision-tree classifier. The classifier uses image features derived from simple filtering operations involving integer arithmetic. The texture analysis method is therefore amenable to implementation on FPGA (field-programmable gate array) hardware. Image features based on the "integral image" transform produce descriptive and efficient texture descriptors. Training the decision tree on a set of training data yields a classification scheme that produces reasonable approximations of optimal "texton" analysis at a fraction of the computational cost. A decision-tree learning algorithm employing the traditional k-means criterion of inter-cluster variance is used to learn tree structure from training data. The result is an efficient and accurate summary of surface morphology in images. This work is an evolutionary advance that unites several previous algorithms (k-means clustering, integral images, decision trees) and applies them to a new problem domain (morphology analysis for autonomous science during remote exploration). Advantages include order-of-magnitude improvements in runtime, feasibility for FPGA hardware, and significant improvements in texture classification accuracy.

Thompson, David R.↗