关于矩阵的奇异值偏序

研究矩阵的奇异值偏序,给出了矩阵的奇异值偏序的等价刻画和性质,指出了相关文献关于矩阵*序刻画不真,利用强同时奇异值分解给出了矩阵*-序的刻画.     

关于矩阵的泛正定性与广义逆偏序的一个注记

指出“矩阵的泛正定性与广义逆偏序”一文的一些错误,利用矩阵的同时合同变换给出了矩阵偏序的若干刻画.     

可换BCH-代数

引入了可换BCH-代数的概念,给出了可换BCH-代数的两个充要条件.对偏序可换BCH-代数进行了讨论,给出了偏序BCH-代数是可换的两个充要条件.证明了偏序可换BCH-代数的每个分支是一个下半格,局部有界偏序可换BCH-代数的每个分支是一个格.     

A note on the partial ordering of positive semi-definite matrices

The effect of the Moore-Penrose map on the positive semi-definite partial ordering of n×n complex matrices, is contrasted with its effect on the Drazin partial ordering of the same set of matrices.     

Full ordering in the Shorrocks mobility sense of the semiring of monotone doubly stochastic matrices

In this paper, we investigate the ordering on a semiring of monotone doubly stochastic transition matrices in Shorrocks’ sense. We identify a class of an equilibrium index of mobility that induces the full ordering in a semiring, while this ordering is compatible with Dardanoni’s partial ordering on a set of monotone primitive irreducible doubly stochastic matrices.     

矩阵的泛正定与广义逆偏序

引言出现在二次型和 Hermite 型研究中的正定矩阵不仅理论结果非常丰富,而且在几乎所有的数值分析以及应用数学和力学各分支中有着广泛的应用.我们用 P_n 表示所有 n 阶实正定阵的集合     

The matrix inequality M ⩾ B1MB

The Loewner partial ordering between nonnegative definite matrices M and B¹MB is considered. The main result obtained generalizes a number of results known in the literature. The rank subtractivity partial ordering and the Drazin partial ordering between M and B¹MB are also discussed.     

Order-preserving representations of the partitions on the finite set

A partial ordering is defined for monotone projections f: N → N, N = {1, 2,…, n}, such that the class of these mappings is a lattice which is isomorphic to the partition lattice. Thus a partition can be uniquely represented by an element of this class of mappings and the partial ordering of partitions is preserved. Algorithms for computing the join and meet of given partitions are presented.     

NBU(2)性的偏序刻画

为刻画同一寿命分布类中两个不同分布的NBU(2)性的强弱,本文定义了一个新的偏序,即NBU(2)序,并证明NBU(2)序具有反身性,反对称性和传递性.另外,该偏序与超可加序、NBUE序,增凹序的关系也作了探讨.基于被比较分布是指数的情况,还建立了判定NBU(2)序的一个充要条件.     

The extensional ordering of the sequential functionals

We investigate the extensional ordering of the sequential functionals of finite types, with a focus on when the sequential functionals of a given type form a directed complete partial ordering, and on when a finite sequential functional will be the nontrivial least upper bound of an infinite chain of sequential functionals. We offer a full characterization for finite functionals of pure types.     

关于矩阵的Sharp序、*序和减序

给出短阵sharp序的一个新的刻画，由此得到(半)正定短阵sharp序与其平方矩阵sharp序之间的关系．我们还讨论正规矩阵的*序与减序之间的关系，推广了关于Hermmite矩阵的相应结果．     

The failure rate and likelihood ratio orderings of standby redundant systems

There are various notions of partial ordering between lifetimes of systems; stochastic ordering, failure rate ordering, and likelihood ratio ordering. In this paper we show that for series systems with noni.i.d. exponential lifetimes of components, standby redundancy at component level is better than that at system level in failure rate ordering and likelihood ratio ordering. We also demonstrate that for 2-component parallel systems withi.i.d. exponential lifetimes of components, standby system redundancy is better than standby component redundancy in failure rate ordering and likelihood ratio ordering.     

