Related papers: Matrix-valued Gegenbauer polynomials
We study non-symmetric Jacobi polynomials of type $BC_1$ by means of vector-valued and matrix-valued orthogonal polynomials. The interpretation as matrix-valued orthogonal polynomials allows us to introduce shift operators for the…
We develop a theory of weights for a quantum analogue of the symmetric pair (gl4,gl2 x gl2) realised as a quantum symmetric pair subalgebra. Based on Letzter's triangular decomposition we define Verma modules. Using magical operators that…
We study the following problem: describe the triplets $(\Omega,g,\mu)$, $\mu=\rho\,dx$, where $g= (g^{ij}(x))$ is the (co)metric associated with the symmetric second order differential operator $L (f) = \frac{1}{\rho}\sum_{ij} \partial_i…
In this paper we focus on the solution of shifted quasiseparable systems and of more general parameter dependent matrix equations with quasiseparable representations. We propose an efficient algorithm exploiting the invariance of the…
We introduce a new family of special functions, namely $q$-Charlier multiple orthogonal polynomials. These polynomials are orthogonal with respect to $q$-analogues of Poisson distributions. We focus our attention on their structural…
The notion of root polynomials of a polynomial matrix $P(\lambda)$ was thoroughly studied in [F. Dopico and V. Noferini, Root polynomials and their role in the theory of matrix polynomials, Linear Algebra Appl. 584:37--78, 2020]. In this…
This paper lies in the intersection of several fields: number theory, lattice theory, multilinear algebra, and scientific computing. We adapt existing solution algorithms for tensor eigenvalue problems to the tensor-train framework. As an…
LU-factorization of matrices is one of the fundamental algorithms of linear algebra. The widespread use of supercomputers with distributed memory requires a review of traditional algorithms, which were based on the common memory of a…
Weights of permutations were originally introduced by Dugan, Glennon, Gunnells, and Steingr\'imsson (Journal of Combinatorial Theory, Series A 164:24-49, 2019) in their study of the combinatorics of tiered trees. Given a permutation…
The (generalised) Mellin transforms of certain Chebyshev and Gegenbauer functions based upon the Chebyshev and Gegenbauer polynomials, have polynomial factors $p_n(s)$, whose zeros lie all on the `critical line' $\Re\,s=1/2$ or on the real…
In this paper we prove the Jones factorization theorem and the Rubio de Francia extrapolation theorem for matrix $\mathcal A_p$ weights. These results answer longstanding open questions in the study of matrix weights. The proof requires the…
We study the monic orthogonal polynomials with respect to a singularly perturbed Airy weight. By using Chen and Ismail's ladder operator approach, we derive a discrete system satisfied by the recurrence coefficients for the orthogonal…
A $\mathbb{D}$-semi-classical weight is one which satisfies a particular linear, first order homogeneous equation in a divided-difference operator $\mathbb{D}$. It is known that the system of polynomials, orthogonal with respect to this…
We study the problem of approximating an unknown function $f:\mathbb{R}\to\mathbb{R}$ by a degree-$d$ polynomial using as few function evaluations as possible, where error is measured with respect to a probability distribution $\mu$.…
Matrix theory and its applications make wide use of the eigenprojections of square matrices. The present paper demonstrates that the eigenprojection of a matrix $A$ can be calculated with the use of any annihilating polynomial of A^u, where…
We prove $L^{2}$ estimates and solvability for a variety of simply characteristic constant coefficient partial differential equations $P(D)u=f$. These estimates \[||u||_{L^2(D_{r})}\le C\sqrt{d_{r}d_{s}} ||f||_{_{L^2(D_{s})}}\] depend on…
On even-dimensional Euclidean space for integer powers of the Laplace operator greater than or equal to half the dimension, a fundamental solution of the polyharmonic equation has binomial and logarithmic behavior. Gegenbauer polynomial…
We apply the bi-moment determinant method to compute a representation of the matrix product algebra -- a quadratic algebra satisfied by the operators $\mathbf{d}$ and $\mathbf{e}$ -- for the five parameter ($\alpha$, $\beta$, $\gamma$,…
We review a recent construction of an explicit analytic series representation for symmetric polynomials which up to a groundstate factor are eigenfunctions of Calogero-Sutherland type models. We also indicate a generalisation of this result…
In this chapter we are examining several iterative methods for solving nonlinear eigenvalue problems. These arise in variational image-processing, graph partition and classification, nonlinear physics and more. The canonical eigenproblem we…