Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “variational algorithms”

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 523 records · Page 29

Computing Satellite Maneuvers For A Repeating Ground Track

TOPEX/POSEIDON Ground Track Maintenance Maneuver Targeting Program (GTARG) assists in designing maneuvers to maintain orbit of TOPEX/POSEIDON satellite. Targeting strategies used either maximize time between maneuvers or force control band exit to occur at specified intervals. Runout mode allows for ground-track propagation without targeting. GTARG incorporates analytic mean-element propagation algorithm accounting for all perturbations known to cause significant variations in ground track. Perturbations include oblateness of Earth, luni-solar gravitation, drag, thrusts associated with impulsive maneuvers, and unspecified fixed forces acting on satellite in direction along trajectory. Written in VAX-FORTRAN.

Shapiro, Bruce↗

The effect of sub-surface volume scattering on the accuracy of ice-sheet altimeter retracking algorithms

The NASA and ESA retracking algorithms are compared with an algorithm based upon a combined surface and volume (S/V) scattering model. First, the S/V, NASA, and ESA algorithms were used to retrack over 400,000 altimeter return waveforms from the Greenland and Antarctic ice sheets. The surface elevations from the S/V algorithm were compared with the elevations produced by the NASA and ESA algorithms to determine the relative accuracy of these algorithms when subsurface volume-scattering occurs. The results show that the NASA algorithm produced surface elevations within 35 to 50 cm of the S/V algorithm, while the performance of the ESA algorithm was slightly worse. Next, by analyzing several thousand satellite crossover points from the Antarctic data set, we determined the retracking algorithm that produced the most repeatable surface elevations. The elevations derived from the S/V algorithm had the smallest RMS error for the region of the East Antarctic plateau examined here. The ESA algorithm produced erroneous estimates of elevation change when seasonal variations were present; it measured 0.7 to 1.6-m change in elevation over a 6-month period on the East Antarctic plateau where accumulation rates are only 10 cm/year.

Davis, Curt H.↗

Investigation of computational and spectral analysis methods for aeroacoustic wave propagation

Most computational fluid dynamics (CFD) schemes are not adequately accurate for solving aeroacoustics problems, which have wave amplitudes several orders of magnitude smaller yet with frequencies larger than the flow field variations generating the sound. Hence, a computational aeroacoustics (CAA) algorithm should have minimal dispersion and dissipation features. A dispersion relation preserving (DRP) scheme is, therefore, applied to solve the linearized Euler equations in order to simulate the propagation of three types of waves, namely: acoustic, vorticity, and entropy waves. The scheme is derived using an optimization procedure to ensure that the numerical derivatives preserve the wave number and angular frequency of the partial differential equations being discretized. Consequently, simulated waves propagate with the correct wave speeds and exhibit their appropriate properties. A set of radiation and outflow boundary conditions, compatible with the DRP scheme and derived from the asymptotic solutions of the governing equations, are also implemented. Numerical simulations are performed to test the effectiveness of the DRP scheme and its boundary conditions. The computed solutions are shown to agree favorably with the exact solutions. The major restriction appears to be that the dispersion relations can be preserved only for waves with wave lengths longer than four or five spacings. The boundary conditions are found to be transparent to the outgoing disturbances. However, when the disturbance source is placed closer to a boundary, small acoustic reflections start appearing. CAA generates enormous amounts of temporal data which needs to be reduced to understand the physical problem being simulated. Spectral analysis is one approach that helps us in extracting information which often can not be easily interpreted in the time domain. Thus, three different methods for the spectral analysis of numerically generated aeroacoustic data are studied. First, the capabilities of two traditional methods for spectral analysis, namely, the Blackman-Tukey method and periodogram method, are compared in estimating the spectra of a simple-periodic process. The periodogram is then applied to analyze transitory-deterministic processes. Finally, these two methods are compared with a more recent method, referred as the Weighted-Overlapped-Segment-Averaging (WOSA) method, in estimating the spectra of a chaotic (random-like) process. From the demonstrative case for the spectral analyses of data generated by simple-periodic process, the periodogram method is found to give a better estimate of the steep-sloped spectra than the Blackman-Tukey method. Also, for this problem, the Hanning window is found to perform better with the periodogram method than with the Blackman-Tukey method. Finally, for the spectral analysis of data generated by the chaotic process, the periodogram method does not perform well, whereas, the WOSA and Blackman-Tukey methods give equivalently good results.

Vanel, Florence O.↗

Satellite Data Sets in the Polar Regions

