Rate of convergence of the discrete Pólya Algorithm

AbstractIn approximating an arbitrary point of Rn from a fixed subspace, it is known that the net of lp-best approximations, 1 ⩽ p < ∞, converges to the strict uniform best approximation. It is shown that this convergence occurs at a rate no worse than 1p. It is also shown by example that this rate may be achieved