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 559 records · Page 31

Optical Payload for the STARE Mission

Space-based Telescopes for Actionable Refinement of Ephemeris (STARE) is a nano-sat based mission designed to better determine the trajectory of satellites and space debris in orbit around earth. In this paper, we give a brief overview of the mission and its place in the larger context of Space Situational Awareness (SSA). We then describe the details of the central optical payload, touching on the optical design and characterization of the on-board image sensor used in our Cubesat based prototype. Finally, we discuss the on-board star and satellite track detection algorithm central to the success of the mission.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Variational symplectic algorithm for guiding center dynamics in the inner magnetosphere

Charged particle dynamics in magnetosphere has temporal and spatial multiscale; therefore, numerical accuracy over a long integration time is required. A variational symplectic integrator (VSI) [H. Qin and X. Guan, Phys. Rev. Lett. 100, 035006 (2008) and H. Qin, X. Guan, and W. M. Tang, Phys. Plasmas 16, 042510 (2009)] for the guiding-center motion of charged particles in general magnetic field is applied to study the dynamics of charged particles in magnetosphere. Instead of discretizing the differential equations of the guiding-center motion, the action of the guiding-center motion is discretized and minimized to obtain the iteration rules for advancing the dynamics. The VSI conserves exactly a discrete Lagrangian symplectic structure and has better numerical properties over a long integration time, compared with standard integrators, such as the standard and adaptive fourth order Runge-Kutta (RK4) methods. Applying the VSI method to guiding-center dynamics in the inner magnetosphere, we can accurately calculate the particles'orbits for an arbitrary long simulating time with good conservation property. When a time-independent convection and corotation electric field is considered, the VSI method can give the accurate single particle orbit, while the RK4 method gives an incorrect orbit due to its intrinsic error accumulation over a long integrating time.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Meaningful timescales from Monte Carlo simulations of particle systems with hard-core interactions

A new Markov Chain Monte Carlo method for simulating the dynamics of particle systems characterized by hard-core interactions is introduced. In contrast to traditional Kinetic Monte Carlo approaches, where the state of the system is associated with minima in the energy landscape, in the proposed method, the state of the system is associated with the set of paths traveled by the atoms and the transition probabilities for an atom to be displaced are proportional to the corresponding velocities. In this way, the number of possible state-to-state transitions is reduced to a discrete set, and a direct link between the Monte Carlo time step and true physical time is naturally established. The resulting rejection-free algorithm is validated against event-driven molecular dynamics: the equilibrium and non-equilibrium dynamics of hard disks converge to the exact results with decreasing displacement size.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A H-infinity Fault Detection and Diagnosis Scheme for Discrete Nonlinear System Using Output Probability Density Estimation

In this paper, a H-infinity fault detection and diagnosis (FDD) scheme for a class of discrete nonlinear system fault using output probability density estimation is presented. Unlike classical FDD problems, the measured output of the system is viewed as a stochastic process and its square root probability density function (PDF) is modeled with B-spline functions, which leads to a deterministic space-time dynamic model including nonlinearities, uncertainties. A weighting mean value is given as an integral function of the square root PDF along space direction, which leads a function only about time and can be used to construct residual signal. Thus, the classical nonlinear filter approach can be used to detect and diagnose the fault in system. A feasible detection criterion is obtained at first, and a new H-infinity adaptive fault diagnosis algorithm is further investigated to estimate the fault. Simulation example is given to demonstrate the effectiveness of the proposed approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A variational multi-symplectic particle-in-cell algorithm with smoothing functions for the Vlasov-Maxwell system

Smoothing functions are commonly used to reduce numerical noise arising from coarse sampling of particles in particle-in-cell (PIC) plasma simulations. When applying smoothing functions to symplectic algorithms, the conservation of symplectic structure should be guaranteed to preserve good conservation properties. In this paper, we show how to construct a variational multi-symplectic PIC algorithm with smoothing functions for the Vlasov-Maxwell system. The conservation of the multi-symplectic structure and the reduction of numerical noise make this algorithm specifically suitable for simulating long-term dynamics of plasmas, such as those in the steady-state operation or long-pulse discharge of a super-conducting tokamak. The algorithm has been implemented in a 6D large scale PIC code. Numerical examples are given to demonstrate the good conservation properties of the multi-symplectic algorithm and the reduction of the noise due to the application of smoothing function.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Dark Energy Camera for Blanco

In order to make accurate measurements of dark energy, a system is needed to monitor the focus and alignment of the Dark Energy Camera (DECam) to be located on the Blanco 4m Telescope for the upcoming Dark Energy Survey. One new approach under development is to fit out-of-focus star images to a point spread function from which information about the focus and tilt of the camera can be obtained. As a first test of a new algorithm using this idea, simulated star images produced from a model of DECam in the optics software Zemax were fitted. Then, real images from the Mosaic II imager currently installed on the Blanco telescope were used to investigate the algorithm's capabilities. A number of problems with the algorithm were found, and more work is needed to understand its limitations and improve its capabilities so it can reliably predict camera alignment and focus.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Canonical symplectic structure and structure-preserving geometric algorithms for Schrödinger–Maxwell systems