We have generated about two decades of consistently derived geophysical parameters in the polar regions. The key parameters are sea ice concentration, surface temperature, albedo, and cloud cover statistics. Sea ice concentrations were derived from the Scanning Multichannel Microwave Radiometer (SMMR) data and the Special Scanning Cl Microwave Imager (SSM/I) data from several platforms using the enhanced Bootstrap Algorithm for the period 1978 through 1999. The new algorithm reduces the errors associated with spatial and temporal variations in the emissivity and surface temperatures of sea ice. Also, bad data at ocean/land interfaces are identified and deleted in an unsupervised manner. Surface ice temperature, albedo and cloud cover statistics are derived simultaneously from the Advanced Very High Resolution Radiometer (AVHRR) data from 1981 through 1999 and mapped at a higher resolution but the same format as the ice concentration data. The technique makes use these co-registered ice concentration maps to enable cloud masking to be done separately for open ocean, sea ice and land areas. The effect of inversion is minimized by taking into consideration the expected changes in the effect of inversion with altitude, especially in the Antarctic. A technique for ice type regional classification has also been developed using multichannel cluster analysis and a neural network. This provide a means to identify large areas of thin ice, first year ice, and older ice types. The data sets have been shown to be coherent with each other and provide a powerful tool for in depth studies of the currently changing Arctic and Antarctic environment.

Comiso, Josefino C.↗

Classical Optimizers for Noisy Intermediate-Scale Quantum Devices

We present a collection of optimizers tuned for usage on Noisy Inter-mediate-Scale Quantum (NISQ) devices. Optimizers have a range of applications in quantum computing, including the Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization (QAOA) algorithms. They have further uses in calibration, hyperparameter tuning, machine learning, etc. We employ the VQE algorithm as a case study. VQE is a hybrid algorithm, with a classical minimizer step driving the next evaluation on the quantum processor. While most results to date concentrated on tuning the quantum VQE circuit, our study indicates that in the presence of quantum noise the classical minimizer step is a weak link and a careful choice combined with tuning is required for correct results. We explore state-of-the-art gradient-free optimizers capable of handling noisy, black-box, cost functions and stress-test them using a quantum circuit simulation environment with noise injection capabilities on individual gates. Our results indicate that specifically tuned optimizers are crucial to obtaining valid science results on NISQ hardware, as well as projecting forward on fault tolerant circuits.

Lavrijsen, Wim↗

Aerial Videography From Locally Launched Rockets

A method of quickly collecting digital imagery of ground areas from video cameras carried aboard locally launched rockets has been developed. The method can be used, for example, to record rare or episodic events or to gather image data to guide decisions regarding treatment of agricultural fields or fighting wildfires. The method involves acquisition and digitization of a video frame at a known time along with information on the position and orientation of the rocket and camera at that time. The position and orientation data are obtained by use of a Global Positioning System receiver and a digital magnetic compass carried aboard the rocket. These data are radioed to a ground station, where they are processed, by a real-time algorithm, into georeferenced position and orientation data. The algorithm also generates a file of transformation parameters that account for the variation of image magnification and distortion associated with the position and orientation of the camera relative to the ground scene depicted in the image. As the altitude, horizontal position, and orientation of the rocket change between image frames, the algorithm calculates the corresponding new georeferenced position and orientation data and the associated transformation parameters. The output imagery can be rendered in any of a variety of formats. The figure presents an example of one such format.

Lyle, Stacey D.↗

Zonal-Mean Temperature Variations Inferred from SABER Measurements on TIMED Compared with UARS Observations

In the Numerical Spectral Model (NSM, Mayr et al., 2003), small-scale gravity waves propagating in the north/south direction can generate zonal mean (m = 0) meridional wind oscillations with periods between 2 and 4 months. These oscillations tend to be confined to low latitudes and have been interpreted to be the meridional counterpart of the wave-driven Quasi Biennial Oscillation in the zonal circulation. Wave driven meridional winds across the equator should generate, due to dynamical heating and cooling, temperature oscillations with opposite phase in the two hemispheres. We have analyzed SABER temperature measurements in the altitude range between 55 and 95 km to investigate the existence such variations. Because there are also strong tidal signatures (up to approximately 20 K) in the data, our algorithm estimates both mean values and tides together from the data. Based on SABER temperature data, the intra-annual variations with periods between 2 and 4 months can have amplitudes up to 5 K or more, depending on the altitude. Their amplitudes are in qualitative agreement with those inferred Erom UARS data (from different years). The SABER temperature variations also reveal pronounced hemispherical asymmetries, which are qualitatively consistent with wave driven meridional wind oscillations across the equator. Oscillations with similar periods have been seen in the meridional winds based on UARS data (Huang and Reber, 2003).

