Abstract. Let Mn;m be the set of n-by-m matrices with entries inthe field of real numbers. A matrix R in Mn = Mn;n is a generalizedrow substochastic matrix (g-row substochastic, for short) if Re e, where e = (1; 1; : : : ; 1)t. For X; Y 2 Mn;m, X is said to besgut-majorized by Y (denoted by X sgut Y ) if there exists ann-by-n upper triangular g-row substochastic matrix R such thatX = RY . This ...

In this paper, for an arbitrary multiplicative functional f from the set of all upper triangular fuzzy matrices to the fuzzy algebra, we prove that there exist a multiplicative functional F and a functional G from the fuzzy algebra to the fuzzy algebra such that the image of an upper triangular fuzzy matrix under f can be represented as the product of all the images of its main diagonal element...

Nakajima conjectured in [N] that the transition matrix between certain PBW-basis constructed in [LXZ] and the affine canonical basis is upper triangular with the diagonal entries equal to one and the upper diagonal entries in vZ[v]. In this paper, we show that the transition matrix between the PBW-basis in [LXZ] and the canonical basis is upper triangular with the diagonal entries equal to one ...

Given a complex matrix H, we consider the decomposition H = QRP∗, where R is upper triangular and Q and P have orthonormal columns. Special instances of this decomposition include the singular value decomposition (SVD) and the Schur decomposition where R is an upper triangular matrix with the eigenvalues of H on the diagonal. We show that any diagonal for R can be achieved that satisfies Weyl’s...

This contribution considers the problem of transforming a regular matrix pair (A;B) to generalized Schur form. The focus is on blocked algorithms for the reduction process that typically includes two major steps. The rst is a two-stage reduction of a regular matrix pair (A;B) to condensed form (H;T ) using orthogonal transformations Q and Z such that H = QAZ is upper Hessenberg and T = QBZ is u...

This paper proposes a new method for finding fuzzy weights in the fuzzy analytic hierarchy process (FAHP), which fuzzifies the derived formulation of an eigenvector directly. The presented formulation only needs information about the upper triangular matrix and the assumption about the reciprocal matrix is not necessary. This characteristic makes the FAHP feasible because the property of recipr...