非线性二元算子方程组的迭代求解方法

Using the cone and partial ordering theory and mixed monotone operator theory, the existence and uniqueness of solutions for some classes of systems of nonlinear two binary operator equations in a Banach space with a partial ordering are discussed. And the error estimates that the iterative sequences converge to solutions are also given. Some relevant results of solvability of two binary operator equations and systems of operator equations are improved and generalized.     

Partial orderings of matrices referring to singular values or eigenvalues

A new partial ordering in the set of complex matrices is defined, which is weaker than the star ordering introduced by Drazin in 1978 and stronger than the minus ordering introduced by Hartwig in 1980. This ordering refers to singular values of matrices, and the interest in it was generated by canonical interpretations of the minus and star orderings, given by Hartwig and Styan in 1986. For Hermitian matrices, a similar ordering referring to eigenvalues is also considered, and its connection with a problem concerning distributions of quadratic forms in normal variables is pointed out.     

Weakening partial orderings to lattice and semilattice orderings

A partial ordering on a set P can be weakened to an upper or lower semilattice ordering, respectively a lattice ordering, if and only if P is filtered in the appropriate direction(s).This work was done while the author was partly supported by NSF contract DMS 85-02330.     

ON THE ｛2｝－INVERSE AND SOME ORDERING PROPERTIES OF NONNEGATIVE DEFINITE MATRICES

ＥＲＫＫＩＰ．ＬＩＳＫＩ（ＤｅｐｅｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃａｌＳｃｉｅｎｃｅｓ，ＵｎｉｖｅｒｓｉｔｙｏｆＴａｍｐｅｒｓ，Ｆｉｎｌａｎｄ）ＷＡＮＧＳＯＮＧＧＵＩ（王松桂）（ＤｅｐａｒｔｍｅｎｔｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ，Ｂｅｉ...     

Numerical Procedures in Multiobjective Optimization with Variable Ordering Structures

Multiobjective optimization problems with a variable ordering structure, instead of a partial ordering, have recently gained interest due to several applications. In the previous years, a basic theory has been developed for such problems. The binary relations of a variable ordering structure are defined by a cone-valued map that associates, with each element of the linear space ? ^m , a pointed convex cone of dominated or preferred directions. The difficulty in the study of the variable ordering structures arises from the fact that the binary relations are in general not transitive. In this paper, we propose numerical approaches for solving such optimization problems. For continuous problems a method is presented using scalarization functionals, which allows the determination of an approximation of the infinite optimal solution set. For discrete problems the Jahn–Graef–Younes method, known from multiobjective optimization with a partial ordering, is adapted to allow the determination of all optimal elements with a reduced effort compared to a pairwise comparison.     

Binary operations and lattice structure for a model of matching with contracts

We consider a restricted model of many-to-one matching with contracts and we order the set of stable allocations according both to the unanimous-for-doctors partial ordering and Blair’s partial ordering for hospitals. We define two binary operations to calculate the least upper bound and greatest lower bound for each pair of elements of this set in a simple way. By using these operations, we show that the set of stable allocations has dual lattice structures, thus reflecting an expected counterposition of interests between both sides of the market.     

编序式问卷调查的模糊偏序排序法

讨论了现有的编序式问卷调查排序方法的不足之处;提出了基于模糊偏序关系的编序式问卷调查的排序方法,给出了模糊偏序排序法的数学模型,论证了用模糊偏序关系对编序式问卷调查进行排序是一种较好的方法;并用实例分析了模糊偏序排序法应用于编序式问卷调查的具体操作步骤.     

一个投资问题的信息结构

本文研究一个投资问题中的信息价值，其中信息可以是不完美的，信息价值依赖于其结构．信息结构由状态变量与信息变量联合概率(或条件概率)矩阵来描述．我们定义了矩阵的一些偏序，通过这些偏序给出了信息价值的比较关系．由这些结果，我们导出了信息价值的一些基本性质．