随机参数Duffing系统中的随机混沌及其延迟反馈控制

研究了谐和激励下含有界随机参数Duffing系统(简称随机Duffing系统)中的随机混沌及其延迟反馈控制问题.借助Gegenbauer多项式逼近理论，将随机Duffing系统转化为与其等效的确定性非线性系统.这样，随机Duffing系统在谐和激励下的混沌响应及其控制问题就可借等效的确定性非线性系统来研究.分析阐明了随机混沌的主要特点，并采用Wolf算法计算等效确定性非线性系统的最大Lyapunov指数，以判别随机Duffing系统的动力学行为.数值计算表明，恰当选取不同的反馈强度和延迟时间，可分别达到抑制或诱发系统混沌的目的，说明延迟反馈技术对随机混沌控制也是十分有效的. 关键词： 随机Duffing系统 延迟反馈控制 随机混沌 Gegenbauer多项式     

Soluble models for dynamics driven by a super-diffusive noise

We explicitly discuss scalar Langevin type of equations where the deterministic part is linear, but where the integrated noise source is a non-linear diffusion process exhibiting superdiffusive behavior. We calculate transient and stationary probabilities and study the possibility of noise induced transitions from a unimodal to a bimodal probability shape. Illustrations from finance and dynamical systems are given.     

On the Equivalence of Multiparameter Gaussian Processes

Our purpose is to characterize the multiparameter Gaussian processes, that is Gaussian sheets, that are equivalent in law to the Brownian sheet and to the fractional Brownian sheet. We survey multiparameter analogues of the Hitsuda, Girsanov and Shepp representations. As an application, we study a special type of stochastic equation with linear noise.      

Design of recursive least-squares fixed-lag smoother using covariance information in linear continuous stochastic systems

This paper newly designs the recursive least-squares (RLS) fixed-lag smoother and filter using the covariance information in linear continuous-time stochastic systems. It is assumed that the signal is observed with additive white observation noise and the signal is uncorrelated with the observation noise. The estimators require the covariance information of the signal and the variance of the observation noise. The auto-covariance function of the signal is expressed in the semi-degenerate kernel form.     

Maximal Lyapunov exponent and rotation numbers for two coupled oscillators driven by real noise

Asymptotic expansions for the exponential growth rate, known as the Lyapunov exponent, and rotation numbers for two coupled oscillators driven by real noise are constructed. Such systems arise naturally in the investigation of the stability of steady-state motions of nonlinear dynamical systems and in parametrically excited linear mechanical systems. Almost-sure stability or instability of dynamical systems depends on the sign of the maximal Lyapunov exponent. Stability conditions are obtained under various assumptions on the infinitesimal generator associated with real noise provided that the natural frequencies are noncommensurable. The results presented here for the case of the infinitesimal generator having a simple zero eigenvalue agree with recent results obtained by stochastic averaging, where approximate ItÔ equations in amplitudes and phases are obtained in the sense of weak convergence.Dedicated to Thomas K. Caughey on the occasion of his 65th birthday.     

Designing a majorization scheme for the recourse function in two-stage stochastic linear programming

We discuss issues pertaining to the domination from above of the second-stage recourse function of a stochastic linear program and we present a scheme to majorize this function using a simpler sublinear function. This majorization is constructed using special geometrical attributes of the recourse function. The result is a proper, simplicial function with a simple characterization which is well-suited for calculations of its expectation as required in the computation of stochastic programs. Experiments indicate that the majorizing function is well-behaved and stable.     

Discrete storage processes and their Poisson flow and fluid flow approximations

Consider discrete storage processes that are modulated by environmental processes. Environmental processes cause interruptions in the input and/or output processes of the discrete storage processes. Due to the difficulties encountered in the exact analysis of such discrete storage systems, often Poisson flow and/or fluid flow models with the same modulating environmental processes are proposed as approximations for these systems. The analysis of Poisson flow and fluid flow models is much easier than that of the discrete storage processes. In this paper we give sufficient conditions under which the content of the discrete storage processes can be bounded by the Poisson flow and the fluid flow models. For example, we show that Poisson flow models and the fluid flow models developed by Kosten (and by Anick, Mitra and Sondhi) can be used to bound the performance of infinite (finite) source packetized voice/data communication systems. We also show that a Poisson flow model and the fluid flow model developed by Mitra can be used to bound the buffer content of a two stage automatic transfer line. The potential use of the bounding techniques presented in this paper, of course, transcends well beyond these examples.Supported in part by NSF grant DMS-9308149.     

Symmetric form of the Hudson-Parthasarathy stochastic equation

We prove that the Hudson-Parthasarathy equation corresponds, up to unitary equivalence, to the strong resolvent limit of Schrödinger Hamiltonians in Fock space and that the symmetric form of this equation corresponds to the weak limit of the Schrödinger Hamiltonians.Translated fromMatematicheskie Zametki, Vol. 60, No. 5, pp. 726–750, November, 1996.     

Proof of the Mixing Theorem for Statistical Systems in Classical Physics

In a general measure-theoretic context, it is proved that the action of a stochastic map on a pair of probability distributions can be characterized by the criterion of decreasing mixing distance.     

Relationships between characteristics in periodic Poisson queues

We study single server periodic queues in the day equilibrium conditions. The following characteristics of interest are considered at time of dayt: V^p(t)-the work load, L^p(t)-the number of customers and u^p(t)-the departure rate. We give relationships between E[V^p(t)], E[L^p(t)] and u^p(t). We also prove that E[V^p(t)] < and E[L^p(t)] < provided the second moment of the service time is finite.