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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,441 records · Page 80

All sources NASA NTRS DOE OSTI

DOE OSTI2021

Imaging pyrometry for most color cameras using a triple pass filter

A simple combination of the Planck blackbody emission law, optical filters, and digital image processing is demonstrated to enable most commercial color cameras (still and video) to be used as an imaging pyrometer for flames and explosions. The hardware and data processing described take advantage of the color filter array (CFA) that is deposited on the surface of the light sensor array present in most digital color cameras. In this work, a triple-pass optical filter incorporated into the camera lens allows light in three 10-nm wide bandpass regions to reach the CFA/light sensor array. These bandpass regions are centered over the maxima in the blue, green, and red transmission regions of the CFA, minimizing the spectral overlap of these regions normally present. A computer algorithm is used to retrieve the blue, green, and red image matrices from camera memory and correct for remaining spectral overlap. A second algorithm calibrates the corrected intensities to a gray body emitter of known temperature, producing a color intensity correction factor for the camera/filter system. The Wien approximation to the Planck blackbody emission law is used to construct temperature images from the three color (blue, green, red) matrices. A short pass filter set eliminates light of wavelengths longer than 750 nm, providing reasonable accuracy (±10%) for temperatures between 1200 and 6000 K. The effectiveness of this system is demonstrated by measuring the temperature of several systems for which the temperature is known.

47 OTHER INSTRUMENTATION↗

NASA NTRS2016

The Role of Cloud Contamination, Aerosol Layer Height and Aerosol Model in the Assessment of the OMI Near-UV Retrievals Over the Ocean

Retrievals of aerosol optical depth (AOD) at 388 nm over the ocean from the Ozone Monitoring Instrument (OMI) two-channel near-UV algorithm (OMAERUV) have been compared with independent AOD measurements. The analysis was carried out over the open ocean (OMI and MODerate-resolution Imaging Spectrometer (MODIS) AOD comparisons) and over coastal and island sites (OMI and AERONET, the AErosol RObotic NETwork). Additionally, a research version of the retrieval algorithm (using MODIS and CALIOP (Cloud-Aerosol Lidar with Orthogonal Polarization) information as constraints) was utilized to evaluate the sensitivity of the retrieval to different assumed aerosol properties. Overall, the comparison resulted in differences (OMI minus independent measurements) within the expected levels of uncertainty for the OMI AOD retrievals (0.1 for AOD less than 0.3, 30% for AOD greater than 0.3). Using examples from case studies with outliers, the reasons that led to the observed differences were examined with specific purpose to determine whether they are related to instrument limitations (i.e., pixel size, calibration) or algorithm assumptions (such as aerosol shape, aerosol height). The analysis confirms that OMAERUV does an adequate job at rejecting cloudy scenes within the instrument's capabilities. There is a residual cloud contamination in OMI pixels with quality flag 0 (the best conditions for aerosol retrieval according to the algorithm), resulting in a bias towards high AODs in OMAERUV. This bias is more pronounced at low concentrations of absorbing aerosols (AOD 388 nm approximately less than 0.5). For higher aerosol loadings, the bias remains within OMI's AOD uncertainties. In pixels where OMAERUV assigned a dust aerosol model, a fraction of them (less than 20 %) had retrieved AODs significantly lower than AERONET and MODIS AODs. In a case study, a detailed examination of the aerosol height from CALIOP and the AODs from MODIS, along with sensitivity tests, was carried out by varying the different assumed parameters in the retrieval (imaginary index of refraction, size distribution, aerosol height, particle shape). It was found that the spherical shape assumption for dust in the current retrieval is the main cause of the underestimate. In addition, it is demonstrated in an example how an incorrect assumption of the aerosol height can lead to an underestimate. Nevertheless, this is not as significant as the effect of particle shape. These findings will be incorporated in a future version of the retrieval algorithm.

aerosols↗

DOE OSTI2022

