Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation algorithm”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 217 records · Page 12

An algorithm for maximum likelihood estimation using an efficient method for approximating sensitivities

An algorithm for maximum likelihood (ML) estimation is developed primarily for multivariable dynamic systems. The algorithm relies on a new optimization method referred to as a modified Newton-Raphson with estimated sensitivities (MNRES). The method determines sensitivities by using slope information from local surface approximations of each output variable in parameter space. The fitted surface allows sensitivity information to be updated at each iteration with a significant reduction in computational effort compared with integrating the analytically determined sensitivity equations or using a finite-difference method. Different surface-fitting methods are discussed and demonstrated. Aircraft estimation problems are solved by using both simulated and real-flight data to compare MNRES with commonly used methods; in these solutions MNRES is found to be equally accurate and substantially faster. MNRES eliminates the need to derive sensitivity equations, thus producing a more generally applicable algorithm.

Murphy, P. C.↗

Rigorous Computation of Diffusion Coefficients for Expanding Maps

For real analytic expanding interval maps, a novel method is given for rigorously approximating the diffusion coefficient of real analytic observables. As a theoretical algorithm, our approximation scheme is shown to give quadratic exponential convergence to the diffusion coefficient. The method for converting this rapid convergence into explicit high precision rigorous bounds is illustrated in the setting of Lanford’s map x↦2x+(1/2)x(1−x) (mod 1).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

CASTRO: A NEW COMPRESSIBLE ASTROPHYSICAL SOLVER. III. MULTIGROUP RADIATION HYDRODYNAMICS

We present a formulation for multigroup radiation hydrodynamics that is correct to order O(v/c) using the comoving-frame approach and the flux-limited diffusion approximation. We describe a numerical algorithm for solving the system, implemented in the compressible astrophysics code, CASTRO. CASTRO uses a Eulerian grid with block-structured adaptive mesh refinement based on a nested hierarchy of logically rectangular variable-sized grids with simultaneous refinement in both space and time. In our multigroup radiation solver, the system is split into three parts: one part that couples the radiation and fluid in a hyperbolic subsystem, another part that advects the radiation in frequency space, and a parabolic part that evolves radiation diffusion and source-sink terms. The hyperbolic subsystem and the frequency space advection are solved explicitly with high-order Godunov schemes, whereas the parabolic part is solved implicitly with a first-order backward Euler method. Our multigroup radiation solver works for both neutrino and photon radiation.

79 ASTRONOMY AND ASTROPHYSICS↗

Classical combinatorial optimization scaling for random Ising models on 2D heavy-hex graphs

Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the quantum approximate optimization algorithm. In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation time scaling quantification. Specifically the time-to-solution (TTS) metric using the classical heuristic simulated annealing is measured for finding optimal variable assignments (ground states), as well as the time required for the optimization software Gurobi to find an optimal variable assignment. Because of the sparsity of these Ising models, the classical algorithms are able to find optimal solutions efficiently even for large instances (i.e. 100 000 spin variables). The Ising models both with and without geometrically local cubic terms exhibit average-case linear-time or weakly quadratic scaling when solved exactly using Gurobi, and the Ising models with no cubic terms show evidence of exponential-time TTS scaling when sampled using simulated annealing. These findings point to the necessity of developing and testing more complex, namely more densely connected, optimization problems in order for quantum computing to ever have a practical advantage over classical computing. Our results are another illustration that different classical algorithms can indeed have exponentially different running times, thus making the identification of the best practical classical technique important in any quantum computing vs. classical computing comparison.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Classical optimization with imaginary-time block encoding on quantum computers: The MaxCut problem

Optimization problems in finance, physics, and computer science are typically very hard to tackle in classical computing; quantum computing could help speed up computations and provide efficient methods for tackling large problems. Typically, to treat a problem with a quantum computer, the optimal solution is cast as the ground state of a diagonal Hamiltonian. Here, we develop a method, called imaginary-time evolution block encoding (ITE-BE), based on a recent imaginary-time algorithm, which requires no variational parameter optimization, as all parameters can be derived analytically from the target Hamiltonian. We also demonstrate that our method can be successfully combined with other quantum algorithms such as the quantum approximate optimization algorithm (QAOA). For illustration, here we study the MaxCut problem. We find that the QAOA ansatz increases the postselection success of ITE-BE, and shallow QAOA circuits, when boosted with ITE-BE, achieve better performance than deeper QAOA circuits. For the special case of the transverse initial state, we adapt our block-encoding scheme to allow for a deterministic application of the first layer of the circuit.

