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 541 records · Page 30

A fast and memory-sparing probabilistic selection algorithm for the GPU

A fast and memory-sparing probabilistic top-N selection algorithm is implemented on the GPU. This probabilistic algorithm gives a deterministic result and always terminates. The use of randomization reduces the amount of data that needs heavy processing, and so reduces both the memory requirements and the average time required for the algorithm. This algorithm is well-suited to more general parallel processors with multiple layers of memory hierarchy. Probabilistic Las Vegas algorithms of this kind are a form of stochastic optimization and can be especially useful for processors having a limited amount of fast memory available.

99 GENERAL AND MISCELLANEOUS↗

A massively parallel fractional step solver for incompressible flows

This paper presents a parallel implementation of fractional solvers for the incompressible Navier-Stokes equations using an algebraic approach. Under this framework, predictor-corrector and incremental projection schemes are seen as sub-classes of the same class, making apparent its differences and similarities. An additional advantage of this approach is to set a common basis for a parallelization strategy, which can be extended to other split techniques or to compressible flows. The predictor-corrector scheme consists in solving the momentum equation and a modified 'continuity' equation (namely a simple iteration for the pressure Schur complement) consecutively in order to converge to the monolithic solution, thus avoiding fractional errors. On the other hand, the incremental projection scheme solves only one iteration of the predictor-corrector per time step and adds a correction equation to fulfill the mass conservation. As shown in the paper, these two schemes are very well suited for massively parallel implementation. In fact, when compared with monolithic schemes, simpler solvers and preconditioners can be used to solve the non-symmetric momentum equations (GMRES, Bi-CGSTAB) and to solve the symmetric continuity equation (CG, Deflated CG). This gives good speedup properties of the algorithm. The implementation of the mesh partitioning technique is presented, as well as the parallel performances and speedups for thousands of processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dual Schroedinger Equation as Global Optimization Algorithm

The dual Schroedinger equation is defined as replacing the imaginary number i by -1 in the original one. This paper shows that the dual equation shares the same stationary states as the original one. Different from the original one, it explicitly defines a dynamic process for a system to evolve from any state to lower energy states and eventually to the lowest one. Its power as a global optimization algorithm might be used by nature for constructing atoms and molecules. It shall be interesting to verify its existence in nature.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimization of multilayer mirrors at 13.4 nm with more than two materials

The design of multilayer mirrors with more than two materials is one of the key technologies for investigating lithography. We study a new procedure for optimizing multilayer mirrors of different combinations of materials at a wavelength of 13.4 nm. By adding Be and C layers in different orders to a Si/Mo stack, we have observed enhancement of the reflectivity and a reduction in the number of layers. The Luus-Jaakola optimization procedure has been implemented for the global optimization of the multilayer mirrors. With this algorithm it is not necessary to specify initially the number of layers present in a given design.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Three-flat test with plates in horizontal posture

Measuring flats in the horizontal posture with interferometers is analyzed in detail, taking into account the sag produced by gravity. A mathematical expression of the bending is provided for a plate supported at three unevenly spaced locations along the edge. It is shown that the azimuthal terms of the deformation can be recovered from a three-flat measuring procedure, while the pure radial terms can only be estimated. The effectiveness of the iterative algorithm for data processing is also demonstrated. Experimental comparison on a set of three flats in horizontal and upright posture is provided.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Surface profile measurement in white-light scanning interferometry using a three-chip color CCD

White-light scanning interferometry (WLSI) is a useful technique to measure surface profile when a test object contains discontinuous structures or microstructures. A black and white CCD camera is usually utilized to capture interferograms, and a series of corresponding algorithms is used to achieve the profile measurement. However, the color information in the interferograms is lost. A novel profile measurement method that uses phase information in different color channels (red-green-blue) of an interferogram obtained using a three-chip color CCD in WLSI is proposed. The phase values are extracted by a windowed Fourier transform algorithm. Simulation and experimental results are presented to demonstrate the validity of the proposed method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Permutation matrix representation quantum Monte Carlo

We present a quantum Monte Carlo algorithm for the simulation of general quantum and classical many-body models within a single unifying framework. The algorithm builds on a power series expansion of the quantum partition function in its off-diagonal terms and is both parameter-free and Trotter error-free. In our approach, the quantum dimension consists of products of elements of a permutation group. As such, it allows for the study of a very wide variety of models on an equal footing. To demonstrate the utility of our technique, we use it to clarify the emergence of the sign problem in the simulations of non-stoquastic physical models. We showcase the flexibility of our algorithm and the advantages it offers over existing state-of-the-art by simulating transverse- field Ising model Hamiltonians and comparing the performance of our technique against that of the stochastic series expansion algorithm. Furthermore, we also study a transverse-field Ising model augmented with randomly chosen two-body transverse-field interactions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Approximating Nash Equilibrium in Day-ahead Electricity Market Bidding with Multi-agent Deep Reinforcement Learning

In this paper, a day-ahead electricity market bidding problem with multiple strategic generation company (GEN-CO) bidders is studied. The problem is formulated as a Markov game model, where GENCO bidders interact with each other todevelop their optimal day-ahead bidding strategies. Considering unobservable information in the problem, a model-free and data-driven approach, known as multi-agent deep deterministic policy gradient (MADDPG), is applied for approximating the Nash equilibrium (NE) in the above Markov game. The MADDPG algorithm has the advantage of generalization due to the automatic feature extraction ability of the deep neural networks. The algorithm is tested on an IEEE 30-bus system with three competitive GENCO bidders in both an uncongested caseand a congested case. Comparisons with a truthful bidding strategy and state-of-the-art deep reinforcement learning methods including deep Q network and deep deterministic policy gradient (DDPG) demonstrate that the applied MADDPG algorithm can find a superior bidding strategy for all the market participants with increased profit gains. In addition, the comparison with a conventional model-based method shows that the MADDPG algorithm has higher computational efficiency, which is feasible for real-world applications.

