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 343 records · Page 19

High Performance Parallel Multigrid Algorithms for Unstructured Grids

We describe a high performance parallel multigrid algorithm for a rather general class of unstructured grid problems in two and three dimensions. The algorithm PUMG, for parallel unstructured multigrid, is related in structure to the parallel multigrid algorithm PSMG introduced by McBryan and Frederickson, for they both obtain a higher convergence rate through the use of multiple coarse grids. Another reason for the high convergence rate of PUMG is its smoother, an approximate inverse developed by Baumgardner and Frederickson.

Frederickson, Paul O.↗

Computational Aerothermodynamic Simulation Issues on Unstructured Grids

The synthesis of physical models for gas chemistry and turbulence from the structured grid codes LAURA and VULCAN into the unstructured grid code FUN3D is described. A directionally Symmetric, Total Variation Diminishing (STVD) algorithm and an entropy fix (eigenvalue limiter) keyed to local cell Reynolds number are introduced to improve solution quality for hypersonic aeroheating applications. A simple grid-adaptation procedure is incorporated within the flow solver. Simulations of flow over an ellipsoid (perfect gas, inviscid), Shuttle Orbiter (viscous, chemical nonequilibrium) and comparisons to the structured grid solvers LAURA (cylinder, Shuttle Orbiter) and VULCAN (flat plate) are presented to show current capabilities. The quality of heating in 3D stagnation regions is very sensitive to algorithm options in general, high aspect ratio tetrahedral elements complicate the simulation of high Reynolds number, viscous flow as compared to locally structured meshes aligned with the flow.

Gnoffo, Peter A.↗

(abstract) 3D Electromagnetic Plasma Particle Simulations

A 3D electromagnetic plasma particle-in-cell code has been developed using the General Concurrent PIC algorithm. The GCPIC algorithm uses a domain decomposition to divide the computation among the processors. Particles must be exchanged between processors as they move. The efficiencies for 1-, 2-, and 3-dimensional partitions of the three dimensional domain are compared, and the algorithm is found to be very efficient even when a large fraction (e.g., 30%) of the particles must be exchanged at every time step. This PIC code has been used to perform simulations of a variety of space plasma physics problems. Results of three applications will be discussed: 1) plasma disturbances induced by moving conducting bodies in a magnetized plasma; 2) plasma plume interactions; and 3) solar wind termination shock.

electromagnetic plasma particles simulations 3D al↗

Data compression using Chebyshev transform

The present invention is a method, system, and computer program product for implementation of a capable, general purpose compression algorithm that can be engaged on the fly. This invention has particular practical application with time-series data, and more particularly, time-series data obtained form a spacecraft, or similar situations where cost, size and/or power limitations are prevalent, although it is not limited to such applications. It is also particularly applicable to the compression of serial data streams and works in one, two, or three dimensions. The original input data is approximated by Chebyshev polynomials, achieving very high compression ratios on serial data streams with minimal loss of scientific information.

Cheng, Andrew F.↗

A Framework for Optimal Control Allocation with Structural Load Constraints

Conventional aircraft generally employ mixing algorithms or lookup tables to determine control surface deflections needed to achieve moments commanded by the flight control system. Control allocation is the problem of converting desired moments into control effector commands. Next generation aircraft may have many multipurpose, redundant control surfaces, adding considerable complexity to the control allocation problem. These issues can be addressed with optimal control allocation. Most optimal control allocation algorithms have control surface position and rate constraints. However, these constraints are insufficient to ensure that the aircraft's structural load limits will not be exceeded by commanded surface deflections. In this paper, a framework is proposed to enable a flight control system with optimal control allocation to incorporate real-time structural load feedback and structural load constraints. A proof of concept simulation that demonstrates the framework in a simulation of a generic transport aircraft is presented.

Frost, Susan A.↗

Traveling-Wave Tube Efficiency Enhancement

