Preconditioning the Poincaré-Steklov operator by using Green's function

This paper is concerned with the Poincaré-Steklov operator that is widely used in domain decomposition methods. It is proved that the inverse of the Poincaré-Steklov operator can be expressed explicitly by an integral operator with a kernel being the Green's function restricted to the interface. As an application, for the discrete Poincaré-Steklov operator with respect to either a line (edge) or a star-shaped web associated with a single vertex point, a preconditioner can be constructed by first imbedding the line as the diameter of a disk, or the web as a union of radii of a disk, and then using the Green's function on the disk. The proposed technique can be effectively used in conjunction with various existing domain decomposition techniques, especially with the methods based on vertex spaces (from multi-subdomain decomposition). Some numerical results are reported.

     

有限域上多项式集的简单分解

研究如何将任意有限域上的多项式集分解为有限多个简单列.为了解决这一问题,首先研究简单列和根理想之间的关系,然后基于已有的正则分解算法和有限域上理想的根的两种计算方法设计一个有限域上多项式集的简单分解算法.计算试验表明,文章给出的算法是有效的.     

Operators which have a closed quasi-nilpotent part

We find several conditions for the quasi-nilpotent part of a bounded operator acting on a Banach space to be closed. Most of these conditions are established for semi-Fredholm operators or, more generally, for operators which admit a generalized Kato decomposition. For these operators the property of having a closed quasi-nilpotent part is related to the so-called single valued extension property.

     

基于模糊ANP的系统系的效能评估算法及其应用

针对系统系效能的综合评估问题,基于模糊ANP提出了一种新算法.考虑到效能之间的关联性,建立起分级式网络化效能评价指标系统系,实现了系统系(SoS)到子系统,再到系统功能之间的逐级映射,进而得到系统系效能评估的层次模型.采用改进模糊指数标度的网络分析法定量计算系统功能对系统系效能的权重,得到系统功能对系统系效能的贡献度.最后以微电网构成的电力系统为例验证分析,证明所提算法的有效性.     

Extending local mixture models

Local mixture models have proved useful in many statistical applications. This paper looks at ways in which the local assumption, which is used in an asymptotic approximation, can be relaxed in order to generate a much larger class of models which still have the very attractive geometric and inferential properties of local mixture models. The tool used to develop this large class of models is the Karhunen–Loève decomposition. Computational issues associated with working with these models are also briefly considered.     

Classification of Dantzig–Wolfe reformulations for binary mixed integer programming problems

In this note, we provide a classification of Dantzig–Wolfe reformulations for Binary Mixed Integer Programming Problems. We specifically focus on modeling the binary conditions in the convexification approach to the Dantzig–Wolfe decomposition. For a general Binary Mixed Integer Programming problem, an extreme point of the overall problem does not necessarily correspond to an extreme point of the subproblem. Therefore, the binary conditions cannot in general be imposed on the new master problem variables but must be imposed on the original binary variables. In some cases, however, it is possible to impose the binary restrictions directly on the new master problem variables. The issue of imposing binary conditions on the original variables versus the master problem variables has not been discussed systematically for MIP problems in general in the literature and most of the research has been focused on the pure binary case. The classification indicates in which cases you can, and cannot, impose binary conditions on the new master problem variables.     

检测含任意项特殊逻辑函数的图形方法

线性函数、冗余特殊、自反函数、自双反函数等特殊逻辑函数在电路设计中具有独特的优点.从特殊逻辑函数的定义出发,提出了基于K图检测含任意项线性函数、冗余函数的方法及基于分解图检测含任意项自反函数、自双反函数的方法,并举例说明了具体检测过程.应用结果表明,该图形方法具有直观,便捷等特点.     

三步迭代求解非线性方程组(英文)

本文给出求解非线性方程组具有六阶精度的三步迭代方法,理论上给予了证明。并且与Jae Heon Yun提出的有四阶精度的三步迭代方法相比有比较大的改进。最后给出数值例子,对几种不同的迭代方法进行比较,数值结果显示给出的方法与理论结果一致。     

弱A-调和张量的高阶可积性

首先,利用Riesz变换和内插理论的结果得到了非齐次A-调和方程d^＊A（x,g＋du）=d^＊h很弱解的一个先验估计.然后,利用这个先验估计得到了该方程很弱解的高阶可积性.