Quantum algorithms from fluctuation theorems: Thermal-state preparation

Fluctuation theorems provide a correspondence between properties of quantum systems in thermal equilibrium and a work distribution arising in a non-equilibrium process that connects two quantum systems with Hamiltonians H 0 and H 1 = H 0 + V. Building upon these theorems, we present a quantum algorithm to prepare a purification of the thermal state of H 1 at inverse temperature β ≥ 0 starting from a purification of the thermal state of H 0 . The complexity of the quantum algorithm, given by the number of uses of certain unitaries, is $\mathcal{O}$ (e β(ΔA - w l )/2 ), where ΔA is the free-energy difference between H 1 and H 0 , and w l is a work cutoff that depends on the properties of the work distribution and the approximation error ϵ > 0. If the non-equilibrium process is trivial, this complexity is exponential i β∥V∥, where ∥V∥ is the spectral norm of V. This represents a significant improvement of prior quantum algorithms that have complexity exponential in β∥H 1 ∥ in the regime where ∥V∥$\ll$ ∥H 1 ∥. The dependence of the complexity in ϵ varies according to the structure of the quantum systems. It can be exponential in 1/ϵ in general, but we show it to be sublinear in 1/ϵ if H 0 and H 1 commute, or polynomial in 1/ϵ if H 0 and H 1 are local spin systems. The possibility of applying a unitary that drives the system out of equilibrium allows one to increase the value of w l and improve the complexity even further. To this end, we analyze the complexity for preparing the thermal state of the transverse field Ising model using different non-equilibrium unitary processes and see significant complexity improvements.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS2010

Electrical Capacitance Volume Tomography with High-Contrast Dielectrics

The Electrical Capacitance Volume Tomography (ECVT) system has been designed to complement the tools created to sense the presence of water in nonconductive spacecraft materials, by helping to not only find the approximate location of moisture but also its quantity and depth. The ECVT system has been created for use with a new image reconstruction algorithm capable of imaging high-contrast dielectric distributions. Rather than relying solely on mutual capacitance readings as is done in traditional electrical capacitance tomography applications, this method reconstructs high-resolution images using only the self-capacitance measurements. The image reconstruction method assumes that the material under inspection consists of a binary dielectric distribution, with either a high relative dielectric value representing the water or a low dielectric value for the background material. By constraining the unknown dielectric material to one of two values, the inverse math problem that must be solved to generate the image is no longer ill-determined. The image resolution becomes limited only by the accuracy and resolution of the measurement circuitry. Images were reconstructed using this method with both synthetic and real data acquired using an aluminum structure inserted at different positions within the sensing region. The cuboid geometry of the system has two parallel planes of 16 conductors arranged in a 4 4 pattern. The electrode geometry consists of parallel planes of copper conductors, connected through custom-built switch electronics, to a commercially available capacitance to digital converter. The figure shows two 4 4 arrays of electrodes milled from square sections of copper-clad circuit-board material and mounted on two pieces of glass-filled plastic backing, which were cut to approximately square shapes, 10 cm on a side. Each electrode is placed on 2.0-cm centers. The parallel arrays were mounted with the electrode arrays approximately 3 cm apart. The open ends were surrounded by a metal guard to reduce the sensitivity of the electrodes to outside interference and to help maintain the spacing between the arrays. Other uses for this innovation potentially include quantifying the amount of commodity remaining in the fuel and oxidizer tanks while on-orbit without having to fire spacecraft engines. Another orbit application is moisture sensing in plant-growth experiments because microgravity causes moisture in soil to distribute itself in unusual ways. At the moment, the hardware and image reconstruction technique may only be of interest to people involved in nondestructive evaluation. The reconstructed image takes almost a full week to reproduce with existing computer power. However, because computer power and speeds follows Moore s Law, execution times are likely to become acceptable within the next five to eight years. The code was written in Mathematica for dedicated use with the ECVT system. In its present form, it is not suitable to be used directly as a consumer product. However, the code could be likely improved by rewriting it in a compiled language such as C or Fortran.

