六类不确定型判断矩阵的相容性研究

介绍区间数互补判断矩阵、区间数互反判断矩阵、区间数混合判断矩阵、三角模糊数互补判断矩阵、三角模糊数互反判断矩阵和三角模糊数混合判断矩阵等概念，给出衡量六类不确定型判断矩阵(区间数互补判断矩阵、区间数互反判断矩阵、区间数混合判断矩阵、三角模糊数互补判断矩阵、三角模糊数互反判断矩阵以及三角模糊数混合判断矩阵)同类型之间相容性的两个通用指标，并给出上述六类不确定型判断矩阵相容性的度量准则，最后进行算例分析。     

关于形式三角矩阵环

本文研究形式三角矩阵环 R 的若干新性质,讨论 R-模的伪投射性,给出了形式三角矩阵环 R 是 V-环或半 V-环的充要条件．同时,给出了 R 是 PS-环的条件．     

基于一致性逼近的三角模糊数互补判断矩阵的排序方法

研究了元素为三角模糊数形式的互补判断矩阵的一致性和排序问题.分析了三角模糊数互补判断矩阵和三角模糊数互反判断矩阵之间的相互转换关系,提出了这两类判断矩阵完全一致性的概念并得到了三角模糊数互补判断矩阵的元素和排序权值之间的关系,在此基础上建立了一个多目标优化模型,通过求解该模型得到三角模糊数互补判断矩阵的排序向量,利用已有的模糊数比较大小公式得到方案的排序,最后给出了一个算例.     

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

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

两类模糊数判断矩阵的转换关系及一致性研究

研究了三角模糊数互反和互补判断矩阵的相互转换和一致性问题.提出了三角模糊数互反判断矩阵完全一致性的定义以及三角模糊数互补判断矩阵加性一致性和乘性一致性的定义,给出了两类模糊数判断矩阵相互转化的公式,论证了转换公式对判断矩阵一致性的保持关系.最后,基于一致性模糊数判断矩阵元素和排序权值的关系,建立了两个方案排序的非线性规划模型.     

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

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

On regularity of block triangular fuzzy matrices

Necessary and sufficient conditions are given for the regularity of block triangular fuzzy matrices. This leads to characterization of idempotency of a class of triangular Toeplitz matrices. As an application, the existence of group inverse of a block triangular fuzzy matrix is discussed. Equivalent conditions for a regular block triangular fuzzy matrix to be expressed as a sum of regular block fuzzy matrices is derived. Further, fuzzy relational equations consistency is studied.     

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

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

不确定多属性决策中的一种模糊赋权方法

研究了以三角模糊数给出属性权重的不确定多属性决策问题,提出了一种基于三角模糊数的赋权方法,并给出了决策模型.首先决策者将属性权重两两比较的结果用三角模糊数表示,构造三角模糊数互补判断矩阵.通过求解矩阵得到模糊权重.然后,集结各方案的模糊综合属性值,通过构造并求解可能度矩阵对方案进行排序.最后给出了一个应用实例.     

三角模糊数判断矩阵理论及排序方法研究

由于三角模糊数运算的复杂性和特殊性,许多经典判断矩阵的理论并非完全适用于三角模糊数判断矩阵.首先指出目前文献中三角模糊数判断矩阵排序向量研究中存在的问题,并对经典判断矩阵的理论和性质在三角模糊数中是否完全适用进行了证明,然后基于已经证明在三角模糊数判断矩阵所适用的性质,分别建立了最小二乘法的三角模糊数互反互补判断矩阵目标优化模型,通过求解其模型可得到矩阵的权重向量,最后利用已有的三角模糊数排序公式求得决策结果.算例分析验证了该方法的正确性和有效性.     

An internal characterisation of structural matrix rings

It is known that structural matrix rings pro-vide a natural passage from complete matrix rings to upper and lower triangular matrix rings, and they often explain the peculiarities regarding certain properties of complete matrix rings on the one hand and of triangular matrix rings on the other hand. In this paper the concept of a set of matrix units in a ring associated with a quasi-order relation is introduced and used to provide an internal char-acterisation of structural matrix rings.     

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

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

基于优势度分析的三角模糊数判断矩阵的排序方法