Huang, Frank T.↗

Squint mode SAR processing algorithms

The unique characteristics of a spaceborne SAR (synthetic aperture radar) operating in a squint mode include large range walk and large variation in the Doppler centroid as a function of range. A pointing control technique to reduce the Doppler drift and a new processing algorithm to accommodate large range walk are presented. Simulations of the new algorithm for squint angles up to 20 deg and look angles up to 44 deg for the Earth Observing System (Eos) L-band SAR configuration demonstrate that it is capable of maintaining the resolution broadening within 20 percent and the ISLR within a fraction of a decibel of the theoretical value.

Chang, C. Y.↗

Conservation equations and physical models for hypersonic air flows over the aeroassist flight experiment vehicle

The code development and application program for the Langley Aerothermodynamic Upwind Relaxation Algorithm (LAURA), with emphasis directed toward support of the Aeroassist Flight Experiment (AFE) in the near term and Aeroassisted Space Transfer Vehicle (ASTV) design in the long term is reviewed. LAURA is an upwind-biased, point-implicit relaxation algorithm for obtaining the numerical solution to the governing equations for 3-D, viscous, hypersonic flows in chemical and thermal nonequilibrium. The algorithm is derived using a finite volume formulation in which the inviscid components of flux across cell walls are described with Roe's averaging and Harten's entropy fix with second-order corrections based on Yee's Symmetric Total Variation Diminishing scheme. Because of the point-implicit relaxation strategy, the algorithm remains stable at large Courant numbers without the necessity of solving large, block tri-diagonal systems. A single relaxation step depends only on information from nearest neighbors. Predictions for pressure distributions, surface heating, and aerodynamic coefficients compare well with experimental data for Mach 10 flow over an AFE wind tunnel model. Predictions for the hypersonic flow of air in chemical and thermal nonequilibrium over the full scale AFE configuration obtained on a multi-domain grid are discussed.

Gnoffo, Peter A.↗

Aerodynamic Shape Optimization Using Evolutionary Algorithms

A method for aerodynamic shape optimization based on an evolutionary algorithm approach is presented and demonstrated. Results are presented for a number of model problems to access the effect of algorithm parameters on convergence efficiency and reliability. A transonic viscous airfoil optimization problem, both single and two-objective variations, is used as the basis for a preliminary comparison with an adjoint-gradient optimizer. The evolutionary algorithm is coupled with a transonic full potential flow solver and is used to optimize the inviscid flow about transonic wings including multi-objective and multi-discipline solutions that lead to the generation of pareto fronts. The results indicate that the evolutionary algorithm approach is easy to implement, flexible in application and extremely reliable.

Holst, Terry L.↗

Adaptive, problem-tailored variational quantum eigensolver mitigates rough parameter landscapes and barren plateaus

Abstract Variational quantum eigensolvers (VQEs) represent a powerful class of hybrid quantum-classical algorithms for computing molecular energies. Various numerical issues exist for these methods, however, including barren plateaus and large numbers of local minima. In this work, we consider the Adaptive, Problem-Tailored Variational Quantum Eiegensolver (ADAPT-VQE) ansätze, and examine how they are impacted by these local minima. We find that while ADAPT-VQE does not remove local minima, the gradient-informed, one-operator-at-a-time circuit construction accomplishes two things: First, it provides an initialization strategy that can yield solutions with over an order of magnitude smaller error compared to random initialization, and which is applicable in situations where chemical intuition cannot help with initialization, i.e., when Hartree-Fock is a poor approximation to the ground state. Second, even if an ADAPT-VQE iteration converges to a local trap at one step, it can still “burrow” toward the exact solution by adding more operators, which preferentially deepens the occupied trap. This same mechanism helps highlight a surprising feature of ADAPT-VQE: It should not suffer optimization problems due to barren plateaus and random initialization. Even if such barren plateaus appear in the parameter landscape, our analysis suggests that ADAPT-VQE avoids such regions by design.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Performance prediction: A case study using a multi-ring KSR-1 machine

While computers with tens of thousands of processors have successfully delivered high performance power for solving some of the so-called 'grand-challenge' applications, the notion of scalability is becoming an important metric in the evaluation of parallel machine architectures and algorithms. In this study, the prediction of scalability and its application are carefully investigated. A simple formula is presented to show the relation between scalability, single processor computing power, and degradation of parallelism. A case study is conducted on a multi-ring KSR1 shared virtual memory machine. Experimental and theoretical results show that the influence of topology variation of an architecture is predictable. Therefore, the performance of an algorithm on a sophisticated, heirarchical architecture can be predicted and the best algorithm-machine combination can be selected for a given application.

