The matrix equation MA = N is considered. The lgrade of a matrix A is the the largest rank of any subdiagonal block of a symmetric partition of a square matrix. When A has lgrade d, representation results are given for MA = N with M and N having lower bandwidth d. M can be chosen to be lower triangular or unitary. A second result is that if MA = N with M and N have lower bandwidths d M and d N ...

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.

A weighted mean matrix, denoted by (N , pn), is a lower triangular matrix with entries pk/Pn, where {pk} is a nonnegative sequence with p0 > 0, and Pn := ∑n k=0 pk. Mishra and Srivastava [1] obtained sufficient conditions on a sequence {pk} and a sequence {λn} for the series ∑ anPnλn/npn to be absolutely summable by the weighted mean matrix (N , pn). Bor [2] extended this result to absolute sum...

is a Hessenberg matrix and its determinant is F2n+2. Furthermore, a Hessenberg matrix is said to be a Fibonacci-Hessenberg matrix [2] if its determinant is in the form tFn−1 + Fn−2 or Fn−1 + tFn−2 for some real or complex number t. In [1] several types of Hessenberg matrices whose determinants are Fibonacci numbers were calculated by using the basic definition of the determinant as a signed sum...

The usual procedure to compute the determinant is the so-called Gaussian elimination. We can view this as the transformation of the matrix into a lower triangular matrix with column operations. These transformations do not change the determinant but in the triangular matrix, the computation of the determinant is more convenient: we must only multiply the diagonal elements to obtain it. (It is a...

Let L(n)p be the Pascal lower triangular matrix with coefficients `i j ́ (mod p), 0 ≤ i, j < n. In this paper, we found the inverse of L(n)p modulo p. In fact, we generalize a result due to David Callan [4].

In this paper we prove that Neville elimination can be matricially described by elementary matrices. A PLU-factorization is obtained for any n×m matrix, where P is a permutation matrix, L is a lower triangular matrix (product of bidiagonal factors) and U is an upper triangular matrix. This result generalizes the Neville factorization usually applied to characterize the totally positive matrices...

For the all-ones lower triangular matrices, the upper and lower bounds on rigidity are known to match [13]. In this short note, we apply these techniques to the allones extended lower triangular matrices, to obtain upper and lower bounds with a small gap between the two; we show that the rigidity is θ( 2 r ).

In this paper we define multiplication between intuitionistic fuzzy matrices (IFMs) and we derive the conditions for a block IFM to be regular. Also a method to find the generalized inverse of it with the help of the generalized inverses of the blocks of the original matrix is described. Again, it is shown that a block intuitionistic fuzzy matrix can be decomposed into an upper triangular idemp...

This research investigates the implementation mechanism of block-wise ILU(k) preconditioner on GPU. The block-wise ILU(k) algorithm requires both the level k and the block size to be designed as variables. A decoupled ILU(k) algorithm consists of a symbolic phase and a factorization phase. In the symbolic phase, a ILU(k) nonzero pattern is established from the point-wise structure extracted fro...