Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “generalized 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 685 records · Page 38
All sourcesNASA NTRSDOE OSTI
NASA NTRS1983

Inelastic stress analyses at finite deformation through complementary energy approaches

A new hybrid-stress finite element algorithm, suitable for analyses of large, quasistatic, inelastic deformations, is presented. The algorithm is based upon a generalization of de Veubeke's (1972) complementary energy principle. The principal variables in the formulation are the nominal stress rate and spin, and the resulting finite element equations are discrete versions of the equations of compatibility and angular momentum balance. The algorithm produces true rates, time derivatives, as opposed to 'increments'. There results a boundary value problem (for stress rate and velocity) and an initial value problem (for total stress and deformation). A discussion of the numerical treatment of the boundary value problem is followed by a detailed examination of the numerical treatment of the initial value problem, covering the topics of efficiency, stability, and objectivity. The paper is closed with a set of examples, finite homogeneous deformation problems, which serve to bring out important aspects of the algorithm.

Atluri, S. N.↗
NASA NTRS2005

Single-Scale Retinex Using Digital Signal Processors

The Retinex is an image enhancement algorithm that improves the brightness, contrast and sharpness of an image. It performs a non-linear spatial/spectral transform that provides simultaneous dynamic range compression and color constancy. It has been used for a wide variety of applications ranging from aviation safety to general purpose photography. Many potential applications require the use of Retinex processing at video frame rates. This is difficult to achieve with general purpose processors because the algorithm contains a large number of complex computations and data transfers. In addition, many of these applications also constrain the potential architectures to embedded processors to save power, weight and cost. Thus we have focused on digital signal processors (DSPs) and field programmable gate arrays (FPGAs) as potential solutions for real-time Retinex processing. In previous efforts we attained a 21 (full) frame per second (fps) processing rate for the single-scale monochromatic Retinex with a TMS320C6711 DSP operating at 150 MHz. This was achieved after several significant code improvements and optimizations. Since then we have migrated our design to the slightly more powerful TMS320C6713 DSP and the fixed point TMS320DM642 DSP. In this paper we briefly discuss the Retinex algorithm, the performance of the algorithm executing on the TMS320C6713 and the TMS320DM642, and compare the results with the TMS320C6711.

Hines, Glenn↗
NASA NTRS1981

Software for universal noiseless coding

An overview is provided of the universal noiseless coding algorithms as well as their relationship to the now available FORTRAN implementations. It is suggested that readers considering investigating the utility of these algorithms for actual applications should consult both NASA's Computer Software Management and Information Center (COSMIC) and descriptions of coding techniques provided by Rice (1979). Examples of applying these techniques have also been given by Rice (1975, 1979, 1980). Attention is given to reversible preprocessing, general implementation instructions, naming conventions, and calling arguments. A general applicability of the considered algorithms to solving practical problems is obtained because most real data sources can be simply transformed into the required form by appropriate preprocessing.

Rice, R. F.↗
NASA NTRS1983

A new algorithm for constrained nonlinear least-squares problems, part 1

A Gauss-Newton algorithm is presented for solving nonlinear least squares problems. The problem statement may include simple bounds or more general constraints on the unknowns. The algorithm uses a trust region that allows the objective function to increase with logic for retreating to best values. The computations for the linear problem are done using a least squares system solver that allows for simple bounds and linear constraints. The trust region limits are defined by a box around the current point. In its current form the algorithm is effective only for problems with small residuals, linear constraints and dense Jacobian matrices. Results on a set of test problems are encouraging.

Hanson, R. J.↗
NASA NTRS1988

A survey of the state-of-the-art and focused research in range systems

In this one-year renewal of NASA Contract No. 2-304, basic research, development, and implementation in the areas of modern estimation algorithms and digital communication systems have been performed. In the first area, basic study on the conversion of general classes of practical signal processing algorithms into systolic array algorithms is considered, producing four publications. Also studied were the finite word length effects and convergence rates of lattice algorithms, producing two publications. In the second area of study, the use of efficient importance sampling simulation technique for the evaluation of digital communication system performances were studied, producing two publications.

