Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation 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 253 records · Page 14

Image processing with cellular nonlinear networks implemented on field-programmable gate arrays for real-time applications in nuclear fusion

In the past years cameras have become increasingly common tools in scientific applications. They are now quite systematically used in magnetic confinement fusion, to the point that infrared imaging is starting to be used systematically for real-time machine protection in major devices. However, in order to guarantee that the control system can always react rapidly in case of critical situations, the time required for the processing of the images must be as predictable as possible. The approach described in this paper combines the new computational paradigm of cellular nonlinear networks (CNNs) with field-programmable gate arrays and has been tested in an application for the detection of hot spots on the plasma facing components in JET. The developed system is able to perform real-time hot spot recognition, by processing the image stream captured by JET wide angle infrared camera, with the guarantee that computational time is constant and deterministic. The statistical results obtained from a quite extensive set of examples show that this solution approximates very well an ad hoc serial software algorithm, with no false or missed alarms and an almost perfect overlapping of alarm intervals. The computational time can be reduced to a millisecond time scale for 8 bit 496x560-sized images. Moreover, in our implementation, the computational time, besides being deterministic, is practically independent of the number of iterations performed by the CNN - unlike software CNN implementations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Reversed Cherenkov-Transition Radiation by a Charge Crossing a Left-Handed Medium Boundary

We analyze the radiation from a charged particle crossing the boundary between an ordinary medium and a 'left-handed' metamaterial. We obtain exact and approximate expressions for the field components and develop algorithms for their computation. The spatial radiation in this system can be separated into three distinct components, corresponding to ordinary transition radiation having a relatively large magnitude, Cherenkov radiation, and reversed Cherenkov-transition radiation (RCTR). The last one is explained by reflection and refraction of reversed Cherenkov radiation at the interface. Conditions for generating of RCTR are obtained. We note properties of this radiation that have potential applications in the detection of charged particles and accelerator beams and for the characterization of metamaterial macroscopic parameters (epsilon, mu).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Scalable O(N) Algorithm for Large-Scale Parallel First-Principles Molecular Dynamics Simulations

Traditional algorithms for first-principles molecular dynamics (FPMD) simulations only gain a modest capability increase from current petascale computers, due to their O(N 3 ) complexity and their heavy use of global communications. To address this issue, we are developing a truly scalable O(N) complexity FPMD algorithm, based on density functional theory (DFT), which avoids global communications. The computational model uses a general nonorthogonal orbital formulation for the DFT energy functional, which requires knowledge of selected elements of the inverse of the associated overlap matrix. We present a scalable algorithm for approximately computing selected entries of the inverse of the overlap matrix, based on an approximate inverse technique, by inverting local blocks corresponding to principal submatrices of the global overlap matrix. The new FPMD algorithm exploits sparsity and uses nearest neighbor communication to provide a computational scheme capable of extreme scalability. Accuracy is controlled by the mesh spacing of the finite difference discretization, the size of the localization regions in which the electronic orbitals are confined, and a cutoff beyond which the entries of the overlap matrix can be omitted when computing selected entries of its inverse. We demonstrate the algorithm's excellent parallel scaling for up to O(100K) atoms on O(100K) processors, with a wall-clock time of O(1) minute per molecular dynamics time step.

36 MATERIALS SCIENCE↗

Reduced-order modeling on a near-term quantum computer

Quantum computing is an advancing area of research in which computer hardware and algorithms are developed to take advantage of quantum mechanical phenomena. In recent studies, quantum algorithms have shown promise in solving linear systems of equations as well as systems of linear ordinary differential equations (ODEs) and partial differential equations (PDEs). Reducedorder modeling (ROM) algorithms for studying fluid dynamics have shown success in identifying linear operators that can describe flowfields, where dynamic mode decomposition (DMD) is a particularly useful method in which a linear operator is identified from data. In this work, DMD is reformulated as an optimization problem to propagate the state of the linearized dynamical system on a quantum computer. This reformulation was chosen as a means of facilitating implementation on a near-term quantum computer. Quadratic unconstrained binary optimization (QUBO), a technique for optimizing quadratic polynomials in binary variables, allows for quantum annealing algorithms to be applied. A quantum circuit model (quantum approximation optimization algorithm, QAOA) is utilized to obtain predictions of the state trajectories. Results are shown for the quantum-ROM predictions for flow over a 2D cylinder at Re = 220 and flow over a NACA0009 airfoil at Re = 500 and α = 15°. The quantum-ROM predictions are found to depend on the number of bits utilized for a fixed point representation and the truncation level of the DMD model. Comparisons with DMD predictions from a classical computer algorithm are made, as well as an analysis of the computational complexity and prospects for future, more fault-tolerant quantum computers.

