Search NASA⌕ Search

SEARCH · Search NASA

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.

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

At least 847 records · Page 47

Radioisotope identification method for poorly resolved gamma-ray spectrum of nuclear security concern

Gamma-ray signal can be used as a fingerprint for radioisotope identification. In the context of radioactive and nuclear materials security at the border control point, the detection task can present a significant challenge due to various constraints such as the limited measurement time, the shielding conditions, and the noise interference. This study proposes a novel method to identify the signal of one or several radioisotopes from a poorly resolved gamma-ray spectrum. In this method, the noise component in the raw spectrum is reduced by the wavelet decomposition approach, and the removal of the continuum background is performed using the baseline determination algorithm. Finally, the identification of radioisotope is completed using the matrix linear regression method. The proposed method has been verified by experiments using the poorly resolved gamma-ray signals from various scenarios including single source, mixing of natural uranium with five of the most common industrial radioactive sources (57Co, 60Co, 133Ba, 137Cs, and 241Am). The preliminary results show that the proposed algorithm is comparable with the commercial method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Kato expansion in quantum canonical perturbation theory

This work establishes a connection between canonical perturbation series in quantum mechanics and a Kato expansion for the resolvent of the Liouville superoperator. Our approach leads to an explicit expression for a generator of a block-diagonalizing Dyson’s ordered exponential in arbitrary perturbation order. Unitary intertwining of perturbed and unperturbed averaging superprojectors allows for a description of ambiguities in the generator and block-diagonalized Hamiltonian. We compare the efficiency of the corresponding computational algorithm with the efficiencies of the Van Vleck and Magnus methods for high perturbative orders.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Resources required for topological quantum factoring

We consider a hypothetical topological quantum computer composed of either Ising or Fibonacci anyons. For each case, we calculate the time and number of qubits (space) necessary to execute the most computationally expensive step of Shor's algorithm, modular exponentiation. For Ising anyons, we apply Bravyi's distillation method [S. Bravyi, Phys. Rev. A 73, 042313 (2006)] which combines topological and nontopological operations to allow for universal quantum computation. With reasonable restrictions on the physical parameters we find that factoring a 128-bit number requires approximately 10{sup 3} Fibonacci anyons versus at least 3x10{sup 9} Ising anyons. Other distillation algorithms could reduce the resources for Ising anyons substantially.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum defragmentation algorithm

In this addendum to our paper [D. Burgarth and V. Giovannetti, Phys. Rev. Lett. 99, 100501 (2007)] we prove that during the transformation that allows one to enforce control by relaxation on a quantum system, the ancillary memory can be kept at a finite size, independently from the fidelity one wants to achieve. The result is obtained by introducing the quantum analog of defragmentation algorithms which are employed for efficiently reorganizing classical information in conventional hard disks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Operational Stochastic Cooling in the Relativistic Heavy-Ion Collider

Operational stochastic cooling of 100 GeV/nucleon gold beams has been achieved in the BNL Relativistic Heavy-Ion Collider. We discuss the physics and technology of the longitudinal cooling system and present results with the beams. A simulation algorithm is described and shown to accurately model the system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Probabilistic Look-ahead Contingency Analysis Integrated with GE EMS Tool

This report documents implementation of the smart sampling-based probabilistic look-ahead contingency analysis algorithm, the integration with General Electric (GE) Grid Solutions’ commercial energy management system (EMS) tool, and the case study results using real world data from the Bonneville Power Administration (BPA).The probabilistic look-ahead contingency analysis algorithm incorporates forecast errors of renewable energy and load into contingency analysis functions to enable a predictive capability with a more complete picture, revealing the potential violations that are not normally detected by traditional deterministic approaches. To test its performance under practical environments, the probabilistic look-ahead contingency analysis algorithm has been integrated with the dominant GE EMS tool as a proof-of-concept for a seamless integration. To meet the output format of GE EMS tool, an extreme value distribution (EVD) algorithm is newly adapted to analyze the GE EMS’s violation-only output. Real world data from BPA are used to test its performance, and the results clearly show the effectiveness of the developed algorithm and improved situational awareness. This effort is an example of successful technology transition and cooperation under a real-world environment because it is a joint effort from department of energy, a national laboratory, a commercial vendor, and a large utility.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Fast frequency acquisition via adaptive least squares algorithm