Kung, Yao↗
NASA NTRSDate not supplied

Newly Available Single Field-of-view Sounder Atmospheric Product (SiFSAP) and Its Derivative Product

The Single Field-of-view Sounder Atmospheric product (SiFSAP) has been developed and delivered to NASA GES DISC. The SiFSAP Algorithm Theoretical Basis Documents (ATBD) and users manuals are ready to be released to public. This novel data product supplements other operational products such as AIRS version 7 and the Community Long-term Infrared Microwave Combined Atmospheric Product System (CLIMCAPS) from two main perspectives: 1) improving the spatial resolution of sounder Level-2 data to extend its usage in weather and dynamics focus area; 2) establishing radiance closure between Level-2 data and directly measured Level-1 radiances to facilitate the climate trend analysis. SiFSAP has 3-times higher spatial resolution and 9-times denser data products comparing to current NASA and NOAA operational IR sounder products. SiFSAP is derived using the optimal estimation method based physical retrieval algorithm. The Principal Component-based Radiative Transfer Model (PCRTM) which includes the cloud scattering simulation is used for the forward model so that the solution can fit the spectral radiances under all-sky conditions for individual single field-of-view (SFOV) measurements. A general introduction of the SiFSAP algorithm and corresponding validation work will be presented. Also introduced here is the Climate Fingerprinting Sounder product (ClimFiSP) that is the derivative product of SiFSAP and will be released in the near future. The ClimFiSP algorithm uses pre-constructed fingerprinting relationship to achieve a low-latency Level-3 data production and facilitate the fusion of data of different sounders.

Wan Wu↗
NASA NTRS1990

Navier-Stokes computations for aerodynamic configurations at high angles of attack

Navier-Stokes computations at high angles of attack over aerodynamic configurations are presented using an implicit finite-volume algorithm. The spatial differencing is upwind-biased for the convective and pressure terms and central for the shear stress and heat transfer terms. The equations are relaxed to steady state with a spatially factored implicit algorithm. In order to treat general geometries, a multiblock patched-grid framework is implemented. Applications and detailed comparisons with experimental data are made for two simple but representative geometric shapes: (1) a highly swept delta wing and (2) a prolate spheroid of 6:1 length-to-diameter. Recent extensions of the algorithm to compute the flow over an F-18 forebody-strake configuration are shown, including comparisons with wind tunnel and flight test results. Comparisons across the range of Reynolds number for all cases indicate that either low Reynolds number or high Reynolds number flows are simulated well, but that flows at intermediate Reynolds number cannot be simulated accurately without a detailed knowledge of the transitional zone between laminar and turbulent flow.

Thomas, J. L.↗
DOE OSTI2026

New approaches to Bayesian uncertainty quantification for Nuclear Science (Final Technical Report)

Inverse problems play a central role in experimentation and theory/data comparisons for many areas of modern Nuclear Physics (NP) and High-Energy Physics (HEP). Bayes’s Theorem is a powerful tool for solving Inverse Problems, providing conceptually transparent and unbiased constraints on theoretical parameters and their uncertainties (“Bayesian Inference”) and enabling the quantification of agreement or tension between models and data. However, analyses based on Bayesian Inference are often challenging for NP and HEP applications, either because of the large number of parameters in the problem, the high computational cost, or both. We propose a multi-institutional collaboration to develop and deploy novel Bayesian analysis tools that advance the scientific scope of a broad range of current and future NP experiments. This project brings together NP domain scientists working on several high-profile NP projects for which new, high-performance Bayesian Uncertainty Quantification (“Bayesian UQ”) methods are essential to carry out the science, and data scientists who are developing state-of-the-art methods applicable to these problems. The NP projects in this proposal comprise measurements of the mass and fundamental nature of the neutrino; study of the Quark-Gluon Plasma that filled the early universe; and mapping of natural and anthropogenic radiation environments. While these NP projects have very different scientific goals, with datasets and analysis approaches that differ significantly, they share common requirements for improving computationally intensive Bayesian analyses using advanced Machine Learning algorithms and will benefit strongly from a coherent effort to develop general solutions. This proposal brings together these projects and forefront ML-based data science algorithms to develop such general solutions. The methods developed in this project will also be more widely applicable, thereby advancing science in the larger Nuclear Physics portfolio.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1990