97 MATHEMATICS AND COMPUTING↗

Simple algorithm for computing the geometric measure of entanglement

We present an easy implementable algorithm for approximating the geometric measure of entanglement from above. The algorithm can be applied to any multipartite mixed state. It involves only the solution of an eigenproblem and finding a singular value decomposition; no further numerical techniques are needed. To provide examples, the algorithm was applied to the isotropic states of three qubits and the three-qubit XX model with external magnetic field.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Prototype Hail Detection Algorithm and Hail Climatology Developed with the Advanced Microwave Sounding Unit (AMSU)

In previous studies published in the open literature, a strong relationship between the occurrence of hail and the microwave brightness temperatures (primarily at 37 and 85 GHz) was documented. These studies were performed with the Nimbus‐7 SMMR, the TRMM Microwave Imager (TMI) and most recently, the Aqua AMSR‐E sensor. This lead to climatologies of hail frequency from TMI and AMSR‐E, however, limitations include geographical domain of the TMI sensor (35 S to 35 N) and the overpass time of the Aqua satellite (130 am/pm local time), both of which reduce an accurate mapping of hail events over the global domain and the full diurnal cycle. Nonetheless, these studies presented exciting, new applications for passive microwave sensors. Since 1998, NOAA and EUMETSAT have been operating the AMSU‐A/B and the MHS on several operational satellites: NOAA‐15 through NOAA‐19; MetOp‐A and ‐B. With multiple satellites in operation since 2000, the AMSU/MHS sensors provide near global coverage every 4 hours, thus, offering a much larger time and temporal sampling than TRMM or AMSR‐E. With similar observation frequencies near 30 and 85 GHz and additionally three at the 183 GHz water vapor band, the potential to detect strong convection associated with severe storms on a more comprehensive time and space scale exists. In this study, we develop a prototype AMSU‐based hail detection algorithm through the use of collocated satellite and surface hail reports over the continental U.S. for a 12‐year period (2000‐2011). Compared with the surface observations, the algorithm detects approximately 40 percent of hail occurrences. The simple threshold algorithm is then used to generate a hail climatology that is based on all available AMSU observations during 2000‐11 that is stratified in several ways, including total hail occurrence by month (March through September), total annual, and over the diurnal cycle. Independent comparisons are made compared to similar data sets derived from other satellite, ground radar and surface reports. The algorithm was also applied to global land measurements for a single year and showed close agreement with other satellite based hail climatologies. Such a product could serve as a prototype for use with a future geostationary based microwave sensor such as NASA's proposed PATH mission.

Ferraro, Ralph↗

Modifications of functions, Fourier coefficients and nonlinear approximation

This work continues the author's investigations of the convergence of greedy algorithms from the standpoint of classical results on correction of functions. In particular, the following result is obtained: for each {epsilon}, 0<{epsilon}<1, there exists a measurable set E subset of [0,1) of measure |E|>1-{epsilon} such that for each function f element of L{sup 1}[0,1) a function f-tilde element of L{sup 1}(0,1) equal to f on E can be found such that the greedy algorithm for f-tilde with respect to the Walsh system converges to it almost everywhere on [0,1], and all the nonzero elements of the sequence of Walsh-Fourier coefficients of the function thus obtained are arranged in decreasing order of their absolute values. Bibliography: 35 titles.

97 MATHEMATICS AND COMPUTING↗

Fast, Conservative Algorithm for Solving the Transonic Full-Potential Equation

