The Hagedorn wavepacket method is an important numerical method for solving the semiclassical time-dependent Schrödinger equation. In this paper, a new semi-discretization in space is obtained by wavepacket opera...
详细信息
The Hagedorn wavepacket method is an important numerical method for solving the semiclassical time-dependent Schrödinger equation. In this paper, a new semi-discretization in space is obtained by wavepacket operator. In a sense, such semi-discretization is equivalent to the Hagedorn wavepacket method, but this discretization is more intuitive to show the advantages of wavepacket methods. Moreover, we apply the multi-time-step method and the Magnus-expansion to obtain the improved algorithms in time-stepping computation. The improved algorithms are of the Gauss–Hermite spectral accuracy to approximate the analytical solution of the semiclassical Schrödinger equation. And for the given accuracy, the larger time stepsize can be used for the higher oscillation in the semiclassical Schrödinger equation. The superiority is shown by the error estimation and numerical experiments.
Video summarization provides condensed and succinct representations of the content of a video stream. A static storyboard summarization approach based on robust low-rank subspace segmentation is proposed in this paper...
详细信息
In this paper, we develop a novel fuzzy supervised learning algorithm based on the dynamical parameter estimation. First, a reformative supervised fuzzy LDA algorithm (RF-LDA) for the training samples is proposed. Com...
详细信息
Membrane algorithms are a new class of heuristic algorithms, which attempt to incorporate some components of membrane computing models (also called P systems) for designing efficient optimization algorithms, such as t...
详细信息
Membrane algorithms are a new class of heuristic algorithms, which attempt to incorporate some components of membrane computing models (also called P systems) for designing efficient optimization algorithms, such as the structure of P systems, the way of communication between cells, etc. Membrane algorithms are a kind of parallel methods, where many operations can be performed in parallel. Although the importance of the parallelism of such algorithms is recognized, membrane algorithms were often implemented on the serial computing device Central processing Unit (CPU), which makes the algorithms cannot work in a more efficient way. In this work, we consider the implementation of membrane algorithms on the parallel computing device Graphics processing Unit (GPU). Under such implementation, all cells of membrane algorithms can work simultaneously. Experiment results on two classical intractable problems, point set matching problem and TSP, show that GPU implementation of membrane algorithms is much more efficient than CPU implementation in terms of runtime, especially for solving the problems with a high complexity.
In the real word, the complex problems usually have netted structure, namely netted problems. The general methods to solve this kind of problems are based on the sequence structural description or tree structural desc...
详细信息
In this paper, a discrete time model of the mixed TCP and UDP connection with the RED is introduced. We use this one order discrete-time model to explain the instability, bifurcation and chaotic behaviors of the syste...
详细信息
This letter presents the graphic processor unit (GPU)implementation of the finite-difference time-domain (FDTD)method for the solution of the two-dimensional electromagnetic fields inside dispersive *** improved Z-tra...
详细信息
This letter presents the graphic processor unit (GPU)implementation of the finite-difference time-domain (FDTD)method for the solution of the two-dimensional electromagnetic fields inside dispersive *** improved Z-transform-based finite-difference time-domain (ZTFDTD) method was presented for simulating the interaction of electromagnetic wave with unmagnetized *** using the newly introduced Compute Unified Device Architecture (CUDA) technology, we illustrate the efficacy of GPU in accelerating the FDTD computations by achieving significant speedups with great ease and at no extra hardware *** effect of the GPU-CPU memory transfers on the speedup will be also studied.
In this study, we are concerned with controlling Hopf bifurcation in a dual model of Internet congestion control algorithms. The stability of this system depends on a communication delay parameter, and Hopf bifurcatio...
详细信息
Particle filter is well suited to estimate the state of non-linear non-Gaussian dynamic systems,which comes at the cost of higher computational *** in many real time applications,it must deal with constraints imposed ...
详细信息
Particle filter is well suited to estimate the state of non-linear non-Gaussian dynamic systems,which comes at the cost of higher computational *** in many real time applications,it must deal with constraints imposed by limited computational *** deal with this question,we distribute the samples among the different observations arriving during a filter update, the novel algorithm represents densities over the state space by mixtures of sample *** contribution of this paper is to increasing the efficiency of particle filters by adapting the size of sample sets during the estimation *** to the relative entropy theory and particle number controller idea,we choose the number of samples,decrease computation overhead.A simulation of the classic HARD bearing only tracking problem is presented,the results show that the novel algorithm performs better than generic particle filter.
The essence of maneuvering target tracking is mainly including maneuvering target modeling, maneuvering target detection or maneuvering target identification and filtering algorithm. In this paper, the maneuvering tar...
详细信息
The essence of maneuvering target tracking is mainly including maneuvering target modeling, maneuvering target detection or maneuvering target identification and filtering algorithm. In this paper, the maneuvering target model was described by the cooperative turn model, and tracked by the particle filter algorithm. The resample technique is introduced to overcome the problem of particle degradation in standard particle filter. Finally, we finished simulation experiments by Matlab, and compared the particle filter algorithm with the extended kalman filter algorithm, the results show that particle filter with the resample technique has a better performance in tracking precision, computational complexity, real-time performance and stability, it is a more effective method for maneuvering target tracking.
暂无评论