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.

SourceResearch connectionFrom yearThrough year

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

At least 487 records · Page 27

All sources NASA NTRS DOE OSTI

NASA NTRS2015

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↗

NASA NTRS2016

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↗

NASA NTRS2016

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↗

NASA NTRS2017

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.↗

NASA NTRS2017

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↗

NASA NTRS1994

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↗

NASA NTRS2025

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↗

DOE OSTI2021

Space Charge Effects in Low Energy Magnetized Electron Beams

Magnetized electron cooling of the ion beam is one of the major approaches towards obtaining the required high luminosity in the proposed Electron-Ion Collider (EIC). To increase the cooling efficiency, a bunched electron beam with a high bunch charge and high repetition rate is required. However, these features can combine to enhance the collective interactions, such as the space charge effect. A magnetized electron beam was successfully generated at the Thomas Jefferson National Accelerator Facility (JLab) using a compact, 300 kV DC high voltage photo-gun with an inverted insulator geometry and bi-alkali antimonide photocathode. The beam magnetization was characterized using a modest diagnostic beamline to measure beam sizes, rotation angles, and normalized transverse emittance as a function of magnetic field at the photocathode, laser spot size, and gun high-voltage. Simultaneously, simulations were performed using the A Space Charge Tracking Algorithm (ASTRA) and General Particle Tracer (GPT) programs. Further, sustained high average current magnetized beam up to 28 mA was demonstrated, and the photocathode lifetime for different magnetized electron beam currents was investigated. In the second part of the project, the space charge effect in low-energy magnetized electron beams was studied and compared with GPT simulations. The high bunch charge studies showed evidence of space charge current limitations starting at 0.3 nC and limited the maximum delivered bunch charge to 0.7 nC. To reach the high bunch charge goal of a few nC, the existing DC photo-gun design was modified using CST Studio Suite’s electromagnetic field solver, and a way to cancel the beam deflection exerted by the non-symmetric nature of the inverted insulator photo-gun geometry was discovered. This thesis presents a detailed description of the generation, characterization, and simulation of high current, high bunch charge magnetized electron beams at JLab, as well as the modified photo-gun design. Together with measurements and simulations, the purpose of this thesis is to provide a solid background on the theoretical aspects and the experimental challenges associated with magnetized electron beams for accelerator applications.

Wijethunga, W M Sajini↗

NASA NTRS2017

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.↗

DOE OSTI2020

Electronic structure with direct diagonalization on a D-wave quantum annealer

Quantum chemistry is regarded to be one of the first disciplines that will be revolutionized by quantum computing. Although universal quantum computers of practical scale may be years away, various approaches are currently being pursued to solve quantum chemistry problems on near-term gate-based quantum computers and quantum annealers by developing the appropriate algorithm and software base. This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. The approach is based on the matrix formulation, efficiently uses qubit resources based on a power-of-two encoding scheme and is hardware-dominant relying on only one classically optimized parameter. We demonstrate the use of D-Wave hardware for obtaining ground and excited electronic states across a variety of small molecular systems. The approach can be adapted for use by a vast majority of electronic structure methods currently implemented in conventional quantum-chemical packages. The results of this work will encourage further development of software such as qbsolv which has promising applications in emerging quantum information processing hardware and has expectation to address large and complex optimization problems intractable for classical computers.

97 MATHEMATICS AND COMPUTING↗

NASA NTRSDate not supplied

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↗

NASA NTRSDate not supplied

Modified Cascading Generalized Inverse Control Allocation

Control Allocation↗

DOE OSTI2022

Ensuring Transient Stability With Guaranteed Region of Attraction in DC Microgrids

