Artificial time integration

Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be “close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought. In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency. AMS subject classification (2000)  65L05, 65M32, 65N21, 65N22, 65D18     

空位在金刚石近(001)表面扩散的分子动力学模拟

用分子动力学方法模拟了空位在金刚石近(001)表面的扩散过程,研究了温度对空位扩散的影响.结果表明,当温度为1000K左右时,位于近表面第二层上的空位开始向表面运动;当温度在1400—2000K时,空位完全扩散到表面.这与实验结果和其他计算结果符合得很好.同时发现,温度为1400—1800K时,空位的扩散经历了两次迁移运动,其分别对应了均方位移图中的两个极大值.在不施加任何约束的条件下得到了空位的动态扩散路径,空位在金刚石近(001)表面的扩散势垒约为042eV.并探讨了一定温度下空位数目增多及其不同排列 关键词： 金刚石 空位 扩散 分子动力学     

Estimating Invariant Probability Densities for Dynamical Systems

Knowing a probability density (ideally, an invariant density) for the trajectories of a dynamical system allows many significant estimates to be made, from the well-known dynamical invariants such as Lyapunov exponents and mutual information to conditional probabilities which are potentially more suitable for prediction than the single number produced by most predictors. Densities on typical attractors have properties, such as singularity with respect to Lebesgue measure, which make standard density estimators less useful than one would hope. In this paper we present a new method of estimating densities which can smooth in a way that tends to preserve fractal structure down to some level, and that also maintains invariance. We demonstrate with applications to real and artificial data.     

Controlling global stochasticity of Hamiltonian systems by nonlinear perturbation

A method of controlling global stochasticity in Hamiltonian systems by applying nonlinear perturbation is proposed. With the well-known standard map we demonstrate that this control method can convert global stochasticity into regular motion in a wide chaotic region for arbitrary initial condition, in which the control signal remains very weak after a few kicks. The system in which chaos has been controlled approximates to the original Hamiltonian system, and this approach appears robust against small external noise. The mechanism underlying this high control efficiency is intuitively explained. Received 15 January 2002 Published online 6 June 2002     

On the Linear Complexity Profile of Nonlinear Congruential Pseudorandom Number Generators with Dickson Polynomials

Linear complexity and linear complexity profile are important characteristics of a sequence for applications in cryptography and Monte-Carlo methods. The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. Recently, a weak lower bound on the linear complexity profile of a general nonlinear congruential pseudorandom number generator was proven by Gutierrez, Shparlinski and the first author. For most nonlinear generators a much stronger lower bound is expected. Here, we obtain a much stronger lower bound on the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials.     

Numerical simulation of the spatiotemporal evolution of a nanoparticle–plasma system

A one-dimensional nanodusty plasma was modeled by self-consistently coupling a plasma model with nanoparticle growth, charging, and transport models. As nanoparticles grow from subnanometer to tens of nm in diameter, the numerical results predict a rich spatiotemporal structure, including four distinct temporal phases: a charge-limited phase, a charge accumulation phase, an early ion drag phase, and a sheath interaction phase.     

Molecular dynamics simulations on the structures and properties of ε-CL-20-based PBXs ——Primary theoretical studies on HEDM formulation design

Five polymer bonded explosives (PBXs) with the base explosive ε-CL-20 (hexanitrohexaazaisowurtzi- tane), the most important high energy density compound (HEDC), and five polymer binders (Estane 5703, GAP, HTPB, PEG, and F2314) were constructed. Molecular dynamics (MD) method was employed to investigate their binding energies (Ebind), compatibility, safety, mechanical properties, and energetic properties. The information and rules were reported for choosing better binders and guiding formula- tion design of high energy density material (HEDM). According to the calculated binding energies, the ordering of compatibility and stability of the five PBXs was predicted as ε-CL-20/PEG > ε-CL-20/ Estane5703 ≈ε-CL-20/GAP > ε-CL-20/HTPB > ε-CL-20/F2314. By pair correlation function g(r) analyses, hydrogen bonds and vdw are found to be the main interactions between the two components. The elasticity and isotropy of PBXs based ε-CL-20 can be obviously improved more than pure ε-CL-20 crystal. It is not by changing the molecular structures of ε-CL-20 for each binder to affect the sensitivity. The safety and energetic properties of these PBXs are mainly influenced by the thermal capability (C°p) and density (ρ) of binders, respectively.     

Biham–Middleton–Levine model with four-directional traffic

We study the four-directional traffic flow on a two-dimensional lattice. In the case of discrete densities, we assume equal number of vehicles in each lane. Except for the minimum density, the gridlock emerges swiftly. Two kinds of gridlock have been observed. The global gridlock dominates the system when the density is twice the minimum value. At higher densities, the system is pervaded by local gridlocks. We also analyze the time evolution of average speed. In the case of continuous densities, the vehicle numbers vary from lane to lane. The global gridlock is then destroyed by the fluctuations; while the local gridlock can still be observed.     

Viscosity solutions of fully nonlinear parabolic systems

In this paper, we discuss the viscosity solutions of the weakly coupled systems of fully nonlinear second-order degenerate parabolic equations and their Cauchy-Dirichlet problem. We prove the existence, uniqueness and continuity of viscosity solution by combining Perron's method with the technique of coupled solutions. The results here generalize those in Proc. London Math. Soc. 63 (1991) 212-240 and Comm. Partial Differential Equations 16 (1991) 1095-1128.     

Algebra with Quadratic Commutation Relations for an Axially Perturbed Coulomb–Dirac Field

The motion of a particle in the field of an electromagnetic monopole (in the Coulomb–Dirac field) perturbed by an axially symmetric potential after quantum averaging is described by an integrable system. Its Hamiltonian can be written in terms of the generators of an algebra with quadratic commutation relations. We construct the irreducible representations of this algebra in terms of second-order differential operators; we also construct its hypergeometric coherent states. We use these states in the first-order approximation with respect to the perturbing field to obtain the integral representation of the eigenfunctions of the original problem in terms of solutions of the model Heun-type second-order ordinary differential equation and present the asymptotic approximation of the corresponding eigenvalues.