Uniform random number generation

In typical stochastic simulations, randomness is produced by generating a sequence of independent uniform variates (usually real-valued between 0 and 1, or integer-valued in some interval) and transforming them in an appropriate way. In this paper, we examine practical ways of generating (deterministic approximations to) such uniform variates on a computer. We compare them in terms of ease of implementation, efficiency, theoretical support, and statistical robustness. We look in particular at several classes of generators, such as linear congruential, multiple recursive, digital multistep, Tausworthe, lagged-Fibonacci, generalized feedback shift register, matrix, linear congruential over fields of formal series, and combined generators, and show how all of them can be analyzed in terms of their lattice structure. We also mention other classes of generators, like non-linear generators, discuss other kinds of theoretical and empirical statistical tests, and give a bibliographic survey of recent papers on the subject.     

利用KTP晶体实现1.08μmNd：YAP激光器锁模

本文描述了利用ＫＴＰ晶体和腔的基波输出镜构成非线性镜实现１．０８μｍＮｄ：ＹＡＰ激光器的被动锁模。实验表明，这种新的锁模技术比用染料作可饱和吸收体的被动锁模技术有很多突出的优点，具有很大的发展潜力。实验测得锁模时基波１．０８μｍ输出２．４ｍＪ，二次谐波０．５４μｍ输出０．５ｍＪ（同样条件下的静态输出为２．５ｍＪ），基波脉冲的平均脉宽为４０ｐｓ。     

激光光束质量因子的研究进展

本文详细分析了各种光场下光束质量M2因子。在不同的场中,A.E.Siegman当初所定义的M2因子,已经有了很大的变化,因而M2因子的特性也与当初不同,不仅M2因子可以大于等于1,而且可以小于1,甚至小于0。其反映的物理意义,也从经典场中的衍射极限倍数,变化为非经典场中的准直性量度以及对空间相干性的某些反映。此外还列举并分析了几种特殊的光束质量因子,最后讨论了M2因子应用的问题并指出了其局限性。     

Applications of Soliton Transmission Control in Optimal Design of Long－Haul Soliton Communication System

ＡｐｐｌｉｃａｔｉｏｎｓｏｆｃｈａｏｓｉｎｓｐｒｅａｄｓｐｅｃｔｒｕｍｃｏｍｍｕｎｉｃａｔｉｏｎｓＡｐｐｌｉｃａｔｉｏｎｓｏｆＳｏｌｉｔｏｎＴｒａｎｓｍｉｓｓｉｏｎＣｏｎｔｒｏｌｉｎＯｐｔｉｍａｌＤｅｓｉｇｎｏｆＬｏｎｇ－ＨａｕｌＳｏｌｉｔｏｎＣｏｍ...     

Existence and Nonlinear Stability of Stationary States of the Schrödinger–Poisson System

We consider the Schrödinger–Poisson system in the repulsive (plasma physics) Coulomb case. Given a stationary state from a certain class we prove its nonlinear stability, using an appropriately defined energy-Casimir functional as Lyapunov function. To obtain such states we start with a given Casimir functional and construct a new functional which is in some sense dual to the corresponding energy-Casimir functional. This dual functional has a unique maximizer which is a stationary state of the Schrödinger–Poisson system and lies in the stability class. The stationary states are parameterized by the equation of state, giving the occupation probabilities of the quantum states as a strictly decreasing function of their energy levels.     

Numerical simulation of critical dependences for symmetric two-layered Josephson junctions

Partial critical dependences of the form current-magnetic field in a two-layered symmetric Josephson junction are modeled. A numerical experiment shows that, for the zero interaction coefficient between the layers of the junction, jumps of the critical currents corresponding to different distributions of the magnetic fluxes in the layers may appear on the critical curves. This fact allows a mathematical interpretation of the results of some recent experimental results for two-layered junctions as a consequence of discontinuities of partial critical curves.     

关于均值KIRCHHOFF板非线性边界镇定问题的几点注记