General method for assessing the geographically correlated error for an orbiter with applications to Topex

An estimation based computational algorithm for evaluating geographically dependent orbit determination errors is presented. A derivation is included of the generalized geographically correlated error analysis algorithm and the algorithm is applied to a Topex simulation. Then a general numerical technique which provides the capability to analyze any type of mismodeled parameter with the geopotential as a special case is described. The numerical algorithm is compared with the analytic method of Rosborough (1986) and it is shown that both methods generate consistent geographically dependent orbit error profiles when the ephemeris error is dominated by the mismodeled geopotential.

Wolff, P. J.↗
NASA NTRS1984

Fast algorithms for combustion kinetics calculations: A comparison

To identify the fastest algorithm currently available for the numerical integration of chemical kinetic rate equations, several algorithms were examined. Findings to date are summarized. The algorithms examined include two general-purpose codes EPISODE and LSODE and three special-purpose (for chemical kinetic calculations) codes CHEMEQ, CRK1D, and GCKP84. In addition, an explicit Runge-Kutta-Merson differential equation solver (IMSL Routine DASCRU) is used to illustrate the problems associated with integrating chemical kinetic rate equations by a classical method. Algorithms were applied to two test problems drawn from combustion kinetics. These problems included all three combustion regimes: induction, heat release and equilibration. Variations of the temperature and species mole fraction are given with time for test problems 1 and 2, respectively. Both test problems were integrated over a time interval of 1 ms in order to obtain near-equilibration of all species and temperature. Of the codes examined in this study, only CREK1D and GCDP84 were written explicitly for integrating exothermic, non-isothermal combustion rate equations. These therefore have built-in procedures for calculating the temperature.

Radhakrishnan, K.↗
DOE OSTI2022

Electromagnetic total- f algorithm for gyrokinetic particle-in-cell simulations of boundary plasma in XGC

We report the simplified δf mixed-variable/pullback electromagnetic simulation algorithm implemented in XGC for core plasma simulations by Cole et al. [Phys. Plasmas 28, 034501 (2021)] has been generalized to a total- f electromagnetic algorithm that can include, for the first time, the boundary plasma in diverted magnetic geometry with neutral particle recycling, turbulence, and neoclassical physics. The δf mixed-variable/pullback electromagnetic implementation is based on the pioneering work by Kleiber and Mischenko et al. [Kleiber et al., Phys. Plasmas 23, 032501 (2016); Mishchenko et al., Comput. Phys. Commun. 238, 194 (2019)]. An electromagnetic demonstration simulation is performed in a DIII-D-like, H-mode boundary plasma, including a corresponding comparative electrostatic simulation, which confirms that the electromagnetic simulation is necessary for a higher fidelity understanding of the electron particle and heat transport even at the low- β pedestal foot in the vicinity of the magnetic separatrix.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRSDate not supplied

Adaptive Optimization for System Performance and Combined Bernstein Polynomial, Optimal Reciprocal Collision Avoidance, Differential Dynamic Programming for Trajectory Replanning and Collision Avoidance for UAM Vehicles

