ON HERMITE MATRIX POLYNOMIALS AND HERMITE MATRIX FUNCTIONS

In this paper properties of Hermite matrix polynomials and Hermite matrix functions are studied. The concept ot total set with respect to a matrix functional is introduced and the total property of the Hermite matrix polynomials is proved. Asymptotic behaviour of Hermite matrix polynomials is studied and the relationship of Hermite matrix functions with certain matrix differential equations is developed. A new expression of the matrix exponential for a wide class of matrices in terms of Hermite matrix polynomials is proposed.     

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.     

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.     

On the best approximation matrix problem and matrix Fourier series

In this paper the concept of positive definite bilinear matrix moment functional, acting on the space of all the matrix valued continuous functions defined on a bounded interval [a,b] is introduced. The best approximation matrix problem with respect to such a functional is solved in terms of matrix Fourier series. Basic properties of matrix Fourier series such as the Riemann—Lebesgue, matrix property and the bessel—parseval matrix inequality are proved. The concept of total set with respect to a positive definite matrix functional is introduced, and the totallity of an orthonormal sequence of matrix polynomials with respect to the functional is established.     

Rectangular matrix Padé approximants and square matrix orthogonal polynomials

In this paper we study Padé-type and Padé approximants for rectangular matrix formal power series, as well as the formal orthogonal polynomials which are a consequence of the definition of these matrix Padé approximants. Recurrence relations are given along a diagonal or two adjacent diagonals of the table of orthogonal polynomials and their adjacent ones. A matrix qd-algorithm is deduced from these relations. Recurrence relations are also proved for the associated polynomials. Finally a short presentation of right matrix Padé approximants gives a link between the degrees of orthogonal polynomials in right and left matrix Padé approximants in order to show that the latter are identical. This revised version was published online in June 2006 with corrections to the Cover Date.     

ORTHOGONAL MATRIX POLYNOMIALS WITH RESPECT TO A CONJUGATE BILINEAR MATRIX MOMENT FUNCTIONAL: BASIC THEORY

In this paper basic results for a theory of orthogonal matrix polynomials with respect to a conjugate bilinear matrix moment functional are proposed. Properties of orthogonal matrix polynomial sequences including a three term matrix relationship are given. Positive definite conjugate bilinear matrix moment functionals are introduced and a characterization of positive definiteness in terms of a block Haenkel moment matrix is established. For each positive definite conjugate bilinear matrix moment functional an associated matrix inner product is defined.     

Orthogonal matrix polynomials with respect to linear matrix moment functionals: Theory and applications

In this paper orthogonal matrix polynomials with respect to a right matrix moment functional are introduced. Basic results, important examples and applications to the approximation of matrix integrals are studied. Error bounds for the proposed matrix quadrature rules are given.     

Hermite matrix polynomials and second order matrix differential equations

In this paper we introduce the class of Hermite’s matrix polynomials which appear as finite series solutions of second order matrix differential equations Y″−xAY′+BY=0. An explicit expression for the Hermite matrix polynomials, the orthogonality property and a Rodrigues’ formula are given.     

Palindromic matrix polynomials, matrix functions and integral representations

We study the properties of palindromic quadratic matrix polynomials φ(z)=P+Qz+Pz², i.e., quadratic polynomials where the coefficients P and Q are square matrices, and where the constant and the leading coefficients are equal. We show that, for suitable choices of the matrix coefficients P and Q, it is possible to characterize by means of φ(z) well known matrix functions, namely the matrix square root, the matrix polar factor, the matrix sign and the geometric mean of two matrices. Finally we provide some integral representations of these matrix functions.     

Completion of a partial integral matrix to a unimodular matrix

We first characterize submatrices of a unimodular integral matrix. We then prove that if n entries of an n × n partial integral matrix are prescribed and these n entries do not constitute a row or a column, then this matrix can be completed to a unimodular matrix. Consequently an n × n partial integral matrix with n − 1 prescribed entries can always be completed to a unimodular matrix.     

Instability indices for matrix polynomials

