奇异M—矩阵的图相容弱正则分裂

设Ａ是奇异Ｍ－矩阵，Ａ＝Ｍ－Ｎ是Ａ的图相容弱正则分裂。本文研究迭代矩阵Ｍ＾－１Ｎ的谱性质，得到与迭代矩阵的指数有关的一个定理：ｉｎｄ０（Ａ）＝ｉｎｄ１（Ｍ＾－１Ｎ）．它推广了Ｈ．Ｓｃｈｎｅｉｄｅｒ和作者的结果。     

奇异M─矩阵的图相容弱正则分裂

设Ａ是奇异Ｍ－矩阵，Ａ＝Ｍ－Ｎ是Ａ的图相容弱正则分裂．本文研究迭代矩阵Ｍ－１Ｎ的谱性质，得到与迭代矩阵的指数有关的一个定理：ｉｎｄ０（Ａ）＝ｉｎｄ１（Ｍ－１Ｎ）．它推广了Ｈ．Ｓｃｈｎｅｉｄｅｒ和作者的结果．     

关于Z－矩阵的弱正则分裂

本文主要考虑一类Ｚ－矩阵弱正则分裂的迭代矩阵的谱半径和特征值１的指数问题，推广了Ｒｏｓｅ在１９８４年得到的一个定理．     

Fuglede—Putnam定理的简单证明

Ｆｕｇｌｅｄｅ──Ｐｕｔｎａｍ定理的简单证明陈寅（河海大学数理系２１００２４）复矩阵Ａ称为正规矩阵，如Ａ＊Ａ＝ＡＡ＊，这里Ａ＊为Ａ的共轭转置，关于正规矩阵的最重要的结论之一是Ｆｕｇｌｅｄｅ－Ｐｕｔｎａｍ定理，［１，５３８－５４２］给出了这个定理的证明...     

P—循环矩阵和块AOR方法

本文首先导出Ｐ－循环矩阵的块Ｊａｃｏｂｉ迭代矩阵和相应的块ＡＯＲ迭代矩阵的特征间的关系式。然后，我们确定块ＡＯＲ方法用于最小二乘问题时的收敛和发散区域。     

布尔矩阵广义逆A－ω，A－d，A－ω

设Ａ是布尔矩阵，而矩阵Ｇ满足ＡＧＡ＝Ａ．（１）如果对所有Ａｘ＝ｙ的向量ｘ，ｙ．有ω（Ｇｙ）≤ω（ｘ）（＊）称Ｇ是Ａ的一个极小权ｇ－逆，表示为Ａ－ω．（２）如果对所有向量ｘ，ｙ，有ｄ（ＡＧｙ，ｙ）≤ｄ（Ａｘ，ｙ）（＊＊）称Ｇ是Ａ的最小距离ｇ－逆，表示为Ａ－ｄ．（３）如果（＊）和（＊＊）都成立，就称Ｇ是极小权最小距离ｇ－逆，表示为Ａ－ωｄ．本文研究这三类广义逆矩阵的最大逆的存在性及表示式．主要结果如下：假定对于矩阵Ａ．Ａ－ω，Ａ－ｄ，Ａ－ωｄ分别存在，那么．（１）存在最大Ａ－ω，当且仅当Ａ中设有两个相同的非零列，且最大Ａ－ω为Ａω＝［ＩＣＡＴ］Ｃ．（２）最大Ａ－ｄ存在，且为Ａｄ＝［ＡＴＡＣＡＴ＋ＡＴ（ＪＡＴ）Ｃ］Ｃ．（３）存在最大Ａ－ωｄ，当且仅当Ａ的所有非零列向量线性独立，且最大Ａ－ωｄ为Ａωｄ＝［ＡＴＡｃＡＴ＋ＡＴ（ＪＡＴ）ｃ＋（ＡＴＪ）ｃＡＴ］Ｃ．其中Ｊ为全１矩阵     

利用Z／P^αZ上矩阵构作多个结合类的结合方案与PBIB设计

本文利用有限局部环Ｚ／ｐαＺ上的１×ｎ矩阵集合构作具α个结合类的方案与ＰＢＩＢ设计，并计算了它们的参数．     

不可约M－矩阵的刻画（II）

该文给出了（非）奇异Ｚ－矩阵是（非）奇异不可约Ｍ－矩阵的一些充分必要条件．     

p—除环上子空间的交与和

本文讨论Ｐ－除环上 间的交与和的关系。用Ａｂｅｌ范畴中裂正合序列的性质证明矩阵秩的恒等式和维数公式。     

具有矩阵伸缩的双正交小波基

在这篇文章里,我们研究了伸缩为矩阵的双正交小波基的构造问题,在适当条件下,我们得到了Ｌ~２（Ｒ~ｎ）的小波框架或双正交小波基｛ｓｊ,ｋ｝和｛ｓｊ,ｋ｝,其中ｓｊｋ（ｘ）＝ｄｅｔＡｓ（Ａｊｘ－ｋ）,ｓｊ,ｋ（ｘ）＝ｄｅｔＡｊ２ｓ（Ａｊｘ－ｋ）（ｊ Ｚ． ｋ Ｚ~ｎ）及 Ａ是一伸缩矩阵．     

