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 955 records · Page 53

Acyclic and star colorings of joins of graphs and an algorithm for cographs.

An acyclic coloring of a graph is a proper vertex coloring such that the subgraph induced by the union of any two color classes is a disjoint collection of trees. The more restricted notion of star coloring requires that the union of any two color classes induces a disjoint collection of stars. The acyclic and star chromatic numbers of a graph G are defined analogously to the chromatic number {chi}(G) and are denoted by {chi}{sub a}(G) and {chi}{sub s}(G), respectively. In this paper, we consider acyclic and star colorings of graphs that are decomposable with respect to the join operation, which builds a new graph from a collection of two or more disjoint graphs by adding all possible edges between them. In particular, we present a recursive formula for the acyclic chromatic number of joins of graphs and show that a similar formula holds for the star chromatic number. We also demonstrate the algorithmic implications of our results for the cographs, which have the unique property that they are recursively decomposable with respect to the join and disjoint union operations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Modelling transient heat conduction in solids at multiple length and time scales: A coupled non-equilibrium molecular dynamics/continuum approach

A method for controlling the thermal boundary conditions of non-equilibrium molecular dynamics simulations is presented. The method is simple to implement into a conventional molecular dynamics code and independent of the atomistic model employed. It works by regulating the temperature in a thermostatted boundary region by feedback control to achieve the desired temperature at the edge of an inner region where the true atomistic dynamics are retained. This is necessary to avoid intrinsic boundary effects in non-equilibrium molecular dynamics simulations. Three thermostats are investigated: the global deterministic Nose-Hoover thermostat and two local stochastic thermostats, Langevin and stadium damping. The latter thermostat is introduced to avoid the adverse reflection of phonons that occurs at an abrupt interface. The method is then extended to allow atomistic/continuum models to be thermally coupled concurrently for the analysis of large steady state and transient heat conduction problems. The effectiveness of the algorithm is demonstrated for the example of heat flow down a three-dimensional atomistic rod of uniform cross-section subjected to a variety of boundary conditions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Finite element formulation of fluctuating hydrodynamics for fluids filled with rigid particles using boundary fitted meshes

In this paper, we present a finite element implementation of fluctuating hydrodynamics with a moving boundary fitted mesh for treating the suspended particles. The thermal fluctuations are incorporated into the continuum equations using the Landau and Lifshitz approach [1]. The proposed implementation fulfills the fluctuation–dissipation theorem exactly at the discrete level. Since we restrict the equations to the creeping flow case, this takes the form of a relation between the diffusion coefficient matrix and friction matrix both at the particle and nodal level of the finite elements. Brownian motion of arbitrarily shaped particles in complex confinements can be considered within the present formulation. A multi-step time integration scheme is developed to correctly capture the drift term required in the stochastic differential equation (SDE) describing the evolution of the positions of the particles. The proposed approach is validated by simulating the Brownian motion of a sphere between two parallel plates and the motion of a spherical particle in a cylindrical cavity. The time integration algorithm and the fluctuating hydrodynamics implementation are then applied to study the diffusion and the equilibrium probability distribution of a confined circle under an external harmonic potential.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum walk computation

Quantum versions of random walks have diverse applications that are motivating experimental implementations as well as theoretical studies. Recent results showing quantum walks are “universal for quantum computation” relate to algorithms, to be run on quantum computers. We consider whether an experimental implementation of a quantum walk could provide useful computation before we have a universal quantum computer.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adiabatic condition and the quantum hitting time of Markov chains

We present an adiabatic quantum algorithm for the abstract problem of searching marked vertices in a graph, or spatial search. Given a random walk (or Markov chain) P on a graph with a set of unknown marked vertices, one can define a related absorbing walk P{sup '} where outgoing transitions from marked vertices are replaced by self-loops. We build a Hamiltonian H(s) from the interpolated Markov chain P(s)=(1-s)P+sP{sup '} and use it in an adiabatic quantum algorithm to drive an initial superposition over all vertices to a superposition over marked vertices. The adiabatic condition implies that, for any reversible Markov chain and any set of marked vertices, the running time of the adiabatic algorithm is given by the square root of the classical hitting time. This algorithm therefore demonstrates a novel connection between the adiabatic condition and the classical notion of hitting time of a random walk. It also significantly extends the scope of previous quantum algorithms for this problem, which could only obtain a full quadratic speedup for state-transitive reversible Markov chains with a unique marked vertex.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum algorithm for simulating the dynamics of an open quantum system

