Customizable triangular factorizations of matrices find their applications in computer graphics and lossless transform coding. In this paper, we prove that any N ×N nonsingular matrix A can be factorized into 3 triangular matrices, A = PLUS, where P is a permutation matrix, L is a unit lower triangular matrix, U is an upper triangular matrix of which the diagonal entries are customizable and ca...

Aweighted 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 . Recently Savaş and Rhoades 2 established the correspon...

Let = be a non-negative matrix. Denote by the supremum of those , satisfying the following inequality: where , , and also is increasing, non-negative sequence of real numbers. If we used instead of The purpose of this paper is to establish a Hardy type formula for , where is Hausdorff matrix and A similar result is also established for where In particular, we apply o...

A matrix R is said to be g-row substochastic if Re ≤ e. For X, Y ∈ Mn,m, it is said that X is sglt-majorized by Y , X ≺sglt Y , if there exists an n-by-n lower triangular g-row substochastic matrix R such that X = RY . This paper characterizes all (strong) linear preservers and strong linear preservers of ≺sglt on Rn and Mn,m, respectively.

The Extended Euclidean algorithm for matrix Pade approximants is applied to compute matrix Pade approximants in rectangular full packed format (RFP) if the coefficient matrices of the input matrix polynomial are triangular. The procedure given by Gustavson et al for packing a triangular matrix in rectangular full packed format is applied to pack sequence of lower triangular matrices of a matrix...

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.

This article proposes a direct method for solving three types of integral equations with time delay. By using operational matrix of integration, integral equations can be reduced to a linear lower triangular system which can be directly solved by forward substitution. Numerical examples shows that the proposed scheme have a suitable degree of accuracy.  

This paper is concerned with the problem of finding bounds for the norm of lower triangular matrix operators from [Formula: see text] into [Formula: see text], where [Formula: see text] is the Cesàro weighted sequence space and [Formula: see text] is a non-negative sequence. Also this problem is considered for lower triangular matrix operators from [Formula: see text] into [Formula: see text], ...

this article proposes a direct method for solving three types of integral equations with time delay. by using operational matrix of integration, integral equations can be reduced to a linear lower triangular system which can be directly solved by forward substitution. numerical examples shows that the proposed scheme have a suitable degree of accuracy.