Rate of convergence of the linear discrete Pólya algorithm (Q5937257)

Let \(K\) be a proper affine subspace of \({\mathbb R}^n\), and \(h_p,\;1<p<\infty\) is the best approximation of a given element \(h\in{\mathbb R}^n\setminus K\) from \(K\) in the \(\ell^p\)-norm of \({\mathbb R}^n\). The strict uniform approximation \(h^\ast_\infty=\lim_{p\to\infty}h_p\) is a best uniform approximation of \(h\) from \(K\) in the \(\ell^\infty\)-norm of \({\mathbb R}^n\), defined by the so called Pólya algorithm. In this paper the authors describe the rate of convergence of \(h_p\) to \(h^\ast_\infty\) in the \(\ell^\infty\)-norm \(\|x\|_\infty=\max_{1\leq j\leq n}|x_j|\). Namely, they show that if \(\lim_{p\to\infty}p\|h_p-h^\ast_\infty\|=0\), then there is a number \(a\in (0,1)\) such that \(\max_{p\in(1,\infty)}(p/a^p)\|h_p-h^\ast_\infty\|<\infty\).