Perturbed recurrence relations II the general case

In this paper, we give some new explicit relations between two families of polynomials defined by recurrence relations of all order. These relations allow us to analyze, even in the Sobolev case, how some properties of a family of orthogonal polynomials are affected when the coefficients of the recurrence relation and the order are perturbed. In a paper we have already given a method which allows us to study the polynomials defined by a three-term recurrence relation. Also here some generalizations are given.     

Blow Up of Solutions to Semilinear Wave Equations with Critical Exponent in High Dimensions

In this paper, the author considers the Cauchy problem for semilinear wave equations with critical exponent in n≥4 space dimensions. Under some positivity conditions on the initial data, it is proved that there can be no global solutions no matter how small the initial data are.     

双对数模型对模型模拟误差的放缩问题探讨

对双对数模型lg Y=a0+a1lg X1+a2lg X2+…+anlg Xn与其对应的指数模型y=c0xa11xa22…xann的模拟相对误差的关系进行了探讨,指出双对数模型具有放大和缩小指数模型相对误差的特性.对二者的关系进行了理论推导和实例验证,并给出了二者的定量关系式.     

N-Widths and Average Widths of Besov Classes in Sobolev Spaces

In this paper, we consider the n-widths and average widths of Besov classes in the usual Sobolev spaces. The weak asymptotic results concerning the Kolmogorov n-widths, the linear n-widths, the Gel＇fand n-widths, in the Sobolev spaces on T^d, and the infinite-dimensional widths and the average widths in the Sobolev spaces on Ra are obtained, respectively.     

Nonlinear Schrödinger equations with symmetric multi-polar potentials

This paper deals with a class of nonlinear elliptic equations involving a critical power-nonlinearity as well as a potential featuring multiple inverse square singularities. When the poles form a symmetric structure, it is natural we wonder how the symmetry affects such mutual interaction. The present paper means to study this aspect from the point of view of the existence of solutions inheriting the same symmetry properties as the set of singularities. Mathematics Subject Classification (2000) 35J60, 35J20, 35B33     

Chaotic oscillations and noise transformations in a simple dissipative system with delayed feedback

We analyze the statistical behavior of signals in nonlinear circuits with delayed feedback in the presence of external Markovian noise. For the special class of circuits with intense phase mixing we develop an approach for the computation of the probability distributions and multitime correlation functions based on the random phase approximation. Both Gaussian and Kubo-Andersen models of external noise statistics are analyzed and the existence of the stationary (asymptotic) random process in the long-time limit is shown. We demonstrate that a nonlinear system with chaotic behavior becomes a noise amplifier with specific statistical transformation properties.     

一个新的四维混沌系统理论分析与电路实现

分析了一个新的复杂的四维混沌系统的基本特性，该系统每个方程中包含一个三次交叉乘积项，共有9个平衡点，它们相对于原点和坐标轴具有完美的对称性，并且相对于线性特性和不变流形具有很好的相似性.描述了两个同时共存的对称双翼吸引子.最后，设计了一个模拟电路来实现这个新的四维混沌系统，表明数值仿真和电路实现具有很好的一致性，同时说明在应用上由于频率不同导致的仿真与物理实现之间的重要区别. 关键词： 四维混沌系统 Lyapunov 指数 共存双翼吸引子 电路实现     

An expansion in the exponent for compound binomial approximations

The purpose of this paper is two-fold. First, we introduce a new asymptotic expansion in the exponent for the compound binomial approximation of the generalized Poisson binomial distribution. The dependence of its accuracy on the symmetry and shifting of distributions is investigated. Second, for compound binomial and compound Poisson distributions, we present new smoothness estimates, some of which contain explicit constants. Finally, the ideas used in this paper enable us to prove new precise bounds in the compound Poisson approximation. Published in Lietuvos Matematikos Rinkinys, Vol. 46, No. 1, pp. 67–110, January–March, 2006.     

Solutions in Sobolev spaces of vector refinement equations with a general dilation matrix

In this paper, we present a necessary and sufficient condition for the existence of solutions in a Sobolev space W_p^k(ℝ^s) (1≤p≤∞) to a vector refinement equation with a general dilation matrix. The criterion is constructive and can be implemented. Rate of convergence of vector cascade algorithms in a Sobolev space W_p^k(ℝ^s) will be investigated. When the dilation matrix is isotropic, a characterization will be given for the L_p (1≤p≤∞) critical smoothness exponent of a refinable function vector without the assumption of stability on the refinable function vector. As a consequence, we show that if a compactly supported function vector φ∈L_p(ℝ^s) (φ∈C(ℝ^s) when p=∞) satisfies a refinement equation with a finitely supported matrix mask, then all the components of φ must belong to a Lipschitz space Lip(ν,L_p(ℝ^s)) for some ν>0. This paper generalizes the results in R.Q. Jia, K.S. Lau and D.X. Zhou (J. Fourier Anal. Appl. 7 (2001) 143–167) in the univariate setting to the multivariate setting. Dedicated to Professor Charles A. Micchelli on the occasion of his 60th birthday Mathematics subject classifications (2000) 42C20, 41A25, 39B12. Research was supported in part by the Natural Sciences and Engineering Research Council of Canada (NSERC Canada) under Grant G121210654.     

On the complexity of suboptimal decoding for list and decision feedback schemes

We consider bounded distance list decoding, such that the decoder calculates the list of all codewords within a sphere around the received vector. We analyze the performance and the complexity of this suboptimum list decoding scheme for the binary symmetric channel. The reliability function of the list decoding scheme is equivalent to the sphere-packing bound, where the decoding complexity is asymptotically bounded by 2^nR(1-R). Furthermore, we investigate a decision feedback strategy that is based on bounded distance list decoding. Here, any output with zero or many codewords will call for a repeated transmission. In this case the decoding complexity will be of the order 2^nR(1-C), where C denotes the channel capacity. The reliability function is close to Forney's feedback exponent.