实矩阵特征值排序的直接算法

矩阵不变子空间的计算是求解矩阵特征值问题的继续。近年来发展的计算不变子空间的正交基或更一般的稳定基的算法中,常需解决将特征值按要求的次序排列的问题,不妨称之为排序问题。对於复矩阵,不变子空间的稳定基的计算是首先应用QR方法将矩阵经酉相似变换约化为上三角阵,而对上三角阵Ruhe提出了一个简单而有效     

三对角线阵行列式恒等式及应用

本文导出了求三对角线阵行列式的显式表示.这个恒等式可应用于研究三对角线阵的逆矩阵和特征值性质以及求某些正交多项式的显式表示,并能由此导出一类有用的恒等式.     

用正交变换化实二次型为标准形的同步求解问题

作为《关于矩阵的特征值与特征向量同步求解问题》的续篇,利用其给出的方法,证明了新的定理.通过对实对称矩阵进行行列互逆变换,同步求出二次型的标准形及正交变换阵,简化了复杂的施密特正交化法,较好地解决了二次型标准形与正交变换阵同步求解问题.     

矩阵不可约的充要条件

本文利用可达性给出矩阵不可约的一个充要条件。在此基础法上,讨论可达性矩阵的性质,进而给出将一类可约矩阵化为主对角线上都为不可约子块的块上三角阵。这个方法可以在计算机上实施,实用而方便。     

二次矩阵方程AX~2+BX+C=0的可对角化解

给出了二次矩阵方程AX2+BX+C=0的特征值和特征子空间的定义,然后运用其特征子空间的维数或特征向量刻画了该二次矩阵方程存在可对角化解的充要条件.     

一种求解加权Toeplitz最小二乘问题的新预条件子（英文）

本文研究加权Toeplitz最小二乘问题的快速求解算法.首先,在增广线性系统的基础上,设计了一种用于求解此类线性系统的新型简单预条件子.其次,研究了迭代法的收敛性,并证明了预条件矩阵的所有特征值均是实数且非单位特征值位于某正区间.再次,研究了预条件矩阵的特征向量分布和最小多项式的维数.最后,相关数值实验表明新型预条件子比一些已有的预条件子更有效.     

利用矩阵的初等变换求方阵的特征值

高阶方阵的特征多项式以及特征值的求得,在计算上往往有一定的难度.本文首先从理论上分析了存在一个上三角矩阵或者下三角矩阵与一个方阵相似;接着,提出了相似变换的概念,分析了相似变换中初等矩阵的选择方法;然后指出了利用相似变换在求方阵的特征多项式以及特征值时的方法,并列举若干实例给予了说明.     

二次自伴矩阵多项式阵的特征值

系统地论证了二次自伴矩阵多项式特征值,特征向量的性质.给出了二次自伴矩阵多项式特征值与任一非零向量所对应的二次多项式根之间的大小关系;精确地给出了二次自伴矩阵多项式是负定时参数的界;简化了二次自伴矩阵多项式的符号特征是正(负)的特征值对应特征向量间可以是线性无关等定理的证明.     

SP.n矩阵的分解

J.J．Johnson在1974年给出了P．n．P矩阵的谱性质具有一负特征值的充分条件及P．n矩阵的两个增性质．许多国内同仁也于近几年从分析偏负阵的Schur补入手，从特殊到一般，得到了一系列偏负阵的判定方法．本文在偏负阵判定方法的基础上，专门对偏负阵的分解进行论述，得出了对称偏负阵能进行三角分解和正交分解的充要条件．     

矩阵与其友矩阵相似的一个充要条件及其证明

得到一个矩阵A与其特征多项式的友矩阵C相似的充要条件是对应于A的每个不同的特征值λi,Jordan标准形中只含有一个Jordan子矩阵,并给出证明.     

Pascal三角形与Pascal矩阵

Pascal三角形中隐含着二项系数的许多相关性质 .本文从线性代数的观点研究了 Pascal矩阵的性质及其应用 ,并将这种矩阵推广到了更一般的形式     

A Parallel Algorithm for Toeplitz Triangular Matrices