Sun, Xian-He↗

Insights into Long-Term Global Precipitation from IMERG and GPCP

Multiple satellite-based datasets provide estimates of the long-term record of global precipitation. Each necessarily includes both the real atmospheric behavior and a collection of artifacts driven by the input data sources and design choices in the retrievals and dataset construction. For this presentation, the Integrated Multi-satellitE Retrievals for GPM (IMERG) products from the Global Precipitation Measurement (GPM) mission’s U.S. Science Team are designed as a modern High-Resolution Precipitation Product (HRPP), while the Global Precipitation Climatology Project’s (GPCP) products are designed as a modern Climate Data Record (CDR). Although they share some common input data sources, the computational process for each is rather different. Comparing the precipitation estimates from each algorithm gives us insights into likely artifacts and the natural variations that are common to both. The goal of an HRPP is to give the best estimate of precipitation at each time step in the dataset, generally meaning that “all possible available” data are used. In contrast, the CDR is intended to provide a precipitation record that has relatively homogeneous statistics, necessary for climate analysis. Each analysis strives for both goals, of course, but this means that the HRPP uses the disparate collection of satellites whose statistics don’t quite match the ideal record, while the CDR is computed from fewer satellites that provide a relatively homogeneous set of precipitation statistics. This presentation employs the current versions of the IMERG and GPCP products, V07B and V3.2, respectively. A variety of analyses have demonstrated that IMERG has more artifacts, as expected, which tend to result from changes in the source of intercalibration for the various input satellites, namely the Combined Radar-Radiometer Algorithm using TMI and PR during the TRMM era and using GMI and DPR-Ku during the GPM era. As well, a shift occurs when the altitudes of the TRMM and GPM satellites change as a result of orbit boosts. For the most part the mean precipitation shows good continuity across these boundaries, but there are noticeable changes in the respective histograms. The latter has taken on more importance in recent years due to increased scrutiny on extremes which implicitly focus on the upper end of the precipitation histograms. The GPCP product is more homogeneous, with only one major change in calibrator, transitioning from the SSMI series of satellites to the SSMIS series of satellites in 2009. The GPCP analysis does a good job of minimizing artifacts in the means at this boundary, while the histograms show a smaller, but still noticeable shift in the histograms, a result that is similar to data boundaries in IMERG. The GPCP Daily, which is a month-by-month rescaling of the daily accumulated IMERG Final product, shows more consistency than the equivalent daily IMERG, but inherits the histogram shifts from IMERG. Given this overlay of artifacts, there is enough consistency between the products to illustrate some important long-term variations, including interannual variations, not all of which are easily attributable to ENSO events, and trends that are large regionally, but comparatively small when averaged across the globe.

precipitation↗

Aerodynamic Shape Optimization using an Evolutionary Algorithm

A method for aerodynamic shape optimization based on an evolutionary algorithm approach is presented and demonstrated. Results are presented for a number of model problems to access the effect of algorithm parameters on convergence efficiency and reliability. A transonic viscous airfoil optimization problem-both single and two-objective variations is used as the basis for a preliminary comparison with an adjoint-gradient optimizer. The evolutionary algorithm is coupled with a transonic full potential flow solver and is used to optimize the inviscid flow about transonic wings including multi-objective and multi-discipline solutions that lead to the generation of pareto fronts. The results indicate that the evolutionary algorithm approach is easy to implement, flexible in application and extremely reliable.

Hoist, Terry L.↗

Quantifying Uncertainties in Nighttime Light Retrievals From Suomi-NPP and NOAA-20 VIIRS Day/Night Band Data

