Instability analysis of saddle points by a local minimax method

The objective of this work is to develop some tools for local instability analysis of multiple critical points, which can be computationally carried out. The Morse index can be used to measure local instability of a nondegenerate saddle point. However, it is very expensive to compute numerically and is ineffective for degenerate critical points. A local (weak) linking index can also be defined to measure local instability of a (degenerate) saddle point. But it is still too difficult to compute. In this paper, a local instability index, called a local minimax index, is defined by using a local minimax method. This new instability index is known beforehand and can help in finding a saddle point numerically. Relations between the local minimax index and other local instability indices are established. Those relations also provide ways to numerically compute the Morse, local linking indices. In particular, the local minimax index can be used to define a local instability index of a saddle point relative to a reference (trivial) critical point even in a Banach space while others failed to do so.

     

The rate of convergence for the cyclic projections algorithm III: Regularity of convex sets

The cyclic projections algorithm is an important method for determining a point in the intersection of a finite number of closed convex sets in a Hilbert space. That is, for determining a solution to the “convex feasibility” problem. This is the third paper in a series on a study of the rate of convergence for the cyclic projections algorithm. In the first of these papers, we showed that the rate could be described in terms of the “angles” between the convex sets involved. In the second, we showed that these angles often had a more tractable formulation in terms of the “norm” of the product of the (nonlinear) metric projections onto related convex sets.In this paper, we show that the rate of convergence of the cyclic projections algorithm is also intimately related to the “linear regularity property” of Bauschke and Borwein, the “normal property” of Jameson (as well as Bakan, Deutsch, and Li’s generalization of Jameson’s normal property), the “strong conical hull intersection property” of Deutsch, Li, and Ward, and the rate of convergence of iterated parallel projections. Such properties have already been shown to be important in various other contexts as well.     

A-Statistical extension of the Korovkin type approximation theorem

In this paper, using the concept ofA-statistical convergence which is a regular (non-matrix) summability method, we obtain a general Korovkin type approximation theorem which concerns the problem of approximating a functionf by means of a sequenceL _n f of positive linear operators.     

带阻尼项一维非等熵流方程组初边值问题解的收敛速度

研究了带阻尼项一维非等熵流方程组的初边值问题，利用能量估计的办法证明了整体解的存在性和得到在L2－模及L∞－模意义下解的大时间状态稳定性估计。     

Modeling the failure of an adhesive layer in a peel test

The failure of an adhesive layer in a 180° peel test is analyzed by the modeling of the peel as an elastica. The adhesive is assumed to fail by a process of cavitation and fibrillation. The resistance of the fibrillated material to deformation gives rise to a rate‐dependent peel force F. Governing equations, which take into account the large deformation of the fibrillated materials, are derived. Numerical solutions are obtained for the special case of a linear, viscous adhesive. Assuming a critical strain failure criterion for the fibrils, we show that the peel rate is inversely proportional to the square root of the adhesive thickness and directly proportional to F^3/4. The connection between the peel test and the tack test is also discussed. The maximum traction on the peel arm is found to be directly proportional to the peel force and inversely proportional to the adhesive thickness. © 2002 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 40: 2277–2291, 2002     

A successive quadratic programming algorithm with global and superlinear convergence properties

This paper presents a successive quadratic programming algorithm for solving general nonlinear programming problems. In order to avoid the Maratos effect, direction-finding subproblems are derived by modifying the second-order approximations to both objective and constraint functions of the problem. We prove that the algorithm possesses global and superlinear convergence properties.This work was supported in part by a Scientific Research Grant-in-Aid from the Ministry of Education, Science and Culture, Japan.     

On new third-order convergent iterative formulas

In this paper, we present new iteration methods with cubic convergence for solving nonlinear equations. The main advantage of the new methods are free from second derivatives and it permit that the first derivative is zero in some points. Analysis of efficiency shows that the new methods can compete with Newton’s method and the classical third-order methods. Numerical results indicate that the new methods are effective and have definite practical utility.      

Consistency of change point estimators for symmetrical stable distribution with parameters shift

Assume that the characteristic indexαof stable distribution satisfies 1<α<2,and that the distribution is symmetrical about its mean.We consider the change point estimators for stable distribution withαor scale parameterβshift.For the one case that mean is a known constant,ifαorβchanges,then density function will change too.To this end,we suppose the kernel estimation for a change point.For the other case that mean is an unknown constant,we suppose to apply empirical characteristic function to estimate the change-point location.In the two cases,we consider the consistency and strong convergence rate of estimators.Furthermore,we consider the mean shift case.If mean changes,then corresponding characteristic function will change too.To this end,we also apply empirical characteristic function to estimate change point.We obtain the similar convergence rate.Finally,we consider its application on the detection of mean shift in financial market.     

On Approximation Methods Generated by Bochner-Riesz Kernels

Means and families of operators generated by Bochner-Riesz kernels are studied. Some sharp results on their convergence are achieved. The equivalence of the approximation errors of these methods to smoothness quantities related to the Laplacian is proved.      

Measurement of excitation spectra for highly ionized sulphur

The excitation spectra in the wavelength range of 19—40 nm for highly ionized sulphur ions were measured by using the beam-foil method at the Heavy lon Research Facility in Lanzhou. In this experiment, more than 30 spectral lines were observed, which belonged to the transitions of the excitation energy levels for highly ionized SX—SXV ions, and 5 new lines were determined. The experimental results were compared with those from other experiments and theoretical calculations.