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 973 records · Page 54

A conservative type-dependent full potential method for the treatment of supersonic flows with embedded subsonic regions

A nonlinear method based on the full potential equation in conservation form, cast in an arbitrary coordinate system, has been developed to treat predominantly supersonic flows with embedded subsonic regions. This type of flow field occurs frequently near the fuselage-canopy junction area and wing leading edge regions for a moderately swept fighter configuration. The method uses the theory of characteristics to accurately monitor the type-dependent flow field. A conservative switching scheme is developed to transition from the supersonic marching algorithm to a subsonic relaxation procedure, and vice versa. An implicit approximate factorization scheme is employed to solve the finite-differenced equation. Results are shown for a few configurations, including a wing-body-wake realistic fighter model having embedded subsonic regions.

Shankar, V.↗

Application of a full potential method for computation of three-dimensional supersonic flows

A nonlinear aerodynamic analysis technique based on the full potential equation in conservative form has been modified to permit treatment of supersonic flows with embedded subsonic regions (typically near the fuselage-canopy juncture and the wing leading edge). Solution procedures for the equations do not require any specific form of geometry or physical grid system. This results in the capability to analyze easily very complex geometries provided the posed problem lies within the isentropic restrictions of the full potential theory. Characteristic signal propagation theory is used to monitor the type dependent flow and a conservative switching scheme is employed to transition from the supersonic marching algorithm to a subsonic relaxation procedure and vice versa. An implicit approximate factorization scheme is used to solve the finite-difference equations. These modifications now permit analysis of fully three-dimensional flowfields including the interference effects due to lifting surface wakes. Improved grid generation capability allows analysis of complete complex aircraft geometries (fuselage, wing, tail, wing wake, and tail wake). Results are presented showing very good correlations with experimental surface pressure data and aerodynamic force data at both design and off-design operating points. Configurations examined include several waverider concepts, an arrow wing-body with wake, an advanced tactical fighter concept, and a fighter forebody-canard configuration.

Jones, K. M.↗

The usefulness of Klett's inversion algorthms to simulated satellite Lidar returns

The lidar equation is a special form of the radiative transport equation in single scattering approximation and describes the return signal of a lidar. Klett's algorithm for retrieving the total extinction coefficient profile was developed for application to ground-based lidar returns by a backward integration from the far end to the near end, the range where the incident and backscattered pulse overlap totally. The applicability of Klett's algorithm to satellite backscatter lidar returns was assessed. The simulated data of a 1 J Alexandrite laser operated at about 0.7 micron and at a satellite flight level of 840 km.

Kastner, M.↗

Analysis of a parallelized nonlinear elliptic boundary value problem solver with application to reacting flows

A parallelized finite difference code based on the Newton method for systems of nonlinear elliptic boundary value problems in two dimensions is analyzed in terms of computational complexity and parallel efficiency. An approximate cost function depending on 15 dimensionless parameters is derived for algorithms based on stripwise and boxwise decompositions of the domain and a one-to-one assignment of the strip or box subdomains to processors. The sensitivity of the cost functions to the parameters is explored in regions of parameter space corresponding to model small-order systems with inexpensive function evaluations and also a coupled system of nineteen equations with very expensive function evaluations. The algorithm was implemented on the Intel Hypercube, and some experimental results for the model problems with stripwise decompositions are presented and compared with the theory. In the context of computational combustion problems, multiprocessors of either message-passing or shared-memory type may be employed with stripwise decompositions to realize speedup of O(n), where n is mesh resolution in one direction, for reasonable n.

Keyes, David E.↗

Estimators of primary production for interpretation of remotely sensed data on ocean color

The theoretical basis is explained for some commonly used estimators of daily primary production in a vertically uniform water column. These models are recast into a canonical form, with dimensionless arguments, to facilitate comparison with each other and with an analytic solution. The limitations of each model are examined. The values of the photoadaptation parameter I(k) observed in the ocean are analyzed, and I(k) is used as a scale to normalize the surface irradiance. The range of this scaled irradiance is presented. An equation is given for estimation of I(k) from recent light history. It is shown how the models for water column production can be adapted for estimation of the production in finite layers. The distinctions between model formulation, model implementation and model evaluation are discussed. Recommendations are given on the choice of algorithm for computation of daily production according to the degree of approximation acceptable in the result.

Platt, Trevor↗

Algorithm For Integer Cosine Transforms