The emerging urban air mobility (UAM) sector in aerospace is driving development of unconventional multi-modal vehicle configurations and autonomous flight. The combination of multi-modal vehicle dynamics, complex environment, requirements to deal with flight contingencies in an efficient and safe manner, as well as necessity for precise trajectory following and performance, are the driving influence behind adaptive optimization for system performance. We are interested in trajectory optimization algorithm that would system parameter estimation and identifying the optimal switching time between modes of hybrid dynamical systems. This presentation discusses a parameterized optimal control trajectory optimization algorithm that is an extended and generalized version of Differential Dynamic Programming (DDP), titled Parameterized Differential Dynamic Programming (PDDP). DDP is an efficient trajectory optimization algorithm relying on second order approximations of a system’s dynamics and cost function and has recently been applied to optimize systems with time invariant parameters. Experiments are presented applying PDDP to solve model predictive control (MPC) and moving horizon estimation (MHE) tasks simultaneously. In particular, PDDP is used to determine the optimal transition point between flight regimes of a complex urban air mobility (UAM) class vehicle exhibiting multiple phases of flight and to identify and compensate for actuation faults.

optimization↗
DOE OSTI2020

Parameter Sensitivity Analysis of the SparTen High Performance Sparse Tensor Decomposition Software (Extended Analysis)

Tensor decomposition models play an increasingly important role in modern data science applications. One problem of particular interest is fitting a low-rank Canonical Polyadic (CP) tensor decomposition model when the tensor has sparse structure and the tensor elements are nonnegative count data. SparTen is a high-performance C++ library which computes a low-rank decomposition using different solvers: a first-order quasi-Newton or a second-order damped Newton method, along with the appropriate choice of runtime parameters. Since default parameters in SparTen are tuned to experimental results in prior published work on a single real-world dataset conducted using MATLAB implementations of these methods, it remains unclear if the parameter defaults in SparTen are appropriate for general tensor data. Furthermore, it is unknown how sensitive algorithm convergence is to changes in the input parameter values. This report addresses these unresolved issues with large-scale experimentation on three benchmark tensor data sets. Experiments were conducted on several different CPU architectures and replicated with many initial states to establish generalized profiles of algorithm convergence behavior.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2004

Ozone and Aerosol Retrieval from Backscattered Ultraviolet Radiation

In this presentation we will discuss the techniques to estimate total column ozone and aerosol absorption optical depth from the measurements of backscattered ultraviolet (buv) radiation. The total ozone algorithm has been used to create a unique record of the ozone layer, spanning more than 3 decades, from a series of instruments (BUV, SBUV, TOMS, SBUV/2) flown on NASA, NOAA, Japanese and Russian satellites. We will discuss how this algorithm can be considered a generalization of the well-known Dobson/Brewer technique that has been used to process data from ground-based instruments for many decades, and how it differs from the DOAS techniques that have been used to estimate vertical column densities of a host of trace gases from data collected by GOME and SCIAMACHY instruments. The BUV aerosol algorithm is most suitable for the detection of UV absorbing aerosols (smoke, desert dust, volcanic ash) and is the only technique that can detect aerosols embedded in clouds. This algorithm has been used to create a quarter century record of aerosol absorption optical depth using the BUV data collected by a series of TOMS instruments. We will also discuss how the data from the OM1 instrument launched on July 15,2004 will be combined with data from MODIS and CALIPSO lidar data to enhance the accuracy and information content of satellite-derived aerosol measurements. The OM1 and MODIS instruments are currently flying on EOS Aura and EOS Aqua satellites respectively, part of a constellation of satellites called the "A-train". The CALIPSO satellite is expected to join this constellation in mid 2005.

Bhartia, Pawan K.↗
NASA NTRS2012

Ozone and Aerosol Retrieval from Backscattered Ultraviolet Radiation

