环的投射自由性的研究

引进了两类新环,进而研究了其投射自由性,得到了群环上的模结构,推广了Quillen-Suslin定理.     

模糊集的凸的几点性质

引入了T_λ算子,基于此算子,对模糊集的凸和拟凸的一些性质进行了研究,得出了一些结论。对模糊集的凸和拟凸的概念进行了拓展,引入了半凸模糊集,半拟凸模糊集,研究了半凸模糊集和半拟凸模糊集的性质。     

自由群的直积的检验元素的注记

本文研究了自由群的直积的检验元素,通过对直积的自同态的分解,得到了直积中的元素为检验元素的充分必要条件,改进了O'neill和Turner的结果.此外,构造了两类具体的检验元素.     

基于GRA-DEA模型的有关农民收入的九城市的评价

有关农民收入,文章以山西省九个城市为例进行了评价.首先用灰色关联分析法分析了2016年这些城市的有关数据,筛选出影响农民收入的主要因素;其次构建了指标体系,利用数据包络分析法对有关农民收入九个城市进行了DEA有效性评价;再次对非DEA有效的城市,借助投影公式探索了改进方法;最后得出了九城市分为两类的结论,提出了针对性的建议.     

二阶非线性微分方程的零解的全局稳定的充要条件

由于自动控制理论提出了二阶微分方程的零解的全局稳定性,引起了不少数学工作者的研究,H.H.研究了方程组(1,1),得到了零解为全局稳定的充分条件,本文采用定性方法,研究了方程组(1,1)的零解为全局稳定的必要条件,并削弱了[1]中的充分条件,从而得到方程组(1,1)的零解为全局稳定的充要条件(定理 3——5).同时还研究了方程组(2,1)的零解为全局稳定的充要条件(定理6).     

幂格与商格的关系的注记

研究了分配格上的幂格,给出了格的相对凸子格的概念,得到了分配格上的幂格的一个充要条件,建立了幂格与商格的联系.     

关于特征值的平方和的注记

探讨了特征值的平方和这一计算问题,指出了常用方法的不足之处,并在深入研究方阵相似的基础之上弥补了这一不足,彻底解决了这一问题,此外运用这种方法还能解决特征值高次幂之和与多项式之和的计算问题.最后文中给出了一种新的计算特征值平方和的方法,这种方法能够回避第一种方法的不足,但缺点是不易推广.     

一类线性方程组的解的公式

本文在[1]的基础上,引进了递差方阵 D,给出了 Vandermonde 型阵 V_m 的逆阵的显示式,从而得到了方程组(1),(1′)的可供直接计算用的用三角阵表示的解的公式.此外,还得到了包括[2]的化(1′)为三角形方程组的结果.     

随机环境下的一类衍生的ARCH模型的极限行为

提出了随机环境下的幂变换门限自回归条件异方差模型,得出了其以几何速率收敛的充分条件.该模型反映了动力系统受随机环境干扰的现象,能更好的拟合现实世界中的诸多实际问题.另一方面,本文推广了自回归条件异方差模型,改善了模型的适应性程度,能够更好地适用于各种不同的金融市场价格行为波动的现象.     

群的根性的一般理论

该文列举了任意群的根性的定义,并给出了任意群的根性的几个例子,同时还研究了群的根性的性质.     

Identification of distributed systems and the theory of the regularization

The identification problems, i.e., the problems of finding unknown parameters in distributed systems from the observations are very important in modern control theory. The solutions of these identification problems can be obtained by solving the equations of the first kind. However, the solutions are often unstable. In other words, they are not continuously dependent on the data. The regularization or Tihonov's regularization is known as one of the stabilizing algorithms to solve these non well-posed problems. In this paper is studied the regularization method for identification of distributed systems. Several approximation theorems are proved to solve the equations of the first kind. Then, identification problems are reduced to the minimization of quadratic cost functionals by virtue of these theorems. On the other hand, it is known that the statistical methods for identification such as the maximum likelihood lead to the minimization problems of certain quadratic functionals. Comparing these quadratic cost functionals, the relations between the regularization and the statistical methods are discussed. Further, numerical examples are given to show the effectiveness of this method.     

On the performance of the algebraic optimized Schwarz methods with applications

