Related papers: A Stieltjes algorithm for generating multivariate …
Ordinary orthogonal polynomials are uniquely characterized by the three term recurrence relations up to an overall multiplicative constant. We show that the newly discovered M-indexed orthogonal polynomials satisfy 3+2M term recurrence…
Sequences of bivariate orthogonal polynomials written as vector polynomials of increasing size satisfy a couple of three term relations with matrix coefficients. In this work, introducing a time-dependent parameter, we analyse a Lax-type…
Due to its convolution nature, the Stieltjes integral equation can be diagonalized by Mellin transform. Several explicit resolvent kernels were obtained over the years, all of convolution type. The conditions on the given function under…
This paper gives via Stieltjes transform a complete description of the solution set of a matricial truncated Stieltjes-type power moment problem in the non-degenerate and degenerate cases. The approach is based on the Schur type algorithm…
Various numerical linear algebra problems can be formulated as evaluating bivariate function of matrices. The most notable examples are the Fr\'echet derivative along a direction, the evaluation of (univariate) functions of…
We show that Stieltjes moment sequences are infinitely log-convex, which parallels a famous result that (finite) P\'olya frequency sequences are infinitely log-concave. We introduce the concept of $q$-Stieltjes moment sequences of…
We prove a solvability theorem for the Stieltjes moment problem on $R^d$ which is based on the multivariate Stieltjes condition $\sum_{n=1}^\infty L(x_j^n)^{-1/(2n)}=+\infty$, $j=1,\dots,d.$ This result is applied to derive a new…
In this paper, we consider methods to compute the coefficients of interpolants relative to a basis of polynomials satisfying a three-term recurrence relation. Two new algorithms are presented: the first constructs the coefficients of the…
Optimization over the Stiefel manifold is a fundamental computational problem in many scientific and engineering applications. Despite considerable research effort, high-dimensional optimization problems over the Stiefel manifold remain…
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…
Multiple orthogonal polynomials are a generalization of orthogonal polynomials in which the orthogonality is distributed among a number of orthogonality weights. They appear in random matrix theory in the form of special determinantal point…
We present computational methods for constructing orthogonal/orthonormal polynomials over arbitrary polygonal domains in $\mathbb{R}^2$ using bivariate spline functions. Leveraging a mature MATLAB implementation which generates spline…
Multidimensional Scaling (MDS) is a classic technique that seeks vectorial representations for data points, given the pairwise distances between them. However, in recent years, data are usually collected from diverse sources or have…
The generalized Stieltjes--Wigert polynomials depending on parameters 0\le p<1 and 0<q<1 are discussed. By removing the mass at zero of the N-extremal solution concentrated in the zeros of the D-function from the Nevanlinna parametrization,…
We study analytic and geometric properties of Stieltjes and inverse Stieltjes families defined on a separable Hilbert space and establish various minimal representations for them by means of compressed resolvents of various types of linear…
This paper presents an efficient parallel direct algorithm with near-optimal complexity for the compact fourth and sixth-order approximation of the three-dimensional Helmholtz equations [1] with the problem coefficient depending on only one…
In this paper, we study some existence and uniqueness results for systems of differential equations in which each of equations of the system involves a different Stieltjes derivative. Specifically, we show that this problems can only have…
Evaluating a polynomial on a set of points is a fundamental task in computer algebra. In this work, we revisit a particular variant called trimmed multipoint evaluation: given an $n$-variate polynomial with bounded individual degree $d$ and…
We present two approaches for computing rational approximations to multivariate functions, motivated by their effectiveness as surrogate models for high-energy physics (HEP) applications. Our first approach builds on the Stieltjes process…
We investigate new generalizations of the Meixner polynomials on the lattice $\mathbb{N}$, on the shifted lattice $\mathbb{N}+1-\beta$ and on the bi-lattice $\mathbb{N}\cup (\mathbb{N}+1-\beta)$. We show that the coefficients of the…