对于均值K IRCHHOFF板非线性边界镇定问题给出几点注记.首先应用G reen公式对具有非线性边界反馈控制的均值K IRCHHOFF板所决定的非线性系统的能量衰减速度进行了重新推导,从而修正了前人的结果.然后应用极大单调函数的定义和分部积分技巧,对均值K IRCHHOFF板非线性边界镇定问题所决定的非线性算子A的极大单调性给出了重新证明,进而更正了已有文献中相应证明的欠妥之处.     

Equality and inequality constrained optimization algorithms with convergent stepsizes

In this paper, we consider two algorithms for nonlinear equality and inequality constrained optimization. Both algorithms utilize stepsize strategies based on differentiable penalty functions and quadratic programming subproblems. The essential difference between the algorithms is in the stepsize strategies used. The objective function in the quadratic subproblem includes a linear term that is dependent on the penalty functions. The quadratic objective function utilizes an approximate Hessian of the Lagrangian augmented by the penalty functions. In this approximation, it is possible to ignore the second-derivative terms arising from the constraints in the penalty functions.The penalty parameter is determined using a strategy, slightly different for each algorithm, that ensures boundedness as well as a descent property. In particular, the boundedness follows as the strategy is always satisfied for finite values of the parameter.These properties are utilized to establish global convergence and the condition under which unit stepsizes are achieved. There is also a compatibility between the quadratic objective function and the stepsize strategy to ensure the consistency of the properties for unit steps and subsequent convergence rates.This research was funded by SERC and ESRC research contracts. The author is grateful to Professors Laurence Dixon and David Mayne for their comments. The numerical results in the paper were obtained using a program written by Mr. Robin Becker.     

Degeneracy in NLP and the development of results motivated by its presence

We study notions of nondegeneracy and several levels of increasing degeneracy from the perspective of the local behavior of a local solution of a nonlinear program when problem parameters are slightly perturbed. Ideal nondegeneracy at a local minimizer is taken to mean satisfaction of second order sufficient conditions, linear independence and strict complimentary slackness. Following a brief exploration of the relationship of these conditions with the classical definition of nondegeneracy in linear programming, we recall a number of optimality and regularity conditions used to attempt to resolve degeneracy and survey results of Fiacco, McCormick, Robinson, Kojima, Gauvin and Janin, Shapiro, Kyparisis and Liu. This overview may be viewed as a structured survey of sensitivity and stability results: the focus is on progressive levels of degeneracy. We note connections of nondegeneracy with the convergence of algorithms and observe the striking parallel between the effects of nondegeneracy and degeneracy on optimality conditions, stability analysis and algorithmic convergence behavior. Although our orientation here is primarily interpretive and noncritical, we conclude that more effort is needed to unify optimality, stability and convergence theory and more results are needed in all three areas for radically degenerate problems.Research supported by National Science Foundation Grant ECS 90-00560 and Grant N00014-89-J-1537 Office of Naval Research     

An analysis of reduced Hessian methods for constrained optimization

We study the convergence properties of reduced Hessian successive quadratic programming for equality constrained optimization. The method uses a backtracking line search, and updates an approximation to the reduced Hessian of the Lagrangian by means of the BFGS formula. Two merit functions are considered for the line search: the ₁ function and the Fletcher exact penalty function. We give conditions under which local and superlinear convergence is obtained, and also prove a global convergence result. The analysis allows the initial reduced Hessian approximation to be any positive definite matrix, and does not assume that the iterates converge, or that the matrices are bounded. The effects of a second order correction step, a watchdog procedure and of the choice of null space basis are considered. This work can be seen as an extension to reduced Hessian methods of the well known results of Powell (1976) for unconstrained optimization.This author was supported, in part, by National Science Foundation grant CCR-8702403, Air Force Office of Scientific Research grant AFOSR-85-0251, and Army Research Office contract DAAL03-88-K-0086.This author was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under contracts W-31-109-Eng-38 and DE FG02-87ER25047, and by National Science Foundation Grant No. DCR-86-02071.