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 361 records · Page 20

A least-squares approximation of partial differential equations with high-dimensional random inputs

Uncertainty quantification schemes based on stochastic Galerkin projections, with global or local basis functions, and also stochastic collocation methods in their conventional form, suffer from the so called curse of dimensionality: the associated computational cost grows exponentially as a function of the number of random variables defining the underlying probability space of the problem. In this paper, to overcome the curse of dimensionality, a low-rank separated approximation of the solution of a stochastic partial differential (SPDE) with high-dimensional random input data is obtained using an alternating least-squares (ALS) scheme. It will be shown that, in theory, the computational cost of the proposed algorithm grows linearly with respect to the dimension of the underlying probability space of the system. For the case of an elliptic SPDE, an a priori error analysis of the algorithm is derived. Finally, different aspects of the proposed methodology are explored through its application to some numerical experiments.

97 MATHEMATICS AND COMPUTING↗

Density-Matrix Based Extended Lagrangian Born–Oppenheimer Molecular Dynamics

Extended Lagrangian Born–Oppenheimer molecular dynamics [ Phys. Rev. Lett. 2008, 100, 123004] is presented for Hartree–Fock theory, where the extended electronic degrees of freedom are represented by a density matrix, including fractional occupation numbers at elevated electronic temperatures. In contrast to regular direct Born–Oppenheimer molecular dynamics simulations, no iterative self-consistent field optimization is required prior to the force evaluations. To sample regions of the potential energy landscape where the gap is small or vanishing, which leads to particular convergence problems in regular direct Born–Oppenheimer molecular dynamics simulations, an adaptive integration scheme for the extended electronic degrees of freedom is presented. The integration scheme is based on a tunable, low-rank approximation of a fourth-order kernel, K, that determines the metric tensor, T ≡ K T K, used in the extended harmonic oscillator of the Lagrangian that generates the dynamics of the electronic degrees of freedom. Here, the formulation and algorithms provide a general guide to implement extended Lagrangian Born–Oppenheimer molecular dynamics for quantum chemistry, density functional theory, and semiempirical methods using a density matrix formalism.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A methodology for the synthesis of robust feedback systems

A new methodology is developed for the synthesis of linear, time-variant (LTI) controllers for multivariable LTI systems. The resulting closed-loop system is nominally stable and exhibits a known level of performance. In addition, robustness of the feedback system is guaranteed, i.e., stability and performance are retained in the presence of multiple unstructured uncertainty blocks located at various points in the feedback loop. The design technique is referred to as the Causality Recovery Methodology (CRM). The CRM relies on the Youla parameterization of all stabilizing compensators to ensure nominal stability of the feedback system. A frequency-domain inequality in terms of the structured singular value mu defines the robustness specification. The optimal compensator, with respect to the mu condition, is shown to be noncausal in general. The aim of the CRM is to find a stable, causal transfer function matrix that approximates the robustness characteristics of the optimal solution. The CRM, via a series of infinite-dimensional convex programs, produces a closed-loop system whose performance robustness is at least as good as that of any initial design. The algorithm is approximated by a finite dimensional process for the purposes of implementation. Two numerical examples confirm the potential viability of the CRM concept; however, the robustness improvement comes at the expense of increased computational burden and compensator complexity.

Milich, David Albert↗

Producing approximate answers to database queries

We have designed and implemented a query processor, called APPROXIMATE, that makes approximate answers available if part of the database is unavailable or if there is not enough time to produce an exact answer. The accuracy of the approximate answers produced improves monotonically with the amount of data retrieved to produce the result. The exact answer is produced if all of the needed data are available and query processing is allowed to continue until completion. The monotone query processing algorithm of APPROXIMATE works within the standard relational algebra framework and can be implemented on a relational database system with little change to the relational architecture. We describe here the approximation semantics of APPROXIMATE that serves as the basis for meaningful approximations of both set-valued and single-valued queries. We show how APPROXIMATE is implemented to make effective use of semantic information, provided by an object-oriented view of the database, and describe the additional overhead required by APPROXIMATE.

Vrbsky, Susan V.↗

Quantum mechanical generalized phase-shift approach to atom-surface scattering: A Feshbach projection approach to dealing with closed channel effects

