The dual Kaczmarz algorithm (Q2304861): Difference between revisions

The authors use duality for a study of the Kaczmarz algorithm. The Kaczmarz algorithm can be used to reconstruct a vector \(x\) in a Hilbert space given a sequence of inner-products \( \{ \langle x, \varphi_n \rangle \} \). The method however converges when \( \{ \varphi_n \} \) forms an effective sequence. The novelty of the current paper is to extend this method to the case when \( \{ \varphi_n \} \) is not effective. The authors obtain some characterization using operators and frame theory. The paper is organized as follows: Section 1 discusses the history of the subject and provides an introduction to frame theory. In Section 2, the authors present the main results in two subsections. They characterize symmetric effective pairs and study almost effective sequences by duality. In Section 3, some interesting examples are presented.