Related papers: Differential equations for the recurrence coeffici…
We study the discrete semiclassical orthogonal polynomials of class s=1. By considering all possible solutions of the Pearson equation, we obtain five canonical families. We also consider limit relations between these and other families of…
We derive a system of difference equations satisfied by the three-term recurrence coefficients of some families of discrete orthogonal polynomials.
New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high…
Given a square complex matrix $A$, we tackle the problem of finding the nearest matrix with multiple eigenvalues or, equivalently when $A$ had distinct eigenvalues, the nearest defective matrix. To this goal, we extend the general framework…
We analyze and partially solve system of recurrences that can be derived from the properties of martingale orthogonal polynomials that characterize quadratic harnesses (QH). We also specify conditions for the existence of moments of one…
The relation between the spectral decomposition of a self-adjoint operator which is realizable as a higher order recurrence operator and matrix-valued orthogonal polynomials is investigated. A general construction of such operators from…
A high order linear $q$-difference equation with polynomial coefficients having $q$-Hahn multiple orthogonal polynomials as eigenfunctions is given. The order of the equation is related to the number of orthogonality conditions that these…
We first show the existence and nature of convergence to a limiting set of roots for polynomials in a three-term recurrence of the form $p_{n+1}(z) = Q_k(z)p_{n}(z)+ \gamma p_{n-1}(z)$ as $n$ $\rightarrow$ $\infty$, where the coefficient…
In this work, we establish strong asymptotics of multiple orthogonal polynomials of the second type for Angelesco systems with measures that satisfy Szeg\H{o} conditions. We consider multi-indices that converge to infinity in the…
We obtain some recurrence relationships among the partition vectors of the partial exponential Bell polynomials. On using such results, the $n$-th Adomian polynomial for any nonlinear operator can be expressed explicitly in terms of the…
We establish some new Tur\'an's type inequalities for orthogonal polynomials defined by a three-term recurrence with monotonic coefficients. As a corollary we deduce asymptotic bounds on the extreme zeros of orthogonal polynomials with…
Let $s$ be a finite sequence over a field of length $n$. It is well-known that if $s$ satisfies a linear recurrence of order $d$ with non-zero constant term, then the reverse of $s$ also satisfies a recurrence of order $d$ (with…
In this paper we introduce a six-parameter generalization of the four-parameter three-variable polynomials on the simplex and we investigate the properties of these polynomials. Sparse recurrence relations are derived by using ladder…
These are the notes of my lectures at the 1996 European Congress of Mathematicians. {} Polynomials appear in mathematics frequently, and we all know from experience that low degree polynomials are easier to deal with than high degree ones.…
Dual Bernstein polynomials of one or two variables have proved to be very useful in obtaining B\'{e}zier form of the $L^2$-solution of the problem of best polynomial approximation of B\'{e}zier curve or surface. In this connection, the…
We consider orthogonal polynomials on the surface of a double cone or a hyperboloid of revolution, either finite or infinite in axis direction, and on the solid domain bounded by such a surface and, when the surface is finite, by…
We look for spectral type differential equations for the generalized Jacobi polynomials and for the Sobolev-Laguerre polynomials. We use a method involving computeralgebra packages like Maple and Mathematica and we will give some…
We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…
We consider a variational convex relaxation of a class of optimal partitioning and multiclass labeling problems, which has recently proven quite successful and can be seen as a continuous analogue of Linear Programming (LP) relaxation…
In this paper we construct the main algebraic and differential properties and the weight functions of orthogonal polynomial solutions of bivariate second--order linear partial differential equations, which are admissible potentially…