We have developed a new method for solving quantum dynamical scattering problems, using the time-independent Schroedinger equation (TISE), based on a novel method to generalize a ''one-way'' quantum mechanical wave equation, impose correct boundary conditions, and eliminate exponentially growing closed channel solutions. The approach is readily parallelized to achieve approximate N{sup 2} scaling, where N is the number of coupled equations. The full two-way nature of the TISE is included while propagating the wave function in the scattering variable and the full S-matrix is obtained. The new algorithm is based on a ''Modified Cayley'' operator splitting approach, generalizing earlier work where the method was applied to the time-dependent Schroedinger equation. All scattering variable propagation approaches to solving the TISE involve solving a Helmholtz-type equation, and for more than one degree of freedom, these are notoriously ill-behaved, due to the unavoidable presence of exponentially growing contributions to the numerical solution. Traditionally, the method used to eliminate exponential growth has posed a major obstacle to the full parallelization of such propagation algorithms. We stabilize by using the Feshbach projection operator technique to remove all the nonphysical exponentially growing closed channels, while retaining all of the propagating open channel components, as well as exponentially decaying closed channel components.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Transmission integral analysis of Mössbauer spectra displaying hyperfine parameter distributions with arbitrary profile

Accurate quantitative analysis of Mössbauer spectra displaying thickness effects requires the consideration of the so-called transmission integral when modeling the spectral shape. Whereas this is straightforward when the correct model for the decomposition of the absorber's nuclear resonance absorption cross-section into individual components is a priori known, in the absence of such knowledge and notably in the presence of hyperfine parameter distributions with an unknown profile, the so-called model-independent evaluation methods could be used to fit the spectra. However, the methods available for this purpose were developed for the analysis of spectra for which the thin absorber approximation is valid, and thus they do not take the sample thickness and related effects into account. Consequently, in order to use them for spectra displaying thickness effects, their usage needs to be generalized by combining them with transmission integral fitting. A new algorithm realizing such a generalized version of the Hesse-Rübartsch model-independent evaluation method was developed recently as an integral part of the MossWinn program. In the present work, the working principle of the newly developed algorithm is described in details along with examples illustrating the capabilities of the method for the case of {sup 57}Fe Mössbauer spectroscopy.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Quantum Monte Carlo estimation of complex-time correlations for the study of the ground-state dynamic structure function

We present a method based on the path integral Monte Carlo formalism for the calculation of ground-state time correlation functions in quantum systems. The key point of the method is the consideration of time as a complex variable whose phase δ acts as an adjustable parameter. By using high-order approximations for the quantum propagator, it is possible to obtain Monte Carlo data all the way from purely imaginary time to δ values near the limit of real time. As a consequence, it is possible to infer accurately the spectral functions using simple inversion algorithms. We test this approach in the calculation of the dynamic structure function S(q, ω) of two one-dimensional model systems, harmonic and quartic oscillators, for which S(q, ω) can be exactly calculated. We notice a clear improvement in the calculation of the dynamic response with respect to the common approach based on the inverse Laplace transform of the imaginary-time correlation function.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Double sweep preconditioner for optimized Schwarz methods applied to the Helmholtz problem

This paper presents a preconditioner for non-overlapping Schwarz methods applied to the Helmholtz problem. Starting from a simple analytic example, we show how such a preconditioner can be designed by approximating the inverse of the iteration operator for a layered partitioning of the domain. The preconditioner works by propagating information globally by concurrently sweeping in both directions over the subdomains, and can be interpreted as a coarse grid for the domain decomposition method. The resulting algorithm is shown to converge very fast, independently of the number of subdomains and frequency. The preconditioner has the advantage that, like the original Schwarz algorithm, it can be implemented as a matrix-free routine, with no additional preprocessing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Attosecond Streaking Enables the Measurement of Quantum Phase

Attosecond streaking, as a measurement technique, was originally conceived as a means to characterize attosecond light pulses, which is a good approximation if the relevant transition matrix elements are approximately constant within the bandwidth of the light pulse. Our analysis of attosecond streaking measurements on systems with a complex response to the photoionizing pulse reveals the relation between the momentum-space wave function of the outgoing electron and the result of conventional retrieval algorithms. This finding enables the measurement of the quantum phase associated with bound-continuum transitions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quench dynamics in SRF cavities: can we locate the quench origin with 2nd sound?

