A systematic construction of higher order splines using two hierarchies of polynomials is presented. Explicit instructions on how to implement one of these hierarchies are given. The results are limited to interpolations on regular, rectangular grids, but an approach to other types of grids is also discussed.

In the recent paper “On certain Vandermonde determinants whose variables separate” [Linear Algebra and its Applications 449 (2014) pp. 17–27], there was established a factorized formula for some bivariate Vandermonde determinants (associated to almost square grids) whose basis functions are formed by Hadamard products of some univariate polynomials. That formula was crucial for proving a conjec...

In this paper we consider bilinear forms of matrix polynomials and show that these polynomials can be used to construct solutions for the problems of solving systems of linear algebraic equations, matrix inversion and finding extremal eigenvalues. An almost Optimal Monte Carlo (MAO) algorithm for computing bilinear forms of matrix polynomials is presented. Results for the computational costs of...

We characterize orthogonal matrix polynomials (Pn)n whose differences (∇ Pn+1)n are also orthogonal by means of a discrete Pearson equation for the weight matrix W with respect to which the polynomials (Pn)n are orthogonal. We also construct some illustrative examples. In particular, we show that contrary to what happens in the scalar case, in the matrix orthogonality the discrete Pearson equat...

In this paper, we consider an approach based on the elementary matrix theory. other words, take into account generalized Gaussian Fibonacci numbers. context, a general tridiagonal family. Then, obtain determinants of family via Chebyshev polynomials. Moreover, one type matrix, whose are Horadam hybrid polynomials, i.e., most form its by means polynomials second kind. We provided several illustr...

The singular value decomposition (SVD) is a generalization of the eigen-decomposition which can be used to analyze rectangular matrices (the eigen-decomposition is definedonly for squaredmatrices). By analogy with the eigen-decomposition, which decomposes a matrix into two simple matrices, the main idea of the SVD is to decompose a rectangular matrix into three simple matrices: Two orthogonal m...

It is well known that the determinant of a matrix can only be defined for a square matrix. In this paper, we propose a new definition of the determinant of a rectangular matrix and examine its properties. We apply these properties to squared canonical correlation coefficients, and to squared partial canonical correlation coefficients. The proposed definition of the determinant of a rectangular ...

In this paper a general theory of semi-classical matrix orthogonal polynomials is developed. We define the semi-classical linear functionals by means of a distri-butional equation D(uA) = uB, where A and B are matrix polynomials. Several characterizations for these semi-classical functionals are given in terms of the corresponding (left) matrix orthogonal polynomials sequence. They involve a qu...

In the scalar case, it is well known that the zonal spherical functions of any compact Riemannian symmetric space of rank one can be expressed in terms of the Jacobi polynomials. The main purpose of this paper is to revisit the matrix valued spherical functions associated to the complex projective plane to exhibit the interplay among these functions, the matrix hypergeometric functions and the ...

Abstract. We revisit the important paper [D. S. Mackey, N. Mackey, C. Mehl, and V. Mehrmann, SIAM J. Matrix Anal. Appl., 28 (2006), pp. 971–1004] and, by viewing matrices as coefficients for bivariate polynomials, we provide concise proofs for key properties of linearizations for matrix polynomials. We also show that every pencil in the double ansatz space is intrinsically connected to a Bézout...