Algorithm computes coefficients of integer cosine transforms, containing only integer coefficients approximately proportional to floating-point coefficients of discrete cosine transforms. Used in compression of image data in blocks of N x N pixels, discrete cosine transforms involve large amounts of computation, typically amounting to 80 percent of computational load in data-compression scheme. In constructing integer approximations, competing requirements are to obtain data-compression and data-decompression performances comparable to those of corresponding descrete cosine transforms while taking advantage of simplicity afforded by integer arithmetic to reduce complexity and amount of computation.

Pollara, Fabrizio↗

Telerobotic control of a mobile coordinated robotic server

The annual report on telerobotic control of a mobile coordinated robotic server is presented. The goal of this effort is to develop advanced control methods for flexible space manipulator systems. As such, an adaptive fuzzy logic controller was developed in which model structure as well as parameter constraints are not required for compensation. The work builds upon previous work on fuzzy logic controllers. Fuzzy logic controllers have been growing in importance in the field of automatic feedback control. Hardware controllers using fuzzy logic have become available as an alternative to the traditional PID controllers. Software has also been introduced to aid in the development of fuzzy logic rule-bases. The advantages of using fuzzy logic controllers include the ability to merge the experience and intuition of expert operators into the rule-base and that a model of the system is not required to construct the controller. A drawback of the classical fuzzy logic controller, however, is the many parameters needed to be turned off-line prior to application in the closed-loop. In this report, an adaptive fuzzy logic controller is developed requiring no system model or model structure. The rule-base is defined to approximate a state-feedback controller while a second fuzzy logic algorithm varies, on-line, parameters of the defining controller. Results indicate the approach is viable for on-line adaptive control of systems when the model is too complex or uncertain for application of other more classical control techniques.

Lee, Gordon↗

Non-Equilibrium Turbulence Modeling for High Lift Aerodynamics