A newly developed method of locating quenches in SRF cavities by detecting second-sound waves has been gaining popularity in SRF laboratories. The technique is based on measurements of time delays between the quench as determined by the RF system and arrival of the second-sound wave to the multiple detectors placed around the cavity in superfluid helium. Unlike multi-channel temperature mapping, this approach requires only a few sensors and simple readout electronics; it can be used with SRF cavities of almost arbitrary shape. One of its drawbacks is that being an indirect method it requires one to solve an inverse problem to find the location of a quench. We tried to solve this inverse problem by using a parametric forward model. By analyzing the data we found that the approximation where the second-sound emitter is a near-singular source does not describe the physical system well enough. A time-dependent analysis of the quench process can help us to put forward a more adequate model. We present here our current algorithm to solve the inverse problem and discuss the experimental results.

43 PARTICLE ACCELERATORS↗

ADDITIVE SELF-HELICITY AS A KINK MODE THRESHOLD

In this paper, we propose that additive self-helicity, introduced by Longcope and Malanushenko, plays a role in the kink instability for complex equilibria, similar to twist helicity for thin flux tubes. We support this hypothesis by a calculation of additive self-helicity of a twisted flux tube from the simulation of Fan and Gibson. As more twist gets introduced, the additive self-helicity increases, and the kink instability of the tube coincides with the drop of additive self-helicity, after the latter reaches the value of H{sub A} /{phi}{sup 2} {approx} 1.5 (where {phi} is the flux of the tube and H{sub A} is the additive self-helicity). We compare the additive self-helicity to twist for a thin subportion of the tube to illustrate that H{sub A} /{phi}{sup 2} is equal to the twist number, studied by Berger and Field, when the thin flux tube approximation is applicable. We suggest that the quantity H{sub A} /{phi}{sup 2} could be treated as a generalization of a twist number, when the thin flux tube approximation is not applicable. A threshold on a generalized twist number might prove extremely useful studying complex equilibria, just as the twist number itself has proven useful studying idealized thin flux tubes. We explicitly describe a numerical method for calculating additive self-helicity, which includes an algorithm for identifying a domain occupied by a flux bundle and a method of calculating potential magnetic field confined to this domain. We also describe a numerical method to calculate twist of a thin flux tube, using a frame parallelly transported along the axis of the tube.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On low-rank updates to the singular value and Tucker decompositions

The singular value decomposition is widely used in signal processing and data mining. Since the data often arrives in a stream, the problem of updating matrix decompositions under low-rank modification has been widely studied. Brand developed a technique in 2006 that has many advantages. However, the technique does not directly approximate the updated matrix, but rather its previous low-rank approximation added to the new update, which needs justification. Further, the technique is still too slow for large information processing problems. We show that the technique minimizes the change in error per update, so if the error is small initially it remains small. We show that an updating algorithm for large sparse matrices should be sub-linear in the matrix dimension in order to be practical for large problems, and demonstrate a simple modification to the original technique that meets the requirements.

99 GENERAL AND MISCELLANEOUS↗

Back-and-forth approximation as a simple neutron transport model - 14607

The back-and-forth approximation is a very simple neutron transport model that helps get a number of exact solutions which qualitatively describe the actual characteristics of planar, cylindrical and spherical systems with fissile material. The model allows its absolutely accurate implementation in Monte Carlo codes and can be used to test the algorithms which do not treat geometry or interaction data. (author)

42 ENGINEERING↗

Ultra-Scale Computing for Emergency Evacuation

Emergency evacuations are carried out in anticipation of a disaster such as hurricane landfall or flooding, and in response to a disaster that strikes without a warning. Existing emergency evacuation modeling and simulation tools are primarily designed for evacuation planning and are of limited value in operational support for real time evacuation management. In order to align with desktop computing, these models reduce the data and computational complexities through simple approximations and representations of real network conditions and traffic behaviors, which rarely represent real-world scenarios. With the emergence of high resolution physiographic, demographic, and socioeconomic data and supercomputing platforms, it is possible to develop micro-simulation based emergency evacuation models that can foster development of novel algorithms for human behavior and traffic assignments, and can simulate evacuation of millions of people over a large geographic area. However, such advances in evacuation modeling and simulations demand computational capacity beyond the desktop scales and can be supported by high performance computing platforms. This paper explores the motivation and feasibility of ultra-scale computing for increasing the speed of high resolution emergency evacuation simulations.

