Search results for "A* algorithm"
showing 10 items of 2538 documents
Numerical experiments with a parallel fast direct elliptic solver on Cray T3E
1997
A parallel fast direct O(N log N) solver is shortly described for linear systems with separable block tridiagonal matrices. A good parallel scalability of the proposed method is demonstrated on a Cray T3E parallel computer using MPI in communication. Also, the sequential performance is compared with the well-known BLKTRI-implementation of the generalized. cyclic reduction method using a single processor of Cray T3E.
Reconstruction of an effective magnon mean free path distribution from spin Seebeck measurements in thin films
2017
A thorough understanding of the mean-free-path (MFP) distribution of the energy carriers is crucial to engineer and tune the transport properties of materials. In this context, a significant body of work has investigated the phonon and electron MFP distribution, however, similar studies of the magnon MFP distribution have not been carried out so far. In this work, we used thickness-dependence measurements of the longitudinal spin Seebeck (LSSE) effect of yttrium iron garnet films to reconstruct the cumulative distribution of a SSE related effective magnon MFP. By using the experimental data reported by Guo et al. [Phys. Rev. X 6, 031012 (2016)], we adapted the phonon MFP reconstruction algo…
Parallelization of a Lattice Boltzmann Suspension Flow Solver
2002
We have applied a parallel Lattice Boltzmann method to solve the behaviour of the suspension flow. The complex behaviour of the suspension flow cannot be solved by analytical methods, so simulations are the only way to study it. Usually the size of an interesting problem is so big that calculation time on one processor is too long, and this can be solved by parallel program. We have written a parallel suspension flow solver and tested it on massive parallel computers. The measured performance of our program show that the parallelization of suspension particles was successful. We also show that over one million particles can be simulated.
SPATIAL MULTIFRACTALITY OF ELECTRONIC STATES AND THE METAL-INSULATOR TRANSITION IN DISORDERED SYSTEMS
1993
For the investigation of the spatial behavior of electronic wave functions in disordered systems, we employ the Anderson model of localization. The eigenstates of the corresponding Hamiltonian are calculated numerically by means of the Lanczos algorithm and are analyzed with respect to their spatial multifractal properties. We find that the wave functions show spatial multifractality for all parameter cases not too far away from the metal-insulator transition (MIT) which separates localized from extended states in this model. Exactly at the MIT, multifractality is expected to exist on all length scales larger than the lattice spacing. It is found that the corresponding singularity spectrum…
Entropy measures, entropy estimators, and their performance in quantifying complex dynamics: Effects of artifacts, nonstationarity, and long-range co…
2017
Entropy measures are widely applied to quantify the complexity of dynamical systems in diverse fields. However, the practical application of entropy methods is challenging, due to the variety of entropy measures and estimators and the complexity of real-world time series, including nonstationarities and long-range correlations (LRC). We conduct a systematic study on the performance, bias, and limitations of three basic measures (entropy, conditional entropy, information storage) and three traditionally used estimators (linear, kernel, nearest neighbor). We investigate the dependence of entropy measures on estimator- and process-specific parameters, and we show the effects of three types of …
Entropy-Based Detection of Complexity and Nonlinearity in Short-Term Heart Period Variability under different Physiopathological States
2020
We compare different estimators of a popular en-tropy-based nonlinear dynamic measure, i.e. the conditional entropy (CE), as regards their ability to assess the complexity and nonlinearity of short-term heart rate variability (HRV). The CE is computed using binning, kernel and nearest neighbor entropy estimators in HRV time series measured from young, old and post-myocardial infarction patients studied at rest and during orthostatic stress. We find that the three estimators yield similar patterns of CE, but different patterns of nonlinear dynamics, across groups and conditions. These results suggest that the strategy for CE estimation is not crucial for the quantification of complexity, but…
On general conditional prevision assessments
2009
In this paper we consider general conditional random quantities of the kind $X|Y$, where $X$ and $Y$ are finite discrete random quantities. Then, we introduce the notion of coherence for conditional prevision assessments on finite families of general conditional random quantities. Moreover, we give a compound prevision theorem and we examine the relation between the previsions of $X|Y$ and $Y|X$. Then, we give some results on random gains and, by a suitable alternative theorem, we obtain a characterization of coherence. We also propose an algorithm for the checking of coherence. Finally, we briefly examine the case of imprecise conditional prevision assessments by introducing the notions of…
The SISCone jet algorithm optimised for low particle multiplicities
2011
The SISCone jet algorithm is a seedless infrared-safe cone jet algorithm. There exists an implementation which is highly optimised for a large number of final state particles. However, in fixed-order perturbative calculations with a small number of final state particles, it turns out that the computer time needed for the jet clustering of this implementation is comparable to the computer time of the matrix elements. This article reports on an implementation of the SISCone algorithm optimised for low particle multiplicities.
A PARALLEL ALGORITHM FOR ANALYZING CONNECTED COMPONENTS IN BINARY IMAGES
1992
In this paper, a parallel algorithm for analyzing connected components in binary images is described. It is based on the extension of the Cylindrical Algebraic Decomposition (CAD) to a two-dimensional (2D) discrete space. This extension allows us to find the number of connected components, to determine their connectivity degree, and to solve the visibility problem. The parallel implementation of the algorithm is outlined and its time/space complexity is given.
Stationary states in quantum walk search
2016
When classically searching a database, having additional correct answers makes the search easier. For a discrete-time quantum walk searching a graph for a marked vertex, however, additional marked vertices can make the search harder by causing the system to approximately begin in a stationary state, so the system fails to evolve. In this paper, we completely characterize the stationary states, or 1-eigenvectors, of the quantum walk search operator for general graphs and configurations of marked vertices by decomposing their amplitudes into uniform and flip states. This infinitely expands the number of known stationary states and gives an optimization procedure to find the stationary state c…