For little q-Jacobi polynomials and q-Hahn polynomials we give particular q-hypergeometric series representations in which the termwise q = 0 limit can be taken. When rewritten in matrix form, these series representations can be viewed as LU factorizations. We develop a general theory of LU factorizations related to complete systems of orthogonal polynomials with discrete orthogonality relation...

Three algorithms providing rigourous bounds for the eigenvalues of a real matrix are presented. The first is an implementation of the bisection algorithm for a symmetric tridiagonal matrix using IEEE floating-point arithmetic. The two others use interval arithmetic with directed rounding and are deduced from the Jacobi method for a symmetric matrix and the Jacobi-like method of Eberlein for an ...

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

We present a novel approach to Gaussian Berezin correlation functions. A formula well known in the literature expresses these quantities in terms of submatrices of the inverse matrix appearing in the Gaussian action. By using a recently proposed method to calculate Berezin integrals as an expectation of suitable functionals of Poisson processes, we obtain an alternative formula which allows one...

formulae expressing explicitly the coefficients of an expansion of double jacobi polynomials which has been partially differentiated an arbitrary number of times with respect to its variables in terms of the coefficients of the original expansion are stated and proved. extension to expansion of triple jacobi polynomials is given. the results for the special cases of double and triple ultraspher...

This project focussed on speeding up the cyclic Jacobi algorithm of the Singular Value Decomposition for DLX architecture. Using the performance monitor, it is shown that over 96% of the time is spent in a subroutine calculates Jacobi rotations. To speed up the subroutine, the improvement are performed on two aspects. From the algorithm point of view, we rst implemented the fast Jacobi matrix m...

We consider a standard matrix ow on the set of unitary upper Hessenberg matrices with nonnegative subdiagonal elements. The Schur parametrization of this set of matrices leads to ordinary diier-ential equations for the weights and the parameters that are analogous with the Toda ow as identiied with a ow on Jacobi matrices. We derive explicit diierential equations for the ow on the Schur paramet...

Abstract. We consider constrained Hamiltonian systems in the framework of Dirac’s theory. We show that the Jacobi identity results from imposing that the constraints are Casimir invariants, regardless of the fact that the matrix of Poisson brackets between constraints is invertible or not. We point out that the proof we provide ensures the validity of the Jacobi identity everywhere in phase spa...

respectively. There are many iterative methods such as GMRES [7] and Bi-CGSTAB [9] algorithms for solving Eq. (1.1) which are more efficient than the Jacobi and Gauss-Seidel methods. However, when these methods are combined with the more efficient methods, for example as a preconditioner, can be quite successful. For example see [4, 6]. It has been proved that if A is a strictly diagonally domi...

In this paper we give the optimum parameters for the Accelerated Overrelaxation (AOR) method in the special case where the matrix coefficient of the linear system, which is solved, is consistently ordered with nonvanishing diagonal elements. Under certain assumptions, concerning the eigenvalues of the corresponding Jacobi matrix, it is shown that the optimum AOR method gives better convergence ...