一类具有闭环极点约束的不确定线性系统的保性能控制

主要研究了闭环系统的极点约束在一个给定圆盘中的保性能控制问题,基于线性矩阵不等式处理方法给出了状态反馈控制器存在的充要条件,并利用线性矩阵不等式的解给出了保性能控制器的设计方法,得到一个状态反馈控制器,使得对所有允许的不确定性闭环系统稳定,并且闭环性能指标值不超过某个确定的上界.最后以数值例子验证了结果的正确性.     

关于稳定矩阵分解定理的一个简单证明

一个矩阵称为稳定的,如果这个矩阵的特征值全包含在单位开圆盘内.利用Parker关于复方阵的分解定理给出了稳定矩阵分解定理的一个简单证明,并对奇异值全部严格小于1的矩阵给出了类似的结论.     

线性代数中特征向量的一个应用

在线性代数中,特征向量在矩阵的对角化过程中起着重要作用.从一个引例出发,证明了:一个矩阵与对角矩阵可交换当且仅当它可以用以特征向量为列向量的两个矩阵表示.做为推论,如果对角矩阵对角线上的相同元素在相邻位置,那么与其可交换的矩阵只能是准对角矩阵.     

农夫过河问题新解

以一种新视角讨论了趣味逻辑题"农夫过河问题",通过引入位置状态向量与运送过程向量,建立了一个向量方程,它对应于一个线性方程组,其解是唯一确定的.考虑到运送过程的顺序,这个唯一解对应于两种安全过河运送方案.最后,用线性代数建模方法重新表述趣味问题"嫉妒的丈夫"及其矩阵表示.     

非对称三对角阵化为复数域上的对称阵的注记

构造一个相似变换矩阵,讨论三对角矩阵的对称位置上元素异号和一般三对角矩阵如何对称化,通过实例指出了现有结论中的一个纰漏.     

矩阵特征值的一类新的存在性区域

用盖尔斯果林圆盘定理估计矩阵特征值是一个经典的方法，后人对此定理虽有许多改进，例如用卵形区域代替盖氏圆盘，但都显得粗糙，本文的研究得出了一类新的特征值存在区域，它们与盖氏圆盘等方法结合结合能提高估计的精确度。     

矩阵系统的稳定与条件稳定

一个矩阵对应一种状态变换 .一系列的矩阵构成矩阵序列系统 .任一微小的扰动都会破坏伪逆的精确性 ,即状态的最后结果 .本文证明 :若矩阵系统是广义各态历经的 ,则系统是稳定的 ;若矩阵系统是普真的 ,则系统是条件稳定的 .     

特征多项式的系数

用一种新方法证明了方阵的特征多项式的一般项的系数与该方阵的主子式密切相关.利用该结论和盖尔圆盘定理,证明了0是一类特殊Laplace矩阵的单特征值.     

胜负难以预料

<正>一次偶然的机会,笔者发现4个小朋友在玩一个"猜拳转盘"的游戏,不禁驻足观看,觉得这个游戏有点意思.在此,笔者愿意把这个游戏介绍给读者,并从数学的角度做一点探讨.游戏用到一个直径大约1米的圆盘,把这个圆盘平均分为8份,在每一份上分别标有"-5,-3,-1,0,1,3,4,5"这8个数字,每一个数字代表相应的分数.圆盘外有一个固定的指针,指针指到哪个区域,选手就     

Markov链在生态学中的一个应用

Markov链是随机过程的一个特例,专门研究在无后效条件下时间和状态均为离散的随机转移问题.本文运用与Markov链相关的转移概率矩阵性质,探讨一个鱼类洄游实际问题的数学模型,寻求鱼类洄游的数量规律.     

Decomposable symmetric designs

The first infinite families of symmetric designs were obtained from finite projective geometries, Hadamard matrices, and difference sets. In this paper we describe two general methods of constructing symmetric designs that give rise to the parameters of all other known infinite families of symmetric designs. The method of global decomposition produces an incidence matrix of a symmetric design as a block matrix with each block being a zero matrix or an incidence matrix of a smaller symmetric design. The method of local decomposition represents incidence matrices of a residual and a derived design of a symmetric design as block matrices with each block being a zero matrix or an incidence matrix of a smaller residual or derived design, respectively.     

跳行范德蒙矩阵的三角分解

跳行范德蒙矩阵是一种重要的矩阵,在函数插值等方面有着重要的应用.根据跳行范德蒙矩阵的特殊结构,将跳行范德蒙矩阵分解为一系列下三角矩阵与一系列上三角矩阵的乘积.进一步给出了其逆矩阵分解为一系列上三角矩阵与一系列下三角矩阵的乘积的表达式.     

Hessenberg matrix for sums of Hermitian positive definite matrices and weighted shifts

In this work, we introduce an algebraic operation between bounded Hessenberg matrices and we analyze some of its properties. We call this operation m-sum and we obtain an expression for it that involves the Cholesky factorization of the corresponding Hermitian positive definite matrices associated with the Hessenberg components.This work extends a method to obtain the Hessenberg matrix of the sum of measures from the Hessenberg matrices of the individual measures, introduced recently by the authors for subnormal matrices, to matrices which are not necessarily subnormal.Moreover, we give some examples and we obtain the explicit formula for the m-sum of a weighted shift. In particular, we construct an interesting example: a subnormal Hessenberg matrix obtained as the m-sum of two not subnormal Hessenberg matrices.     