This phase is discussed in ('Non linear kappa - epsilon - upsilon(sup 2) modeling with application to high lift', Application of the kappa - epsilon -upsilon(sup 2) model to multi-component airfoils'). Further results are presented in 'Non-linear upsilon(sup 2) - f modeling with application to high-lift' The ADI solution method in the initial implementation was very slow to converge on multi-zone chimera meshes. I modified the INS implementation to use GMRES. This provided improved convergence and less need for user intervention in the solution process. There were some difficulties with implementation into the NASA compressible codes, due to their use of approximate factorization. The Helmholtz equation for f is not an evolution equation, so it is not of the form assumed by the approximate factorization method. Although The Kalitzin implementation involved a new solution algorithm ('An implementation of the upsilon(sup 2) - f model with application to transonic flows'). The algorithm involves introducing a relaxation term in the f-equation so that it can be factored. The factorization can be into a plane and a line, with GMRES used in the plane. The NASA code already evaluated coefficients in planes, so no additional memory is required except that associated the the GMRES algorithm. So the scope of this project has expanded via these interactions. . The high-lift work has dovetailed into turbine applications.

Durbin, P. A.↗

Independent Component Analysis of Textures

A common method for texture representation is to use the marginal probability densities over the outputs of a set of multi-orientation, multi-scale filters as a description of the texture. We propose a technique, based on Independent Components Analysis, for choosing the set of filters that yield the most informative marginals, meaning that the product over the marginals most closely approximates the joint probability density function of the filter outputs. The algorithm is implemented using a steerable filter space. Experiments involving both texture classification and synthesis show that compared to Principal Components Analysis, ICA provides superior performance for modeling of natural and synthetic textures.

Manduchi, Roberto↗

Generative Representations for Automated Design of Robots

A method of automated design of complex, modular robots involves an evolutionary process in which generative representations of designs are used. The term generative representations as used here signifies, loosely, representations that consist of or include algorithms, computer programs, and the like, wherein encoded designs can reuse elements of their encoding and thereby evolve toward greater complexity. Automated design of robots through synthetic evolutionary processes has already been demonstrated, but it is not clear whether genetically inspired search algorithms can yield designs that are sufficiently complex for practical engineering. The ultimate success of such algorithms as tools for automation of design depends on the scaling properties of representations of designs. A nongenerative representation (one in which each element of the encoded design is used at most once in translating to the design) scales linearly with the number of elements. Search algorithms that use nongenerative representations quickly become intractable (search times vary approximately exponentially with numbers of design elements), and thus are not amenable to scaling to complex designs. Generative representations are compact representations and were devised as means to circumvent the above-mentioned fundamental restriction on scalability. In the present method, a robot is defined by a compact programmatic form (its generative representation) and the evolutionary variation takes place on this form. The evolutionary process is an iterative one, wherein each cycle consists of the following steps: 1. Generative representations are generated in an evolutionary subprocess. 2. Each generative representation is a program that, when compiled, produces an assembly procedure. 3. In a computational simulation, a constructor executes an assembly procedure to generate a robot. 4. A physical-simulation program tests the performance of a simulated constructed robot, evaluating the performance according to a fitness criterion to yield a figure of merit that is fed back into the evolutionary subprocess of the next iteration. In comparison with prior approaches to automated evolutionary design of robots, the use of generative representations offers two advantages: First, a generative representation enables the reuse of components in regular and hierarchical ways and thereby serves a systematic means of creating more complex modules out of simpler ones. Second, the evolved generative representation may capture intrinsic properties of the design problem, so that variations in the representations move through the design space more effectively than do equivalent variations in a nongenerative representation. This method has been demonstrated by using it to design some robots that move, variously, by walking, rolling, or sliding. Some of the robots were built (see figure). Although these robots are very simple, in comparison with robots designed by humans, their structures are more regular, modular, hierarchical, and complex than are those of evolved designs of comparable functionality synthesized by use of nongenerative representations.

Homby, Gregory S.↗

The Hitchhiker's Guide to the Outer Solar System

We propose a novel deep space propulsion method called the Comet Hitchhiker. The concept is to perform momentum exchange with small bodies (i.e., asteroid and comet) using an extendable/retrievable tether and a harpoon. Unlike previously proposed tethered fly-by, the use of extendable tether enables to change the relative speed with a target. Hence Hitchhiker would be a prospective means of providing orbit insertion deltaV, particularly for rendezvous missions to small bodies in the outer Solar System such as Kuiper belt objects and Centaurs, which are not easily manageable with chemical propulsion or solar electric propulsion. Furthermore, by applying regenerative brake during a hitchhike maneuver, a Hitchhiker can harvest energy. The stored energy can be used to make a departure from the target by quickly retrieving the tether, which we call a inverse hitchhike maneuver. By repeating hitchhike and inverse Hitchhike maneuvers, a Hitchhiker could perform a mission to rendezvous with multiple targets efficiently, which we call a multi-hitchhike mission. We derive the basic equation of Hitchhiker, namely the Space Hitchhike Equation, which relates the specific strength and mass fraction of tether to achievable ∆V. We then perform detailed feasibility analysis through finite element simulations of tether as well as hypervelocity impact simulations of the harpoon using the Adaptive Mesh Refinement Objected-oriented C++ (AMROC) algorithm. The analysis results suggest that a hitchhike maneuver with deltaV = approximately 1.5km/s is feasible with flight proven materials such as Kevlar/Zylon tether and tungsten harpoon. A carbon nanotube tether, combined with diamond harpoon, would enable approximately 10 km/s hitchhike maneuver. Finally, we present two particular mission scenarios for Hitchhiker: Pluto rendezvous and a multi-hitchhike mission to the Themis family asteroids in the main belt.

Ono, Masahiro↗

The Hitchhiker's Guide to the Outer Solar System

We propose a novel deep space propulsion method called the Comet Hitchhiker. The concept is to perform momentum exchange with small bodies (i.e., asteroid and comet) using an extendable/retrievable tether and a harpoon. Unlike previously proposed tethered fly-by, the use of extendable tether enables to change the relative speed with a target. Hence Hitchhiker would be a prospective means of providing orbit insertion deltaV, particularly for rendezvous missions to small bodies in the outer Solar System such as Kuiper belt objects and Centaurs, which are not easily manageable with chemical propulsion or solar electric propulsion. Furthermore, by applying regenerative brake during a hitchhike maneuver, a Hitchhiker can harvest energy. The stored energy can be used to make a departure from the target by quickly retrieving the tether, which we call a inverse hitchhike maneuver. By repeating hitchhike and inverse Hitchhike maneuvers, a Hitchhiker could perform a mission to rendezvous with multiple targets efficiently, which we call a multi-hitchhike mission. We derive the basic equation of Hitchhiker, namely the Space Hitchhike Equation, which relates the specific strength and mass fraction of tether to achievable ∆V. We then perform detailed feasibility analysis through finite element simulations of tether as well as hypervelocity impact simulations of the harpoon using the Adaptive Mesh Refinement Objected-oriented C++ (AMROC) algorithm. The analysis results suggest that a hitchhike maneuver with deltaV = approximately 1.5km/s is feasible with flight proven materials such as Kevlar/Zylon tether and tungsten harpoon. A carbon nanotube tether, combined with diamond harpoon, would enable approximately 10 km/s hitchhike maneuver. Finally, we present two particular mission scenarios for Hitchhiker: Pluto rendezvous and a multi-hitchhike mission to the Themis family asteroids in the main belt.

Ono, Masahiro↗

Semi-analytic preliminary design of low-thrust missions

Using generalized logarithmic spirals to approximate low-thrust trajectories, a new strategy for the design of low-thrust gravity-assist transfers has been developed. Each transfer leg is defined by a semi-analytic model, and its solution is equivalent to a hybrid Lambert’s problem. The method is suitable for approximating both flyby and rendezvous transfer legs. A branch and prune algorithm is used to generate a collection of initial guesses for further optimization. The analytic nature of the low-thrust model simplifies the pruning step, since dynamical and operational constraints (like maximum thrust or total v) can be imposed easily. The solutions obtained with the global search algorithm can be post-processed, filtered, and ranked according to various criteria. This is where the versatility of the method resides, because changing the selection criteria does not require a new search. Selected candidates are then optimized further, in order to generate actual low-thrust orbits. Two mission design examples are presented: an asteroid deflection mission using a kinetic impactor, and a rendezvous mission to Jupiter. These examples are used to analyze the convergence of the optimization stage, in particular how far from the optimal solution the initial guesses are.

Park, Ryan S.↗

Estimating groundwater use and demand in arid Kenya through assimilation of satellite data and in-situ sensors with machine learning toward drought early action

Groundwater is an important source of water for people, livestock, and agriculture during drought in the Horn of Africa. In this work, areas of high groundwater use and demand in drought-prone Kenya were identified and forecasted prior to the dry season. Estimates of groundwater use were extended from a sentinel network of 69 in-situ sensored mechanical boreholes to the region with satellite data and a machine learning model. The sensors contributed 756 site-month observations from June 2017 to September 2021 for model building and validation at a density of approximately one sensor per 3700 sq.km. An ensemble of 19 parameterized algorithms was informed by features including satellite-derived precipitation, surface water availability, vegetation indices, hydrologic land surface modeling, and site characteristics to dichotomize high groundwater pump utilization. Three operational definitions of high demand on groundwater infrastructure were considered: 1) mechanical runtime of pumps greater than a quarter of a day (6+ hr) and daily per capita volume extractions indicative of 2) domestic water needs (35+ L), and 3) intermediate needs including livestock (75+ L). Gridded interpolation of localized groundwater use and demand was provided from 2017 to 2020 and forecasted for the 2021 dry season, June–September 2021. Cross-validated skill for contemporary estimates of daily pump runtime and daily volume extraction to meet domestic and intermediate water needs was 68%, 69%, and 75%, respectively. Forecasts were externally validated with an accuracy of at least 56%, 70%, or 72% for each groundwater use definition. The groundwater maps are accessible to stakeholders including the Kenya National Drought Management Authority (NDMA) and the Famine Early Warning Systems Network (FEWS NET). These maps represent the first operational spatially-explicit sub-seasonal to seasonal (S2S) estimates of groundwater use and demand in the literature. Knowledge of historical and forecasted groundwater use is anticipated to improve decision-making and resource allocation for a range of early warning early action applications.

