1983
DOI: 10.1016/0021-9045(83)90129-6
|View full text |Cite
|
Sign up to set email alerts
|

The Polya algorithm in L∞ approximation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
14
0

Year Published

1984
1984
1993
1993

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 14 publications
(14 citation statements)
references
References 8 publications
0
14
0
Order By: Relevance
“…The Polya property fails for an arbitrary / in Lx [2,1] but, as is shown in this note, the Polya-one property obtains.…”
Section: |/-/||/; = Inf{||/-/!||/):ägm}mentioning
confidence: 75%
“…The Polya property fails for an arbitrary / in Lx [2,1] but, as is shown in this note, the Polya-one property obtains.…”
Section: |/-/||/; = Inf{||/-/!||/):ägm}mentioning
confidence: 75%
“…Notice that the study of the convergence as p -* oo of p-predictions on uniformly convex spaces was carried out in [7], but the proof of the existence of the limit is not satisfactory as pointed out in [4]. (Also in connection with the Pólya algorithm see [5].)…”
Section: Introductionmentioning
confidence: 99%
“…In particular, it generalizes the simultaneous-Polya-algorithm-convergence result of [12], and it establishes the convergence of the Polya algorithm in a general context which includes the approximation of multivariate by univariate functions [1]. [2] Tubular sets and multivariate Polya algorithm 233 Ifw = (w u ...,w n )eW let ' l < p < c x ) and llwlloo = max \x t \.…”
mentioning
confidence: 99%
“…Current usage of the Polya algorithm is primarily theoretical. In [2] it was used to show that best uniform approximations exist, in [6] its limit was shown to be a Lipschitz uniform selection operator, and in [3] and [8] its convergence was studied in new contexts. The theme underlying these studies is the evolution of L p to L x as p -> oo.…”
mentioning
confidence: 99%
See 1 more Smart Citation