Nurge, Mark↗

NASA NTRS1978

Finite element dynamic analysis on CDC STAR-100 computer

Computational algorithms are presented for the finite element dynamic analysis of structures on the CDC STAR-100 computer. The spatial behavior is described using higher-order finite elements. The temporal behavior is approximated by using either the central difference explicit scheme or Newmark's implicit scheme. In each case the analysis is broken up into a number of basic macro-operations. Discussion is focused on the organization of the computation and the mode of storage of different arrays to take advantage of the STAR pipeline capability. The potential of the proposed algorithms is discussed and CPU times are given for performing the different macro-operations for a shell modeled by higher order composite shallow shell elements having 80 degrees of freedom.

Noor, A. K.↗

NASA NTRS2001

Use of a genetic algorithm for the analysis of eye movements from the linear vestibulo-ocular reflex

It is common in vestibular and oculomotor testing to use a single-frequency (sine) or combination of frequencies [sum-of-sines (SOS)] stimulus for head or target motion. The resulting eye movements typically contain a smooth tracking component, which follows the stimulus, in which are interspersed rapid eye movements (saccades or fast phases). The parameters of the smooth tracking--the amplitude and phase of each component frequency--are of interest; many methods have been devised that attempt to identify and remove the fast eye movements from the smooth. We describe a new approach to this problem, tailored to both single-frequency and sum-of-sines stimulation of the human linear vestibulo-ocular reflex. An approximate derivative is used to identify fast movements, which are then omitted from further analysis. The remaining points form a series of smooth tracking segments. A genetic algorithm is used to fit these segments together to form a smooth (but disconnected) wave form, by iteratively removing biases due to the missing fast phases. A genetic algorithm is an iterative optimization procedure; it provides a basis for extending this approach to more complex stimulus-response situations. In the SOS case, the genetic algorithm estimates the amplitude and phase values of the component frequencies as well as removing biases.

Non-NASA Center↗

DOE OSTI2021

Parallel Algorithms for Efficient Computation of High-Order Line Graphs of Hypergraphs

This paper considers structures of systems beyond dyadic (pairwise) interactions and investigates mathematical modeling of multi-way interactions and connections as hypergraphs, where captured relationships among system entities are set-valued. To date, in most situations, entities in a hypergraph are considered connected as long as there is at least one common ``neighbor''. However, minimal commonality sometimes discards the ``strength'' of connections and interactions among groups. To this end, considering the ``width'' of a connection, referred to as the \emph{$s$-overlap} of neighbors, provides more meaningful insights into how closely the communities or entities interact with each other. In addition, $s$-overlap computation is the fundamental kernel to construct the line graph of a hypergraph, a low-order approximation of the hypergraph which can carry significant information about the original hypergraph. Subsequent stages of a data analytics pipeline then can apply highly-tuned graph algorithms on the line graph to reveal important features. Given a hypergraph, computing the $s$-overlaps by exhaustively considering all pairwise entities can be computationally prohibitive. To tackle this challenge, we develop efficient algorithms to compute $s$-overlaps and the corresponding line graph of a hypergraph. We propose several heuristics to avoid execution of redundant work and improve performance of the $s$-overlap computation. Our parallel algorithm, combined with these heuristics, is orders of magnitude (more than $10\times$) faster than the naive algorithm in all cases and the SpGEMM algorithm with filtration in most cases (especially with large $s$ value).

hypergraph algorithms, graph algorithms, parallel ↗

DOE OSTI2021

Calibration of elastoplastic constitutive model parameters from full-field data with automatic differentiation-based sensitivities