Some Characterizations of a Class of M-matrices

ＳｏｍｅＣｈａｒａｃｔｅｒｉｚａｔｉｏｎｓｏｆａＣｌａｓｓｏｆ　Ｍ－ｍａｔｒｉｃｅｓＬｉＷｅｎ（黎稳）ａｎｄＺｈａｎｇＭｏｕｃｈｅｎｇ（张谋成）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ,ＳｏｕｔｈＣｈｉｎａＮｏｒｍａｌＵｖｉｖｅｒｓｉｔｙ,Ｇ...     

Global synchronization criteria for a class of third-order non-autonomous chaotic systems via linear state error feedback control

This paper investigates the global synchronization of a class of third-order non-autonomous chaotic systems via the master–slave linear state error feedback control. A sufficient global synchronization criterion of linear matrix inequality (LMI) and several algebraic synchronization criteria for single-variable coupling are proven. These LMI and algebraic synchronization criteria are then applied to two classes of well-known third-order chaotic systems, the generalized Lorenz systems and the gyrostat systems, proving that the local synchronization criteria for the chaotic generalized Lorenz systems developed in the existing literature can actually be extended to describe global synchronization and obtaining some easily implemented synchronization criteria for the gyrostat systems.     

ON THE CONVERGENCE OFSPLITTINGS FOR A Z-MATRIX

In this paper, first we present a characterization of semiconvergence for nonnegative splittings of a singular Z-mattix, which generalizes the corresponding result of . Second, a characterization of convergence for L1-regular splittings of a singular E-matrix is given, which im-prove the resuh of [3]. Third, convergence of weak nonnegative splittings and regular splittings isdiscussed, and we obtain some necessary and sufficient conditions such that the splittings of a Z-matrix converge,     

A Unified and Broadened Class of Admissible Minimax Estimators of a Multivariate Normal Mean

The problem of estimating the mean of a multivariate normal distribution is considered. A class of admissible minimax estimators is constructed. This class includes two well-known classes of estimators, Strawderman's and Alam's. Further, this class is much broader than theirs.     

对称Z-矩阵的惯量以及其Schur补的若干交错性质

In this Paper,the inertia of a symmetric Z-matrix is studied,and bounds of the number of its positive eigenvalues are obtained.Also the interlacing theorem for Schur complement of a symmetric Z-matrix is established,which can be considered as a generalization Cauchy interlacing theorem in some extent.     

Newton iterations in implicit time-stepping scheme for differential linear complementarity systems

We propose a generalized Newton method for solving the system of nonlinear equations with linear complementarity constraints in the implicit or semi-implicit time-stepping scheme for differential linear complementarity systems (DLCS). We choose a specific solution from the solution set of the linear complementarity constraints to define a locally Lipschitz continuous right-hand-side function in the differential equation. Moreover, we present a simple formula to compute an element in the Clarke generalized Jacobian of the solution function. We show that the implicit or semi-implicit time-stepping scheme using the generalized Newton method can be applied to a class of DLCS including the nondegenerate matrix DLCS and hidden Z-matrix DLCS, and has a superlinear convergence rate. To illustrate our approach, we show that choosing the least-element solution from the solution set of the Z-matrix linear complementarity constraints can define a Lipschitz continuous right-hand-side function with a computable Lipschitz constant. The Lipschitz constant helps us to choose the step size of the time-stepping scheme and guarantee the convergence.     

Weak topology and infinite matrix games

This paper approaches infinite matrix games through the weak topology on the players' sets of strategies. A new class of semi-infinite and infinite matrix games is defined, and it is proved that these games always have a value and optimal strategies for each player. Using these games it is proved that some other important classes of infinite matrix game also have values. Received April 1996/Revised version June 1997/Final version September 1997     

A field guide to the matrix classes found in the literature of the linear complementarity problem

There are more than 50 matrix classes discussed in the literature of the Linear Complementarity Problem. This guide is offered as a compendium of notations, definitions, names, source information, and commentary on these many matrix classes. Also included are discussions of certain properties possessed by some (but not all) of the matrix classes considered in this guide. These properties—fullness, completeness, reflectiveness, and sign-change invariance—are the subject of another table featuring matrix classes that have one or more of them. Still another feature of this work is a matrix class inclusion map depicting relationships among the matrix classes listed herein.     

A generalization of a basic inequality of Telyakovski?

Two classes of numerical sequences are defined by means certain properties of the differences of terms of positive sequences, and their relationship to some newly defined classes and the well-known Sidon-Telyakovski? class is analyzed. It is also verified that if a sequence belongs to the newly defined wider class, then with this sequence in place of the sequence {1/k} an essential inequality established by Telyakovski? can be generalized notably. This new result and the previous generalizations of the original Telyakovski???s theorem are incomparable.     

Quasi-star-cutsets and some consequences

This paper introduces a structural property of minimal imperfect graphs, no minimal imperfect graph has a quasi-star-cutset, before describing some consequences. First, a large class of perfect graphs is obtained from the class of all bipartite graphs and their line-graphs; this class contains several well-known classes of perfect graphs. The second consequence deals with a composition operation of graphs which preserves perfection and which encompasses the most part of the compositions known to preserve perfection.