DC microgrids have promising applications in renewable integration due to their better energy efficiency when connecting DC components. However, they might be unstable since many loads in a DC microgrid are regulated as constant power loads (CPLs) that have a destabilizing negative impedance effect. As a result, the state trajectory displacement caused by abrupt load changes or contingencies can easily lead to instability. Many existing works have been devoted to studying the region of attraction (ROA) of a DC microgrid, in which the system is guaranteed to be asymptotically stable. Nevertheless, existing work either focuses on using numerical methods for ROA approximations that generally have no performance guarantees or cannot ensure a desired ROA for a general DC microgrid. To close this gap, this paper develops an innovative control synthesis algorithm to make a general DC microgrid have a theoretically guaranteed ROA, for example, to cover the entirety of its operating range regarding state trajectories. Here, we first study the nonlinear dynamics of a DC microgrid to derive a novel transient stability condition to rigorously certify whether a given operating range is a subset of the ROA; then, we formulate a control synthesis optimization problem to guarantee the condition’s satisfaction. This condition is a linear constraint, and the optimization problem resembles an optimal power flow problem and has a good computational behavior. Simulation case studies verify the validity of the proposed work.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2021

Variational Quantum Algorithms for Semidefinite Programming

A semidefinite program (SDP) is a particular kind of convex optimization problem with applications in operations research, combinatorial optimization, quantum information science, and beyond. In this work, we propose variational quantum algorithms for approximately solving SDPs. For one class of SDPs, we provide a rigorous analysis of their convergence to approximate locally optimal solutions, under the assumption that they are weakly constrained (i.e., N " M, where N is the dimension of the input matrices and M is the number of constraints). We also provide algorithms for a more general class of SDPs that requires fewer assumptions. Finally, we numerically simulate our quantum algorithms for applications such as MaxCut, and the results of these simulations provide evidence that convergence still occurs in noisy settings.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Variational Quantum Algorithms for Semidefinite Programming

A semidefinite program (SDP) is a particular kind of convex optimization problem with applications in operations research, combinatorial optimization, quantum information science, and beyond. In this work, we propose variational quantum algorithms for approximately solving SDPs. For one class of SDPs, we provide a rigorous analysis of their convergence to approximate locally optimal solutions, under the assumption that they are weakly constrained (i.e., N$\gg$M, where N is the dimension of the input matrices and M is the number of constraints). We also provide algorithms for a more general class of SDPs that requires fewer assumptions. Finally, we numerically simulate our quantum algorithms for applications such as MaxCut, and the results of these simulations provide evidence that convergence still occurs in noisy settings.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1992

Quasi-kernel polynomials and convergence results for quasi-minimal residual iterations

Recently, Freund and Nachtigal have proposed a novel polynominal-based iteration, the quasi-minimal residual algorithm (QMR), for solving general nonsingular non-Hermitian linear systems. Motivated by the QMR method, we have introduced the general concept of quasi-kernel polynomials, and we have shown that the QMR algorithm is based on a particular instance of quasi-kernel polynomials. In this paper, we continue our study of quasi-kernel polynomials. In particular, we derive bounds for the norms of quasi-kernel polynomials. These results are then applied to obtain convergence theorems both for the QMR method and for a transpose-free variant of QMR, the TFQMR algorithm.

Freund, Roland W.↗

NASA NTRS2007

Planetary Moon Cycler Trajectories

Free-return cycler trajectories repeatedly shuttle a spacecraft between two bodies using little or no fuel. Here, the cycler architecture is proposed as a complementary and alternative method for designing planetary moon tours. Previously applied enumerative cycler search and optimization techniques are generalized and specifically implemented in the Jovian and Saturnian moon systems. In addition, the algorithms are tested for general use to find non-Earth heliocentric cyclers. Overall, hundreds of ideal model ballistic cycler geometries are found and several representative cases are documented and discussed. Many of the ideal model solutions are found to remain ballistic in a zero radius sphere of influence patched conic ephemeris model, and preliminary work in a high-fidelity fully integrated model demonstrates near-ballistic cycles for several example cases.

trajectory↗

NASA NTRS1990

Random search optimization based on genetic algorithm and discriminant function

The general problem of optimization with arbitrary merit and constraint functions, which could be convex, concave, monotonic, or non-monotonic, is treated using stochastic methods. To improve the efficiency of the random search methods, a genetic algorithm for the search phase and a discriminant function for the constraint-control phase were utilized. The validity of the technique is demonstrated by comparing the results to published test problem results. Numerical experimentation indicated that for cases where a quick near optimum solution is desired, a general, user-friendly optimization code can be developed without serious penalties in both total computer time and accuracy.

Kiciman, M. O.↗