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 937 records · Page 52

Performance of Multi-chaotic PSO on a shifted benchmark functions set

In this paper the performance of Multi-chaotic PSO algorithm is investigated using two shifted benchmark functions. The purpose of shifted benchmark functions is to simulate the time-variant real-world problems. The results of chaotic PSO are compared with canonical version of the algorithm. It is concluded that using the multi-chaotic approach can lead to better results in optimization of shifted functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simple algorithm for computing the geometric measure of entanglement

We present an easy implementable algorithm for approximating the geometric measure of entanglement from above. The algorithm can be applied to any multipartite mixed state. It involves only the solution of an eigenproblem and finding a singular value decomposition; no further numerical techniques are needed. To provide examples, the algorithm was applied to the isotropic states of three qubits and the three-qubit XX model with external magnetic field.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Design of Optical Pulse Position Modulation (PPM) Translating Receiver

M-ary pulse position modulation (M-ary PPM) signaling is a means of transmitting multiple bits per symbol in an intensity modulated/direct detection (IM/DD) system. PPM is used in applications with average power limitations. In optical communication systems, PPM becomes challenging to implement at gigabit rates and/or large M, since pulsed signaling requires higher electronic processing bandwidths than the fundamental transmission rate. they have thus been exploring techniques for PPM communications using optical processing. Previous work described a transmitter algorithm that directly translates a bit sequence of N digital bits to the optical pulse position m for any M = 2{sup N}. It has been considerably more difficult to define a similar receiver algorithm that translates the received optical pulse position directly back to a bit sequence with minimal electronic processing. Designs for specific Ms (e.g., 4-ary) have been shown and implemented, but are difficult to scale to larger M. In this work, they present for the first time a generalized PPM translating receiver that is applicable to all M and data rates.

42 ENGINEERING↗

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↗

Closed Loop, DM Diversity-based, Wavefront Correction Algorithm for High Contrast Imaging Systems

High contrast imaging from space relies on coronagraphs to limit diffraction and a wavefront control systems to compensate for imperfections in both the telescope optics and the coronagraph. The extreme contrast required (up to 10(exp -10) for terrestrial planets) puts severe requirements on the wavefront control system, as the achievable contrast is limited by the quality of the wavefront. This paper presents a general closed loop correction algorithm for high contrast imaging coronagraphs by minimizing the energy in a predefined region in the image where terrestrial planets could be found. The estimation part of the algorithm reconstructs the complex field in the image plane using phase diversity caused by the deformable mirror. This method has been shown to achieve faster and better correction than classical speckle nulling.

Give'on, Amir↗

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↗

On domains of convergence in optimization problems

Numerical optimization algorithms require the knowledge of an initial set of design variables. Starting from an initial design x(sup 0), improved solutions are obtained by updating the design iteratively in a way prescribed by the particular algorithm used. If the algorithm is successful, convergence is achieved to a local optimal solution. Let A denote the iterative procedure that characterizes a typical optimization algorithm, applied to the problem: Find x belonging to R(sup n) that maximizes f(x) subject to x belonging to Omega contained in R(sup n). We are interested in problems with several local maxima (x(sub j))(sup *), j=1, ..., m, in the feasible design space Omega. In general, convergence of the algorithm A to a specific solution (x(sub j))(sup *) is determined by the choice of initial design x(sup 0). The domain of convergence D(sub j) of A associated with a local maximum (x(sub j))(sup *) is a subset of initial designs x(sup 0) in Omega such that the sequence (x(sup k)), k=0,1,2,... defined by x(sup k+1) = A(x(sup k)), k=0,1,... converges to (x(sub j))(sup *). The set D(sub j) is also called the basin of attraction of (x(sub j))(sup *). Cayley first proposed the problem of finding the basin of attraction for Newton's method in 1897. It has been shown that the basin of attraction for Newton's method exhibits chaotic behavior in problems with polynomial objective. This implies that there may be regions in the feasible design space where arbitrarily close starting points will converge to different local optimal solutions. Furthermore, the boundaries of the domains of convergence may have a very complex, even fractal structure. In this paper we show that even simple structural optimization problems solved using standard gradient based (first order) algorithms exhibit similar features.

Diaz, Alejandro R.↗

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↗

An investigation of the information propagation and entropy transport aspects of Stirling machine numerical simulation

Aspects of the information propagation modeling behavior of integral machine computer simulation programs are investigated in terms of a transmission line. In particular, the effects of pressure-linking and temporal integration algorithms on the amplitude ratio and phase angle predictions are compared against experimental and closed-form analytic data. It is concluded that the discretized, first order conservation balances may not be adequate for modeling information propagation effects at characteristic numbers less than about 24. An entropy transport equation suitable for generalized use in Stirling machine simulation is developed. The equation is evaluated by including it in a simulation of an incompressible oscillating flow apparatus designed to demonstrate the effect of flow oscillations on the enhancement of thermal diffusion. Numerical false diffusion is found to be a major factor inhibiting validation of the simulation predictions with experimental and closed-form analytic data. A generalized false diffusion correction algorithm is developed which allows the numerical results to match their analytic counterparts. Under these conditions, the simulation yields entropy predictions which satisfy Clausius' inequality.

Goldberg, Louis F.↗

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↗