Related papers: $N\times N$ Matrix Time-/Band- Limiting examples
The main purpose of this paper is to extend to a situation involving matrix valued orthogonal polynomials and spherical functions, a result that traces its origin and its importance to work of Claude Shannon in laying the mathematical…
The subject of time-band-limiting, originating in signal processing, is dominated by the miracle that a naturally appearing integral operator admits a commuting differential one allowing for a numerically efficient way to compute its…
We extend to a situation involving matrix valued orthogonal polynomials a scalar result that originates in work of Claude Shannon and a ground-breaking series of papers by D. Slepian, H. Landau and H. Pollak at Bell Labs in the 1960's.…
The "time-and-band limiting" commutative property was found and exploited by D. Slepian, H. Landau and H. Pollak at Bell Labs in the 1960's, and independently by M. Mehta and later by C. Tracy and H. Widom in Random matrix theory. The…
The paper continues previous works which study the behavior of second correlation function of characteristic polynomials of the special case of $n\times n$ one-dimensional Gaussian Hermitian random band matrices, when the covariance of the…
Banded bounded matrices, which represent non normal operators, of oscillatory type that admit a positive bidiagonal factorization are considered. To motivate the relevance of the oscillatory character the Favard theorem for Jacobi matrices…
It is well known that if a finite order linear differential operator with polynomial coefficients has as eigenfunctions a sequence of orthogonal polynomials with respect to a positive measure (with support in the real line), then its order…
The Riemann-Hilbert problems for multiple orthogonal polynomials of types I and II are used to derive string equations associated to pairs of Lax-Orlov operators. A method for determining the quasiclassical limit of string equations in the…
We exhibit three examples showing that the "time-and-band limiting" commutative property found and exploited by D. Slepian, H. Landau and H. Pollak at Bell Labs in the 1960's, and independently by M. Mehta and later by C. Tracy and H. Widom…
This paper adapts the recently developed rigorous application of the supersymmetric transfer matrix approach for the 1d band matrices to the case of the orthogonal symmetry. We consider $N\times N$ block band matrices consisting of $W\times…
We present upper and lower bounds for the numerical radius of $2 \times 2$ operator matrices which improves on the existing bound for the same. As an application of the results obtained we give a better estimation for the zeros of a…
The bispectral problem is motivated by an effort to understand and extend a remarkable phenomenon in Fourier analysis on the real line: the operator of time-and-band limiting is an integral operator admitting a second-order differential…
We give two examples of algebras of differential operators associated to families of matrix valued orthogonal polynomials arising from representations of SU$(N+1)$. The first one gives a commutative algebra and the second one a…
In this paper, we exhibit explicitly a sequence of $2\times2$ matrix valued orthogonal polynomials with respect to a weight $W_{p,n}$, for any pair of real numbers $p$ and $n$ such that $0<p<n$. The entries of these polynomiales are…
We study the spectrum of the differential operator T generated by the differential expression of order n>2 with the m by m PT-symmetric periodic matrix coefficients. The case when m and n are the odd numbers was investigated in [8]. In this…
The main goal of this article is to establish several new upper and lower bounds for the $\mathbb{A}$-numerical radius of $2\times 2$ operator matrices, where $\mathbb{A}$ be the $2\times 2$ diagonal operator matrix whose diagonal entries…
A limiting property of the nearest-neighbor recurrence coefficients for multiple orthogonal polynomials from a Nevai class is investigated. Namely, assuming that the nearest-neighbor coefficients have a limit along rays of the lattice, we…
There have been several algorithms designed to optimise matrix multiplication. From schoolbook method with complexity $O(n^3)$ to advanced tensor-based tools with time complexity $O(n^{2.3728639})$ (lowest possible bound achieved), a lot of…
Multiple orthogonal polynomials with respect to two weights on the step-line are considered. A connection between different dual spectral matrices, one banded (recursion matrix) and one Hessenberg, respectively, and the Gauss-Borel…
We consider a non-commutative polynomial in several independent $N$-dimensional random unitary matrices, uniformly distributed over the unitary, orthogonal or symmetric groups, and assume that the coefficients are $n$-dimensional matrices.…