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...

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...

an ideal i of a ring r is called right baer-ideal if there exists an idempotent e 2 r such that r(i) = er. we know that r is quasi-baer if every ideal of r is a right baer-ideal, r is n-generalized right quasi-baer if for each i e r the ideal in is right baer-ideal, and r is right principaly quasi-baer if every principal right ideal of r is a right baer-ideal. therefore the concept of baer idea...

Explicit time advancement for continuous finite elements requires the inversion of a global mass matrix. For spectral element simulations on quadrilaterals and hexahedra, there is an accurate approximate matrix which diagonal, making it computationally efficient explicit simulations. In this article shown that standard space polynomials used with triangular elements, denoted $\mathcal{T}(p)$, w...

p . It follows that inequality (1.2) holds for any a ∈ lp when U1/p ≥ ||C||p,p and fails to hold for some a ∈ lp when U1/p < ||C||p,p. Hardy’s inequality thus asserts that the Cesáro matrix operator C, given by cn,k = 1/n, k ≤ n and 0 otherwise, is bounded on l p and has norm ≤ p/(p−1). (The norm is in fact p/(p− 1).) We say a matrix A = (an,k) is a lower triangular matrix if an,k = 0 for n < k...

p . It follows that inequality (1.2) holds for any a ∈ lp when U1/p ≥ ||C||p,p and fails to hold for some a ∈ lp when U1/p < ||C||p,p. Hardy’s inequality thus asserts that the Cesáro matrix operator C, given by cn,k = 1/n, k ≤ n and 0 otherwise, is bounded on l p and has norm ≤ p/(p−1). (The norm is in fact p/(p− 1).) We say a matrix A = (an,k) is a lower triangular matrix if an,k = 0 for n < k...

For integers s,k with s 0 and k 0 , we define a class of lower triangular Toeplitz matrices U (s,k) n of type (s,k) , whose non-zero entries are the classical Horadam numbers U (a,b) i . In this paper, we derive a convolution formula containing the Horadam numbers. Using this formula, we obtain several combinatorial identities involving the Horadam numbers and the generalized Fibonacci numbers....

We survey and compare a wide variety of techniques for estimating the condition number of a triangular matrix, and make recommendations concerning the use of the estimates in applications. Each of the methods is shown to bound the condition number; the bounds can broadly be categorised as upper bounds from matrix theory and lower bounds from heuristic or probabilistic algorithms. For each bound...

Systems of linear equations, with uncertainty on the parameters, play a major role in various problems in economics and finance. Fuzzy system of linear equations has been discussed in [1] using LU decomposition when the matrix A in Ax = b is a crisp matrix. Also the Adomian decomposition method and iterative methods have been studied in [2, 6] for fuzzy system of linear equations. In this paper...