On Remotest set and Random controls in Kaczmarz algorithm
arXiv:1704.046601 citationsh-index: 13
Originality Synthesis-oriented
AI Analysis
Theoretical insight for users of Kaczmarz-type algorithms who need guaranteed index recurrence.
The paper analyzes the Kaczmarz algorithm with Remotest set and Random control, providing a sufficient condition for each projection index to appear infinitely often during iterations.
In this paper we analyse the Kaczmarz projection algorithm with Remotest set and Random control of projection indices and provide a sufficient condition such that each projection index appears infinitely many times during the iterations.