A new least squares algorithm is proposed and investigated for fast frequency and phase acquisition of sinusoids in the presence of noise. This algorithm is a special case of more general, adaptive parameter-estimation techniques. The advantages of the algorithms are their conceptual simplicity, flexibility and applicability to general situations. For example, the frequency to be acquired can be time varying, and the noise can be non-Gaussian, nonstationary and colored. As the proposed algorithm can be made recursive in the number of observations, it is not necessary to have a priori knowledge of the received signal-to-noise ratio or to specify the measurement time. This would be required for batch processing techniques, such as the fast Fourier transform (FFT). The proposed algorithm improves the frequency estimate on a recursive basis as more and more observations are obtained. When the algorithm is applied in real time, it has the extra advantage that the observations need not be stored. The algorithm also yields a real time confidence measure as to the accuracy of the estimator.

Kumar, Rajendra↗

Impact of graph structures for QAOA on MaxCut

The quantum approximate optimization algorithm (QAOA) is a promising method of solving combinatorial optimization problems using quantum computing. QAOA on the MaxCut problem has been studied extensively on graphs with specific structure; however, little is known about the general performance of the algorithm on arbitrary graphs. Here, we investigate how different graph characteristics correlate with QAOA performance at depths at most three on the MaxCut problem for all connected non-isomorphic graphs with at most eight vertices. Some good predictors of QAOA success relate to graph symmetries, odd cycles, and density. For example, on eight vertex graphs, the average probability for selecting an optimal solution for graphs that contain no odd cycles after three iterations of QAOA is 60.6% compared to 48.2% for those that do. The data generated from these studies are shared in a publicly accessible database to serve as a benchmark for QAOA calculations and experiments. Knowing the relationship between structure and performance can be used to identify classes of combinatorial problems that are likely to exhibit a quantum advantage.

97 MATHEMATICS AND COMPUTING↗

Unconditionally convergent nonlinear solver for hyperbolic conservation laws with S-shaped flux functions

This paper addresses the convergence properties of implicit numerical solution algorithms for nonlinear hyperbolic transport problems. It is shown that the Newton-Raphson (NR) method converges for any time step size, if the flux function is convex, concave, or linear, which is, in general, the case for CFD problems. In some problems, e.g., multiphase flow in porous media, the nonlinear flux function is S-shaped (not uniformly convex or concave); as a result, a standard NR iteration can diverge for large time steps, even if an implicit discretization scheme is used to solve the nonlinear system of equations. In practice, when such convergence difficulties are encountered, the current time step is cut, previous iterations are discarded, a smaller time step size is tried, and the NR process is repeated. The criteria for time step cutting and selection are usually based on heuristics that limit the allowable change in the solution over a time step and/or NR iteration. Here, we propose a simple modification to the NR iteration scheme for conservation laws with S-shaped flux functions that converges for any time step size. The new scheme allows one to choose the time step size based on accuracy consideration only without worrying about the convergence behavior of the nonlinear solver. The proposed method can be implemented in an existing simulator, e.g., for CO{sub 2} sequestration or reservoir flow modeling, quite easily. The numerical analysis is confirmed with simulation studies using various test cases of nonlinear multiphase transport in porous media. The analysis and numerical experiments demonstrate that the modified scheme allows for the use of arbitrarily large time steps for this class of problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A universal state-selective approach to multireference coupled-cluster non-iterative corrections

A new form of the asymmetric energy functional for the multireference coupled cluster (MRCC) theories is discussed from the point of view of an energy expansion in quasidegenerate situation. The resulting expansion for the exact electronic energy can be used to define the non-iterative corrections to approximate MRCC approaches. In particular, we show that in the proposed framework the essential part of dynamic correlation can be encapsulated in the so-called correlation Hamiltonian, which in analogy to the effective Hamiltonian, is defined in the model space (M0). When the trail wavefunction (wavefunctions) is determined without invoking a specific form of the MRCC sufficiency conditions, the ensuing correction can be universally applied to any type of the approximate MRCC method employing the same excitation manifold. We also discuss several strategies of normalizing trial wavefunctions, which significantly simplify the algebraic structure of the correction. The analogies with other MRCC triples corrections to MRCC theories with singles and doubles are outlined. Possible parallel algorithms for the non-iterative corrections are alsodiscussed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Riemann–Hilbert problem approach for two-dimensional flow inverse scattering