In this presentation we will discuss the techniques to estimate total column ozone and aerosol absorption optical depth from the measurements of back scattered ultraviolet (buv) radiation. The total ozone algorithm has been used to create a unique record of the ozone layer, spanning more than 3 decades, from a series of instruments (BUV, SBUV, TOMS, SBUV/2) flown on NASA, NOAA, Japanese and Russian satellites. We will discuss how this algorithm can be considered a generalization of the well-known Dobson/Brewer technique that has been used to process data from ground-based instruments for many decades, and how it differs from the DOAS techniques that have been used to estimate vertical column densities of a host of trace gases from data collected by GOME and SCIAMACHY instruments. The buv aerosol algorithm is most suitable for the detection of UV absorbing aerosols (smoke, desert dust, volcanic ash) and is the only technique that can detect aerosols embedded in clouds. This algorithm has been used to create a quarter century record of aerosol absorption optical depth using the buv data collected by a series of TOMS instruments. We will also discuss how the data from the OMI instrument launched on July 15, 2004 will be combined with data from MODIS and CALIPSO lidar data to enhance the accuracy and information content of satellite-derived aerosol measurements. The OMI and MODIS instruments are currently flying on EOS Aura and EOS Aqua satellites respectively, part of a constellation of satellites called the "A-train".

Bhartia, Pawan K.↗
NASA NTRS1982

A concept for a fuel efficient flight planning aid for general aviation

A core equation for estimation of fuel burn from path profile data was developed. This equation was used as a necessary ingredient in a dynamic program to define a fuel efficient flight path. The resultant algorithm is oriented toward use by general aviation. The pilot provides a description of the desired ground track, standard aircraft parameters, and weather at selected waypoints. The algorithm then derives the fuel efficient altitudes and velocities at the waypoints.

Collins, B. P.↗
DOE OSTI2023

Non-Boolean quantum amplitude amplification and quantum mean estimation

This paper generalizes the quantum amplitude amplification and amplitude estimation algorithms to work with non-Boolean oracles. The action of a non-Boolean oracle $U_\varphi $ on an eigenstate $\mathinner {|{x}\rangle }$ is to apply a state-dependent phase-shift $\varphi (x)$. Unlike Boolean oracles, the eigenvalues $\exp (i\varphi (x))$ of a non-Boolean oracle are not restricted to be $\pm 1$. Two new oracular algorithms based on such non-Boolean oracles are introduced. The first is the non-Boolean amplitude amplification algorithm, which preferentially amplifies the amplitudes of the eigenstates based on the value of $\varphi (x)$. Starting from a given initial superposition state $\mathinner {|{\psi _0}\rangle }$, the basis states with lower values of $\cos (\varphi )$ are amplified at the expense of the basis states with higher values of $\cos (\varphi )$. The second algorithm is the quantum mean estimation algorithm, which uses quantum phase estimation to estimate the expectation $\mathinner {\langle {\psi _0|U_\varphi |\psi _0}\rangle }$, i.e., the expected value of $\exp (i\varphi (x))$ for a random x sampled by making a measurement on $\mathinner {|{\psi _0}\rangle }$. It is shown that the quantum mean estimation algorithm offers a quadratic speedup over the corresponding classical algorithm. Both algorithms are demonstrated using simulations for a toy example. Potential applications of the algorithms are briefly discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1999

The Structure and Evolution of LOCBURST: The BATSE Burst Location Algorithm

The gamma-ray burst (GRB) location algorithm used to produce the BATSE GRB locations is described. The general flow of control of the current location algorithm is presented, and the significant properties of the various physical inputs required are identified. The development of the burst location algorithm during the releases of the BATSE IB, 2B, and 3B GRB catalogs is presented so that the reasons for the differences in the positions and error estimates between the catalogs can be understood. In particular, differences between the 2B and 3B locations are discussed for events that have moved significantly and the reasons for the changes explained. The locations of bursts located independently by the interplanetary network (IPN) are used to illustrate the effect on burst location accuracy of various components of the algorithm. IPN data and locations from other gamma-ray instruments are used to calculate estimates of the systematic errors on BATSE burst locations.

Pendleton, Geoffrey N.↗