三阶单位上三角非负矩阵

根据矩阵分解性质及原子间的乘积关系,首先探究了单位上三角非负矩阵的原子因式分解性质,然后给出了任意单位上三角非负矩阵A的最小原子因式分解长度l(A)的计算公式,并得到了A具有最小的原子因式分解长度的其中一种分解,从而完善了相关文献中的结果.     

四元数矩阵的广义Schmidt分解与广酉空间中向量组的广义标准正交化

推广了四元数矩阵的Schmidt分解及广酉空间中向量组的标准正交化问题，给出了实四元数矩阵分解为广酉矩阵与生对角元全正的上三角阵乘积的实用方法．     

可换环上上三角矩阵代数的若当自同构分解(英文)

设R是含单位元1和可逆元2的可换环,Tn+1(R)表示R上(n+1)×(n+1)级上三角矩阵全体所形成的矩阵代数.本文证明了T(R)的每一个若当自同构都可唯一的分解为图自同构,内自同构和对角自同构的乘积.     

Toeplitz型矩阵的逆矩阵的快速三角分解算法

针对有关“型”矩阵的三角分解问题 ,提出了一种 Toeplitz型矩阵的逆矩阵的快速三角分解算法 .首先假设给定 n阶非奇异矩阵 A,利用一组线性方程组的解 ,得到 A- 1的一个递推关系式 ,进而利用该关系式得到 A- 1的一种三角分解表达式 ,然后从 Toeplitz型矩阵的特殊结构出发 ,利用上述定理的结论 ,给出了Toeplitz型矩阵的逆矩阵的一种快速三角分解算法 ,算法所需运算量为 O( mn2 ) .最后 ,数值计算表明该算法的可靠性 .     

复矩阵截断奇异值分解的一类混合算法

截断奇异值分解是一类非常重要的矩阵分解,其在病态模型问题分析等领域有广泛的应用.该文主要研究复矩阵截断奇异值分解的有效算法,将问题转化为复Stiefel乘积流形上的黎曼优化问题,进而设计基于乘积流形的黎曼混合牛顿法求解.为有效求解黎曼牛顿方程,从降低系统维数和简化计算入手,通过克罗内克积和复矩阵拉直算子将其转化为易于求解的标准实对称线性方程组.数值实验和数值比较验证该文所提算法针对复矩阵截断奇异值分解问题是高效可行的.     

范德蒙类矩阵与合流范德蒙矩阵的行列式

利用递推的方法给出了范德蒙类矩阵与合流范德蒙矩阵的行列式.     

层次分析正互反矩阵的Hadamard乘积分析法

定义了标准形 ～ 型 ,并指出任一正互反矩阵可唯一分解为任一种标准形和一个一致性矩阵的Hadamard乘积 .     

一个特殊的二项系数

利用发生函数和矩阵方法,研究了一个特殊的二项式系数[n λ n-k]和它所构成的矩阵.得到以[n λ n-k]为矩阵元素的Pascal型矩阵的指数分解和乘积分解公式.同时,考察了与二项式型多项式相伴的函数矩阵Pn,λ[x]及其性质.     

环境激励下基于柔度矩阵分解的损伤诊断

为了解决环境激励作用下结构自由度不完备对损伤诊断的影响,提出了一种基于自由度缩聚的比例柔度矩阵分解损伤诊断法.利用附加质量法求解出环境激励作用下振型关于质量归一化因子.进而根据质量归一化因子和比例柔度矩阵系数之间的关系,构建出其比例柔度矩阵,再通过使用QR矩阵分解法对构建出的比例柔度矩阵进行分解.以分解后得到的三角矩阵...     

r-对称循环矩阵及逆矩阵三角分解的快速算法

根据r-对称循环矩阵的特殊结构给出了求这类矩阵本身及其逆矩阵三角分解的快速算法,算法的运算量均为O(n2),一般矩阵及逆矩阵三角分解的运算量均为O(n3).     

Inherited LU-factorizations of matrices

Various types of LU-factorizations for nonsingular matrices, where L is a lower triangular matrix and U is an upper triangular matrix, are defined and characterized. These types of LU-factorizations are extended to the general m × n case. The more general conditions are considered in the light of the structures of [C.R. Johnson, D.D. Olesky, P. Van den Driessche, Inherited matrix entries: LU factorizations, SIAM J. Matrix Anal. Appl. 10 (1989) 99-104]. Applications to graphs and adjacency matrices are investigated. Conditions for the product of a lower and an upper triangular matrix to be the zero matrix are also obtained.     

保持交换环上两类矩阵运算的映射

主要针对交换环上两类矩阵的保持问题进行展开:(1)刻画了交换环上全矩阵空间和上三角形矩阵空间的保持反对合矩阵映射的形式.(2)研究了交换环上n阶上三角形矩阵空间的保持伴随矩阵映射的形式.     

A note on inversion of Toeplitz matrices

It is shown that the invertibility of a Toeplitz matrix can be determined through the solvability of two standard equations. The inverse matrix can be denoted as a sum of products of circulant matrices and upper triangular Toeplitz matrices. The stability of the inversion formula for a Toeplitz matrix is also considered.     

Block LU-factorization of confluent Vandermonde matrices

In this note we show that an asymptotically fast algorithm may be designed in order to realize a block LU-factorization of confluent Vandermonde matrices. This result is based on a displacement structure satisfied by confluent Vandermonde matrices and on factorizations of the block elements in terms of triangular Toeplitz matrices.     

On inverses of Vandermonde and confluent Vandermonde matrices III

Summary We derive lower bounds for the norm of the inverse Vandermonde matrix and the norm of certain inverse confluent Vandermonde matrices. They supplement upper bounds which were obtained in previous papers.Sponsored in part by the United States Army under Contract No. DAAG29-75-C-0024 and the National Science Foundation under grant MCS 76-00842A01     

Riesz points of upper triangular operator matrices

Two results are proved which concern Riesz points of upper triangular operator matrices. Applications are made to questions involving when Weyl's Theorem holds for an upper triangular operator matrix.

     

Solving confluent Vandermonde systems of Hermite type

In this paper the authors develop two algorithms to solve systems of linear equations where the coefficients form a confluent Vandermonde matrix of Hermite type, or its transpose. These algorithms reduce the given system to upper triangular form by means of elementary matrix transformations. Recursive formulas to obtain the upper triangular form in an economical way are derived. Applications and numerical results are included.Algol-60 programs are appended.     

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.     

Filtrations of Totally Reflexive Modules

In this paper, we introduce a subcategory of totally reflexive modules that have a saturated filtration by other totally reflexive modules. We will prove these are precisely the totally reflexive modules with an upper triangular presentation matrix and that such a module has a complete resolution in which every differential can be simultaneously represented by upper triangular matrices.     

Numerical treatment of a generalized Vandermonde system of equations

A stable method is proposed for the numerical solution of a linear system of equations having a generalized Vandermonde matrix. The method is based on Gaussian elimination and establishes explicit expressions for the elements of the resulting upper triangular matrix. These elements can be computed by means of sums of exclusively positive terms. In an important special case these sums can be reduced to simple recursions. Finally the method is retraced for the case of a confluent type of generalized Vandermonde matrix.