Related papers: MOPS: Multivariate Orthogonal Polynomials (symboli…
For the filtering of peaks in periodic signals, we specify polynomial filters that are optimally localized in space. The space localization of functions having an expansion in terms of orthogonal polynomials is thereby measured by a…
We show that multiple orthogonal polynomials for r measures $(\mu_1,...,\mu_r)$ satisfy a system of linear recurrence relations only involving nearest neighbor multi-indices $\vec{n}\pm \vec{e}_j$, where $\vec{e}_j$ are the standard unit…
The aim of this paper is to construct sup-exponentially localized kernels and frames in the context of classical orthogonal expansions, namely, expansions in Jacobi polynomials, spherical harmonics, orthogonal polynomials on the ball and…
Multiobjective optimization problems (MOPs) are prevalent in machine learning, with applications in multi-task learning, learning under fairness or robustness constraints, etc. Instead of reducing multiple objective functions into a scalar…
We introduce multiple Wilson polynomials, which give a new example of multiple orthogonal polynomials (Hermite-Pade polynomials) of type II. These polynomials can be written as a Jacobi-Pineiro transform, which is a generalization of the…
In this article we present a method to implement orthogonal polynomials and many other special functions in Computer Algebra systems enabling the user to work with those functions appropriately, and in particular to verify different types…
We revisit the ladder operators for orthogonal polynomials and re-interpret two supplementary conditions as compatibility conditions of two linear over-determined systems; one involves the variation of the polynomials with respect to the…
The "2-variable general-$\lambda$-matrix polynomials (2VG$\lambda$MP)" is a new family of matrix polynomials, introduced and studied in this article. These matrix polynomials are constructed using umbral and symbolic methods. We delve into…
We describe symmetric diffusion operators where the spectral decomposition is given through a family of orthogonal polynomials. In dimension one, this reduces to the case of Hermite, Laguerre and Jacobi polynomials. In higher dimension,…
We express the topological expansion of the Jacobi Unitary Ensemble in terms of triple monotone Hurwitz numbers. This completes the combinatorial interpretation of the topological expansion of the classical unitary invariant matrix…
The operational calculus associated with special polynomials has proven to be a powerful tool for analyzing and simplifying their properties. This article examines the bivariate degenerate Hermite polynomials with a focus on their…
A fast and weakly stable method for computing the zeros of a particular class of hypergeometric polynomials is presented. The studied hypergeometric polynomials satisfy a higher order differential equation and generalize Laguerre…
Matrix valued Laguerre polynomials are introduced via a matrix weight function involving several degrees of freedom using the matrix nature. Under suitable conditions on the parameters the matrix weight function satisfies matrix Pearson…
We present theory and practice for robust implementations of bivariate Jacobi set and Reeb space algorithms. Robustness is a fundamental topic in computational geometry that deals with the issues of numerical errors and degenerate cases in…
A general theory of matrix-spherical functions for dual Hopf algebras and right coideal subalgebras is developed. We establish their existence and define their orthogonality relations. When specialized to Kolb and Letzter's quantum…
We present a fast Jacobi-like algorithm for computing the eigenvalues, and optionally the eigenvectors, of a real normal matrix. The method gains a computational advantage by using Paardekooper's method for skew-symmetric matrices The…
In this paper, we describe a new algorithm that approximates the extreme eigenvalue/eigenvector pairs of a symmetric matrix. The proposed algorithm can be viewed as an extension of the Jacobi eigenvalue method for symmetric matrices…
Standard multiparameter eigenvalue problems (MEPs) are systems of $k\ge 2$ linear $k$-parameter square matrix pencils. Recently, a new form of multiparameter eigenvalue problems has emerged: a rectangular MEP (RMEP) with only one…
We study Jacobi matrices on trees whose coefficients are generated by multiple orthogonal polynomials. Hilbert space decomposition into an orthogonal sum of cyclic subspaces is obtained. For each subspace, we find generators and the…
The mathematical software system polymake provides a wide range of functions for convex polytopes, simplicial complexes, and other objects. A large part of this paper is dedicated to a tutorial which exemplifies the usage. Later sections…