24 POWER TRANSMISSION AND DISTRIBUTION↗

The Liquid Argon Software Toolkit (LArSoft): Goals, Status and Plan

LArSoft is a toolkit that provides a software infrastructure and algorithms for the simulation, reconstruction and analysis of events in Liquid Argon Time Projection Chambers (LArTPCs). It is used by the ArgoNeuT, LArIAT, MicroBooNE, DUNE (including 35ton prototype and ProtoDUNE) and SBND experiments. The LArSoft collaboration provides an environment for the development, use, and sharing of code across experiments. The ultimate goal is to develop fully automatic processes for reconstruction and analysis of LArTPC events. The toolkit is based on the art framework and has a well-defined architecture to interface to other packages, including to GEANT4 and GENIE simulation software and the Pandora software development kit for pattern recognition. It is designed to facilitate and support the evolution of algorithms including their transition to new computing platforms. The development of the toolkit is driven by the scientific stakeholders involved. The core infrastructure includes standard definitions of types and constants, means to input experiment geometries as well as meta and event- data in several formats, and relevant general utilities. Examples of algorithms experiments have contributed to date are: photon-propagation; particle identification; hit finding, track finding and fitting; electromagnetic shower identification and reconstruction. We report on the status of the toolkit and plans for future work.

Pordes, Rush↗

Optimal Control of Evolution Mixed Variational Inclusions

Optimal control problems of primal and dual evolution mixed variational inclusions, in reflexive Banach spaces, are studied. The solvability analysis of the mixed state systems is established via duality principles. The optimality analysis is performed in terms of perturbation conjugate duality methods, and proximation penalty-duality algorithms to mixed optimality conditions are further presented. Applications to nonlinear diffusion constrained problems as well as quasistatic elastoviscoplastic bilateral contact problems exemplify the theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Novel electromagnetic surface integral equations for highly accurate computations of dielectric bodies with arbitrarily low contrasts

We present a novel stabilization procedure for accurate surface formulations of electromagnetic scattering problems involving three-dimensional dielectric objects with arbitrarily low contrasts. Conventional surface integral equations provide inaccurate results for the scattered fields when the contrast of the object is low, i.e., when the electromagnetic material parameters of the scatterer and the host medium are close to each other. We propose a stabilization procedure involving the extraction of nonradiating currents and rearrangement of the right-hand side of the equations using fictitious incident fields. Then, only the radiating currents are solved to calculate the scattered fields accurately. This technique can easily be applied to the existing implementations of conventional formulations, it requires negligible extra computational cost, and it is also appropriate for the solution of large problems with the multilevel fast multipole algorithm. We show that the stabilization leads to robust formulations that are valid even for the solutions of extremely low-contrast objects.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

High Quality Typhoon Cloud Image Restoration by Combining Genetic Algorithm with Contourlet Transform

An efficient typhoon cloud image restoration algorithm is proposed. Having implemented contourlet transform to a typhoon cloud image, noise is reduced in the high sub-bands. Weight median value filter is used to reduce the noise in the contourlet domain. Inverse contourlet transform is done to obtain the de-noising image. In order to enhance the global contrast of the typhoon cloud image, in-complete Beta transform (IBT) is used to determine non-linear gray transform curve so as to enhance global contrast for the de-noising typhoon cloud image. Genetic algorithm is used to obtain the optimal gray transform curve. Information entropy is used as the fitness function of the genetic algorithm. Experimental results show that the new algorithm is able to well enhance the global for the typhoon cloud image while well reducing the noises in the typhoon cloud image.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A fast and efficient algorithm for Slater determinant updates in quantum Monte Carlo simulations

We present an efficient low-rank updating algorithm for updating the trial wave functions used in quantum Monte Carlo (QMC) simulations. The algorithm is based on low-rank updating of the Slater determinants. In particular, the computational complexity of the algorithm is O(kN) during the kth step compared to traditional algorithms that require O(N{sup 2}) computations, where N is the system size. For single determinant trial wave functions the new algorithm is faster than the traditional O(N{sup 2}) Sherman-Morrison algorithm for up to O(N) updates. For multideterminant configuration-interaction-type trial wave functions of M+1 determinants, the new algorithm is significantly more efficient, saving both O(MN{sup 2}) work and O(MN{sup 2}) storage. The algorithm enables more accurate and significantly more efficient QMC calculations using configuration-interaction-type wave functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Total Variation Meets Topological Persistence: A First Encounter

We present first insights into the relation between two popular yet apparently dissimilar approaches to denoising of one dimensional signals, based on (i) total variation (TV) minimization and (ii) ideas from topological persistence. While a close relation between (i) and (ii) might phenomenologically not be unexpected, our work appears to be the first to make this connection precise for one dimensional signals. We provide a link between (i) and (ii) that builds on the equivalence between TV-L{sup 2} regularization and taut strings and leads to a novel and efficient denoising algorithm that is contrast preserving and operates in O(nlogn) time, where n is the size of the input.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