Quantum-classical correspondence for motion on a plane with deficit angle

A particle constrained to move on a cone and bound to its tip by harmonic oscillator and Coulomb-Kepler potentials is considered both in the classical as well as in the quantum formulations. The SU(2) coherent states are formally derived for the former model and used for showing some relations between closed classical orbits and quantum probability densities. Similar relations are shown for the Coulomb-Kepler problem. In both cases a perfect localization of the densities on the classical solutions is obtained even for low values of quantum numbers.     

Parallel preconditioned conjugate gradient algorithm on GPU

We propose a parallel implementation of the Preconditioned Conjugate Gradient algorithm on a GPU platform. The preconditioning matrix is an approximate inverse derived from the SSOR preconditioner. Used through sparse matrix–vector multiplication, the proposed preconditioner is well suited for the massively parallel GPU architecture. As compared to CPU implementation of the conjugate gradient algorithm, our GPU preconditioned conjugate gradient implementation is up to 10 times faster (8 times faster at worst).     

Path-following interior point algorithms for the Cartesian <Emphasis Type="Italic">P</Emphasis><Subscript>*</Subscript>(κ)-LCP over symmetric cones

In this paper, we establish a theoretical framework of path-following interior point algorithms for the linear complementarity problems over symmetric cones (SCLCP) with the Cartesian P _*(κ)-property, a weaker condition than the monotonicity. Based on the Nesterov-Todd, xy and yx directions employed as commutative search directions for semidefinite programming, we extend the variants of the short-, semilong-, and long-step path-following algorithms for symmetric conic linear programming proposed by Schmieta and Alizadeh to the Cartesian P _*(κ)-SCLCP, and particularly show the global convergence and the iteration complexities of the proposed algorithms. This work was supported by National Natural Science Foundation of China (Grant Nos. 10671010, 70841008)     

Breaking chaotic shift key communication via adaptive key identification

This paper proposes an adaptive parameter identification method for breaking chaotic shift key communication from the transmitted signal in public channel. The sensitive dependence property of chaos on parameter mismatch is used for chaos adaptive synchronization and parameter identification. An index function about the synchronization error is defined and conjugate gradient method is used to minimize the index function and to search the transmitter's parameter (key). By using proposed method, secure key is recovered from transmitted signal generated by low dimensional chaos and hyper chaos switching communication. Multi-parameters can also be identified from the transmitted signal with noise.     

The Conjugate Nets, Cartan Submanifolds, and Laplace Transformations in Space Forms

In this paper we establish the geometric theory of conjugate nets, Cartan submanifolds, and Laplace transformations in sphere and pseudo-sphere spaces. The corresponding theory in cases of projective and Euclidean spaces has been established by Chern, Kamran and Tenenblat.     

Accelerated Poisson-Boltzmann calculations for static and dynamic systems

We report here an efficient implementation of the finite difference Poisson-Boltzmann solvent model based on the Modified Incomplete Cholsky Conjugate Gradient algorithm, which gives rather impressive performance for both static and dynamic systems. This is achieved by implementing the algorithm with Eisenstat's two optimizations, utilizing the electrostatic update in simulations, and applying prudent approximations, including: relaxing the convergence criterion, not updating Poisson-Boltzmann-related forces every step, and using electrostatic focusing. It is also possible to markedly accelerate the supporting routines that are used to set up the calculations and to obtain energies and forces. The resulting finite difference Poisson-Boltzmann method delivers efficiency comparable to the distance-dependent dielectric model for a system tested, HIV Protease, making it a strong candidate for solution-phase molecular dynamics simulations. Further, the finite difference method includes all intrasolute electrostatic interactions, whereas the distance dependent dielectric calculations use a 15-A cutoff. The speed of our numerical finite difference method is comparable to that of the pair-wise Generalized Born approximation to the Poisson-Boltzmann method.     

Enhancement of phase conjugate wave in cerium doped bismuth germanate crystal

The enhancement of phase-conjugnte wave in cerium-doped bismuth germanatecrystal(Ce:BGO) was investigated.The result indicated that the phase congugate mirror(PCM) reflectivity of the doped BGO is one order higher than that of pure BGO and the re-sponse time is also decreased for doped BGO.Their mechanism were discussed.     

Fourier acceleration of iterative processes in disordered systems

Technical details are given on how to use Fourier acceleration with iterative processes such as relaxation and conjugate gradient methods. These methods are often used to solve large linear systems of equations, but become hopelessly slow very rapidly as the size of the set of equations to be solved increases. Fourier acceleration is a method designed to alleviate these problems and result in a very fast algorithm. The method is explained for the Jacobi relaxation and conjugate gradient methods and is applied to two models: the random resistor network and the random central-force network. In the first model, acceleration works very well; in the second, little is gained. We discuss reasons for this. We also include a discussion of stopping criteria.     

半无限规划的一个对偶问题

本文对半无限凸规划提出一个新的对偶问题，使用扰动函数、次微分和法锥，文中证明了相应的弱对偶性及强对偶性的充要条件．