Satellite observations of nighttime lights (NTL) from Suomi-NPP and NOAA-20 VIIRS Day/Night Band data have been widely used to estimate human activities. Long-term changes such as urban development and abrupt short-term changes such as power outages have been monitored from temporal NTL acquired by satellites. While high temporal NTL variation has been found across NTL data of varying temporal scale (e.g., daily, monthly, and annual composites), the sources of measurement error and uncertainty are poorly understood. This paper quantifies the sources of VIIRS-derived NTL uncertainty due to view-illumination geometry, surface Bidirectional Reflectance Distribution Function (BRDF)/albedo, and the effects of snow cover, lunar irradiance, aerosol loading, cloud mask, vegetation, geometry, and ephemeral artifacts (e.g., the Aurora Borealis). Based on this current assessment of NASA Black Marble retrievals (VNP46, Collection V001), we found that angular and atmospheric effects dominate retrieval uncertainty. Errors introduced by upstream data inputs (e.g., a coarser nighttime snow cover flag and misclassification errors in the existing VIIRS nighttime cloud mask) were also found to impact retrieval quality. Despite these challenges, a consistent daily NTL time series record can be routinely generated from top-of-atmosphere VNP46 radiances. Key recommendations include: (1) the use of lunar-BRDF adjusted and atmospherically corrected NTL (i.e., as identified as high-quality retrievals in the VNP46 QA fields), (2) development and improvement to the VIIRS snow cover and cloud masks algorithms to accurately reflect NTL retrieval conditions, (3) characterizing seasonal variations in NTL due to vegetation and snow, (4) reducing geometric effects due to the spatial mismatch of gridded pixel and observation footprint, (5) employing angularly-consistent NTL observations from multiple VIIRS instruments (i.e., Suomi-NPP and NOAA-20) to reduce pixel-based uncertainties and address persistent data gaps, and (6) being mindful of surface-reflected radiance from aurora events at mid-to-high latitudes.

Zhuosen Wang↗

NISQ Benchmarking

Test suite of quantum algorithms for Noisy Intermediate Scale Quantum (NISQ) computers. The test suite includes benchmark-style code for quantum volume circuits (QV), fairness sampling circuits, quantum telecloning circuits, and other NISQ benchmark style algorithms on small problems (i.e., up to 100 qubits), such as Variational Quantum Eigensolver (VQE), Hamiltonian Simulation, and Grover unstructured search example circuits. These benchmark-style applications are implemented in quantum software packages, mostly IBM's QISKIT, but may include vendor-specific frameworks, such as PyQuil (for Rigetti) or Q\# for Microsoft, or CirQ (for Google) as the test suite grows with the vendor sample. The test suite also includes numerical simulation code for Quantum Alternating Operator Ansatz (QAOA) algorithms, VQE, Hamiltonian Simulation and search examples. Numerical simulation code simulates quantum computers on classical computers, which is only possible for small problem instances; the implementation framework of choice is typically within Python, using the numpy/scipy libraries as well as extensions to the Julia language.

Pelofske, Elijah↗

A Non-cooperative Game-based Approach to Distributed Beam Scheduling in Millimeter-Wave Networks

We consider the distributed beam scheduling problem in mm-Wave networks where the base stations may belong to different operators and there is no centralized coordination among them. Our goal is to design distributed beam scheduling algorithms such that the network utility, which is defined as a logarithm function of the average throughput of the user equipment, can be maximized. We propose a non-cooperative game-based scheduling approach where the base stations are modeled as players that greedily maximize their own utilities. The Nash Equilibrium (NE) then provides a distributed solution to the network utility maximization problem. By employing the Lyapunov optimization, the asymptotic optimality of the proposed scheduling can be guaranteed. We prove the existence and provide sufficient conditions which guarantee the uniqueness of the NE by establishing an equivalence to the Variational Inequality (VI) problem. We also propose a parallel power adaptation algorithm which is proved to converge to the NE. Numerical results show the superiority of the proposed scheduling over several distributed baseline schemes.

99 GENERAL AND MISCELLANEOUS↗

The entropy of galaxy spectra: how much information is encoded?

Abstract The inverse problem of extracting the stellar population content of galaxy spectra is analysed here from a basic standpoint based on information theory. By interpreting spectra as probability distribution functions, we find that galaxy spectra have high entropy, thus leading to a rather low effective information content. The highest variation in entropy is unsurprisingly found in regions that have been well studied for decades with the conventional approach. We target a set of six spectral regions that show the highest variation in entropy – the 4000 Å break being the most informative one. As a test case with real data, we measure the entropy of a set of high-quality spectra from the Sloan Digital Sky Survey, and contrast entropy-based results with the traditional method based on line strengths. The data are classified into star-forming (SF), quiescent (Q), and active galactic nucleus (AGN) galaxies, and show – independently of any physical model – that AGN spectra can be interpreted as a transition between SF and Q galaxies, with SF galaxies featuring a more diverse variation in entropy. The high level of entanglement complicates the determination of population parameters in a robust, unbiased way, and affects traditional methods that compare models with observations, as well as machine learning (especially deep learning) algorithms that rely on the statistical properties of the data to assess the variations among spectra. Entropy provides a new avenue to improve population synthesis models so that they give a more faithful representation of real galaxy spectra.

Ferreras, Ignacio (ORCID:0000000345843127)↗