There is a well-established instability index theory for linear and quadratic matrix polynomials for which the coefficient matrices are Hermitian and skew-Hermitian. This theory relates the number of negative directions for the matrix coefficients which are Hermitian to the total number of unstable eigenvalues for the polynomial. Herein we extend the theory to ?-even matrix polynomials of any finite degree. In particular, unlike previously known cases we show that the instability index depends upon the size of the matrices when the degree of the polynomial is greater than two. We also consider Hermitian matrix polynomials, and derive an index which counts the number of eigenvalues with nonpositive imaginary part. The results are refined if we consider the Hermitian matrix polynomial to be a perturbation of a ?-even polynomials; however, this refinement requires additional assumptions on the matrix coefficients.     

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.     

Preconditioning of two-by-two block matrix systems with square matrix blocks,with applications

Two-by-two block matrices of special form with square matrix blocks arise in important applications, such as in optimal control of partial differential equations and in high order time integration methods.Two solution methods involving very efficient preconditioned matrices, one based on a Schur complement reduction of the given system and one based on a transformation matrix with a perturbation of one of the given matrix blocks are presented. The first method involves an additional inner solution with the pivot matrix block but gives a very tight condition number bound when applied for a time integration method. The second method does not involve this matrix block but only inner solutions with a linear combination of the pivot block and the off-diagonal matrix blocks.Both the methods give small condition number bounds that hold uniformly in all parameters involved in the problem, i.e. are fully robust. The paper presents shorter proofs, extended and new results compared to earlier publications.     

Inertia theorems for matrix polynomials

The Lyapunov method for determining the inertia of a matrix in terms of inertia of solutions of a certain linear matrix equation is extended to matrix polynomials.Generalization of well-known inertia theorems are obtained using the recently developed concept of Bezoutian for several matrix polynomials.     

A matrix Kronecker lemma

We show that a standard tool of probability theory, the Kronecker lemma, has matrix generalizations, but that one of these matrix generalizations is unsatisfactory, to the extent that unless certain extra conditions are placed on the matrix sequence appearing in the lemma statement, the lemma may fail to be true.     

On-line soft error correction in matrix–matrix multiplication

Soft errors are one-time events that corrupt the state of a computing system but not its overall functionality. Soft errors normally do not interrupt the execution of the affected program, but the affected computation results cannot be trusted any more. A well known technique to correct soft errors in matrix–matrix multiplication is algorithm-based fault tolerance (ABFT). While ABFT achieves much better efficiency than triple modular redundancy (TMR) – a traditional general technique to correct soft errors, both ABFT and TMR detect errors off-line after the computation is finished. This paper extends the traditional ABFT technique from off-line to on-line so that soft errors in matrix–matrix multiplication can be detected in the middle of the computation during the program execution and higher efficiency can be achieved by correcting the corrupted computations in a timely manner. Experimental results demonstrate that the proposed technique can correct one error every ten seconds with negligible (i.e. less than 1%) performance penalty over the ATLAS dgemm().     

Radicals of matrix rings generated by a companion matrix

The radicals of full matrix rings as well as structural matrix rings have been studied extensively and there is a well-developed theory for both. Here we initiate the radical theory for another class of matrix rings over a given ring; the matrix ring generated by the companion matrix of a polynomial over the ring.     

L-structured matrices and linear matrix equations

Conditions for the existence of solutions, and the general solution of linear matrix equations are given, when it is known a priori that the solution matrix has a given structure (e.g. symmetric, triangular, diagonal). This theory is subsequently extended to matrix equations that are linear in several unknown 'structured' matrices, and to partitioned matrix equations.     

On singular matrix variate beta distribution

1.IntrodnctionThispaperextendsthestudyofthesingularmatrixvariatebetadistributionofrank1[1]tothecaseofageneralrank.Astherelateddistributiontonormalsampling,thematrixvariatebetadistribution(alsocalledthemultivariatebetadistribution)hasbeenstudiedextens...     

The generalized Fibonomial matrix

The Fibonomial coefficients are known as interesting generalizations of binomial coefficients. In this paper, we derive a (k+1)th recurrence relation and generating matrix for the Fibonomial coefficients, which we call generalized Fibonomial matrix. We find a nice relationship between the eigenvalues of the Fibonomial matrix and the generalized right-adjusted Pascal matrix; that they have the same eigenvalues. We obtain generating functions, combinatorial representations, many new interesting identities and properties of the Fibonomial coefficients. Some applications are also given as examples.