研究了三角模糊数判断矩阵的排序问题,在两个三角模糊数相互比较大小的可能度的基础上,综合分析直接和间接两个方面的比较因素,提出了两个三角模糊数比较的优势度概念.对三角模糊数判断矩阵的行元素信息进行集结并利用所定义的优势度概念作为度量对集结的结果两两进行比较,构造出相应的以实数表示的模糊互补优势度矩阵,进而利用模糊互补判断矩阵的排序公式得到方案的排序权值.最后通过一个算例说明了提出的排序方法.     

Inverting linear combinations of identity and generalized Catalan matrices

We introduce the notion of the generalized Catalan matrix as a kind of lower triangular Toeplitz matrix whose nonzero elements involve the generalized Catalan numbers. Inverse of the linear combination of the Pascal matrix with the identity matrix is computed in Aggarwala and Lamoureux (2002) [1]. In this paper, continuing this idea, we invert various linear combinations of the generalized Catalan matrix with the identity matrix. A simple and efficient approach to invert the Pascal matrix plus one in terms of the Hadamard product of the Pascal matrix and appropriate lower triangular Toeplitz matrices is considered in Yang and Liu (2006) [14]. We derive representations for inverses of linear combinations of the generalized Catalan matrix and the identity matrix, in terms of the Hadamard product which includes the Generalized Catalan matrix and appropriate lower triangular Toeplitz matrix.     

Triangular truncation and its extremal matrices

The triangular truncation operator is a linear transformation that maps a given matrix to its strictly lower triangular part. The operator norm (with respect to the matrix spectral norm) of the triangular truncation is known to have logarithmic dependence on the dimension, and such dependence is usually illustrated by a specific Toeplitz matrix. However, the precise value of this operator norm as well as on which matrices can it be attained is still unclear. In this article, we describe a simple way of constructing matrices whose strictly lower triangular part has logarithmically larger spectral norm. The construction also leads to a sharp estimate that is very close to the actual operator norm of the triangular truncation. This research is directly motivated by our studies on the convergence theory of the Kaczmarz type method (or equivalently, the Gauß‐Seidel type method), the corresponding application of which is also included. Copyright © 2016 John Wiley & Sons, Ltd.     

Triangular Matrix Representations

In this paper we develop the theory of generalized triangular matrix representation in an abstract setting. This is accomplished by introducing the concept of a set of left triangulating idempotents. These idempotents determine a generalized triangular matrix representation for an algebra. The existence of a set of left triangulating idempotents does not depend on any specific conditions on the algebras; however, if the algebra satisfies a mild finiteness condition, then such a set can be refined to a “complete” set of left triangulating idempotents in which each “diagonal” subalgebra has no nontrivial generalized triangular matrix representation. We then apply our theory to obtain new results on generalized triangular matrix representations, including extensions of several well known results.     

Polynomial functions on upper triangular matrix algebras

There are two kinds of polynomial functions on matrix algebras over commutative rings: those induced by polynomials with coefficients in the algebra itself and those induced by polynomials with scalar coefficients. In the case of algebras of upper triangular matrices over a commutative ring, we characterize the former in terms of the latter (which are easier to handle because of substitution homomorphism). We conclude that the set of integer-valued polynomials with matrix coefficients on an algebra of upper triangular matrices is a ring, and that the set of null-polynomials with matrix coefficients on an algebra of upper triangular matrices is an ideal.     

Convergence of skew-symmetric iterative methods

We propose a new technique for studying the convergence of triangular skew-symmetric and product triangular skew-symmetric iterative methods (introduced earlier by the first author) based on the notion of a field of values of a matrix. We obtain formulas connecting the field of values of the initial matrix, that of the matrix which determines the iterative method, and eigenvalues of the iterative matrix. We prove that the mentioned methods can converge even if the initial matrix is not dissipative.     

交换环上三角矩阵模间的线性保持映射(英文)

本文研究了交换环上三角矩阵模间的线性保持问题.利用矩阵计算技巧和局部化技巧,刻画了上三角矩阵T_n(R)上分别保持立方幂等,{1}逆,{1,2}逆和群逆的所有R模自同构集合中的元素,其中R是交换环.