In this paper we obtain sharp bounds for the zeros of classical orthogonal polynomials of a discrete variable, considered as functions of a parameter, by using a theorem of A. Markov and the so-called Hellmann-Feynman ...

An algorithmic approach for generating generalised Zernike polynomials by differential operators and connection matrices is proposed. This is done by introducing a new order of generalised Zernike polynomials such that it ...

Given an orthogonal polynomial sequence on the real line, another sequence of polynomials can be found by composing them with a Mobius transformation. In this work, we study the properties of such Mobius-transformed ...

This paper presents a simple method for decomposing and synthesizing certain decic polynomials.

A positive measure ψ defined on [a,b] such that its moments μn=∫a btndψ(t) exist for n=0,±1,±2,⋯, is called a strong positive measure on [a,b]. If 0≤a<b≤∞ then the sequence of (monic) polynomials {Qn}, defined by ∫a ...

A positive measure ψ defined on [a,b] such that its moments μn=∫a btndψ(t) exist for n=0,±1,±2,⋯, is called a strong positive measure on [a,b]. If 0≤a<b≤∞ then the sequence of (monic) polynomials {Qn}, defined by ∫a ...

Let 0 < j < m ≤ n. Kolmogoroff type inequalities of the form ∥f(j)∥2 ≤ A∥f(m)∥ 2 + B∥f∥2 which hold for algebraic polynomials of degree n are established. Here the norm is defined by ∫ f2(x)dμ(x), where dμ(x) is any ...

Let 0 < j < m ≤ n. Kolmogoroff type inequalities of the form ∥f(j)∥2 ≤ A∥f(m)∥ 2 + B∥f∥2 which hold for algebraic polynomials of degree n are established. Here the norm is defined by ∫ f2(x)dμ(x), where dμ(x) is any ...