A technique to construct symmetric variable-stepsize linear multistep methods for second-order systems

Some previous works show that symmetric fixed- and variable-stepsize linear multistep methods for second-order systems which do not have any parasitic root in their first characteristic polynomial give rise to a slow error growth with time when integrating reversible systems. In this paper, we give a technique to construct variable-stepsize symmetric methods from their fixed-stepsize counterparts, in such a way that the former have the same order as the latter. The order and symmetry of the integrators obtained is proved independently of the order of the underlying fixed-stepsize integrators. As this technique looks for efficiency, we concentrate on explicit linear multistep methods, which just make one function evaluation per step, and we offer some numerical comparisons with other one-step adaptive methods which also show a good long-term behaviour.

     

Discrete limit theorems for general Dirichlet series. III

Here we prove a limit theorem in the sense of the weak convergence of probability measures in the space of meromorphic functions for a general Dirichlet series. The explicit form of the limit measure in this theorem is given. Partially supported by Lithuanian Foundation of Studies and Science     

用迈克耳逊干涉仪测量气体折射率的误差的研究

研究在用迈克尔逊干涉仪测量气体折射率时存在的系统和方法误差，提出了误差修正方法。     

Large deviation for the empirical eigenvalue density of truncated Haar unitary matrices

Let U_m be an m×m Haar unitary matrix and U_[m,n] be its n×n truncation. In this paper the large deviation is proven for the empirical eigenvalue density of U_[m,n] as m/n→λ and n→∞. The rate function and the limit distribution are given explicitly. U_[m,n] is the random matrix model of quq, where u is a Haar unitary in a finite von Neumann algebra, q is a certain projection and they are free. The limit distribution coincides with the Brown measure of the operator quq.     

增长曲线模型中回归系数的广义根方估计

本文对增长曲线模型中的回归系数B提出了一种新的估计形式－广义根方估计的B（K），其中K＝diag(k1,k2,…，kp）并证明了通过广义根方偏参数ki(i=1,2,…，p）的适当选取可使得该估计在均方误差矩阵的意义下优于已有的LS估计和根方估计，及广义根方估计是可容许估计，本文还给出了选取广义根方偏参数的两种方法，算法及一个应用实例。     

加速牛顿迭代收敛的新方法

提出了加速牛顿迭代收敛的新思想，构造出一类加权牛顿迭代格式，通过选取最优加权因子，使得该格式具有高阶收敛性和较小的渐近误差常数。     

Generalized binomial and negative binomial distributions of order<Emphasis Type="Italic">k</Emphasis> by the<Emphasis Type="Italic">l</Emphasis>-overlapping enumeration scheme

In this paper, we investigate the exact distribution of the waiting time for ther-th ℓ-overlapping occurrence of success-runs of a specified length in a sequence of two state Markov dependent trials. The probability generating functions are derived explicitly, and as asymptotic results, relationships of a negative binomial distribution of orderk and an extended Poisson distribution of orderk are discussed. We provide further insights into the run-related problems from the viewpoint of the ℓ-overlapping enumeration scheme. We also study the exact distribution of the number of ℓ-overlapping occurrences of success-runs in a fixed number of trials and derive the probability generating functions. The present work extends several properties of distributions of orderk and leads us a new type of geneses of the discrete distributions.     

UPWIND FINITE VOLUME SCHEMES FOR SEMICONDUCTOR DEVICE

The mathematical model of semiconductor devices is described by the initial boundary value problem of a system of three nonlinear partial differential equations. One equation in elliptic form is for the electrostatic potential; two equations of convection-dominated diffusion type are for the electron and hole concentrations. Finite volume element procedure are put forward for the electrostatic potential, while upwind     

离轴非球面轮廓测量导轨直线度误差补偿模型

由于研磨阶段非球面的面形误差将由几十微米收敛到几个微米,因此采用高重复精度的离散测量技术是决定误差收敛效率、影响加工进程的关键。在新一代数控光学加工中心(FSGJ Ⅱ)上,设计了双测头对非球面进行面形定量检测的轮廓测量机构。通过对测头运动导轨在x、z方向的直线精度的分析,建立了导轨直线度误差补偿模型,以较低的成本实现了较高的测量精度。     

Turbo码概率-代数联合解码算法

Turbo码采用修正的BAHL et al.算法实现解码.这是一种基于软值的概率迭代解码算法.本文在保持Turbo码迭代软解码算法优点的基础上,充分利用Turbo码编码器结构这一确知条件,结合代数解码原理,提出了一种Turbo码概率-代数联合解码算法.该算法结合了概率解码和代数解码的优点,又有效避免了误差传播的发生,使Turbo码的纠错性能在原经典算法的基础上得到进一步的提高.该算法不仅为降低Turbo码的比特误码率和误差地板值提供了一种新的研究途径,而且因其更好的纠错性能而具有十分明显的实用价值.仿真实验结果显示,在比特误码率(BER)为10^-3~10^-4时,与经典Turbo码解码算法相比,采用该算法能获得0.1dB左右的编码增益.