Pattern Search Method for Discrete <Emphasis Type="Italic">L</Emphasis><Subscript>1</Subscript>–Approximation

We propose a pattern search method to solve a classical nonsmooth optimization problem. In a deep analogy with pattern search methods for linear constrained optimization, the set of search directions at each iteration is defined in such a way that it conforms to the local geometry of the set of points of nondifferentiability near the current iterate. This is crucial to ensure convergence. The approach presented here can be extended to wider classes of nonsmooth optimization problems. Numerical experiments seem to be encouraging. This work was supported by M.U.R.S.T., Rome, Italy.     

The combination technique and some generalisations

The combination technique has repeatedly been shown to be an effective tool for the approximation with sparse grid spaces. Little is known about the reasons of this effectiveness and in some cases the combination technique can even break down. It is known, however, that the combination technique produces an exact result in the case of a projection into a sparse grid space if the involved partial projections commute.

The performance of the combination technique is analysed using a projection framework and the C/S decomposition. Error bounds are given in terms of angles between the spanning subspaces or the projections onto these subspaces. Based on this analysis modified combination coefficients are derived which are optimal in a certain sense and which can substantially extend the applicability and performance of the combination technique.     

General synchronization dynamics of coupled Van der Pol–Duffing oscillators

This paper considers the general synchronization dynamics of coupled Van der Pol–Duffing oscillators. The linear and nonlinear stability analysis on the synchronization process is derived through the Whittaker method and the Floquet theory in addition to the multiple time scales method. A stability map displaying different dynamical states of the system is performed. Numerical simulation is carried out to support and to complement the accuracy of the analytical treatment.     

线性递归序列模q

设{u_k}_k≥0为一个线性递归序列．序列{u_k(mod q)}_(k≥0)是周期的,很多人都对其周期有过研究．本文应用二次数域中理想的理论,较完全地刻面了二次线性递归序列模q的周期长度,所获结果加强并推广了Engstrom及Wall的结论．     

一种改进的Fuzzy-HMMS算法及其收敛性

对D at T ran和M ichae lW agner等人提出的FCM-FE-HMM S算法作了进一步的补充和改进,提出了改进的FCM-FE-HMM S算法,并给出了算法收敛性分析,得出在给定初值的情况下该算法将收敛到一个局部最优解。     

Discrete approximation of integral operators

A method to approximate the eigenvalues of linear operators depending on an unknown distribution is introduced and applied to weighted sums of squared normally distributed random variables. This area of application includes the approximation of the asymptotic null distribution of certain degenerated U- and V-statistics.

     

Fractional-Linear Transformations of Operator Balls; Applications to Dynamical Systems

The operator sets, which are the subject of this paper, have been studied in many papers where, under different restrictions on the generating operators, convexity, compactness in the weak operator topology, and nonemptiness were proved for sets of different classes under study. Then the results obtained were used in these papers to solve several applied problems. Namely, they played the key role in establishing the dichotomy of nonautonomous dynamical systems, with either continuous or discrete time. In the present paper, we generalize and sharpen the already known criteria and obtain several new criteria for convexity, compactness, and nonemptiness of several special operator sets. Then, using the assertions obtained, we construct examples of sets of the form under study which are nonconvex, noncompact in the weak operator topology, as well as empty, and are generated by ＂smooth＂ operators of a special class. The existence problem for such sets remained open until the authors of this paper announced some of its results.     

An experiment with arithmetic precision in linear algebra computations

Several techniques for experimental determination of floating point precision in practical computations are examined, and applied to linear algebra algorithms. These techniques are simple enough to be directly applicable to existing production codes, requiring a very limited amount of software on many machines, and yet they yield interesting information on the numerical precision of a computation. Our choice of linear algebra algorithms includes a direct solver (namely the MA32 program from the Harwell Library) and several variants of preconditioned conjugate gradients (the methods DIAG, INV, MINV and POL of Reference 1). The results may be of interest as method selection criteria, and thus complement Mflop performance data available from several sources.     

有序分组资料的线性趋势检验的确切概率计算

有序分组资料的线性趋势检验主要用于检验几个二项总体反应率的线性趋势；在医学与生物学中最典型的用途是研究剂量和反应的关系． 如果用Ｚ检验来代替通常在本检验中所用的卡方检验，就可容易地导出本检验的确切概率计算方法，和其他２×Ｃ有序列联表有着相同的形式．本文给出了该检验的确切概率计算方法．     

截断情况下线性回归模型响应变量均值的经验似然

本文讨论了在带有截断情况的线性回归模型中 ,响应变量均值的估计问题 .将经验似然的方法应用到带有截断情况的回归模型中 ,在估计响应变量的均值时构造了调整的经验似然统计量 ,证明了在一定的条件下 ,该统计量渐近服从 χ2 分布 ,给出了均值的置信区间 ,并与正态下得到的结果进行了比较 ,模拟的结果说明了经验似然的优良性 .