A fast, fully implicit approximate factorization algorithm designed to solve the conservative, transonic, full-potential equation in either two or three dimensions is described. The algorithm uses an upwind bias of the density coefficient for stability in supersonic regions. This provides an effective upwind difference of the streamwise terms for any orientation of the velocity vector (i.e., rotated differencing), thereby greatly enhancing the reliability of the present algorithm. A numerical transformation is used to establish an arbitrary body-fitted, finite-difference mesh. Computed results for both airfoils and simplified wings demonstrate substantial improvement in convergence speed for the new algorithm relative to standard successive-line over-relaxation algorithms.

Holst, Terry L.↗

Iterative quantum optimization of spin glass problems with rapidly oscillating transverse fields

In this work, we introduce a new iterative quantum algorithm, called Iterative Symphonic Tunneling for Satisfiability problems (IST-SAT), which solves quantum spin glass optimization problems using high-frequency oscillating transverse fields. IST-SAT operates as a sequence of iterations, in which bitstrings returned from one iteration are used to set spin-dependent phases in oscillating transverse fields in the next iteration. Over several iterations, the novel mechanism of the algorithm steers the system toward the problem ground state. We benchmark IST-SAT on sets of hard MAX-3-XORSAT problem instances with exact state vector simulation, and report polynomial speedups over Trotterized adiabatic quantum computation and the best known semi-greedy classical algorithm. When IST-SAT is seeded with a sufficiently good initial approximation, the algorithm converges to exact solution(s) in a polynomial number of iterations. Our numerical results identify a critical Hamming radius, or quality of initial approximation, where the time-to-solution crosses from exponential to polynomial scaling in problem size. This work proposes IST-SAT a new quantum algorithm, which improves upon solutions obtained from initial classical or quantum optimization algorithms. The steering mechanism we introduce through IST-SAT presents a new path toward achieving quantum advantage in optimization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An implicit algorithm for the transonic full-potential equation in conservative form

A fast, implicit approximate factorization algorithm for the solution of the conservative full-potential equation for transonic flow in two and three dimensions is presented. Stability in supersonic regions is maintained by the use of an upwind evaluation of the density coefficient along all coordinate directions, providing an effective upwind difference of the streamwise terms for any orientation of the velocity vector and thereby enhancing the reliability of the algorithm. The algorithm is shown to provide rapid convergence for the computation of certain difficult two-dimensional test cases, including cases with fishtail shock patterns, demonstrating the reliability and efficiency of the procedure. Surface pressure coefficient distributions obtained by the present method are also found to be in good agreement with those computed by successive-line overrelaxation and a hybrid direct-solver/successive-line overrelaxation scheme, with significant reductions in CPU time required. A three-dimensional solution for a swept wing mounted between parallel walls is also presented which demonstrates the high convergence rate of the algorithm in three dimensions as well as two.

Holst, T.↗

NO-LESS: Near optimal curtailment strategy selection for net load balancing in micro grids

The integration of renewable energy sources such as solar PVs into micro grids has increased in recent years. However, the intermittent and unpredictable nature of renewable energy generation makes supply uncertain, in turn requiring continuous net load balancing to ensure grid stability. One technique to achieve net load balancing is curtailment, however, selection of the optimal set of curtailment strategies to achieve a targeted curtailment is NP-hard. State-of-the-art curtailment selection techniques approach this problem by either developing computationally expensive optimal curtailment strategies or reduce accuracy to generate sub-optimal solutions quickly. In this work, we develop NO-LESS: a Near OptimaL CurtailmEnt Strategy Selection algorithm. NO-LESS is a novel Fully Polynomial Time Approximation Scheme (FPTAS) which determines bounded (near optimal) curtailment strategies in a small amount of time while simultaneously satisfying practical constraints on strategy switching overhead and curtailment fairness. We perform both theoretical analysis and practical evaluation to show that NO-LESS is a scalable solution for performing net load balancing through curtailment strategy selection in Micro Grids.

14 SOLAR ENERGY↗

Minimal Energy Routing of a Leader and a Wingmate with Periodic Connectivity