空间计量模型中权重矩阵的类型与选择

根据空间效应产生起点及理论基础的不同,归纳了现有空间计量文献中邻接矩阵、反距离矩阵、经济特征矩阵以及嵌套矩阵等主要权重形式,并总结了其共同点、优缺点、演变脉络及使用注意事项.针对截面式权重矩阵本身面临的限制构造了两种必要的转换,即通过转换实现对不同地理区域之间空间效应的考察,以及从截面权重到面板权重的转换.最后指出研究者应该尽量采用多种新方法来确定空间权重形式以使其更客观.     

Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal

In this paper we describe an orthogonal similarity transformation for transforming arbitrary symmetric matrices into a diagonal-plus-semiseparable matrix, where we can freely choose the diagonal. Very recently an algorithm was proposed for transforming arbitrary symmetric matrices into similar semiseparable ones. This reduction is strongly connected to the reduction to tridiagonal form. The class of semiseparable matrices can be considered as a subclass of the diagonalplus- semiseparable matrices. Therefore we can interpret the proposed algorithm here as an extension of the reduction to semiseparable form. A numerical experiment is performed comparing thereby the accuracy of this reduction algorithm with respect to the accuracy of the traditional reduction to tridiagonal form, and the reduction to semiseparable form. The experiment indicates that all three reduction algorithms are equally accurate. Moreover it is shown in the experiments that asymptotically all the three approaches have the same complexity, i.e. that they have the same factor preceding the n³ term in the computational complexity. Finally we illustrate that special choices of the diagonal create a specific convergence behavior. The research was partially supported by the Research Council K.U.Leuven, project OT/05/40 (Large rank structured matrix computations), by the Fund for Scientific Research–Flanders (Belgium), projects G.0078.01 (SMA: Structured Matrices and their Applications), G.0176.02 (ANCILA: Asymptotic aNalysis of the Convergence behavior of Iterative methods in numerical Linear Algebra), G.0184.02 (CORFU: Constructive study of Orthogonal Functions) and G.0455.0 (RHPH: Riemann-Hilbert problems, random matrices and Padé-Hermite approximation), and by the Belgian Programme on Interuniversity Poles of Attraction, initiated by the Belgian State, Prime Minister's Office for Science, Technology and Culture, project IUAP V-22 (Dynamical Systems and Control: Computation, Identification & Modelling). The scientific responsibility rests with the authors.     

矩阵对的相似标准形

设A,B,C,D都是n阶方阵,矩阵对(A,B)相似于矩阵对(C,D),如果存在n阶可逆矩阵P,使得P-1AP=C,P-1BP=D.本文借助Belitskii约化算法,提供一种在相似变化下化任一n阶矩阵对为标准形的有效方法,该方法可以看作Jordan标准形的推广.     

Noncommutative ball maps

In this paper, we analyze problems involving matrix variables for which we use a noncommutative algebra setting. To be more specific, we use a class of functions (called NC analytic functions) defined by power series in noncommuting variables and evaluate these functions on sets of matrices of all dimensions; we call such situations dimension-free. These types of functions have recently been used in the study of dimension-free linear system engineering problems. In this paper we characterize NC analytic maps that send dimension-free matrix balls to dimension-free matrix balls and carry the boundary to the boundary; such maps we call “NC ball maps”. We find that up to normalization, an NC ball map is the direct sum of the identity map with an NC analytic map of the ball into the ball. That is, “NC ball maps” are very simple, in contrast to the classical result of D'Angelo on such analytic maps in C. Another mathematically natural class of maps carries a variant of the noncommutative distinguished boundary to the boundary, but on these our results are limited. We shall be interested in several types of noncommutative balls, conventional ones, but also balls defined by constraints called Linear Matrix Inequalities (LMI). What we do here is a small piece of the bigger puzzle of understanding how LMIs behave with respect to noncommutative change of variables.     

逆矩阵的判定及计算方法

线性代数是大学教育中一门难度较高的基础必修课程,而逆矩阵是教学过程中一个主要概念,对研究其他线性结构有着非常重要的作用.本文通过对逆矩阵定义的分析,汇总若干个判定矩阵是否可逆的方法,同时提供了多种逆矩阵的计算技巧,包括利用计算机技术简化繁琐的计算过程,这些都是学习者在学习过程中需要掌握的重要内容.本文旨在协助教师在开展教学时,能够举一反三,以点带面来引导学生将所学知识融合,注重知识点之间的相关性学习;同时,也帮助学习者能够更加全面的认识逆矩阵这一重要概念.     

Construction,properties and statistical applications of positive definite intraclass matrix

Given a positive definite (p.d.) matrix with real entries, it is possible to construct a p.d. intraclass matrix whose diagonal and off-diagonal elements are chosen as the averages of the diagonal elements and off-diagonal elements of the former matrix. Exploiting the very special structure of the latter matrix various interesting propositions are established. Statistical applications of such matrices are surveyed.