in this paper, we investigate the existence of a positive solution of fully fuzzy linear equation systems. this paper mainly to discuss a new decomposition of a nonsingular fuzzy matrix, the symmetric times triangular (st) decomposition. by this decomposition, every nonsingular fuzzy matrix can be represented as a product of a fuzzy symmetric matrix s and a fuzzy triangular matrix t.

In this paper, we investigate the existence of a positive solution of fully fuzzy linear equation systems. This paper mainly to discuss a new decomposition of a nonsingular fuzzy matrix, the symmetric times triangular (ST) decomposition. By this decomposition, every nonsingular fuzzy matrix can be represented as a product of a fuzzy symmetric matrix S and a fuzzy triangular matrix T.

in this paper, some elementary operations on triangular fuzzynumbers (tfns) are defined. we also define some operations on triangularfuzzy matrices (tfms) such as trace and triangular fuzzy determinant(tfd). using elementary operations, some important properties of tfms arepresented. the concept of adjoints on tfm is discussed and some of theirproperties are. some special types of tfms (e.g. pu...

In this paper, we investigate the existence of a positive solution of fully fuzzy linear equation systems where fuzzy coefficient matrix is a positive matrix. This paper mainly discusses a new decomposition of a nonsingular fuzzy matrix, a symmetric matrix times to a triangular (ST) decomposition. By this decomposition, every nonsingular fuzzy matrix can be represented as a product of a fuzzy s...

In this article, we introduce ST decomposition procedure to solve fully fuzzy linear systems. This paper mainly to discuss a decomposition of non singular fuzzy matrix, Symmetric times triangular(ST) decomposition. Every non singular fuzzy matrix can be represented as a product of symmetric matrix S and triangular matrix T in the form of trapezoidal fuzzy number matrices. By this method, we obt...

In this paper, some elementary operations on triangular fuzzynumbers (TFNs) are defined. We also define some operations on triangularfuzzy matrices (TFMs) such as trace and triangular fuzzy determinant(TFD). Using elementary operations, some important properties of TFMs arepresented. The concept of adjoints on TFM is discussed and some of theirproperties are. Some special types of TFMs (e.g. pu...

In this note, we show that the decomposition group Dec(I) of a zero-dimensional radical ideal I in K[x1, . . . , xn] can be represented as the direct sum of several symmetric groups of polynomials based upon using Gröbner bases. The new method makes a theoretical contribution to discuss the decomposition group of I by using Computer Algebra without considering the complexity. As one application...

We present a family of algorithms for computing symmetric rank-revealing VSV decompositions, based on triangular factorization of the matrix. The VSV decomposition consists of a middle symmetric matrix that reveals the numerical rank in having three blocks with small norm, plus an orthogonalmatrix whose columns span approximations to the numerical range and null space. We show that for semi-de ...

We prove that the diagonally pivoted symmetric LR algorithm on a positive definite matrix is globally convergent. The “symmetric” or “Cholesky” LR iteration is a fairly old method of eigenreduction of a positive definite Hermitian matrix H. It reads H = H0 = R∗ 0R0 H1 = R0R 0 = R ∗ 1R1 .. (1) This process is linearly convergent [6], [5]. Recently, its singular value ’implicit’ equivalent R∗ k =...

This paper studies off-diagonal decay in symmetric Toeplitz matrices. It is shown that if the generating sequence of the matrix is monotone, positive and convex then the monotonicity and positivity are maintained through triangular decomposition. The work is motivated by recent results on explicit bounds for inverses of triangular matrices. © 2005 Elsevier Inc. All rights reserved. AMS classifi...