We investigate the performance of algebraic optimized Schwarz methods used as preconditioners for the solution of discretized differential equations. These methods consist on modifying the so-called transmission blocks. The transmission blocks are replaced by new blocks in order to improve the convergence of the corresponding iterative algorithms. In the optimal case, convergence in two iterations can be achieved. We are also interested in the behavior of the algebraic optimized Schwarz methods with respect to changes in the problems parameters. We focus on constructing preconditioners for different numerically challenging differential problems such as: Periodic and Torus problems; Meshfree problems; Three-dimensional problems. We present different numerical simulations corresponding to different type of problems in two- and three-dimensions.     

Variational problems in the theory of optimum processes

This paper presents a review of the optimization problems for control processes described by ordinary differential equations and of the variational methods for solving these problems. The following cases are studied: problems with constraints on the controls or the coordinates, problems described by equations with discontinuous right-hand sides, problems with functionals depending on intermediate coordinates, and problems with given discontinuities in the coordinates. Variational problems of synthesis of optimal systems are also discussed. The method of solution is based on the multiplier rule and the Weierstrass necessary condition for the strong minimum of a functional. In some cases, the Legendre-Clebsch necessary condition for the weak minimum of a functional is used.     

On the completeness of eigenfunctions of the Frankl problem with the oddness condition

Modified Frankl problems with the oddness condition are considered for the Lavrent’ev-Bitsadze equation. The eigenvalues and eigenfunctions of these problems are found. The completeness of these eigenfunctions in the elliptic part of the domain is proved.     

A practicable way for computing the directional derivative of the optimal value function in convex programming

Formulas for computing the directional derivative of the optimal value function or of lower or upper bounds of it are well-known from literature. Because they have as a rule a minmax structure, methods from nondifferentiable optimization are required.

Considering a fully parametrized convex problem, in the paper the mentioned minmax formulas are transformed into usual programming problems. Although they are nonconvex in general, the computational effort is much lower than that for minmax problems. In several special cases, for instance, for linear least squares problems, linear programming problems arise.     

Carleman estimates for the regularization of ill-posed Cauchy problems

This work is a survey of results for ill-posed Cauchy problems for PDEs of the author with co-authors starting from 1991. A universal method of the regularization of these problems is presented here. Even though the idea of this method was previously discussed for specific problems, a universal approach of this paper was not discussed, at least in detail. This approach consists in constructing of such Tikhonov functionals which are generated by unbounded linear operators of those PDEs. The approach is quite general one, since it is applicable to all PDE operators for which Carleman estimates are valid. Three main types of operators of the second order are among them: elliptic, parabolic and hyperbolic ones. The key idea is that convergence rates of minimizers are established using Carleman estimates. Generalizations to nonlinear inverse problems, such as problems of reconstructions of obstacles and coefficient inverse problems are also feasible.     

关于Schwarz交替法的收敛因子

§1.Schwarz交替法的收敛因子 我们就二阶自共轭椭圆型方程的Dirichlet问题来讨论.设Ω?R~2为一多边形区域, a(u,v)=(f,v),v∈H_0~1(Ω),f∈H~(-1)(Ω), u∈H_0~1(Ω)是定义在其上的边值问题的变分形式,双线性型时a(·,·)满足     

选址问题研究的若干进展

中值问题、覆盖问题、中心问题是选址研究中的三个经典问题，它们的应用非常广泛，也是迄今为止大多数选址理论研究的坚实基础。本文综述了近年来它们的研究进展，包括模型、求解方法以及相关问题，最后，指出这一领域未来研究的一些问题与方向。     

一类混合似变分不等式问题解的存在唯一性

本文中,我们首先给出了一类混合似变分不等式问题．接着,在Banach空间中研究了它的解的存在性和唯一性．最后,讨论了混合似变分不等式问题的扰动问题,并证明了扰动问题的解的存在唯一性定理．     

Bounds for the additional cost of near-optimal controls

Near-optimal controls are considered for singular problems with a constrained control. These controls result in a higher cost than the optimal cost. Bounds for the additional cost are derived for problems with fixed terminal time or free terminal time and for minimal time problems. An illustrative example is solved of an optimal evasive control of an aircraft against a homing missile.