2000
DOI: 10.1080/10236190008808211
|View full text |Cite
|
Sign up to set email alerts
|

Inner products involving differences: the meixner—sobolev polynomials

Abstract: In this paper, polynomials which are orthogonal with respect to the inner productwhere 0 < J.I < I, ')' > 0 and ). 2: 0 are studied. For these polynomials, algebraic properties and difference equations are obtained as well as their relation with the Meixner polynomials. Moreover, some properties about the zeros of these polynomials are deduced.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
21
0

Year Published

2005
2005
2018
2018

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 15 publications
(21 citation statements)
references
References 19 publications
0
21
0
Order By: Relevance
“…The polynomials {S n } were introduced for the first time in [1], and they are the so-called Δ-Meixner-Sobolev orthogonal polynomials. They are normalized by the condition that the leading coefficient of S n (x) equals the leading coefficient of m n (x; β, c), n ≥ 0.…”
Section: δ-Meixner-sobolev Orthogonal Polynomials: the Known Factsmentioning
confidence: 99%
“…The polynomials {S n } were introduced for the first time in [1], and they are the so-called Δ-Meixner-Sobolev orthogonal polynomials. They are normalized by the condition that the leading coefficient of S n (x) equals the leading coefficient of m n (x; β, c), n ≥ 0.…”
Section: δ-Meixner-sobolev Orthogonal Polynomials: the Known Factsmentioning
confidence: 99%
“…To obtain a uniform asymptotic approximation, we will use the cubic transformation suggested by Chester, Friedman and Ursell [4] f (t) = 1 3…”
Section: The Casementioning
confidence: 99%
“…When λ = 0 the Meixner-Sobolev polynomials reduce to the classical Meixner polynomials. These polynomials were introduced in [1], and a recurrence relation involving S n , S n−1 and 2 classical Meixner polynomials are given in [2] and [7]. This recurrence relation is very useful for generating the polynomials.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations