This paper describes Householder reduction of a rectangular sparse matrix to small band upper triangular form Bk+1. Bk+1 is upper triangular with nonzero entries only on the diagonal and on the nearest k superdiagonals. The algorithm is similar to the Householder reduction used as part of the standard dense SVD computation. For the sparse “lazy” algorithm, matrix updates are deferred until a ro...

We study the realizability over R of representations of the group U(n) of upper-triangular n× n matrices over F2. We prove that all the representations of U(n) are realizable over R if n ≤ 12, but that if n ≥ 13, U(n) has representations not realizable over R. This theorem is a variation on a result that can be obtained by combining work of J. Arregi and A. Vera-López and of the authors, but th...

For little q-Jacobi polynomials, q-Hahn polynomials and big q-Jacobi polynomials we give particular q-hypergeometric series representations in which the termwise q = 0 limit can be taken. When rewritten in matrix form, these series representations can be viewed as decompositions into a lower triangular matrix times upper triangular matrix. We develop a general theory of such decompositions rela...

In this paper we study the impact of two types of preconditioning on the numerical solution of large sparse augmented linear systems. The first preconditioning matrix is the lower triangular part whereas the second is the product of the lower triangular part with the upper triangular part of the augmented system’s coefficient matrix. For the first preconditioning matrix we form the Generalized ...

It is shown that the invertibility of a Toeplitz matrix can be determined through the solvability of two standard equations. The inverse matrix can be denoted as a sum of products of circulant matrices and upper triangular Toeplitz matrices. The stability of the inversion formula for a Toeplitz matrix is also considered. c © 2007 Elsevier Ltd. All rights reserved.

A scaled version of the lower and the upper triangular factors of the inverse of the Vandermonde matrix is given. Two applications of the q-Pascal matrix resulting from the factorization of the Vandermonde matrix at the q-integer nodes are introduced. c © 2007 Elsevier Ltd. All rights reserved.

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 work, we show that for linear upper triangular systems of differential equations, we can use the diagonal entries to obtain the Sacker and Sell, or Exponential Dichotomy, and also –under some restrictions– the Lyapunov spectral intervals. Since any bounded and continuous coeficient matrix function can be smoothly transformed to an upper triangular matrix function, our results imply that...

We propose a method based on Cholesky decomposition for Non-negative Matrix Factorization (NMF). NMF enables to learn local representation due to its non-negative constraint. However, when utilizing NMF as a representation leaning method, the issues due to the non-orthogonality of the learned representation has not been dealt with. Since NMF learns both feature vectors and data vectors in the f...

The classical time-invariant Hankel-norm approximation problem is generalized to the time-varying context. The input-output operator of a time-varying bounded causal linear system acting in discrete time may be specified as a bounded upper-triangular operator T with block matrix entries Tij. For such an operator T, we will define the Hankel norm as a generalization of the time-invariant Hankel ...