We consider inverse scattering for the time-harmonic wave equation with first-order perturbation in two dimensions. This problem arises in particular in the acoustic tomography of moving fluid. We consider linearized and nonlinearized reconstruction algorithms for this problem of inverse scattering. Our nonlinearized reconstruction algorithm is based on the non-local Riemann–Hilbert problem approach. Comparisons with preceding results are given.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Design of error-compensating algorithms for sinusoidal phase shifting interferometry

An improved approach to interferometry using sinusoidal phase shifting balances several harmonic components in the interference signal against each other. The resulting computationally efficient phase-estimation algorithms have low sensitivity to errors such as spurious intensity noise, vibration, and errors in the phase shift pattern. Specific example algorithms employing 8 and 12 camera frames illustrate design principles that are extendable to algorithms of any length for applications that would benefit from a simplified, sinusoidal phase shift.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An evaluation of solution algorithms and numerical approximation methods for modeling an ion exchange process

The focus of this work is on the modeling of an ion exchange process that occurs in drinking water treatment applications. The model formulation consists of a two-scale model in which a set of microscale diffusion equations representing ion exchange resin particles that vary in size and age are coupled through a boundary condition with a macroscopic ordinary differential equation (ODE), which represents the concentration of a species in a well-mixed reactor. We introduce a new age-averaged model (AAM) that averages all ion exchange particle ages for a given size particle to avoid the expensive Monte-Carlo simulation associated with previous modeling applications. We discuss two different numerical schemes to approximate both the original Monte-Carlo algorithm and the new AAM for this two-scale problem. The first scheme is based on the finite element formulation in space coupled with an existing backward difference formula-based ODE solver in time. The second scheme uses an integral equation based Krylov deferred correction (KDC) method and a fast elliptic solver (FES) for the resulting elliptic equations. Numerical results are presented to validate the new AAM algorithm, which is also shown to be more computationally efficient than the original Monte-Carlo algorithm. We also demonstrate that the higher order KDC scheme is more efficient than the traditional finite element solution approach and this advantage becomes increasingly important as the desired accuracy of the solution increases. We also discuss issues of smoothness, which affect the efficiency of the KDC-FES approach, and outline additional algorithmic changes that would further improve the efficiency of these developing methods for a wide range of applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerical Experiments with a Continuous L{sub 2}-exponential Merit Function for Semi-Infinite Programming

Here, we present some numerical experiments with a reduction method for solving nonlinear semi-infinite programming (SIP) problems. The method relies on a line search technique to ensure a sufficient decrease of a L{sub 2}-exponential merit function. The proposed merit function is continuous for SIP and improves the algorithm efficiency when compared with other previously tested merit functions. A comparison with other reduction methods is also included.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A center-of-mass principle for the multiparticle Schroedinger equation

The center-of-mass principle is the key to the rapid computation of the interaction of a large number of classical particles. Electrons governed by the multiparticle Schroedinger equation have a much more complicated interaction mainly due to their spatial extent and the antisymmetry constraint on the total wave function of the combined electron system. We present a center-of-mass principle for quantum particles that accounts for this spatial extent, the antisymmetry constraint, and the potential operators. We use it to construct an algorithm for computing a size-consistent approximate wave function for large systems with simple geometries.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Validation of the Electrical Properties of the ITER ICRF Antenna using Reduced-Scale Mock-Ups

Experimental measurements on reduced-scale mock-ups allow validating the electrical properties and RF numerical optimization of the ITER ICRF antenna. Frequency response in the different regions of the antenna is described and key parameters for performance improvement are given. Coupling is improved by acting on the front-face geometry (strap width, antenna box depth and vertical septa recess). The 4-port junction acts as a frequency filter and together with the service stub performs pre-matching in the whole frequency band. Influence of the Faraday screen on coupling is limited. The effect of voltage limitation on the maximum total radiated power is given. The importance of a good decoupling network and of grounding is emphasized. Finally the control of the antenna wave spectrum is performed by implementing feedback controlled load-resilient matching and decoupling options and control algorithms are tested.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal control of a repowered vehicle: Plug-in fuel cell against plug-in hybrid electric powertrain

This paper describes two different powertrain configurations for the repowering of a conventional vehicle, equipped with an internal combustion engine (ICE). A model of a mid-sized ICE-vehicle is realized and then modified to model both a parallel plug-in hybrid electric powertrain and a proton electrolyte membrane (PEM) fuel cell (FC) hybrid powertrain. The vehicle behavior under the application of an optimal control algorithm for the energy management is analyzed for the different scenarios and results are compared.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