An infinite dimensional canonical symplectic structure and structure-preserving geometric algorithms are developed for the photon–matter interactions described by the Schrödinger–Maxwell equations. The algorithms preserve the symplectic structure of the system and the unitary nature of the wavefunctions, and bound the energy error of the simulation for all time-steps. This new numerical capability enables us to carry out first-principle based simulation study of important photon–matter interactions, such as the high harmonic generation and stabilization of ionization, with long-term accuracy and fidelity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerical simulation of non-viscous liquid pinch-off using a coupled level set-boundary integral method

Simulations of the pinch-off of an inviscid fluid column are carried out based upon a potential flow model with capillary forces. The interface location and the time evolution of the free surface boundary condition are both approximated by means of level set techniques on a fixed domain. The interface velocity is obtained via a Galerkin boundary integral solution of the 3D axisymmetric Laplace equation. A short-time analytical solution of the Raleigh-Taylor instability in a liquid column is available, and this result is compared with our numerical experiments to validate the algorithm. The method is capable of handling pinch-off and after pinch-off events, and simulations showing the time evolution of the fluid tube are presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Compact conformal manifolds

In this note we begin a systematic study of compact conformal manifolds of SCFTs in four dimensions (our notion of compactness is with respect to the topology induced by the Zamolodchikov metric). Supersymmetry guarantees that such manifolds are Kähler, and so the simplest possible non-trivial compact conformal manifold in this set of geometries is a complex one-dimensional projective space. We show that such a manifold is indeed realized and give a general prescription for constructing complex N-dimensional projective space conformal manifolds as certain small N = 2 → N = 1 breaking deformations of strongly interacting N = 2 SCFTs. In many cases, our prescription reduces the construction of such spaces to a study of the N = 2 chiral ring. We also give an algorithm for constructing more general compact spaces of SCFTs.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A fast algorithm for parabolic PDE-based inverse problems based on Laplace transforms and flexible Krylov solvers

We consider the problem of estimating parameters in large-scale weakly nonlinear inverse problems for which the underlying governing equations is a linear, time-dependent, parabolic partial differential equation. A major challenge in solving these inverse problems using Newton-type methods is the computational cost associated with solving the forward problem and with repeated construction of the Jacobian, which represents the sensitivity of the measurements to the unknown parameters. Forming the Jacobian can be prohibitively expensive because it requires repeated solutions of the forward and adjoint time-dependent parabolic partial differential equations corresponding to multiple sources and receivers. We propose an efficient method based on a Laplace transform-based exponential time integrator combined with a flexible Krylov subspace approach to solve the resulting shifted systems of equations efficiently. Our proposed solver speeds up the computation of the forward and adjoint problems, thus yielding significant speedup in total inversion time. We consider an application from Transient Hydraulic Tomography (THT), which is an imaging technique to estimate hydraulic parameters related to the subsurface from pressure measurements obtained by a series of pumping tests. The algorithms discussed are applied to a synthetic example taken from THT to demonstrate the resulting computational gains of this proposed method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Data analysis of gravitational-wave signals from spinning neutron stars. V. A narrow-band all-sky search

We present theory and algorithms to perform an all-sky coherent search for periodic signals of gravitational waves in narrow-band data of a detector. Our search is based on a statistic, commonly called the F-statistic, derived from the maximum-likelihood principle in Paper I of this series. We briefly review the response of a ground-based detector to the gravitational-wave signal from a rotating neuron star and the derivation of the F-statistic. We present several algorithms to calculate efficiently this statistic. In particular our algorithms are such that one can take advantage of the speed of fast Fourier transform in calculation of the F-statistic. We construct a grid in the parameter space such that the nodes of the grid coincide with the Fourier frequencies. We present interpolation methods that approximately convert the two integrals in the F-statistic into Fourier transforms so that the fast Fourier transform algorithm can be applied in their evaluation. We have implemented our methods and algorithms into computer codes and we present results of the Monte Carlo simulations performed to test these codes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Algorithm for Unfolding Current from Faraday Rotation Measurement

Various methods are described to translate Faraday rotation measurements into a useful representation of the dynamic current under investigation[1]. For some experiments, simply counting the “fringes” up to the turnaround point in the recorded Faraday rotation signal is sufficient in determining the peak current within some allowable fringe uncertainty. For many other experiments, a higher demand for unfolding the entire dynamic current profile is required. In such cases, investigators often rely extensively on user interaction on the Faraday rotation data by visually observing the data and making logical decisions on what appears to be turnaround points and/or inflections in the signal. After determining extrema, inflection points, and locations, a piece-wise, ΔI/Δt, representation of the current may be revealed with the proviso of having a reliable Verdet constant of the Faraday fiber or medium and time location for each occurring fringe. In this paper, a unique software program is reported which automatically decodes the Faraday rotation signal into a time-dependent current representation. System parameters such as the Faraday fiber’s Verdet constant and number of loops in the sensor are the only user-interface inputs. The central aspect of the algorithm utilizes a short-time Fourier transform (STFT) which reveals much of the Faraday rotation’s hidden detail necessary for unfolding the dynamic current measurement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