Inversion of Catalan matrix plus one

Motivated by a statistical problem, in (Aggarwala and Lamoureux in Am. Math. Mon., 109:371–377, 2002) it is shown how to invert a linear combination of the Pascal matrix with the identity matrix. Continuing this idea, we invert various linear combinations of the Catalan matrix, introduced in (Stanimirovi? et al. in Appl. Math. Comput. 215:796–805, 2009), with the identity matrix. In (Aggarwala and Lamoureux in Am. Math. Mon., 109:371–377, 2002) the occurrence of the polylogarithm function is observed. Inverses of linear combinations of the Catalan and the identity matrix are expressed in terms of Catalan numbers, the pochhammer function and the generalized hypergeometric function.     

Catalan matrix and related combinatorial identities

We introduce the notion of the Catalan matrix whose non-zero elements are expressions which contain the Catalan numbers arranged into a lower triangular Toeplitz matrix. Inverse of the Catalan matrix is derived. Correlations between the matrix and the generalized Pascal matrix are considered. Some combinatorial identities involving Catalan numbers, binomial coefficients and the generalized hypergeometric function are derived using these correlations. Moreover, an additional explicit representation of the Catalan number, as well as an explicit representation of the sum of the first m Catalan numbers are given.     

An inexact shift‐and‐invert Arnoldi algorithm for Toeplitz matrix exponential

We revisit the shift‐and‐invert Arnoldi method proposed in [S. Lee, H. Pang, and H. Sun. Shift‐invert Arnoldi approximation to the Toeplitz matrix exponential, SIAM J. Sci. Comput., 32: 774–792, 2010] for numerical approximation to the product of Toeplitz matrix exponential with a vector. In this approach, one has to solve two large‐scale Toeplitz linear systems in advance. However, if the desired accuracy is high, the cost will be prohibitive. Therefore, it is interesting to investigate how to solve the Toeplitz systems inexactly in this method. The contribution of this paper is in three regards. First, we give a new stability analysis on the Gohberg–Semencul formula (GSF) and define the GSF condition number of a Toeplitz matrix. It is shown that when the size of the Toeplitz matrix is large, our result is sharper than the one given in [M. Gutknecht and M. Hochbruck. The stability of inversion formulas for Toeplitz matrices, Linear Algebra Appl., 223/224: 307–324, 1995]. Second, we establish a relation between the error of Toeplitz systems and the residual of Toeplitz matrix exponential. We show that if the GSF condition number of the Toeplitz matrix is medium‐sized, then the Toeplitz systems can be solved in a low accuracy. Third, based on this relationship, we present a practical stopping criterion for relaxing the accuracy of the Toeplitz systems and propose an inexact shift‐and‐invert Arnoldi algorithm for the Toeplitz matrix exponential problem. Numerical experiments illustrate the numerical behavior of the new algorithm and show the effectiveness of our theoretical results. Copyright © 2015 John Wiley & Sons, Ltd.     

Ballot matrix as Catalan matrix power and related identities