Katie Fankhauser↗

Correction of Path Integrated Attenuation Estimates Considering the Soil Moisture Effect for the Gpm Dual-Frequency Precipitation Radar

Spaceborne precipitation radars, including the Tropical Rainfall Measuring Mission’s Precipitation Radar (PR) and the Global Precipitation Measurement Mission’s Dual-Frequency Precipitation Radar (DPR), measure not only precipitation echoes but surface echoes as well, the latter of which are used to estimate the path-integrated attenuation (PIA) in the surface reference technique (SRT). In our previous study based on analyzing PR measurements, we found that attenuation-free surface backscattering cross sections (denoted by s0e) over land increased in the presence of precipitation. This behavior, called the soil moisture effect, causes an underestimate of the PIA by the SRT as the method does not explicitly consider this effect. In this study, measurements made by Ku-band Precipitation Radar (KuPR) and Ka-band Precipitation Radar (KaPR), which comprise the DPR, were analyzed to examine whether KuPR and KaPR exhibit similar dependencies on the soil moisture as does the PR. For both KuPR and KaPR, an increase in s0e was observed for a large portion of the land area, except for forests and deserts. Results from the Hitschfeld–Bordan (HB) method suggest that s0e increases with the surface precipitation rate for light precipitation events. Meanwhile, for heavy precipitation, owing to the degradation of the HB method, it is difficult to estimate s0e quantitatively. Thus, a correction method for PIA that considers the soil moisture effect was developed and implemented into the DPR standard algorithm. With this correction, the surface precipitation rate estimates increased by approximately 18%for KuPR and 15%for the normal scan of KaPR over land.

