This research introduces a row compression and nested product decomposition of an n × n hierarchical representation of a rank structured matrix A, which extends the compression and nested product decomposition of a quasiseparable matrix. The hierarchical parameter extraction algorithm of a quasiseparable matrix is efficient, requiring only O(nlog(n)) operations, and is proven backward stable. T...

Let H be an m × n real matrix and let Zi be the set of column indices of the zero entries of row i of H. Then the conditions |Zk ∩ ∪k−1 i 1 Zi | ≤ 1 for all k 2 ≤ k ≤ m are called the row Zero Position Conditions ZPCs . If H satisfies the ZPC, then H is said to be a row ZPC matrix. If H satisfies the ZPC, thenH is said to be a column ZPCmatrix. The real matrixH is said to have a zero cycle if H...

As one can see, without several examples worked out with a pencil and paper, this formal definition is not very insightful. To understand where restricted patterns really originated from, we draw on visual imagery and replace “one-dimensional” permutations by “twodimensional” objects, matrices. In doing so, we shall violate the customary labeling of the top row as the “first” row of a matrix. I...

in this paper, a numerical method for nding minimal solution of a mn fullyfuzzy linear system of the form ax = b based on pseudo inverse calculation,is given when the central matrix of coecients is row full rank or column fullrank, and where a~ is a non-negative fuzzy mn matrix, the unknown vectorx is a vector consisting of n non-negative fuzzy numbers and the constant b isa vector consisti...

We consider the double-row (open) transfer matrix constructed from generic representations of various types of Hecke algebras. For different choices of boundary conditions for the relevant integrable lattice model we express the double-row transfer matrix solely in terms of generators of the corresponding Hecke algebra. We then expand the open transfer matrix and extract the associated Murphy e...

In this paper we study the class of m-row matrix compositions (m-compositions, for short), i.e., m-row matrices with nonnegative integer entries in which every column has at least one non-zero element. We provide several enumerative results, various combinatorial identities, and some combinatorial interpretations. Most of these properties are an extension to matrix compositions of the combinato...

We prove an existence and uniqueness theorem for row-finite initial value problems. The right-hand side of the differential equation is supposed to satisfy a one-sided matrix Lipschitz condition with a quasimonotone row-finite matrix which has an at most countable spectrum.

Utilizing the concept of Perron complement, a new estimate for the spectral radius of a nonnegative irreducible matrix is presented. A new matrix is derived that preserves the spectral radius while its minimum row sum increases and its maximum row sum decreases. Numerical examples are provided to illustrate the effectiveness of this approach.