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.

     

On quasi-solution to infeasible linear complementarity problem obtained by Lemke’s method

For a linear complementarity problem with inconsistent system of constraints a notion of quasi-solution of Tschebyshev type is introduced. It’s shown that this solution can be obtained automatically by Lemke’s method if the constraint matrix of the original problem is copositive plus or belongs to the intersection of matrix classes P ₀ and Q ₀.     

On the advantage over a random assignment

We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful measure for optimization problems where the random assignment algorithm is known to give essentially the best possible polynomial time approximation. In this paper, we focus on this measure for the optimization problems Max‐Lin‐2 in which we need to maximize the number of satisfied linear equations in a system of linear equations modulo 2, and Max‐k‐Lin‐2, a special case of the above problem in which each equation has at most k variables. The main techniques we use, in our approximation algorithms and inapproximability results for this measure, are from Fourier analysis and derandomization. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

一般线性模型下方差最小范数二次无偏估计的稳健性

本文给出了一般线性模型下,由最小二乘得到的方差估计与最小范数二次无偏估计相等的充分必要条件,并且当Gauss-Markov估计与最小二乘估计相等时,可以得到一个简单的等价条件。     

广义线性模型(六)

本讲座是广义线性模型这个题目的一个比较系统的介绍。主要分 3部分 :建模、统计分析与模型选择和诊断。写作时依据的主要参考资料是L .Fahrmeir等人的 :《MultivariateStatisticalModel ingBasedonGeneralizedLinearModles》。     

基于新型长周期光纤光栅的掺铒光纤放大器

报道了基于高频CO₂激光脉冲写入的新型长周期光纤光栅的低噪音掺铒光纤放大器,这种新型长周期光纤光栅是用大约几千Hz的高频CO₂激光脉冲对光纤玻璃热冲击作用而形成的.在铒纤中插入一个长周期光纤光栅,会明显减少掺铒光纤放大器的放大自发辐射(ASE)噪音.报道了两种低噪音掺铒光纤放大器,作为前置放大器和线路放大器,它们的ASE噪音指数分别从4.0 dB减少到3.5 dB和从4.8 dB减少到4.3 dB,并且在作为线放时,其小信号增益从30 dB提高到37 dB,降噪及提高增益效应十分显著.     

Controlling the gain shape of Er^3＋—doped fluorozirconate fibre amplifier by a coherent field

We proposed a four-level system to explore the quantum interference effects on optical amplification.We found that the gain of the probe.including positions and values of gain peaks,can be adjusted by changing the coherent field and the incoherent pumping.At the same time,we can also modify the absorption profile of electromagnetically induced transparency by the incoherent pump.The results provide a method to flatten the gain of Erbium-doped fibre amplifiers.     

基于改进的语音参数提取的线性预测

根据语音发生基本原理和线性预测编码原理，针对自相关法需要加窗从而降低了解的精度，而协方差法不能保证保证解所重构出系统的稳定性的特点，提出了一种改进的Cholesky分解的方法求解协方差方程组以产生声道模型参数的方法，实践证明，这种方法既保证了系统的稳定性，又提高了解的精度。     

线性分组码的神经网络译码

介绍了神经网络与线性分组码之间的关系，并在文献[1]的基础上证明了软判决译码与求解能量函数最大值之间的等价性，然后以(7，4，3)汉明码为例介绍了神经网络在循环码硬判决、软判决译码中的应用。     

基于CCD的激光微位移测量系统研究

介绍了一种基于多普勒效应的可进行动态微位移测量的激光微位移测量系统。该系统以He-Ne激光器为光源,配以干涉系统移动方向判别及分频系统、CCD视频信号的高速动态采集系统、微机处理系统及干涉图处理软件包等。与传统测量方法相比,其精度、灵敏度及稳定性都有较大提高,并实现了微位移的全自动测量。