In the study of open quantum systems, one typically obtains the decoherence dynamics by solving a master equation. The master equation is derived using knowledge of some basic properties of the system, the environment, and their interaction: One basically needs to know the operators through which the system couples to the environment and the spectral density of the environment. For a large system, it could become prohibitively difficult to even write down the appropriate master equation, let alone solve it on a classical computer. In this paper, we present a quantum algorithm for simulating the dynamics of an open quantum system. On a quantum computer, the environment can be simulated using ancilla qubits with properly chosen single-qubit frequencies and with properly designed coupling to the system qubits. The parameters used in the simulation are easily derived from the parameters of the system + environment Hamiltonian. The algorithm is designed to simulate Markovian dynamics, but it can also be used to simulate non-Markovian dynamics provided that this dynamics can be obtained by embedding the system of interest into a larger system that obeys Markovian dynamics. We estimate the resource requirements for the algorithm. In particular, we show that for sufficiently slow decoherence a single ancilla qubit could be sufficient to represent the entire environment, in principle.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Attenuation of wall disturbances in an electron cyclotron resonance oxygen–argon plasma using real time control

Present practice in plasma-assisted semiconductor manufacturing specifies recipes in terms of inputs such as gas flow rates, power and pressure. However, ostensibly identical chambers running identical recipes may produce very different results. Extensive chamber matching, i.e., initial iterative, empirical tuning of the process recipe, which entails time-consuming, ex situ statistical analysis of process metrics such as etch depth, uniformity, anisotropy and selectivity, is required to ensure acceptable results. Once matched, chambers are run open loop and are thus sensitive to disturbances such as actuator drift, wall seasoning and substrate loading, which may impact negatively on process reproducibility. An alternative approach, which may obviate the need for chamber matching and reduce the sensitivity of process metrics to exogenous disturbances, would be to specify a recipe in terms of quantities such as active species densities, and to regulate these in real time by adjusting the inputs with a suitable control algorithm. In this work, real time control of an electron cyclotron resonance O{sub 2}/Ar plasma used for photoresist ashing has been implemented. The design of elementary, model-based algorithms for the control of the argon 750 and oxygen 844 line intensities measured by optical emission spectroscopy is described. Fluorination of the chamber walls by means of an SF{sub 6} plasma prior to ashing inhibits wall recombination of oxygen radicals resulting in an approximately 20% increase in ash rate in the open loop case. However, closed loop control almost completely attenuates the effect of fluorination, thus demonstrating the efficacy of the control algorithms in ensuring a reproducible ash rate in the face of a wall disturbance.

42 ENGINEERING↗

Formation Conditions and Stability Criteria for Small-Size Cluster Systems

The formation conditions and stability criteria for small-size cluster systems consisting of several particles interacting via an arbitrary isotropic pair potential are considered. Analytical criteria for instability development in horizontal (quasi-two-dimensional) and vertical (chain) structures consisting of three, four, and five charged particles are obtained for the first time. A simple algorithm to search for similar criteria in systems consisting of a larger number of particles is proposed. The obtained relations are verified by numerically solving the problem for Yukawa systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Steepest-descent algorithm for simulating plasma-wave caustics via metaplectic geometrical optics

The design and optimization of radiofrequency-wave systems for fusion applications is often performed using ray-tracing codes, which rely on the geometrical-optics (GO) approximation. However, GO fails at wave cutoffs and caustics. To accurately model the wave behavior in these regions, more advanced and computationally expensive “full-wave” simulations are typically used, but this is not strictly necessary. A new generalized formulation called metaplectic geometrical optics (MGO) has been proposed that reinstates GO near caustics. The MGO framework yields an integral representation of the wavefield that must be evaluated numerically in general. We present an algorithm for computing these integrals using Gauss-Freud quadrature along the steepest-descent contours. Benchmarking is performed on the standard Airy problem, for which the exact solution is known analytically. Furthermore, the numerical MGO solution provided by the new algorithm agrees remarkably well with the exact solution and significantly improves on previously derived analytical approximations of the MGO integral.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Gaussian Mean Field Lattice Gas

We study rigorously a lattice gas version of the Sherrington–Kirckpatrick spin glass model. In discrete optimization literature this problem is known as unconstrained binary quadratic programming and it belongs to the class NP-hard. We prove that the fluctuations of the ground state energy tend to vanish in the thermodynamic limit, and we give a lower bound of such ground state energy. Then we present a heuristic algorithm, based on a probabilistic cellular automaton, which seems to be able to find configurations with energy very close to the minimum, even for quite large instances.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A retrodictive stochastic simulation algorithm

In this paper we describe a simple method for inferring the initial states of systems evolving stochastically according to master equations, given knowledge of the final states. This is achieved through the use of a retrodictive stochastic simulation algorithm which complements the usual predictive stochastic simulation approach. We demonstrate the utility of this new algorithm by applying it to example problems, including the derivation of likely ancestral states of a gene sequence given a Markovian model of genetic mutation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Improvements on the minimax algorithm for the Laplace transformation of orbital energy denominators