We consider a route planning problem in which two unmanned vehicles are required to complete a set of tasks present at distinct locations, referred to as targets, with minimum energy consumption. The mission environment is hazardous, and to ensure a safe operation, the UVs are required to communicate with each other at every target they visit. The problem objective is to determine the allocation of the tasks to the UVs and plan tours for the UVs to visit the targets such that the weighted sum of the distances traveled by the UVs and the distances traveled by the communicating signals between them is minimized. We formulate this problem as an Integer program and show that naively solving the problem using commercially available off-the-shelf solvers is insufficient in determining scalable solutions efficiently. To address this computational challenge, we develop an approximation and a heuristic algorithm, and employ them to compute high-quality solutions to a special case of the problem where equal weights are assigned to the distances traveled by the vehicles and the communicating signals. For this special case, we show that the approximation algorithm has a fixed approximation ratio of 3.75. We also develop lower bounds to the optimal cost of the problem to evaluate the performance of these algorithms on large-scale instances. We demonstrate the performance of these algorithms on 500 randomly generated instances with the number of targets ranging from 6 to 100, and show that the algorithms provide high-quality solutions to the problem swiftly; the average computation time of the algorithmic solutions is within a fraction of a second for instances with at most 100 targets. Finally, we show that the approximation ratio has a variable ratio for the weighted case of the problem. Specifically, if ρ denotes the ratio of the weights assigned to the distances representing the communication and travel costs, the algorithm has an a posteriori ratio of $3 + \frac{3ρ}{4}$ when ρ ≥ 1, and $\frac{3}{ρ}$ + $\frac{3}{4}$ when ρ ≤ 1.

42 ENGINEERING↗

Addition of Improved Shock-Capturing Schemes to OVERFLOW 2.1

Existing approximate Riemann solvers do not perform well when the grid is not aligned with strong shocks in the flow field. Three new approximate Riemann algorithms are investigated to improve solution accuracy and stability in the vicinity of strong shocks. The new algorithms are compared to the existing upwind algorithms in OVERFLOW 2.1. The new algorithms use a multidimensional pressure gradient based switch to transition to a more numerically dissipative algorithm in the vicinity of strong shocks. One new algorithm also attempts to artificially thicken captured shocks in order to alleviate the errors in the solution introduced by "stair-stepping" of the shock resulting from the approximate Riemann solver. This algorithm performed well for all the example cases and produced results that were almost insensitive to the alignment of the grid and the shock.

Burning, Pieter G.↗

The vertical metallicity gradient of the Milky Way disk: transitions in [α/Fe] populations

Using G dwarfs from the Sloan Extension for Galactic Understanding and Exploration (SEGUE) survey, we have determined the vertical metallicity gradient in the Milky Way's disk and examined how this gradient varies for different [α/Fe] subsamples. Our sample contains over 40,000 stars with low-resolution spectroscopy over 144 lines of sight. It also covers a significant disk volume, between ∼0.3 and 1.6 kpc from the Galactic plane, and allows us to examine the disk in situ, whereas previous analyses were more limited in scope. Furthermore, this work does not presuppose a disk structure, whether composed of a single complex population or distinct thin and thick disk components. We employ the SEGUE Stellar Parameter Pipeline to obtain estimates of stellar parameters, [Fe/H], and [α/Fe] and extract multiple volume-complete subsamples of approximately 1000 stars each. Based on SEGUE's target-selection algorithm, we adjust each subsample to determine an unbiased picture of disk chemistry; consequently, each individual star represents the properties of many. The metallicity gradient is –0.243{sub −0.053}{sup +0.039} dex kpc{sup –1} for the entire sample, which we compare to various literature results. This gradient stems from the different [α/Fe] populations inhabiting different ranges of height above the Galactic plane. Each [α/Fe] subsample shows little change in median [Fe/H] with height. If we associate [α/Fe] with age, the negligible gradients of our [α/Fe] subsamples suggest that stars formed in different epochs exhibit comparable vertical structure, implying similar star formation processes and evolution.

79 ASTRONOMY AND ASTROPHYSICS↗