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

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

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

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

Similarity of block diagonal and block triangular matrices

It is shown that if a block triangular matrix is similar to its block diagonal part, then the similarity matrix can be chosen of the block triangular form. An analogous statement is proved for equivalent matrices. For the simplest case of 2×2 block matrices these results were obtained by W.Roth [1]. It is shown that all these results do not admit a generalization for the infinite dimensional case.     

Rotated block triangular preconditioning based on PMHSS

Based on the PMHSS preconditioning matrix, we construct a class of rotated block triangular preconditioners for block two-by-two matrices of real square blocks, and analyze the eigen-properties of the corresponding preconditioned matrices. Numerical experiments show that these rotated block triangular preconditioners can be competitive to and even more efficient than the PMHSS pre-conditioner when they are used to accelerate Krylov subspace iteration methods for solving block two-by-two linear systems with coefficient matrices possibly of nonsymmetric sub-blocks.     

Generalized fuzzy matrices

We give a systematic development of fuzzy matrix theory. Many of our results generalize to matrices over the two element Boolean algebra, over the nonnegative real numbers, over the nonnegative integers, and over the semirings, and we present these generalizations. Our first main result is that while spaces of fuzzy vectors do not have a unique basis in general they have a unique standard basis, and the cardinality of any two bases are equal. Thus concepts of row and column basis, row and column rank can be defined for fuzzy matrices. Then we study Green's equivalence classes of fuzzy matrices. New we give criteria for a fuzzy matrix to be regular and prove that the row and column rank of any regular fuzzy matrix are equal. Various inverses are also studied. In the next section, we obtain bounds for the index and period of a fuzzy matrix.     

Polynomial stability of semigroups generated by operator matrices

In this paper, we study the stability properties of strongly continuous semigroups generated by block operator matrices. We consider triangular and full operator matrices whose diagonal operator blocks generate polynomially stable semigroups. As our main results, we present conditions under which also the semigroup generated by the operator matrix is polynomially stable. The theoretical results are used to derive conditions for the polynomial stability of a system consisting of a two-dimensional and a one-dimensional damped wave equation.     

半环上矩阵的秩和坡上矩阵可逆的条件

研究了交换半环上矩阵的秩和坡上矩阵的可逆条件.利用Beasley的引理以及不变式,获得了交换半环上正则矩阵的行秩、列秩与Schein秩三者相等,以及坡上矩阵可逆的充要条件.推广模糊代数和分配格上矩阵的结果.     

Rank decomposition in zero pattern matrix algebras

For a block upper triangular matrix, a necessary and sufficient condition has been given to let it be the sum of block upper rectangular matrices satisfying certain rank constraints; see H.Bart, A.P.M.Wagelmans (2000). The proof involves elements from integer programming and employs Farkas’ lemma. The algebra of block upper triangular matrices can be viewed as a matrix algebra determined by a pattern of zeros. The present note is concerned with the question whether the decomposition result referred to above can be extended to other zero pattern matrix algebras. It is shown that such a generalization does indeed hold for certain digraphs determining the pattern of zeros. The digraphs in question can be characterized in terms of forests, i.e., disjoint unions of rooted trees.     

Analysis of incomplete factorizations for a nine-point approximation to a convection–diffusion model problem

We study the stability of zero-fill incomplete LU factorizations of a nine-point coefficient matrix arising from a high-order compact discretisation of a two-dimensional constant-coefficient convection–diffusion problem. Nonlinear recurrences for computing entries of the lower and upper triangular matrices are derived and we show that the sequence of diagonal entries of the lower triangular factor is unconditionally convergent. A theoretical estimate of the limiting value is derived and we show that this estimate is a good predictor of the computed value. The unconditional convergence of the diagonal sequence of the lower triangular factor to a positive limit implies that the incomplete factorization process never encounters a zero pivot and that the other diagonal sequences are also convergent. The characteristic polynomials associated with the lower and upper triangular solves that occur during the preconditioning step are studied and conditions for the stability of the triangular solves are derived in terms of the entries of the tridiagonal matrices appearing in the lower and upper subdiagonals of the block triangular system matrix and a triplet of parameters which completely determines the solution of the nonlinear recursions. Results of ILU-preconditioned GMRES iterations and the effects of orderings on their convergence are also described.     

Valuations with preassigned proximity relations

We characterize the infinite upper triangular matrices (which we call formal proximity matrices) that can arise as proximity matrices associated with zero-dimensional valuations dominating regular noetherian local rings. In particular, for every regular noetherian local ring R of the appropriate dimension, we give a sufficient condition for such a formal proximity matrix to be the proximity matrix associated with a real rank one valuation dominating R. Furthermore, we prove that in the special case of rational function fields, each formal proximity matrix arises as the proximity matrix of a valuation whose value group is computable from the formal proximity matrix. We also give an example to show that this is false for more general fields. Finally in the case of characteristic zero, our constructions can be seen as a particular case of a structure theorem for zero-dimensional valuations dominating equicharacteristic regular noetherian local rings.     

Reduction of matrix polynomials to a special quasitriangular form

We find necessary and sufficient conditions for polynomials with matrix coefficients over an arbitrary field to be reducible via a similarity transformation to block triangular form with regular diagonal blocks of maximum degree. Translated fromMatematichni Metody i Fiziko-Mekhanichni Polya, Vol. 38, 1995.     

On algebras of Toeplitz fuzzy matrices