Here, we present a framework for calibration of parameters in elastoplastic constitutive models that is based on the use of automatic differentiation (AD). The model calibration problem is posed as a partial differential equation-constrained optimization problem where a finite element (FE) model of the coupled equilibrium equation and constitutive model evolution equations serves as the constraint. The objective function quantifies the mismatch between the displacement predicted by the FE model and full-field digital image correlation data, and the optimization problem is solved using gradient-based optimization algorithms. Forward and adjoint sensitivities are used to compute the gradient at considerably less cost than its calculation from finite difference approximations. Through the use of AD, we need only to write the constraints in terms of AD objects, where all of the derivatives required for the forward and inverse problems are obtained by appropriately seeding and evaluating these quantities. We present three numerical examples that verify the correctness of the gradient, demonstrate the AD approach's parallel computation capabilities via application to a large-scale FE model, and highlight the formulation's ease of extensibility to other classes of constitutive models.

42 ENGINEERING↗

DOE OSTI2025

Uncertainty Quantification for Data-Driven Machine Learning Models in Nuclear Engineering Applications: Where We Are and What Do We Need?

Machine learning (ML) has been leveraged to tackle a diverse range of tasks in almost all branches of nuclear engineering. Many of the successes in ML applications can be attributed to the recent performance breakthroughs in deep learning, the growing availability of computational power, data, and easy-to-use ML libraries. However, these empirical successes have often outpaced our formal understanding of the ML algorithms. An important but under-rated area is uncertainty quantification (UQ) of ML. ML-based models are subject to approximation uncertainty when they are used to make predictions, due to sources including but not limited to, data noise, data coverage, extrapolation, imperfect model architecture and the stochastic training process. The goal of this paper is to clearly explain and illustrate the importance of UQ of ML. We will elucidate the differences in the basic concepts of UQ of physics-based models and data-driven ML models. Various sources of uncertainties in physical modeling and data-driven modeling will be discussed, demonstrated, and compared. We will also present and demonstrate a few techniques to quantify the ML prediction uncertainties, including Monte Carlo dropout, deep ensemble, Bayesian neural networks, Gaussian Processes and conformal prediction. Lastly, we will discuss the need for building a verification, validation and UQ framework to establish ML credibility.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2021

Multilevel Training of Neural Networks

MTNN is a software library for applying multilevel algorithms on training neural networks. Based on PyTorch, it is designed to be an extensible framework to enable researchers to implement multilevel training algorithms on a variety of neural network models. This release includes a culmination of preliminary work in applying the multilevel Full Approximation Scheme technique on fully connected and convolutional neural networks to solve PDE problems (pending publication submission).

Li, Ruipeng↗

DOE OSTI2024

Implementation of the Glued Sphere Discrete Element Model for Non-Spherical Particles in MFiX Software

To enhance solver capabilities, simulation flexibility and model validation within the MFiX software, the U.S. Department of Energy (DOE) is funding efforts to develop and integrate the glued-sphere discrete element method into the latest version of MFiX as a dedicated computational module. The glued-sphere discrete element method is a numerical technique to depict the behavior of non-spherical particles in granular flows or particulate systems by representing them as a collection of component spheres. These spheres are bonded together to approximate the shape and mechanical/chemical properties of a more complex particle. The method effectively reuses the existing sphere-sphere collision algorithm, interphase momentum and heat transfer calculations utilized in the traditional discrete element method, extending these capabilities to non-spherical particles. Additionally, this method explicitly resolves intra-particle temperature and species distributions. The MFiX glued-sphere computational module includes tools for generating glued sphere configurations, a dedicated solver, and visualization capabilities in post-processing. More specifically within the computational module, collision detection and calculations were first performed on component spheres and then mapped onto non-spherical particles. The linear spring-dashpot model was utilized to simulate the sphere-sphere interactions.

Ke, Renjie↗

NASA NTRS1980

On the solution of the unsteady Navier-Stokes equations for hypersonic flow about axially-symmetric blunt bodies