We use an analytical approach to find the kth power of the Catalan matrix. Precisely, it is proven that the power of the Catalan matrix is a lower triangular Toeplitz matrix which contains the well-known ballot numbers. A result from [H. S. Wilf, Generatingfunctionology, Academic Press, New York, 1990, Free download available from http://www.math.upenn.edu/~wilf/Downld.html.], related to the generating function for Catalan numbers, is extended to the negative integers. Three interesting representations for Catalan numbers by means of the binomial coefficients and the hypergeometric functions are obtained using relations between Catalan matrix powers.     

Schröder matrix as inverse of Delannoy matrix

Using Riordan arrays, we introduce a generalized Delannoy matrix by weighted Delannoy numbers. It turns out that Delannoy matrix, Pascal matrix, and Fibonacci matrix are all special cases of the generalized Delannoy matrices, meanwhile Schröder matrix and Catalan matrix also arise in involving inverses of the generalized Delannoy matrices. These connections are the focus of our paper. The half of generalized Delannoy matrix is also considered. In addition, we obtain a combinatorial interpretation for the generalized Fibonacci numbers.     

Fast Structured Matrix Computations: Tensor Rank and Cohn–Umans Method

We discuss a generalization of the Cohn–Umans method, a potent technique developed for studying the bilinear complexity of matrix multiplication by embedding matrices into an appropriate group algebra. We investigate how the Cohn–Umans method may be used for bilinear operations other than matrix multiplication, with algebras other than group algebras, and we relate it to Strassen’s tensor rank approach, the traditional framework for investigating bilinear complexity. To demonstrate the utility of the generalized method, we apply it to find the fastest algorithms for forming structured matrix–vector product, the basic operation underlying iterative algorithms for structured matrices. The structures we study include Toeplitz, Hankel, circulant, symmetric, skew-symmetric, f-circulant, block Toeplitz–Toeplitz block, triangular Toeplitz matrices, Toeplitz-plus-Hankel, sparse/banded/triangular. Except for the case of skew-symmetric matrices, for which we have only upper bounds, the algorithms derived using the generalized Cohn–Umans method in all other instances are the fastest possible in the sense of having minimum bilinear complexity. We also apply this framework to a few other bilinear operations including matrix–matrix, commutator, simultaneous matrix products, and briefly discuss the relation between tensor nuclear norm and numerical stability.     

Some identities on Catalan numbers and hypergeometric functions via Catalan matrix power

In this paper we use the Catalan matrix power as a tool for deriving identities involving Catalan numbers and hypergeometric functions. For that purpose, we extend earlier investigated relations between the Catalan matrix and the Pascal matrix by inserting the Catalan matrix power and particulary the squared Catalan matrix in those relations. We also pay attention to some relations between Catalan matrix powers of different degrees, which allows us to derive the simplification formula for hypergeometric function ₃F₂, as well as the simplification formula for the product of the Catalan number and the hypergeometric function ₃F₂. Some identities involving Catalan numbers, proved by the non-matrix approach, are also given.     

Perturbations on the subdiagonals of Toeplitz matrices

Let L be an Hermitian linear functional defined on the linear space of Laurent polynomials. It is very well known that the Gram matrix of the associated bilinear functional in the linear space of polynomials is a Toeplitz matrix. In this contribution we analyze some linear spectral transforms of L such that the corresponding Toeplitz matrix is the result of the addition of a constant in a subdiagonal of the initial Toeplitz matrix. We focus our attention in the analysis of the quasi-definite character of the perturbed linear functional as well as in the explicit expressions of the new monic orthogonal polynomial sequence in terms of the first one.     

New lower bounds on eigenvalue of the Hadamard product of an M-matrix and its inverse

Some new lower bounds for the minimum eigenvalue of the Hadamard product of an M-matrix and its inverse are given. These bounds improve the results of [H.B. Li, T.Z. Huang, S.Q. Shen, H. Li, Lower bounds for the minimum eigenvalue of Hadamard product of an M-matrix and its inverse, Linear Algebra Appl. 420 (2007) 235-247].     

Identities via Bell matrix and Fibonacci matrix

In this paper, we study the relations between the Bell matrix and the Fibonacci matrix, which provide a unified approach to some lower triangular matrices, such as the Stirling matrices of both kinds, the Lah matrix, and the generalized Pascal matrix. To make the results more general, the discussion is also extended to the generalized Fibonacci numbers and the corresponding matrix. Moreover, based on the matrix representations, various identities are derived.     

Symmetric polynomials, Pascal matrices, and Stirling matrices

We consider lower-triangular matrices consisting of symmetric polynomials, and we show how to factorize and invert them. Since binomial coefficients and Stirling numbers can be represented in terms of symmetric polynomials, these results contain factorizations and inverses of Pascal and Stirling matrices as special cases. This work generalizes that of several other authors on Pascal and Stirling matrices.     

Connection between the Hadamard and matrix products with an application to matrix-variate Birnbaum-Saunders distributions

In this paper, we establish a connection between the Hadamard product and the usual matrix multiplication. In addition, we study some new properties of the Hadamard product and explore the inverse problem associated with the established connection, which facilitates diverse applications. Furthermore, we propose a matrix-variate generalized Birnbaum-Saunders (GBS) distribution. Three representations of the matrix-variate GBS density are provided, one of them by using the mentioned connection. The main motivation of this article is based on the fact that the representation of the matrix-variate GBS density based on element-by-element specification does not allow matrix transformations. Consequently, some statistical procedures based on this representation, such as multivariate data analysis and statistical shape theory, cannot be performed. For this reason, the primary goal of this work is to obtain a matrix representation of the matrix-variate GBS density that is useful for some statistical applications. When the GBS density is expressed by means of a matrix representation based on the Hadamard product, such a density is defined in terms of the original matrices, as is common for many matrix-variate distributions, allowing matrix transformations to be handled in a natural way and then suitable statistical procedures to be developed.     

Inherited LU-factorizations of matrices

Various types of LU-factorizations for nonsingular matrices, where L is a lower triangular matrix and U is an upper triangular matrix, are defined and characterized. These types of LU-factorizations are extended to the general m × n case. The more general conditions are considered in the light of the structures of [C.R. Johnson, D.D. Olesky, P. Van den Driessche, Inherited matrix entries: LU factorizations, SIAM J. Matrix Anal. Appl. 10 (1989) 99-104]. Applications to graphs and adjacency matrices are investigated. Conditions for the product of a lower and an upper triangular matrix to be the zero matrix are also obtained.     

The Algebraic Perturbation Method for Generalized Inverses

Algebraic perturbation methods were first proposed for the solution of nonsingular linear systems by R. E. Lynch and T. J. Aird [2]. Since then, the algebraic perturbation methods for generalized inverses have been discussed by many scholars [3]-[6]. In [4], a singular square matrix was perturbed algebraically to obtain a nonsingular matrix, resulting in the algebraic perturbation method for the Moore-Penrose generalized inverse. In [5], some results on the relations between nonsingular perturbations and generalized inverses of $m\times n$ matrices were obtained, which generalized the results in [4]. For the Drazin generalized inverse, the author has derived an algebraic perturbation method in [6]. In this paper, we will discuss the algebraic perturbation method for generalized inverses with prescribed range and null space, which generalizes the results in [5] and [6]. We remark that the algebraic perturbation methods for generalized inverses are quite useful. The applications can be found in [5] and [8]. In this paper, we use the same terms and notations as in [1].     

矩阵值Caratheodory函数广义块Pick矩阵的秩不变性

Lasarow^[1]推导出矩阵值Carath\'{e}odory函数的第一、第二型广义块Pick矩阵及其变型的秩不变性. 这些矩阵由同一个Carath\'{e}odory函数的值与它的直到某阶的导数值确定. 利用文献[2]中提出的块Toeplitz向量方法, 该文断言,这些块矩阵的秩分别相关并重合于具有秩不变性的块Toeplitz矩阵的秩, 从而改进了这两类广义块Pick矩阵的秩不变性结论的证明.     

On the Toeplitz embedding of an arbitrary matrix

It has been shown by Delosme and Morf that an arbitrary block matrix can be embedded into a block Toeplitz matrix; the dimension of this embedding depends on the complexity of the matrix structure compared to the block Toeplitz structure. Due to the special form of the embedding matrix, the algebra of matrix polynomials relative to block Toeplitz matrices can be interpreted directly in terms of the original matrix and therefore can be extended to arbitrary matrices. In fact, these polynomials turn out to provide an appropriate framework for the recently proposed generalized Levinson algorithm solving the general matrix inversion problem.     

Approximate inversion method for time‐fractional subdiffusion equations

The finite‐difference method applied to the time‐fractional subdiffusion equation usually leads to a large‐scale linear system with a block lower triangular Toeplitz coefficient matrix. The approximate inversion method is employed to solve this system. A sufficient condition is proved to guarantee the high accuracy of the approximate inversion method for solving the block lower triangular Toeplitz systems, which are easy to verify in practice and have a wide range of applications. The applications of this sufficient condition to several existing finite‐difference schemes are investigated. Numerical experiments are presented to verify the validity of theoretical results.     

A factorization of the symmetric Pascal matrix involving the Fibonacci matrix

In this short note, we give a factorization of the Pascal matrix. This result was apparently missed by Lee et al. [Some combinatorial identities via Fibonacci numbers, Discrete Appl. Math. 130 (2003) 527-534].     

A generalization of triangular numbers

The triangular numbers are generalized in a natural way and a discovery‐type approach is used to find properties of these numbers. The numbers are connected to the Pascal numbers and generalized combinations that arise are connected to the Stirling numbers of the first kind.