The rate of convergence of the discrete Polya-1 algorithm is studied. Examples are given to show that the rates derived are sharp. (c) 1993 Academic Press, Inc
Rate of convergence of the discrete Pólya Algorithm
✍ Scribed by Alan Egger; Robert Huotari
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 355 KB
- Volume
- 60
- Category
- Article
- ISSN
- 0021-9045
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We show that one can construct a continuous selection for the metric projection in the space of continuous functions by the Pólya algorithm. Moreover, the existence of a continuous selection for the metric projection is equivalent to the stable convergence of the Pólya algorithm. 1995 Academic Press
In his paper [l] P6lya defines the following function P, mapping the interval [0, I] onto a right triangle T. Let t be any number in the unit interval; expand it into a binary fraction: t = .d,d, ... The n-th digit d,(t) of t is either 0 or 1. For each t we assign a sequence of nested triangles T