矩阵初等变换的推广及其应用

矩阵的初等变换及矩阵的分块是矩阵理论中的两个重要方法，本将初等变换推广到分块矩阵上去，在引进了准初等变换概念后，证明了它的某些性质，本的目的在于简化某些矩阵运算，并希望本建立的概念与结论得到更加广泛的应用。     

分块矩阵的初等变换

本文将矩阵的初等变换的概念推广到分块矩阵上并建立了计算分块矩阵的逆矩阵和分块方阵的行列式的若干简易方法．     

分块矩阵的初等变换

本将矩阵的初等变换的概念推广到分块矩阵上并建立了计算分块矩阵的逆矩阵和分块方阵的行列式的若干简易方法。     

高等代数中一道习题的推广

利用分块矩阵及其初等变换将一类矩阵秩的等式推广.     

矩阵的分块初等变换与分块初等阵及其应用

讨论了矩阵分块初等变换和分块初等阵的定义和性质,利用这一工具研究了行列式的分块运算,分块矩阵的求逆和对称阵的分块合同变换等问题.     

关于矩阵秩(不)等式的分块矩阵构造证明

利用构造分块矩阵并通过广义初等变换的方法,证明矩阵秩的（不）等式．     

分块初等变换及应用

<正> 对分块矩阵施行下面三种变换称为分块矩阵的初等变换,简称矩阵A 的分块初等变换:(i)对调两行(列);(ii)以可逆矩阵左乘(右乘)某一行(列)所有元素(要求可乘性);(iii)把某一行(列)所有元素左乘(右乘)某一矩阵再加到另一行(列)对应的元素上去(要求可加性、可乘     

关于分块反循环矩阵及其对角化的讨论

本文给出了分块反循环矩阵的概念，讨论了含分块反循环矩阵的相似类，并且得知分块反循环矩阵一定与分块循环矩阵相似．     

矩阵的块初等变换及其应用

<正> 矩阵的初等变换是矩阵变换的一个基本方法,在线性代数这门基础课程中占有一定的地位,有不少的应用。作为这一方法的推广,矩阵的块初等变换在应用十分广泛的分块矩阵中同样起着重要作用,可以方便地解决其他方法难以解决的问题。     

用分块矩阵求合同与求逆

关于矩阵求合同,或二次型标准化,多数教材采用配方、矩阵初等变换,矩阵的正交相似等方法谋求解决.为了活跃解题思路,本文充分利用分块矩阵的方法以求矩阵合同与矩阵的逆阵. 首先把后面用到的简单事实引证如下:     

相似变换阵与合同变换阵的初等变换求法

引入初等相似变换与初等合同变换 ,使化方阵为 Jordan标准形的同时求得相似变换阵 ,化实对称阵为对角阵的同时求得合同变换阵 .算法易于理解 ,计算量较小 .     

求矩阵最小多项式的初等变换方法

分别给出计算矩阵的最小多项式和向量关于矩阵的最小多项式的初等变换方法 .     

On tridiagonal matrices unitarily equivalent to normal matrices

In this article the unitary equivalence transformation of normal matrices to tridiagonal form is studied.It is well-known that any matrix is unitarily equivalent to a tridiagonal matrix. In case of a normal matrix the resulting tridiagonal inherits a strong relation between its super- and subdiagonal elements. The corresponding elements of the super- and subdiagonal will have the same absolute value.In this article some basic facts about a unitary equivalence transformation of an arbitrary matrix to tridiagonal form are firstly studied. Both an iterative reduction based on Krylov sequences as a direct tridiagonalization procedure via Householder transformations are reconsidered. This equivalence transformation is then applied to the normal case and equality of the absolute value between the super- and subdiagonals is proved. Self-adjointness of the resulting tridiagonal matrix with regard to a specific scalar product is proved. Properties when applying the reduction on symmetric, skew-symmetric, Hermitian, skew-Hermitian and unitary matrices and their relations with, e.g., complex symmetric and pseudo-symmetric matrices are presented.It is shown that the reduction can then be used to compute the singular value decomposition of normal matrices making use of the Takagi factorization. Finally some extra properties of the reduction as well as an efficient method for computing a unitary complex symmetric decomposition of a normal matrix are given.     

Trace inequalities for products of matrices

In this short paper, we study some trace inequalities of the products of the matrices and the power of matrices by the use of elementary calculations.     

矩阵乘积的初等变换术及其应用

通过矩阵乘法运算的拆行拆列表示,巧妙地绕过初等矩阵,建立了矩阵乘积的初等变换术,进而导出了原来运用初等矩阵才能导出的有关初等变换、逆矩阵、矩阵方程、矩阵等价的若干重要结果.     

Generalized Leibniz functional matrices and factorizations of some well-known matrices

In this paper, we introduce the generalized Leibniz functional matrices and study some algebraic properties of such matrices. To demonstrate applications of these properties, we derive several novel factorization forms of some well-known matrices, such as the complete symmetric polynomial matrix and the elementary symmetric polynomial matrix. In addition, by applying factorizations of the generalized Leibniz functional matrices, we redevelop the known results of factorizations of Stirling matrices of the first and second kind and the generalized Pascal matrix.     

Variations on the Theorem of Birkhoff – von Neumann and Extensions

 The theorem of Birkhoff – von Neumann concerns bistochastic matrices (i.e., matrices with nonnegative real entries such that all row sums and all column sums are equal to one). We consider here real matrices with entries unrestricted in sign and we extend the notion of permutation matrices (integral bistochastic matrices); some generalizations of the theorem are derived by using elementary properties of graph theory. Received: October 10, 2000 Final version received: April 11, 2002     

实四元数矩阵行列式函数的几点注记

分别对实四元数矩阵理论中出现的几种行列式函数在三个初等变换下的改变性作一些讨论,得出几种满足一定性质的行列式函数的不存在性或唯一存在性。     

Some geometrical aspects of semidefinite linear complementarity problems

This article studies some geometrical aspects of the semidefinite linear complementarity problem (SDLCP), which can be viewed as a generalization of the well-known linear complementarity problem (LCP). SDLCP is a special case of a complementarity problem over a closed convex cone, where the cone considered is the closed convex cone of positive semidefinite matrices. It arises naturally in the unified formulation of a pair of primal-dual semidefinite programming problems. In this article, we introduce the notion of complementary cones in the semidefinite setting using the faces of the cone of positive semidefinite matrices and show that unlike complementary cones induced by an LCP, semidefinite complementary cones need not be closed. However, under R₀-property of the linear transformation, closedness of all the semidefinite complementary cones induced by L is ensured. We also introduce the notion of a principal subtransformation with respect to a face of the cone of positive semidefinite matrices and show that for a self-adjoint linear transformation, strict copositivity is equivalent to strict semimonotonicity of each principal subtransformation. Besides the above, various other solution properties of SDLCP will be interpreted and studied geometrically.