A formulation of the complete Navier-Stokes problem for a viscous hypersonic flow in general curvilinear coordinates is presented. This formulation is applicable to both the axially symmetric and three dimensional flows past bodies of revolution. The equations for the case of zero angle of attack were solved past a circular cylinder with hemispherical caps by point SOR finite difference approximation. The free stream Mach number and the Reynolds number for the test case are respectively 22.04 and 168883. The whole algorithm is presented in detail along with the preliminary results for pressure, temperature, density and velocity distributions along the stagnation line.

Warsi, Z. U. A.↗

NASA NTRS1983

Minimum-fuel turning climbout and descent guidance of transport jets

The complete flightpath optimization problem for minimum fuel consumption from takeoff to landing including the initial and final turns from and to the runway heading is solved. However, only the initial and final segments which contain the turns are treated, since the straight-line climbout, cruise, and descent problems have already been solved. The paths are derived by generating fields of extremals, using the necessary conditions of optimal control together with singular arcs and state constraints. Results show that the speed profiles for straight flight and turning flight are essentially identical except for the final horizontal accelerating or decelerating turns. The optimal turns require no abrupt maneuvers, and an approximation of the optimal turns could be easily integrated with present straight-line climb-cruise-descent fuel-optimization algorithms. Climbout at the optimal IAS rather than the 250-knot terminal-area speed limit would save 36 lb of fuel for the 727-100 aircraft.

Neuman, F.↗

NASA NTRS1982

On conforming mixed finite element methods for incompressible viscous flow problems

The application of conforming mixed finite element methods to obtain approximate solutions of linearized Navier-Stokes equations is examined. Attention is given to the convergence rates of various finite element approximations of the pressure and the velocity field. The optimality of the convergence rates are addressed in terms of comparisons of the approximation convergence to a smooth solution in relation to the best approximation available for the finite element space used. Consideration is also devoted to techniques for efficient use of a Gaussian elimination algorithm to obtain a solution to a system of linear algebraic equations derived by finite element discretizations of linear partial differential equations.

Gunzburger, M. D↗

NASA NTRS1984

Entropy condition satisfying approximations for the full potential equations of transonic flow

A class of conservative difference approximations for the steady full potential equation was presented. They are, in general, easier to program than the usual density biasing algorithms, and in fact, differ only slightly from them. Rigorous proof indicated that these new schemes satisfied a new discrete entropy inequality, which ruled out expansion shocks, and that they have sharp, steady, discrete shocks. A key tool in the analysis is the construction of a new entropy inequality for the full potential equation itself. Results of some numerical experiments using the new schemes are presented.

Osher, S.↗

NASA NTRS1985

Piloted simulation of an algorithm for onboard control of time-optimal intercept

A piloted simulation of algorithms for onboard computation of trajectories for time-optimal intercept of a moving target by an F-8 aircraft is described. The algorithms, use singular perturbation techniques, generate commands in the cockpit. By centering the horizontal and vertical needles, the pilot flies an approximation to a time-optimal intercept trajectory. Example simulations are shown and statistical data on the pilot's performance when presented with different display and computation modes are described.

Price, D. B.↗

NASA NTRS1985

Entropy condition satisfying approximations for the full potential equation of transonic flow

Osher, S.↗

NASA NTRS1988

Numerical simulation of a subsonic jet in a crossflow

The aerodynamic/propulsive interaction between a subsonic jet exhausting perpendicularly through a flat plate into a crossflow is investigated numerically using an approximately factored, partially flux-split, implicit solver for the three-dimensional, thin-layer Navier-Stokes equations. This algorithm is applied to flows with a range of jet-to-crossflow velocity ratios between 4 and 8. The computations model the jet trajectory, the contrarotating vortex pair and the wake region near the plate downstream of the jet orifice. Both qualitative and quantitative agreement with the existing experimental database are demonstrated. Flow visualization is instructive for understanding the physics of this flowfield.

Roth, Karlin R.↗