99 GENERAL AND MISCELLANEOUS↗

A New Hybrid Quantum-Classical Algorithm for Solving the Unit Commitment Problem

Solving problems related to planning and operations of large-scale power systems is challenging on classical computers due to their inherent nature as mixed-integer and nonlinear problems. Quantum computing provides new avenues to approach these problems. We develop a hybrid quantum-classical algorithm for the Unit Commitment (UC) problem in power systems which aims at minimizing the total cost while optimally allocating generating units to meet the hourly demand of the power loads. The hybrid algorithm combines a variational quantum algorithm (VQA) with a classical Benders-type heuristic. The resulting algorithm computes approximate solutions to UC in three stages: i) a collection of UC vectors capable meeting the power demand with lowest possible operating costs is generated based on VQA; ii) a classical sequential least squares programming (SLSQP) routine is leveraged to find the optimal power level corresponding to a predetermined number of candidate vectors; iii) in the last stage, the approximate solution of UC along with generating units power level combination is given. To demonstrate the effectiveness of the presented method, three different systems with 3 generating units, 10 generating units, and 26 generating units were tested for different time periods. In addition, convergence of the hybrid quantum-classical algorithm for select time periods is proven out on IonQ's Forte system.

Aboumrad, Willie [IonQ, Inc]↗

PADÉ APPROXIMANTS FOR THE EQUATION OF STATE FOR RELATIVISTIC HYDRODYNAMICS BY KINETIC THEORY

A two-point Padé approximant (TPPA) algorithm is developed for the equation of state (EOS) for relativistic hydrodynamic systems, which are described by the classical Maxwell–Boltzmann statistics and the semiclassical Fermi–Dirac statistics with complete degeneracy. The underlying rational function is determined by the ratios of the macroscopic state variables with various orders of accuracy taken at the extreme relativistic limits. The nonunique TPPAs are validated by Taub's inequality for the consistency of the kinetic theory and the special theory of relativity. The proposed TPPA is utilized in deriving the EOS of the dilute gas and in calculating the specific heat capacity, the adiabatic index function, and the isentropic sound speed of the ideal gas. Some general guidelines are provided for the application of an arbitrary accuracy requirement. The superiority of the proposed TPPA is manifested in manipulating the constituent polynomials of the approximants, which avoids the arithmetic complexity of struggling with the modified Bessel functions and the hyperbolic trigonometric functions arising from the relativistic kinetic theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Expectation propagation for nonlinear inverse problems – with an application to electrical impedance tomography

In this paper, we study a fast approximate inference method based on expectation propagation for exploring the posterior probability distribution arising from the Bayesian formulation of nonlinear inverse problems. It is capable of efficiently delivering reliable estimates of the posterior mean and covariance, thereby providing an inverse solution together with quantified uncertainties. Some theoretical properties of the iterative algorithm are discussed, and the efficient implementation for an important class of problems of projection type is described. The method is illustrated with one typical nonlinear inverse problem, electrical impedance tomography with complete electrode model, under sparsity constraints. Numerical results for real experimental data are presented, and compared with that by Markov chain Monte Carlo. The results indicate that the method is accurate and computationally very efficient.

97 MATHEMATICS AND COMPUTING↗

Electron transfer dynamics: Zusman equation versus exact theory

The Zusman equation has been widely used to study the effect of solvent dynamics on electron transfer reactions. However, application of this equation is limited by the classical treatment of the nuclear degrees of freedom. In this paper, we revisit the Zusman equation in the framework of the exact hierarchical equations of motion formalism, and show that a high temperature approximation of the hierarchical theory is equivalent to the Zusman equation in describing electron transfer dynamics. Thus the exact hierarchical formalism naturally extends the Zusman equation to include quantum nuclear dynamics at low temperatures. This new finding has also inspired us to rescale the original hierarchical equations and incorporate a filtering algorithm to efficiently propagate the hierarchical equations. Numerical exact results are also presented for the electron transfer reaction dynamics and rate constant calculations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