一类广义耦合的非线性波动方程组时间周期解的存在性

研究了一类广义耦合的非线性波动方程组关于时间周期解的问题．首先利用Galerkin方法构造近似时间周期解序列，然后利用先验估计和Laray—Schauder不动点原理，证明近似时间周期解序列的收敛性，从而得到该问题时间周期解的存在性。     

周期裂纹削弱的无限长板条的应力分析

作出了周期裂纹削弱的无限长板条的应力分析．假设这些裂纹均在水平位置，又板条承受y疗向的拉伸力p．此时边值问题归结为一个复杂混合边值问题．发现，对此问题言，特征展开变分原理方法(eigenfunctionexpmlsion、，ariationalmethod，简称为EEVM)是非常有效的．研究了裂纹端的应力强度因子和T-应力．从拉伸力作用下的弹性变形考虑，开裂板条可等价于一不开裂的正交异性板条．还分析了等价正交异性板条的弹性性质．最后给出了算例和数值结果．     

一类非线性泛函微分系统的概周期解

结合应用指数型二分性原理和Schaefer定理,考虑了一类完全非线性泛函微分方程概周期解的存在性问题,改善和推广了已有的结果.并将获得的结果推广到周期系统,获得了一些新的结果.     

一类n维中立型泛函微分方程的周期解

通过对NFDE周期系统；周期解的讨论，给出了其周期解界的估计式，结合不动点原理研究了下列系统：周期解的存在性，唯一性等问题，得到一些新的结果．     

常微分方程周期脉冲控制问题的均方turnpike性质

本文研究了一类常微分方程的最优控制问题,其中控制以脉冲的形式周期地施加到系统中.首先,给出了该问题及其参考控制问题的最大值原理.其次,在控制系统能控的假设条件下,证明了系统的能观性不等式.最后,利用最大值原理以及能观性不等式,获得了两个最优控制问题的最优状态和最优控制在时间足够长时的收敛关系—均方turnpike性质.     

线性连续衰退记忆系统的可分性

为逼近建模和辨识问题的需要,讨论线性时变连续有界输入有界输出稳定衰退记忆系统的不同子类．从衰退记忆系统的子类包括概周期系统,渐近周期系统,渐近强周期系统,找到了LTV系统的可分子空间即渐近强周期系统．     

一类高阶常微分方程的共振周期解的存在唯一性

利用min-max原理的非变分形式给出了一系列有关高阶常微分方程共振周期解的存在唯一性结论．     

一类多偏差变元的二阶微分方程周期解问题

作者利用重合度原理研究了一类多偏差变元的二阶微分方程■周期解问题.得到了有关周期解存在性的新的结果     

泛函微分方程的全局稳定周期解

本文综合运用相空间理论，泛函分析方法和李雅普诺夫第二方法，研究具无限时滞的泛函微分方程周期解的存在性，唯一性和稳定性问题，得到了新的结果．     

具有快速振荡外力的拟地转运动的平均原理

一类大尺度的地球物理流体流可以用拟地转方程来描述．有限、但是大时间区间和整个时间轴上在快速振荡外力下的拟地转运动的平均原理被得到了．其中包括比较估计，稳定性估计和拟地转运动及其平均运动之间的收敛性．进一步，几乎周期拟地转运动的存在性和吸引子的收敛性也被得到了．     

Dynamic frictionless contact with adhesion

A model for the dynamic, adhesive, frictionless contact between a viscoelastic body and a deformable foundation is described. The adhesion process is modeled by a bonding field on the contact surface. The contact is described by a modified normal compliance condition. The tangential shear due to the bonding field is included. The problem is formulated as a coupled system of a variational equality for the displacements and a differential equation for the bonding field. The existence of a unique weak solution for the problem is established, together with a partial regularity result. The existence proof proceeds by construction of an appropriate mapping which is shown to be a contraction on a Hilbert space.     

Matrix correction of a dual pair of improper linear programming problems

A matrix is sought that solves a given dual pair of systems of linear algebraic equations. Necessary and sufficient conditions for the existence of solutions to this problem are obtained, and the form of the solutions is found. The form of the solution with the minimal Euclidean norm is indicated. Conditions for this solution to be a rank one matrix are examined. On the basis of these results, an analysis is performed for the following two problems: modifying the coefficient matrix for a dual pair of linear programs (which can be improper) to ensure the existence of given solutions for these programs, and modifying the coefficient matrix for a dual pair of improper linear programs to minimize its Euclidean norm. Necessary and sufficient conditions for the solvability of the first problem are given, and the form of its solutions is described. For the second problem, a method for the reduction to a nonlinear constrained minimization problem is indicated, necessary conditions for the existence of solutions are found, and the form of solutions is described. Numerical results are presented.     

A necessary and sufficient condition for Pareto-optimal security strategies in multicriteria matrix games