In this paper, necessary and sufficient conditions are given for a product of Toeplitz fuzzy matrices to be Toeplitz. As an application, a criterion for normality of Toeplitz fuzzy matrices is derived and conditions are deduced for symmetric idempotency of Toeplitz fuzzy matrices. We discuss similar results for Hankel fuzzy matrices. Keywords: Fuzzy matrix, Toeplitz and Hankel matrices.     

Block LU factorizations of M–matrices

Summary. It is well known that any nonsingular M–matrix admits an LU factorization into M–matrices (with L and U lower and upper triangular respectively) and any singular M–matrix is permutation similar to an M–matrix which admits an LU factorization into M–matrices. Varga and Cai establish necessary and sufficient conditions for a singular M–matrix (without permutation) to allow an LU factorization with L nonsingular. We generalize these results in two directions. First, we find necessary and sufficient conditions for the existence of an LU factorization of a singular M-matrix where L and U are both permitted to be singular. Second, we establish the minimal block structure that a block LU factorization of a singular M–matrix can have when L and U are M–matrices. Received November 21, 1994 / Revised version received August 4, 1997     

基于不确定互补判断矩阵的多目标决策方法研究

针对多目标决策中两种不确定互补判断矩阵形式(区间数互补判断矩阵与三角模糊数互补判断矩阵),给出了各自的模型及其排序方法,并对一些方法进行了推广,提出了一些模型的新方法,为不确定互补判断矩阵排序方法的进一步研究奠定了基础.     

Analytic Classification of Fuchsian Singular Points

We study the local analytic classification of Fuchsian singular points. The resonance formal normal form (FNF) of a system with a Fuchsian singular point, as well as the local analytic equivalence of a system to its resonance FNF, is well known. However, there are distinct resonance FNFs locally analytically equivalent to each other. The main theorem of the paper reduces the problem of local analytic equivalence of resonance FNFs to a problem about conjugacy of certain matrices associated to two FNFs (which are nil-triangular) by a block upper triangular matrix. As a consequence, the local analytic classification of Fuchsian singular points reduces to the study of the orbits of the group of block upper triangular matrices on nil-triangular matrices by conjugation.     

三角模糊数互补判断矩阵的一种排序方法

给出三角模糊数互补判断矩阵的概念及三角模糊数相互比较的可能度公式 ,提出一种基于可能度的三角模糊数互补判断矩阵排序方法 ,通过算例说明该方法的可行性和有效性。     

Fast Structured Matrix Computations: Tensor Rank and Cohn–Umans Method

We discuss a generalization of the Cohn–Umans method, a potent technique developed for studying the bilinear complexity of matrix multiplication by embedding matrices into an appropriate group algebra. We investigate how the Cohn–Umans method may be used for bilinear operations other than matrix multiplication, with algebras other than group algebras, and we relate it to Strassen’s tensor rank approach, the traditional framework for investigating bilinear complexity. To demonstrate the utility of the generalized method, we apply it to find the fastest algorithms for forming structured matrix–vector product, the basic operation underlying iterative algorithms for structured matrices. The structures we study include Toeplitz, Hankel, circulant, symmetric, skew-symmetric, f-circulant, block Toeplitz–Toeplitz block, triangular Toeplitz matrices, Toeplitz-plus-Hankel, sparse/banded/triangular. Except for the case of skew-symmetric matrices, for which we have only upper bounds, the algorithms derived using the generalized Cohn–Umans method in all other instances are the fastest possible in the sense of having minimum bilinear complexity. We also apply this framework to a few other bilinear operations including matrix–matrix, commutator, simultaneous matrix products, and briefly discuss the relation between tensor nuclear norm and numerical stability.     

A note on block preconditioner for generalized saddle point matrices with highly singular (1,1) block

In this paper, we present a block triangular preconditioner for generalized saddle point matrices whose coefficient matrices have singular (1,1) blocks. Theoretical analysis shows that all the eigenvalues of the preconditioned matrix are strongly clustered when choosing an optimal parameter. Numerical experiments are given to demonstrate the efficiency of the presented preconditioner.     

Canonical Forms for Symmetric and Regular Structures

Matrices associated with symmetric and regular structures can be arranged into certain block patterns known as Canonical forms. Using such forms, the decomposition of structural matrices into block diagonal forms, is considerably simplified. In this paper the main canonical forms are reviewed; and symmetric/regular structural configurations that can be explained with such forms are investigated. The invariant subspaces are formulated and the closed form solutions for the block-diagonalized stiffness matrices are provided in each case. Utility and robustness of the canonical forms in the analysis of structures exhibiting decomposable matrix patterns are demonstrated by numerous examples. Furthermore, a numerical method is proposed to extend the computational advantages of the matrix canonical forms to other nonconforming regular structures.     

Block diagonalization and LU-equivalence of Hankel matrices

This article presents a new algorithm for obtaining a block diagonalization of Hankel matrices by means of truncated polynomial divisions, such that every block is a lower Hankel matrix. In fact, the algorithm generates a block LU-factorization of the matrix. Two applications of this algorithm are also presented. By the one hand, this algorithm yields an algebraic proof of Frobenius’ Theorem, which gives the signature of a real regular Hankel matrix by using the signs of its principal leading minors. On the other hand, the close relationship between Hankel matrices and linearly recurrent sequences leads to a comparison with the Berlekamp–Massey algorithm.