We present a robust and non-heuristic algorithm that finds all extremum points of the error distribution function of numerically Laplace-transformed orbital energy denominators. The extremum point search is one of the two key steps for finding the minimax approximation. If pre-tabulation of initial guesses is supposed to be avoided, strategies for a sufficiently robust algorithm have not been discussed so far. We compare our non-heuristic approach with a bracketing and bisection algorithm and demonstrate that 3 times less function evaluations are required altogether when applying it to typical non-relativistic and relativistic quantum chemical systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spatial and Spin Symmetry Breaking in Semidefinite-Programming-Based Hartree–Fock Theory

The Hartree–Fock problem was recently recast as a semidefinite optimization over the space of rank-constrained two-body reduced-density matrices (RDMs) [ Phys. Rev. A 2014, 89, 010502(R)]. This formulation of the problem transfers the nonconvexity of the Hartree–Fock energy functional to the rank constraint on the two-body RDM. We consider an equivalent optimization over the space of positive semidefinite one-electron RDMs (1-RDMs) that retains the nonconvexity of the Hartree–Fock energy expression. The optimized 1-RDM satisfies ensemble N-representability conditions, and ensemble spin-state conditions may be imposed as well. The spin-state conditions place additional linear and nonlinear constraints on the 1-RDM. We apply this RDM-based approach to several molecular systems and explore its spatial (point group) and spin (Ŝ 2 and Ŝ 3 ) symmetry breaking properties. When imposing Ŝ 2 and Ŝ 3 symmetry but relaxing point group symmetry, the procedure often locates spatial-symmetry-broken solutions that are difficult to identify using standard algorithms. For example, the RDM-based approach yields a smooth, spatial-symmetry-broken potential energy curve for the well-known Be–H 2 insertion pathway. We also demonstrate numerically that, upon relaxation of Ŝ 2 and Ŝ 3 symmetry constraints, the RDM-based approach is equivalent to real-valued generalized Hartree–Fock theory.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Geometric descriptions of entangled states by auxiliary varieties

The aim of the paper is to propose geometric descriptions of multipartite entangled states using algebraic geometry. In the context of this paper, geometric means each stratum of the Hilbert space, corresponding to an entangled state, is an open subset of an algebraic variety built by classical geometric constructions (tangent lines, secant lines) from the set of separable states. In this setting, we describe well-known classifications of multipartite entanglement such as 2 Multiplication-Sign 2 Multiplication-Sign (n+ 1), for n Greater-Than-Or-Slanted-Equal-To 1, quantum systems and a new description with the 2 Multiplication-Sign 3 Multiplication-Sign 3 quantum system. Our results complete the approach of Miyake and make stronger connections with recent work of algebraic geometers. Moreover, for the quantum systems detailed in this paper, we propose an algorithm, based on the classical theory of invariants, to decide to which subvariety of the Hilbert space a given state belongs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Solving complex maintenance planning optimization problems using stochastic simulation and multi-criteria fuzzy decision making

One of the most important factors in the operations of many cooperations today is to maximize profit and one important tool to that effect is the optimization of maintenance activities. Maintenance activities is at the largest level divided into two major areas, corrective maintenance (CM) and preventive maintenance (PM). When optimizing maintenance activities, by a maintenance plan or policy, we seek to find the best activities to perform at each point in time, be it PM or CM. We explore the use of stochastic simulation, genetic algorithms and other tools for solving complex maintenance planning optimization problems in terms of a suggested framework model based on discrete event simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Type Ia supernova rate studies from the SDSS-II Supernova Study

The author presents new measurements of the type Ia SN rate from the SDSS-II Supernova Survey. The SDSS-II Supernova Survey was carried out during the Fall months (Sept.-Nov.) of 2005-2007 and discovered ~ 500 spectroscopically confirmed SNe Ia with densely sampled (once every ~ 4 days), multi-color light curves. Additionally, the SDSS-II Supernova Survey has discovered several hundred SNe Ia candidates with well-measured light curves, but without spectroscopic confirmation of type. This total, achieved in 9 months of observing, represents ~ 15-20% of the total SNe Ia discovered worldwide since 1885. The author describes some technical details of the SN Survey observations and SN search algorithms that contributed to the extremely high-yield of discovered SNe and that are important as context for the SDSS-II Supernova Survey SN Ia rate measurements.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Translation and integration of numerical atomic orbitals in linear molecules

We present algorithms for translation and integration of atomic orbitals for LCAO calculations in linear molecules. The method applies to arbitrary radial functions given on a numerical mesh. The algorithms are based on pseudospectral differentiation matrices in two dimensions and the corresponding two-dimensional Gaussian quadratures. As a result, multicenter overlap and Coulomb integrals can be evaluated effectively.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