In this paper, a scalar game is derived from a zero-sum multicriteria matrix game, and it is proved that the solution of the new game with strictly positive scalarization is a necessary and sufficient condition for a strategy to be a Pareto-optimal security strategy (POSS) for one of the players in the original game. This is done by proving that a certain set, which is the extension of the set of security level vectors in the criterion function space, is convex and polyhedral. It is also established that only a finite number of scalarizations are necessary to obtain all the POSS for a player. An example is included to illustrate the main steps in the proof.This work was done while the author was a Research Associate in the Department of Electrical Engineering at the Indian Institute of Science and was financially supported by the Council of Scientific and Industrial Research, Delhi, India.The author wishes to express his gratefulness to Professor U. R. Prasad for helpful discussions and to two anonymous referees for suggestions which led to an improved presentation.     

Suboptimal feedback control of linear periodic systems

A method is developed for the approximate design of an optimal state regulator for a linear periodically varying system with quadratic performance index. The periodic term is taken to be a perturbation to the system. By making use of a power-series expansion in a small parameter, associated with periodic terms, a set of matrix equations is derived for determining successively a feedback gain. Given periodic terms of a Fourier-series form, explicit solutions are obtained for those matrix equations. A sufficient condition for existence and periodicity of the solution is also shown. Further, the performance degradation resulting from a truncation of the power-series solution is investigated. The method may effectively be used in a computer-programmed computation.     

A minimal set-valued strong derivative for vector-valued Lipschitz functions

A set-valued derivative for a function at a point is a set of linear transformations whichapproximates the function near the point. This is stated precisely, and it is shown that, in general, there is not a unique minimal set-valued derivative for functions in the family of closed convex sets of linear transformations. For Lipschitz functions, a construction is given for a specific set-valued derivative, which reduces to the usual derivative when the function is strongly differentiable, and which is shown to be the unique minimal set-valued derivative within a certain subfamily of the family of closed convex sets of linear transformations. It is shown that this constructed set may be larger than Clarke's and Pourciau's set-valued derivatives, but that no irregularity is introduced.The author would like to thank Professor H. Halkin for numerous discussions of the material contained here.     

The Compromise Value for Cooperative Games with Random Payoffs

This paper introduces and studies the compromise value for cooperative games with random payoffs, that is, for cooperative games where the payoff to a coalition of players is a random variable. This value is a compromise between utopia payoffs and minimal rights and its definition is based on the compromise value for NTU games and the τ-value for TU games. It is shown that the nonempty core of a cooperative game with random payoffs is bounded by the utopia payoffs and the minimal rights. Consequently, for such games the compromise value exists. Further, we show that the compromise value of a cooperative game with random payoffs coincides with the τ-value of a related TU game if the players have a certain type of preferences. Finally, the compromise value and the marginal value, which is defined as the average of the marginal vectors, coincide on the class of two-person games. This results in a characterization of the compromise value for two-person games.I thank Peter Borm, Ruud Hendrickx and two anonymous referees for their valuable comments.     

General Approach to Integrating Invertible Dynamical Systems Defined by Transformations from the Cremona group Cr(P k n ) of Birational Transformations

A general approach is developed for integrating an invertible dynamical system defined by the composition of two involutions, i.e., a nonlinear one which is a standard Cremona transformation, and a linear one. By the Noether theorem, the integration of these systems is the foundation for integrating a broad class of Cremona dynamical systems. We obtain a functional equation for invariant homogeneous polynomials and sufficient conditions for the algebraic integrability of the systems under consideration. It is proved that Siegel's linearization theorem is applicable if the eigenvalues of the map at a fixed point are algebraic numbers.     

Stackelberg–Nash exact controllability for the Kuramoto–Sivashinsky equation

This paper deals with a hierarchical control problem for the Kuramoto–Sivashinsky equation following a Stackelberg–Nash strategy. We assume that there is a main control, called the leader, and two secondary controls, called the followers. The leader tries to drive the solution to a prescribed target and the followers intend to be a Nash equilibrium for given functionals. It is known that this problem is equivalent to a null controllability result for an optimality system consisting of three non-linear equations. One of the novelties is a new Carleman estimate for a fourth-order equation with right-hand sides in Sobolev spaces of negative order, which allows to relax some geometric conditions for the observation sets for the followers.     

Stability analysis of set trajectories for families of impulsive equations

In this paper, for a family of impulsive equations, a heterogeneous matrix-valued Lyapunov-like function is considered, the comparison principle is formulated, and stability conditions for the set of stationary solutions are established. In addition, for a class of impulsive equations with uncertain parameters the monotone iterative technique for constructing a set of solutions is adapted.     

CONSERVATION OF THREE—POINT COMPACT SCHEMES ON SINGLE AND MULTIBLOCK PATCHED GRIDS FOR HYPERBOLIC PROBLEMS

For nonlinear hyperbloic problems,Conservation of the numerical scheme is important for convergence to the correct weak solutions.In this paper the the conservation of the well-known compact scheme up to fourth order of accuracy on a single and uniform grid is studied,and a conservative interface treatment is derived for compact schemes on patched grids .For a pure initial value problem,the compact scheme is shown to be equivalent to a scheme in the usual conservative form .For the case of a mixed initial boundary value problem,the compact scheme is conservative only if the rounding errors are small enough.For a pactched grid interface,a conservative interface condition useful for mesh fefiement and for parallel computation is derived and its order of local accuracy is analyzed.