具有非线性扰动的中立型系统的时滞相关稳定性

本研究了具有非线性扰动的中立型系统鲁棒稳定的时滞相关准则。基于LMI方法，并利用S—过程获得了依赖于时滞的鲁棒稳定性准则，所得结果优于已有结论。最后给出一个实例说明本方法的有效性。     

On <Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">1</Emphasis></Superscript>-summability and asymptotic profiles for smooth solutions to Navier–Stokes equations in a 3D exterior domain

The exterior nonstationary problem is studied for the 3D Navier-Stokes equations. The L ¹ -summability is proved for smooth solutions which correspond to initial data satisfying certain symmetry and moment conditions. The result is then applied to show that such solutions decay in time more rapidly than observed in general. Furthermore, an asymptotic expansion is deduced and a lower bound estimate is given for the rates of decay in time. Mathematics Subject Classifications (1991): 35Q30, 76D05.On leave of absence from Institute of Applied Mathematics, Academy of Mathematics and System Sciences. Academia Sinica, Beijing 100080, Peoples Republic of China. Supported by JSPS     

Near-Optimal Controls of Discrete-Time Dynamic Systems Driven by Singularly-Perturbed Markov Chains

This work is devoted to near-optimal controls of large-scale discrete-time nonlinear dynamic systems driven by Markov chains; the underlying problem is to minimize an expected cost function. Our main goal is to reduce the complexity of the underlying systems. To achieve this goal, discrete-time control models under singularly-perturbed Markov chains are introduced. Using a relaxed control representation, our effort is devoted to finding near-optimal controls. Lumping the states in each irreducible class into a single state gives rise to a limit system. Applying near-optimal controls of the limit system to the original system, near-optimal controls of the original system are derived.     

Partially Strictly Monotone and Nonlinear Penalty Functions for Constrained Mathematical Programs

We introduce the concept of partially strictly monotone functions and apply it to construct a class of nonlinear penalty functions for a constrained optimization problem. This class of nonlinear penalty functions includes some (nonlinear) penalty functions currently used in the literature as special cases. Assuming that the perturbation function is lower semi-continuous, we prove that the sequence of optimal values of nonlinear penalty problems converges to that of the original constrained optimization problem. First-order and second-order necessary optimality conditions of nonlinear penalty problems are derived by converting the optimality of penalty problems into that of a smooth constrained vector optimization problem. This approach allows for a concise derivation of optimality conditions of nonlinear penalty problems. Finally, we prove that each limit point of the second-order stationary points of the nonlinear penalty problems is a second-order stationary point of the original constrained optimization problem.     

Trees with Cantor Eigenvalue Distribution

We study a family of trees with degree k at all interior nodes and degree 1 at boundary nodes. The eigenvalues of the adjacency matrix have high multiplicities. As the trees grow, the graphs of those eigenvalues approach a piecewise-constant "Cantor function." For each value of     , we will find the fraction of the eigenvalues that are given by     .     

Approximation of multi-scale elliptic problems using patches of finite elements

In this paper we present a method to solve numerically elliptic problems with multi-scale data using multiple levels of not necessarily nested grids. The method consists in calculating successive corrections to the solution in patches whose discretizations are not necessarily conforming. It resembles the FAC method (see Math. Comp. 46 (174) (1986) 439–456) and its convergence is obtained by a domain decomposition technique (see Math. Comp. 57 (195) (1991) 1–21). However it is of much more flexible use in comparison to the latter. To cite this article: R. Glowinski et al., C. R. Acad. Sci. Paris, Ser. I 337 (2003).     

An Epidemic Model with a Time Delay in Transmission

We study a mathematical model which was originally suggested by Greenhalgh and Das and takes into account the delay in the recruitment of infected persons. The stability of the equilibria are also discussed. In addition, we show that the introduction of a time delay in the transmission term can destabilize the system and periodic solutions can arise by Hopf bifurcation.     

Compactly Supported Tight Affine Frames with Integer Dilations and Maximum Vanishing Moments

When a cardinal B-spline of order greater than 1 is used as the scaling function to generate a multiresolution approximation of L ²=L ²(R) with dilation integer factor M2, the standard matrix extension approach for constructing compactly supported tight frames has the limitation that at least one of the tight frame generators does not annihilate any polynomial except the constant. The notion of vanishing moment recovery (VMR) was introduced in our earlier work (and independently by Daubechies et al.) for dilation M=2 to increase the order of vanishing moments. This present paper extends the tight frame results in the above mentioned papers from dilation M=2 to arbitrary integer M2 for any compactly supported M-dilation scaling functions. It is shown, in particular, that M compactly supported tight frame generators suffice, but not M–1 in general. A complete characterization of the M-dilation polynomial symbol is derived for the existence of M–1 such frame generators. Linear spline examples are given for M=3,4 to demonstrate our constructive approach.     

Stability Conditions of the MMAP [ K ]/ G [ K ]/1/ LCFS Preemptive Repeat Queue

In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically.     

Existence for nonoscillatory solutions of higher-order nonlinear neutral difference equations

In this paper, we consider the following forced higher-order nonlinear neutral difference equation