Related papers: Generating Ouroboros Polynomials and Ouroboros Mat…
We enhance the approximation capabilities of algebraic polynomials by composing them with homeomorphisms. This composition yields families of functions that remain dense in the space of continuous functions, while enabling more accurate…
Multivariate orthogonal polynomials can be introduced by using a moment functional defined on the linear space of polynomials in several variables with real coefficients. We study the so-called Uvarov and Christoffel modifications obtained…
We have been working in many aspects of the problem of analyzing, understanding and solving ordinary differential equations (first and second order). As we have extensively mentioned, while working in the Darboux type methods, the most…
In this paper we consider in detail the composition of an irreducible polynomial with X^2 and suggest a recurrent construction of irreducible polynomials of fixed degree over finite fields of odd characteristics. More precisely, given an…
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…
We are studying here the classical operator creating secondary polynomials associated with an orthogonal system for a continuous probability density function on a real interval. We know it is possible with the coupling of Stietjes…
The aim of this paper is to bring into the picture a new phenomenon in the theory of orthogonal matrix polynomials satisfying second order differential equations. The last few years have witnessed some examples of a (fixed) family of…
Loop invariants are properties of a program loop that hold before and after each iteration of the loop. They are often employed to verify programs and ensure that algorithms consistently produce correct results during execution.…
We apply a symbolic approach of the general quadratic decomposition of polynomial sequences - presented in a previous article referenced herein - to polynomial sequences fulfilling specific orthogonal conditions towards two given…
In the present paper we derive complicated families of orthogonal polynomials in one variable from scratch using the known ones as building blocks. We recall the basics of operational formalism and introduce the notations we use throughout…
We show combinatorially that the higher-order matching polynomials of several families of graphs are d-orthogonal polynomials. The matching polynomial of a graph is a generating function for coverings of a graph by disjoint edges; the…
The spectral decomposition for an explicit second-order differential operator $T$ is determined. The spectrum consists of a continuous part with multiplicity two, a continuous part with multiplicity one, and a finite discrete part with…
The idea of orthogonal polynomials has been generalized in two ways to achieve new types of polynomials: noncommutative orthogonal polynomials and biorthogonal polynomials. This paper brings these two different generalizations together to…
We investigate several families of multiple orthogonal polynomials associated with weights for which the moment generating functions are hypergeometric series with slightly varying parameters. The weights are supported on the unit interval,…
This article is a survey on the topic of polynomial amoebas. We review results of papers written on the topic with an emphasis on its computational aspects. Polynomial amoebas have numerous applications in various domains of mathematics and…
This paper addresses an investigation on a factorization method for difference equations. It is proved that some classes of second order linear difference operators, acting in Hilbert spaces, can be factorized using a pair of mutually…
In this paper a general theory of semi-classical matrix orthogonal polynomials is developed. We define the semi-classical linear functionals by means of a distributional equation $D(u A) = u B,$ where $A$ and $B$ are matrix polynomials.…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
We study here a sequence of secondary measures, so called because the set of secondary polynomials on a given term become orthogonal for the next measure. The main result is a formula making explicit the density of any term of the sequence,…
Inspired by prior work of Bruinier and Ono and Mertens and Rolen, we study class polynomials for non-holomorphic modular functions arising from modular forms of negative weight. In particular, we give general conditions for the…