Related papers: $N\times N$ Matrix Time-/Band- Limiting examples
In this paper we continue studying of matrix $n\times n$ linear differential intertwining operators. The problems of minimization and of reducibility of matrix intertwining operators are considered and criterions of weak minimizability and…
We study differential operators associated with families of polynomials orthonormal with respect to certain measures. These operators, when applied to the Fourier transforms of such measures, produce basis functions for expansions of…
Let $A=\begin{bmatrix} A_{ij} \end{bmatrix}$ be an $n\times n$ operator matrix, where each $A_{ij}$ is a bounded linear operator on a complex Hilbert space. Among other numerical radius bounds, we show that $w(A)\leq w(\hat{A})$, where…
We address the problems of computing operator norms of matrices induced by given norms on the argument and the image space. It is known that aside of a fistful of "solvable cases," most notably, the case when both given norms are Euclidean,…
The operator associated to the angular part of the Dirac equation in the Kerr-Newman background metric is a block operator matrix with bounded diagonal and unbounded off-diagonal entries. The aim of this paper is to establish a variational…
For a family of polynomials in two continuous variables, orthogonal with respect to a weight function, we prove, under suitable conditions, the equivalence of the following properties: the matrix Pearson equation of the weight, the second…
We extend the close interplay between continued fractions, orthogonal polynomials, and Gaussian quadrature rules to several variables in a special but natural setting which we characterize in terms of moment sequences. The crucial condition…
It is well-known that orthogonal polynomials on the real line satisfy a three-term recurrence relation and conversely every system of polynomials satisfying a three-term recurrence relation is orthogonal with respect to some positive Borel…
We study the time-harmonic Maxwell equations on bounded Lipschitz domains with an impedance boundary condition. The impedance coefficient can be matrix valued such that, in particular, a polarization dependent impedance is modeled. We…
We study multiple orthogonal polynomials exploiting their explicit determinantal representation in terms of moments. Our reasoning follows that applied to solve the Hermite-Pad\'{e} approximation and interpolation problems. We study also…
Time-varying systems open intriguing opportunities to explore novel approaches in the design of efficient electromagnetic devices. While such explorations date back to more than half a century ago, recent years have experienced a renewed…
In this paper we introduce a notion of duality for matrix valued orthogonal polynomials with respect to a measure supported on the nonnegative integers. We show that the dual families are closely related to certain difference operators…
In many high-dimensional problems,polynomial-time algorithms fall short of achieving the statistical limits attainable without computational constraints. A powerful approach to probe the limits of polynomial-time algorithms is to study the…
For operators generated by a certain class of infinite band matrices with matrix elements we establish a characterization of the resolvent set in terms of polynomial solutions of the underlying higher order finite difference equations. This…
In the two-dimensional orthogonal colored range counting problem, we preprocess a set, $P$, of $n$ colored points on the plane, such that given an orthogonal query rectangle, the number of distinct colors of the points contained in this…
In recent years much effort has been concentrated towards achieving polynomial time lower bounds on algorithms for solving various well-known problems. A useful technique for showing such lower bounds is to prove them conditionally based on…
We consider operator-valued polynomials in Gaussian Unitary Ensemble random matrices and we show that its $L^p$-norm can be upper bounded, up to an asymptotically small error, by the operator norm of the same polynomial evaluated in free…
In many problems in Computational Physics and Chemistry, one finds a special kind of sparse matrices, termed "banded matrices". These matrices, which are defined as having non-zero entries only within a given distance from the main…
In a previous paper we have introduced matrix-valued analogues of the Chebyshev polynomials by studying matrix-valued spherical functions on SU(2)\times SU(2). In particular the matrix-size of the polynomials is arbitrarily large. The…
We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via…