Journal of Approximation Theory ( IF 0.9 ) Pub Date : 2020-09-26 , DOI: 10.1016/j.jat.2020.105486 Petr A. Borodin , Eva Kopecká
Let be a family of closed subspaces of a Hilbert space , ; let be the orthogonal projection onto . We consider two types of consecutive projections of an element : alternating projections , where , and remotest projections defined recursively, being the remotest point for among . These can be interpreted as residuals in greedy approximation with respect to a special dictionary associated with . We establish parallels between convergence properties separately known for alternating projections, remotest projections, and greedy approximation in . Here are some results. If , then exponentially fast. In case , the convergence can be arbitrarily slow for certain . Such a dichotomy, exponential rate of convergence everywhere on , or arbitrarily slow convergence for certain starting elements, is valid for greedy approximation with respect to general dictionaries. The dichotomy was known for alternating projections. Using the methods developed for greedy approximation we prove that for certain positive and all starting points .
中文翻译:
交替投影,最远投影和贪婪近似
让 是希尔伯特空间的封闭子空间的族 , ; 让 正交投影到 。我们考虑元素的两种连续投影:交替投影 ,在哪里 和最远的投影 递归定义 是最遥远的地方 其中 。这些 可以解释为相对于与 。我们在收敛性之间建立了平行关系,分别针对交替投影,最远投影和贪婪近似。这是一些结果。如果, 然后 指数级快速。以防万一,收敛 可以在一定程度上任意慢 。这种二分法,无处不在的指数收敛速度,或某些起始元素的任意慢收敛,对于一般词典而言,对于贪婪近似有效。二分法以交替投影而闻名。使用为贪婪近似开发的方法,我们证明了 对于某些肯定 和所有起点 。