2015
DOI: 10.1007/s10440-015-0012-7
|View full text |Cite
|
Sign up to set email alerts
|

Zeros of Sobolev Orthogonal Polynomials via Muckenhoupt Inequality with Three Measures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
4
1

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 21 publications
0
5
0
Order By: Relevance
“…There are several papers on this issue (e.g. [1,2,8,9,12,14]). These polynomials are useful in Fourier analysis ( [5,14]), numerical analysis ( [6]), and so on (see [9] and references therein).…”
Section: Introduction and Main Resultsmentioning
confidence: 99%
“…There are several papers on this issue (e.g. [1,2,8,9,12,14]). These polynomials are useful in Fourier analysis ( [5,14]), numerical analysis ( [6]), and so on (see [9] and references therein).…”
Section: Introduction and Main Resultsmentioning
confidence: 99%
“…There are several papers on this issue (e.g. [1,2,7,8,11,13]). These polynomials are useful in Fourier analysis [13], numerical analysis [5], and so on (see [8] and references therein).…”
Section: Theoremmentioning
confidence: 99%
“…In [1] the authors obtain the th root asymptotic of Sobolev orthogonal polynomials when the zeros of these polynomials are contained in a compact set of the complex plane; however, the boundedness of the zeros of Sobolev orthogonal polynomials is an open problem, but as was stated in [2], it could be obtained as a consequence of the boundedness of the multiplication operator ( ) = ( ). Thus, finding conditions to ensure the boundedness of would provide important information about the crucial issue of determining the asymptotic behavior of Sobolev orthogonal polynomials (see, e.g., [3][4][5][6][7][8][9][10][11][12][13]). The more general result on this topic is [ (1) (see Theorem 3 below, which is [3,Theorem 8.1] in the case = 1).…”
Section: Introductionmentioning
confidence: 99%