A new parallel algorithm for inverting Toeplitz triangular matrices as well as solving Toeplitz triangular linear systems is presented in this paper. The algorithm possesses very good parallelism, which can easily be adjusted to match the natural hardware parallelism of the computer systems, that was assumed to be much smaller than the order $n$ of the matrices to be considered since this is the usual case in practical applications. The parallel time complexity of the algorithm is $O([n/p|\log n+\log^2p)$, where $p$ is the hardware parallelism.     

基于三角基的网格形状变形

研究了在散乱数据的三角剖分后对所形成的空间三角形网格进行变形的具体操作算法.首先给出描述三角形网格各顶点空间位置的内在结构矩阵,然后插值于相应的结构矩阵,实现三角形网格之间的形状变形.该文的另一个特点是引入三角基函数作为混合函数,得到了更优的结果.     

Normal dilatation of triangular matrices

LetR be a (real or complex) triangular matrix of ordern, say, an upper triangular matrix. Is it true that there exists a normaln×n matrixA whose upper triangle coincides with the upper triangle ofR? The answer to this question is “yes” and is obvious in the following cases: (1)R is real; (2)R is a complex matrix with a real or a pure imaginary main diagonal, and moreover, all the diagonal entries ofR belong to a straight line. The answer is also in the affirmative (although it is not so obvious) for any matrixR of order 2. However, even forn=3 this problem remains unsolved. In this paper it is shown that the answer is in the affirmative also for 3×3 matrices.     

Low-rank revealing UTV decompositions

A UTV decomposition of an m × n matrix is a product of an orthogonal matrix, a middle triangular matrix, and another orthogonal matrix. In this paper we present and analyze algorithms for computing updatable rank-revealing UTV decompositions that are efficient whenever the numerical rank of the matrix is much less than its dimensions. This revised version was published online in August 2006 with corrections to the Cover Date.     

On absolute summability for double triangle matrices

A lower triangular infinite matrix is called a triangle if there are no zeros on the principal diagonal. The main result of this paper gives a minimal set of sufficient conditions for a double triangle T to be a bounded operator on      

A fast approach to compute fuzzy values of matrix games with payoffs of triangular fuzzy numbers

The aim of this paper is to develop an effective method for solving matrix games with payoffs of triangular fuzzy numbers (TFNs) which are arbitrary. In this method, it always assures that players’ gain-floor and loss-ceiling have a common TFN-type fuzzy value and hereby any matrix game with payoffs of TFNs has a TFN-type fuzzy value. Based on duality theorem of linear programming (LP) and the representation theorem for fuzzy sets, the mean and the lower and upper limits of the TFN-type fuzzy value are easily computed through solving the derived LP models with data taken from 1-cut set and 0-cut set of fuzzy payoffs. Hereby the TFN-type fuzzy value of any matrix game with payoffs of TFNs can be explicitly obtained. Moreover, we can easily compute the upper and lower bounds of any Alfa-cut set of the TFN-type fuzzy value for any matrix game with payoffs of TFNs and players’ optimal mixed strategies through solving the derived LP models at any specified confidence level Alfa. The proposed method in this paper is demonstrated with a numerical example and compared with other methods to show the validity, applicability and superiority.     

三角模糊数互补判断矩阵排序的目标规划法

针对决策者以三角模糊数互补判断矩阵形式给出的多目标决策问题.给出三角模糊数加性一致性互补判断矩阵的判定定理.利用该定理基于最小偏差建立一个目标规划模型而解得三角模糊数互补判断矩阵的权重向量,从而使用三角模糊数排序公式对方案排序,提出了基于目标规划的三角模糊数互补判断矩阵排序法.最后,将模型与方法应用于项目投资决策中.     

Generating and counting triangular systems

Lunnon has defined a triangularp-mino as an edge-connected configuration ofp cells from the triangle plane grid with vertices of degree 6. A triangular system is a triangularp-mino without any holes. On the other hand we can say that a triangular system is a part of a triangular grid with vertices of degree 6, consisting of all edges and vertices of some closed broken lineC without intersections (a circuit in the triangle grid), and all edges and vertices in the interior ofC. It is obvious that any closed broken lineC without intersections uniquely determines a triangular system. In this paper a method of generating triangular systems is presented.