Nonlinear Time Series Analysis Since 1990:Some Personal Reflections

Abstract I reflect upon the development of nonlinear time series analysis since 1990 by focusing on five majorareas of development. These areas include the interface between nonlinear time series analysis and chaos,thenonparametric/semiparametric approach,nonlinear state space modelling,financial time series and nonlinearmodelling of panels of time series.     

由氯化钠制硝酸钠的转化法研究

我国硝石矿很少,硝酸钠主要靠合成法生产,即用纯碱(或烧碱)溶液吸收硝酸“尾气”而得:     

Periodic decomposition of integer valued functions

We study those functions that can be written as a finite sum of periodic integer valued functions. On ℤ we give three different characterizations of these functions. For this we prove that the existence of a real valued periodic decomposition of a ℤ → ℤ function implies the existence of an integer valued periodic decomposition with the same periods. This result depends on the representation of the greatest common divisor of certain polynomials with integer coefficients as a linear combination of the given polynomials where the coefficients also belong to ℤ[x]. We give an example of an ℤ → {0, 1} function that has a bounded real valued periodic decomposition but does not have a bounded integer valued periodic decomposition with the same periods. It follows that the class of bounded ℤ → ℤ functions has the decomposition property as opposed to the class of bounded ℝ → ℤ functions. If the periods are pairwise commensurable or not prescribed, then we get more general results. Supported by OTKA grants T 43623 and K 61908.     

A parallel extended GCD algorithm

A new parallel extended GCD algorithm is proposed. It matches the best existing parallel integer GCD algorithms of Sorenson and Chor and Goldreich, since it can be achieved in O(n/logn) time using at most n¹⁺ processors on CRCW PRAM. Sorenson and Chor and Goldreich both use a modular approach which consider the least significant bits. By contrast, our algorithm only deals with the leading bits of the integers u and v, with uv. This approach is more suitable for extended GCD algorithms since the coefficients of the extended version a and b, such that au+bv=gcd(u,v), are deeply linked with the order of magnitude of the rational v/u and its continuants. Consequently, the computation of such coefficients is much easier.     

EF-4S型电子和场实验仪的改进

本简要分析了电子和场实验仪高压调节电路,并对该线路作了合理改进。     

New Lower Bounds for the Least Common Multiples of Arithmetic Progressions

Abstract For relatively prime positive integers u0 and r, and for 0 〈 k ≤ n, define uk ：= u0 ＋ kr. Let Ln ：= 1cm（u0,u1,... ,un） and let a,l≥2 be any integers. In this paper, the authors show that, for integers α≥ a, r ≥max（a,l - 1） and n ≥lατ, the following inequality holds Ln≥u0r^（l-1）α＋a-l（r＋1）^n.Particularly, letting l = 3 yields an improvement on the best previous lower bound on Ln obtained by Hong and Kominers in 2010.     

关于有限族Lipschitz映射多步Ishikawa迭代算法的收敛性及其应用

本文的目的是研究Lipschitz映射公共不动点问题.基于传统的Ishikawa迭代和Noor迭代方法,我们引入多步Ishikawa迭代算法,并且分别给出了该算法强收敛于有限族拟-Lipschitz映射和伪压缩映射公共不动点的充分必要条件.此外,我们证明了该算法强收敛到非扩张映射的公共不动点.作为应用,我们给出数值试验证实所得的结论.     

Weak convergence theorem for Lipschizian pseudocontraction semigroups in Banach spaces

The purpose of this paper is to study the weak convergence problems of the irnplicity iteration process for Lipschitzian pseudocontraction semigroups in general Banach spaces. The results presented in this paper extend and improve the corresponding results of Zhou [Nonlinear Anal., 68, 2977-2983 （2008）], Chen, et ah [J. Math. Anal. Appl., 314, 701 709 （2006）], Xu and Ori [Numer. Funct. Anal. Optim, 22, 767-773 （2001）] and Osilike [J. Math. Anal. Appl., 294, 73-81 （2004）]. Keywords     

矩阵多项式秩的和的恒等式及其应用

证明了矩阵A的两个多项式秩的和等于它们最大公因式与最小公倍式秩的和,这个结果不仅可以概括近期文献的相关工作,而且可以对应用矩阵多项式求逆矩阵的方法作进一步的研究,同时也可使关于矩阵秩恒等式的最新讨论获得一种简单统一的处理方法.     

非线性混合似变分不等式的扰动近似点-投影算法

In this paper we introduce a new perturbed proximal-projection algorithm for finding the common element of the set of fixed points of non-expansive mappings and the set of solutions of nonlinear mixed variational-like inequalities. The convergence criteria of the iterative sequences generated by the new iterative algorithm is also given. Our approach and results generalize many known results in this field.