Systems of the form (R(1) · · ·R(p) − λI)x = b, where each R(i) is an n-by-n upper triangular matrix, can be solved in O(pn3) flops if the matrix of coefficients is explicitly formed. We develop a new method for this system that circumvents the explicit product and requires only O(pn2) flops to execute. The error bounds for the new algorithm are essentially the same as the error bounds for the ...

In this paper we present a new robust adaptive algorithm. It is derived from the standard QR Decomposition based RLS (QRDRLS) algorithm by introducing a non-orthogonal transform into the update recursion. Instead of updating an upper triangular matrix, as it is the case for the QRD-RLS, we adapt an upper triangular block diagonal matrix. The complexity of the algorithm, thus obtained, varies fr...

In this paper we develop a theory of t-cycle D−Z representations for s-dimensional lattice rules of prime-power order. Of particular interest are canonical forms which, by definition, have a D-matrix consisting of the nontrivial invariants. Among these is a family of triangular forms, which, besides being canonical, have the defining property that their Z-matrix is a column permuted version of ...

If (without loss of generality) n = p, where p is prime, divide and conquer Fourier transforms using O(nlogn) operations reduce multiplying, or inverting nonsingular, complex n×n matrices to abelian group algebra convolutions. If M is a complex 2×2 matrix, constructing a unitary matrix T and an upper triangular matrix TMT reduces to n(n−1)/2 such constructions in which a 2×2 matrix μ is transfo...

We introduce a generalization of the Parikh mapping called the Parikh q-matrix encoding, which takes its values in matrices with polynomial entries. The encoding represents a word w over a k-letter alphabet as a (k + 1)-dimensional upper-triangular matrix with entries that are nonnegative integral polynomials in variable q. Putting q = 1, we obtain the morphism introduced by Mateescu, Salomaa, ...

The purpose of this article is to study determinants of matrices which are known as generalized Pascal triangles (see [1]). We present a factorization by expressing such a matrix as a product of a unipotent lower triangular matrix, a Töeplitz matrix and a unipotent upper triangular matrix. The determinant of a generalized Pascal matrix equals thus the determinant of a Töeplitz matrix. This equa...

Abstract. Let B+ ⊂ GLn(R) denote the subgroup of upper triangular n × nmatrices with positive entries on the main diagonal. A matrix M ∈ B+ is called totally positive if the determinants of all its minors not containing a row or column lying completely under the main diagonal are positive. We give a simple determinantal equation for the boundary of all positive upper triangular matrices in B+.

The main purpose of this paper is to determine the fine spectrum of the generalized upper triangular double-band matrices uv over the sequence spaces c0 and c. These results are more general than the spectrum of upper triangular double-band matrices of Karakaya and Altun[V. Karakaya, M. Altun, Fine spectra of upper triangular doubleband matrices, Journal of Computational and Applied Mathematics...

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.

Iterative methods for solving sparse triangular systems are an attractive alternative to exact forward and backward substitution if an approximation of the solution is acceptable. On modern hardware, performance benefits are available as iterative methods allow for better parallelization. In this paper, we investigate how block-iterative triangular solves can benefit from using overlap. Because...