Traveling-wave tubes (TWT's) are used to amplify microwave communication signals on virtually all NASA and commercial spacecraft. Because TWT's are a primary power user, increasing their power efficiency is important for reducing spacecraft weight and cost. NASA Glenn Research Center has played a major role in increasing TWT efficiency over the last thirty years. In particular, two types of efficiency optimization algorithms have been developed for coupled-cavity TWT's. The first is the phase-adjusted taper which was used to increase the RF power from 420 to 1000 watts and the RF efficiency from 9.6% to 22.6% for a Ka-band (29.5 GHz) TWT. This was a record efficiency at this frequency level. The second is an optimization algorithm based on simulated annealing. This improved algorithm is more general and can be used to optimize efficiency over a frequency bandwidth and to provide a robust design for very high frequency TWT's in which dimensional tolerance variations are significant.

Dayton, James A., Jr.↗

VESGEN Software for Mapping and Quantification of Vascular Regulators

VESsel GENeration (VESGEN) Analysis is an automated software that maps and quantifies effects of vascular regulators on vascular morphology by analyzing important vessel parameters. Quantification parameters include vessel diameter, length, branch points, density, and fractal dimension. For vascular trees, measurements are reported as dependent functions of vessel branching generation. VESGEN maps and quantifies vascular morphological events according to fractal-based vascular branching generation. It also relies on careful imaging of branching and networked vascular form. It was developed as a plug-in for ImageJ (National Institutes of Health, USA). VESGEN uses image-processing concepts of 8-neighbor pixel connectivity, skeleton, and distance map to analyze 2D, black-and-white (binary) images of vascular trees, networks, and tree-network composites. VESGEN maps typically 5 to 12 (or more) generations of vascular branching, starting from a single parent vessel. These generations are tracked and measured for critical vascular parameters that include vessel diameter, length, density and number, and tortuosity per branching generation. The effects of vascular therapeutics and regulators on vascular morphology and branching tested in human clinical or laboratory animal experimental studies are quantified by comparing vascular parameters with control groups. VESGEN provides a user interface to both guide and allow control over the users vascular analysis process. An option is provided to select a morphological tissue type of vascular trees, network or tree-network composites, which determines the general collections of algorithms, intermediate images, and output images and measurements that will be produced.

Parsons-Wingerter, Patricia A.↗

Experiments with a Parallel Multi-Objective Evolutionary Algorithm for Scheduling

Evolutionary multi-objective algorithms have great potential for scheduling in those situations where tradeoffs among competing objectives represent a key requirement. One challenge, however, is runtime performance, as a consequence of evolving not just a single schedule, but an entire population, while attempting to sample the Pareto frontier as accurately and uniformly as possible. The growing availability of multi-core processors in end user workstations, and even laptops, has raised the question of the extent to which such hardware can be used to speed up evolutionary algorithms. In this paper we report on early experiments in parallelizing a Generalized Differential Evolution (GDE) algorithm for scheduling long-range activities on NASA's Deep Space Network. Initial results show that significant speedups can be achieved, but that performance does not necessarily improve as more cores are utilized. We describe our preliminary results and some initial suggestions from parallelizing the GDE algorithm. Directions for future work are outlined.

scheduling↗

Chlorophyll Variability in the Oligotrophic Gyres: Mechanisms, Seasonality and Trends

A 16-year (1998-2013) analysis of trends and seasonal patterns was conducted for the 5 subtropical ocean gyres using chlorophyll-a (Chl-a) retrievals from ocean color satellite data, sea surface temperature (SST) obtained from optimally interpolated Advanced Very High Resolution Radiometer (AVHRR) data, and sea-level anomaly (SLA) from Aviso multi-sensor altimetry data. Trend analysis was also performed on mixed-layer data derived from gridded temperature and salinity profiles (1998-2010) from the Simple Ocean Data Assimilation (SODA) model. The Chl-a monthly composites were constructed from the Sea-viewing Wide Field-of-view Sensor (SeaWiFS) and Moderate-resolution Imaging Spectroradiometer (MODIS) on Aqua using two different algorithms: the standard algorithm (STD) that has been in use since the start of the SeaWiFS mission in 1997, and a more recently developed Ocean Color Index (OCI) algorithm that is purported to provide improved accuracy in low chlorophyll waters such as the oligotrophic regions of the subtropical gyres. Trends were obtained for all gyres using both STD and OCI algorithms, which demonstrated generally consistent results. The North Pacific, Indian Ocean, North Atlantic and South Atlantic gyres showed significant downward trends in Chl-a, while the South Pacific gyre has a much weaker upward trend with no statistical significance. Time series of satellite-derived net primary production (NPP) showed downward trends for all the gyres, while all 5 gyres exhibited positive trends in SST and SLA. The seasonal variability of Chl-a in each gyre is tightly coupled to the variability in mixed layer depth (MLD) with peak values in winter in both hemispheres when vertical mixing is more vigorous, reaching depths approaching the nutricline (ZNO3, here defined as the depth of the 0.2 micron nitrate concentration). On a seasonal basis, Chl-a concentrations increase when the MLD approaches or is deeper than the nutricline depth, in agreement with the concept that vertical mixing is the major driving mechanism for phytoplankton photosynthesis in the interior of the gyres. In addition, MLD and SST seasonal changes are well correlated indicating that SST is a reasonable index of vertical mixing in the gyres. The combination of surface warming trends and biomass reduction over the 16-year period has the potential to reduce atmospheric CO2 uptake by the gyres and therefore influence the global carbon cycle.

Long-term trends↗

A New Operational Snow Retrieval Algorithm Applied to Historical AMSR-E Brightness Temperatures

Snow is a key element of the water and energy cycles and the knowledge of spatio-temporal distribution of snow depth and snow water equivalent (SWE) is fundamental for hydrological and climatological applications. SWE and snow depth estimates can be obtained from spaceborne microwave brightness temperatures at global scale and high temporal resolution (daily). In this regard, the data recorded by the Advanced Microwave Scanning Radiometer-Earth Orbiting System (EOS) (AMSR-E) onboard the National Aeronautics and Space Administration's (NASA) AQUA spacecraft have been used to generate operational estimates of SWE and snow depth, complementing estimates generated with other microwave sensors flying on other platforms. In this study, we report the results concerning the development and assessment of a new operational algorithm applied to historical AMSR-E data. The new algorithm here proposed makes use of climatological data, electromagnetic modeling and artificial neural networks for estimating snow depth as well as a spatio-temporal dynamic density scheme to convert snow depth to SWE. The outputs of the new algorithm are compared with those of the current AMSR-E operational algorithm as well as in-situ measurements and other operational snow products, specifically the Canadian Meteorological Center (CMC) and GlobSnow datasets. Our results show that the AMSR-E algorithm here proposed generally performs better than the operational one and addresses some major issues identified in the spatial distribution of snow depth fields associated with the evolution of effective grain size.

passive microwave↗

Estimates of Lightning NOx Production Based on OMI NO2 Observations Over the Gulf of Mexico

We evaluate nitrogen oxide (NO(sub x) NO + NO2) production from lightning over the Gulf of Mexico region using data from the Ozone Monitoring Instrument (OMI) aboard NASAs Aura satellite along with detection efficiency-adjusted lightning data from the World Wide Lightning Location Network (WWLLN). A special algorithm was developed to retrieve the lightning NOx [(LNO(sub x)] signal from OMI. The algorithm in its general form takes the total slant column NO2 from OMI and removes the stratospheric contribution and tropospheric background and includes an air mass factor appropriate for the profile of lightning NO(sub x) to convert the slant column LNO2 to a vertical column of LNO(sub x). WWLLN flashes are totaled over a period of 3 h prior to OMI overpass, which is the time an air parcel is expected to remain in a 1 deg. x 1 deg. grid box. The analysis is conducted for grid cells containing flash counts greater than a threshold value of 3000 flashes that yields an expected LNO(sub x) signal greater than the background. Pixels with cloud radiance fraction greater than a criterion value (0.9) indicative of highly reflective clouds are used. Results for the summer seasons during 2007-2011 yield mean LNO(sub x) production of approximately 80 +/- 45 mol per flash over the region for the two analysis methods after accounting for biases and uncertainties in the estimation method. These results are consistent with literature estimates and more robust than many prior estimates due to the large number of storms considered but are sensitive to several substantial sources of uncertainty.

Lightning↗

Extension of HCDstruct for Transonic Aeroservoelastic Analysis of Unconventional Aircraft Concepts

A substantial effort has been made to implement an enhanced aerodynamic modeling capability in the Higher-fidelity Conceptual Design and structural optimization tool. This additional capability is needed for a rapid, physics-based method of modeling advanced aircraft concepts at risk of structural failure due to dynamic aeroelastic instabilities. To adequately predict these instabilities, in particular for transonic applications, a generalized aerodynamic matching algorithm was implemented to correct the doublet-lattice model available in Nastran using solution data from a priori computational fluid dynamics anal- ysis. This new capability is demonstrated for two tube-and-wing aircraft configurations, including a Boeing 737-200 for implementation validation and the NASA D8 as a first use case. Results validate the current implementation of the aerodynamic matching utility and demonstrate the importance of using such a method for aircraft configurations featuring fuselage-wing aerodynamic interaction.

Quinlan, Jesse R.↗

Evaluation of Sentinel-1A Data For Above Ground Biomass Estimation in Different Forests in India

Use of remote sensing data for mapping and monitoring of forest biomass across large spatial scales can aid in addressing uncertainties in carbon cycle. Earlier, several researchers reported on the use of Synthetic Aperture Radar (SAR) data for characterizing forest structural parameters and the above ground biomass estimation. However, these studies cannot be generalized and the algorithms cannot be applied to all types of forests without additional information on the forest physiognomy, stand structure and biomass characteristics. The radar backscatter signal also saturates as forest parameters such as biomass and the tree height increase. It is also not clear how different polarizations (VV versus VH) impact the backscatter retrievals in different forested regions. Thus, it is important to evaluate the potential of SAR data in different landscapes for characterizing forest structural parameters. In this study, the SAR data from Sentinel-1A has been used to characterize forest structural parameters including the above ground biomass from tropical forests of India. Ground based data on tree density, basal area and above ground biomass data from thirty-eight different forested sites has been collected to relate to SAR data. After the pre-processing of Sentinel 1-A data for radiometric calibration, geo-correction, terrain correction and speckle filtering, the variability in the backscatter signal in relation tree density, basal area and above biomass density has been investigated. Results from the curve fitting approach suggested exponential model between the Sentinel-1A backscatter versus tree density and above ground biomass whereas the relationship was almost linear with the basal area in the VV polarization mode. Of the different parameters, tree density could explain most of the variations in backscatter. Both VV and VH backscatter signals could explain only thirty and thirty three percent of variation in above biomass in different forest sites of India. Results also suggested saturation of the Sentinel-1A backscatter signal around hundred tonnes per hectare for VV polarization and one hundred and forty five tonnes per hectare for VH polarization. The presentation will highlight the above results in addition to potentials and limitations of Sentinel-1A data for retrieving forest structural parameters. Also, background information on different forest types of India, biomass variations and forest type mapping efforts in the region will be presented.

Data↗

3D Electromagnetic Plasma Particle Simulations on the Intel Delta Parallel Computer

A three-dimensional electromagnetic PIC code has been developed on the 512 node Intel Touchstone Delta MIMD parallel computer. This code is based on the General Concurrent PIC algorithm which uses a domain decomposition to divide the computation among the processors. The 3D simulation domain can be partitioned into 1-, 2-, or 3-dimensional subdomains. Particles must be exchanged between processors as they move among the subdomains.

PIC↗

Mission-Maps For Outbound Cislunar Transfer Trajectories

This study quantifies the robustness and sensitivity of an outbound cislunar trajectory for a lunar lander in the form of mission-maps, or topological maps that allows either a computer program or mission designer to intuitively optimize the placement of critical outbound correction burns from the derived sensitivity data. The non-linear multi-body dynamics are applied to generate an outbound cislunar reference profile used by a linear covariance analysis (LinCov) tool to compute the expected Δv and trajectory dispersions due to the initial state uncertainty, sensor errors, maneuver execution errors, and disturbance accelerations along the outbound cislunar profile. The rapid performance analysis capabilities of LinCov are complimented with parallel processing techniques to evaluate hundreds and thousands of different translational burn locations, placements, and targeting constraints to identify the combination that minimizes the total Δv usage (nominal plus 3σ Δv) and trajectory dispersions at lunar orbit insertion. This study utilizes a generalized reference targeting algorithm to quickly assess the integrated closed-loop GN&C system performance due to different targeting configurations and constraints. The resulting mission maps provide an intuitive insight to ascertain each trajectory correction maneuver’s (TCM) sensitivity to different burn times along an outbound cislunar trajectory and quickly identify desirable engineering tradeoffs when performing analysis on the number and placement of these burns that nominally zero. Multiple mission maps are generated for a variety of different performance parameters that allow engineers to visually identify optimal solutions for trajectory correction maneuver placements, the number of correction burns, and the targeting constraints for each burn.

GN&C↗

Low-Thrust Trajectory Optimization with Simplified SQP Algorithm

The problem of low-thrust trajectory optimization in highly perturbed dynamics is a stressing case for many optimization tools. Highly nonlinear dynamics and continuous thrust are each, separately, non-trivial problems in the field of optimal control, and when combined, the problem is even more difficult. This paper de-scribes a fast, robust method to design a trajectory in the CRTBP (circular restricted three body problem), beginning with no or very little knowledge of the system. The approach is inspired by the SQP (sequential quadratic programming) algorithm, in which a general nonlinear programming problem is solved via a sequence of quadratic problems. A few key simplifications make the algorithm presented fast and robust to initial guess: a quadratic cost function, neglecting the line search step when the solution is known to be far away, judicious use of end-point constraints, and mesh refinement on multiple shooting with fixed-step integration.In comparison to the traditional approach of plugging the problem into a “black-box” NLP solver, the methods shown converge even when given no knowledge of the solution at all. It was found that the only piece of information that the user needs to provide is a rough guess for the time of flight, as the transfer time guess will dictate which set of local solutions the algorithm could converge on. This robustness to initial guess is a compelling feature, as three-body orbit transfers are challenging to design with intuition alone. Of course, if a high-quality initial guess is available, the methods shown are still valid.We have shown that endpoints can be efficiently constrained to lie on 3-body repeating orbits, and that time of flight can be optimized as well. When optimizing the endpoints, we must make a trade between converging quickly on sub-optimal endpoints or converging more slowly on end-points that are arbitrarily close to optimal. It is easy for the mission design engineer to adjust this trade based on the problem at hand.The biggest limitation to the algorithm at this point is that multi-revolution transfers (greater than 2 revolutions) do not work nearly as well. This restriction comes in because the relationship between node 1 and node N becomes increasingly nonlinear as the angular distance grows. Trans-fers with more than about 1.5 complete revolutions generally require the line search to improve convergence. Future work includes: Comparison of this algorithm with other established tools; improvements to how multiple-revolution transfers are handled; parallelization of the Jacobian computation; in-creased efficiency for the line search; and optimization of many more trajectories between a variety of 3-body orbits.

Parrish, Nathan L.↗

Modified Cascading Generalized Inverse Control Allocation

The current aviation revolution towards electric propulsion aircraft (e.g., electric vertical takeoff-and-landing) brings unique control challenges. These vehicles are typically over-actuated (more effectors than desired control outcomes), may require control strategies for the three phases of flight (hover, transition and cruise), and currently have limited electric power availability. These vehicle challenges bring the need for optimal control allocation to the forefront of research. A leading control allocation algorithm, used in current flight vehicles, is the Cascading Generalized Inverse (CGI). Unfortunately, the Cascading Generalized Inverse algorithm is unable to achieve some desired outcomes, it intermittently provides non-optimal allocations, and it may fail to preserve moment direction near maximal achievable outcomes. In this research, the shortcomings of the Cascading Generalized Inverse algorithm are addressed by augmenting the algorithm with Scalar Difference Quadratic unsaturation identification and location at each iteration. Rigorous theory is shown that the Modified Cascading Generalized Inverse performs better at obtaining optimal allocations for all attainable outcomes. Numerical case studies for over-actuated vehicles demonstrate resolution to the aforementioned deficiencies.

Control Allocation↗