Zhong, Dawei [University of Southern California, L↗

N-body simulations for coupled scalar-field cosmology

We describe in detail the general methodology and numerical implementation of consistent N-body simulations for coupled-scalar-field models, including background cosmology and the generation of initial conditions (with the different couplings to different matter species taken into account). We perform fully consistent simulations for a class of coupled-scalar-field models with an inverse power-law potential and negative coupling constant, for which the chameleon mechanism does not work. We find that in such cosmological models the scalar-field potential plays a negligible role except in the background expansion, and the fifth force that is produced is proportional to gravity in magnitude, justifying the use of a rescaled gravitational constant G in some earlier N-body simulation works for similar models. We then study the effects of the scalar coupling on the nonlinear matter power spectra and compare with linear perturbation calculations to see the agreement and places where the nonlinear treatment deviates from the linear approximation. We also propose an algorithm to identify gravitationally virialized matter halos, trying to take account of the fact that the virialization itself is also modified by the scalar-field coupling. We use the algorithm to measure the mass function and study the properties of dark-matter halos. We find that the net effect of the scalar coupling helps produce more heavy halos in our simulation boxes and suppresses the inner (but not the outer) density profile of halos compared with the {Lambda}CDM prediction, while the suppression weakens as the coupling between the scalar field and dark-matter particles increases in strength.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Variational Trajectory Optimization Tool Set: Technical description and user's manual

The algorithms that comprise the Variational Trajectory Optimization Tool Set (VTOTS) package are briefly described. The VTOTS is a software package for solving nonlinear constrained optimal control problems from a wide range of engineering and scientific disciplines. The VTOTS package was specifically designed to minimize the amount of user programming; in fact, for problems that may be expressed in terms of analytical functions, the user needs only to define the problem in terms of symbolic variables. This version of the VTOTS does not support tabular data; thus, problems must be expressed in terms of analytical functions. The VTOTS package consists of two methods for solving nonlinear optimal control problems: a time-domain finite-element algorithm and a multiple shooting algorithm. These two algorithms, under the VTOTS package, may be run independently or jointly. The finite-element algorithm generates approximate solutions, whereas the shooting algorithm provides a more accurate solution to the optimization problem. A user's manual, some examples with results, and a brief description of the individual subroutines are included.

Bless, Robert R.↗

A Geometric Approach to Aggregate Flexibility Modeling of Thermostatically Controlled Loads

Coordinated aggregation of a large population of thermostatically controlled loads (TCLs) presents a great potential to provide various ancillary services to the grid. One of the key challenges in coordination and control of TCLs is developing a simple and portable model to accurately extract their aggregate flexibility. In this paper, we propose a novel geometric approach to model the aggregate flexibility of TCLs. We show that the set of admissible power profiles of an individual TCL is a polytope, and their aggregate flexibility is the Minkowski sum of the individual polytopes. In order to represent their aggregate flexibility in an intuitive way and achieve a tractable approximation, we develop optimization-based algorithms to approximate the polytopes by the homothets of a given convex set. As a special application, this set is chosen as a virtual battery model and the corresponding optimal approximation problems are solved efficiently by equivalent linear programs. Numerical results show that our algorithms yield significant improvement in characterizing the aggregate flexibility over existing modeling methods. Finally, we also conduct case studies to demonstrate the efficacy of our approaches by coordinating TCLs to track a frequency regulation signal from the Pennsylvania-New Jersey-Maryland (PJM) Interconnection.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Approximation concepts for numerical airfoil optimization

An efficient algorithm for airfoil optimization is presented. The algorithm utilizes approximation concepts to reduce the number of aerodynamic analyses required to reach the optimum design. Examples are presented and compared with previous results. Optimization efficiency improvements of more than a factor of 2 are demonstrated. Improvements in efficiency are demonstrated when analysis data obtained in previous designs are utilized. The method is a general optimization procedure and is not limited to this application. The method is intended for application to a wide range of engineering design problems.

Vanderplaats, G. N.↗

An approximate factorization solution of the Navier-Stokes equations for transonic flow using body-fitted coordinates with application to NACA 64A010 airfoils

The implementation of the approximate factorization algorithm and its ability to efficiently and accurately describe transonic flow about an NACA 64A010 airfoil section is examined. The approximate factorization algorithm is developed from the nondimensional, conservative, vectorized Navier-Stokes equations expressed in curvilinear coordinates. Equations of state and transport coefficient relations appropriate to atmospheric air are appended to close the system of partial differential equations. An algebraic turbulence model is also incorporated into the equation set. This algorithm was verified by investigating the flow about an NACA 64A010 airfoil at 0, 2, and 3.5 deg angle of attack for free-stream conditions of 2,000,000 Reynolds number and 0.8 Mach number. Overall results were in good qualitative agreement with wind tunnel data sets. However, while nondimensional times of six were attained, numerical difficulties prevented any case from reaching a true steady state.

Copper, G. K.↗

An iterative approach to non-overdetermined inverse scattering at fixed energy

We present an iterative approximate reconstruction algorithm for non-overdetermined inverse scattering at fixed energy E with incomplete data, where the dimension d≥2. In particular, we obtain rapidly converging approximate reconstructions for this inverse scattering for E→+∞. Bibliography: 38 titles.

97 MATHEMATICS AND COMPUTING↗

Propagating Qualitative Values Through Quantitative Equations

In most practical problems where traditional numeric simulation is not adequate, one need to reason about a system with both qualitative and quantitative equations. In this paper, we address the problem of propagating qualitative values represented as interval values through quantitative equations. Previous research has produced exponential-time algorithms for approximate solution of the problem. These may not meet the stringent requirements of many real time applications. This paper advances the state of art by producing a linear-time algorithm that can propagate a qualitative value through a class of complex quantitative equations exactly and through arbitrary algebraic expressions approximately. The algorithm was found applicable to Space Shuttle Reaction Control System model.

Kulkarni, Deepak↗

On recent advances and future research directions for computational fluid dynamics

This paper highlights some recent accomplishments regarding CFD numerical algorithm constructions for generation of discrete approximate solutions to classes of Reynolds-averaged Navier-Stokes equations. Following an overview of turbulent closure modeling, and development of appropriate conservation law systems, a Taylor weak-statement semi-discrete approximate solution algorithm is developed. Various forms for completion to the final linear algebra statement are cited, as are a range of candidate numerical linear algebra solution procedures. This development sequence emphasizes the key building blocks of a CFD RNS algorithm, including solution trial and test spaces, integration procedure and added numerical stability mechanisms. A range of numerical results are discussed focusing on key topics guiding future research directions.

Baker, A. J.↗

An approximation based global optimization strategy for structural synthesis

A global optimization strategy for structural synthesis based on approximation concepts is presented. The methodology involves the solution of a sequence of highly accurate approximate problems using a global optimization algorithm. The global optimization algorithm implemented consists of a branch and bound strategy based on the interval evaluation of the objective function and constraint functions, combined with a local feasible directions algorithm. The approximate design optimization problems are constructed using first order approximations of selected intermediate response quantities in terms of intermediate design variables. Some numerical results for example problems are presented to illustrate the efficacy of the design procedure setforth.

Sepulveda, A. E.↗

Computing the partition function, ensemble averages, and density of states for lattice spin systems by sampling the mean

An algorithm to approximately calculate the partition function (and subsequently ensemble averages) and density of states of lattice spin systems through non-Monte-Carlo random sampling is developed. This algorithm (called the sampling-the-mean algorithm) can be applied to models where the up or down spins at lattice nodes interact to change the spin states of other lattice nodes, especially non-Ising-like models with long-range interactions such as the biological model considered here. Because it is based on the Central Limit Theorem of probability, the sampling-the-mean algorithm also gives estimates of the error in the partition function, ensemble averages, and density of states. Easily implemented parallelization strategies and error minimizing sampling strategies are discussed. The sampling-the-mean method works especially well for relatively small systems, systems with a density of energy states that contains sharp spikes or oscillations, or systems with little a priori knowledge of the density of states.

97 MATHEMATICS AND COMPUTING↗

Study of the mapping of Navier-Stokes algorithms onto multiple-instruction/multiple-data-stream computers

Implicit approximate-factored algorithms have certain properties that are suitable for parallel processing. A particular computational fluid dynamics (CFD) code, using this algorithm, is mapped onto a multiple-instruction/multiple-data-stream (MIMD) computer architecture. An explanation of this mapping procedure is presented, as well as some of the difficulties encountered when trying to run the code concurrently. Timing results are given for runs on the Ames Research Center's MIMD test facility which consists of two VAX 11/780's with a common MA780 multi-ported memory. Speedups exceeding 1.9 for characteristic CFD runs were indicated by the timing results.

Eberhardt, D. S.↗

Fast computation algorithms for speckle pattern simulation

We present our development of a series of efficient computation algorithms, generally usable to calculate light diffraction and particularly for speckle pattern simulation. We use mainly the scalar diffraction theory in the form of Rayleigh-Sommerfeld diffraction formula and its Fresnel approximation. Our algorithms are based on a special form of the convolution theorem and the Fast Fourier Transform. They are able to evaluate the diffraction formula much faster than by direct computation and we have circumvented the restrictions regarding the relative sizes of the input and output domains, met on commonly used procedures. Moreover, the input and output planes can be tilted each to other and the output domain can be off-axis shifted.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