Shinta Seto↗

Use of TEMPO as a Proxy for Hyperspectral Geostationary Ocean Color Measurements from the GeoXO OCX Instrument: Harnessing Machine Learning and Principal Component Techniques for Atmospheric and Glint Correction

Retrievals of ocean color from space are important for better understanding the ocean ecosystem. The launch of atmospheric geostationary hyperspectral sensors such as TEMPO, provides a unique opportunity to examine the diurnal variability in ocean ecology. While TEMPO does not have as high spatial resolution or full spectral coverage as planned coastal ocean sensors such as the Geosynchronous Littoral Imaging and Monitoring Radiometer (GLIMR) or GeoXO Ocean Color instrument (OCX), its hourly measurements provide coverage of regions such as Lake Erie and the Gulf of Mexico at spatial scales of approximately 5 km. These data can be useful for testing new algorithms. We will apply our newly developed machine learning based atmospheric correction approach for ocean color retrievals to TEMPO data. Our approach begins by decomposing measured radiances from hyperspectral sensors into spectral features that describe the scattering and absorption of the atmosphere as well as the underlying surface reflectance. The coefficients of the principal components are then used to train a neural network to predict ocean color properties derived from collocated MODIS/VIIRS physically-based retrievals. This machine learning approach does not rely on radiative transfer modeling, and the use of MODIS/VIIRS data for training accounts for possible calibration b in hyperspectral data. Previously, we applied our approach using blue and UV wavelengths with the Ozone Monitoring Instrument (OMI) and TROPOspheric Monitoring Instrument (TROPOMI) to show that it can estimate ocean color properties in less-than-ideal conditions such as lightly to moderately clouded conditions as well as sun glint and thus improve the spatial coverage of ocean color measurements. TEMPO provides an opportunity to improve on this approach since it will provide collocated measurements at green and red wavelengths that were not available from OMI and TROPOMI and are important particularly for coastal waters. Additionally, our technique can be applied early in the mission and has potential to demonstrate the value of near real time ocean color products that are important for monitoring of harmful algae blooms and other oceanic phenomena.

Zachary Fasnacht↗

A Simple Physical Optics Algorithm Perfect for Parallel Computing

One of the simplest reflector antenna computer programs is based upon a discrete approximation of the radiation integral. This calculation replaces the actual reflector surface with a triangular facet representation so that the reflector resembles a geodesic dome. The Physical Optics (PO) current is assumed to be constant in magnitude and phase over each facet so the radiation integral is reduced to a simple summation. This program has proven to be surprisingly robust and useful for the analysis of arbitrary reflectors, particularly when the near-field is desired and surface derivatives are not known. Because of its simplicity, the algorithm has proven to be extremely easy to adapt to the parallel computing architecture of a modest number of large-grain computing elements such as are used in the Intel iPSC and Touchstone Delta parallel machines.

Imbriale, W. A.↗

Computation of three-dimensional flows using two stream functions

An approach to compute 3-D flows using two stream functions is presented. The method generates a boundary fitted grid as part of its solution. Commonly used two steps for computing the flow fields are combined into a single step in the present approach: (1) boundary fitted grid generation; and (2) solution of Navier-Stokes equations on the generated grid. The presented method can be used to directly compute 3-D viscous flows, or the potential flow approximation of this method can be used to generate grids for other algorithms to compute 3-D viscous flows. The independent variables used are chi, a spatial coordinate, and xi and eta, values of stream functions along two sets of suitably chosen intersecting stream surfaces. The dependent variables used are the streamwise velocity, and two functions that describe the stream surfaces. Since for a 3-D flow there is no unique way to define two sets of intersecting stream surfaces to cover the given flow, different types of two sets of intersecting stream surfaces are considered. First, the metric of the (chi, xi, eta) curvilinear coordinate system associated with each type is presented. Next, equations for the steady state transport of mass, momentum, and energy are presented in terms of the metric of the (chi, xi, eta) coordinate system. Also included are the inviscid and the parabolized approximations to the general transport equations.

Greywall, Mahesh S.↗