A Kaczmarz algorithm for sequences of projections, infinite products, and applications to frames in IFS $L^{2}$ spaces
Preprint
Abstract
We show that an idea, originating initially with a fundamental recursive iteration scheme (usually referred as "the" Kaczmarz algorithm), admits important applications in such infinite-dimensional, and non-commutative, settings as are central to spectral theory of operators in Hilbert space, to optimization, to large sparse systems, to iterated function systems (IFS), and to fractal harmonic analysis. We present a new recursive iteration scheme involving as input a prescribed sequence of selfadjoint projections. Applications include random Kaczmarz recursions, their limits, and their error-estimates.Keywords
All Related Versions
This publication has 26 references indexed in Scilit:
- A new greedy Kaczmarz algorithm for the solution of very large linear systemsApplied Mathematics Letters, 2019
- The Projected Power Method: An Efficient Algorithm for Joint Alignment from Pairwise DifferencesCommunications on Pure and Applied Mathematics, 2018
- Introducing the windowed Fourier frames technique for obtaining the approximate solution of the coupled system of differential equationsJournal of Pseudo-Differential Operators and Applications, 2018
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithmMathematical Programming, 2015
- Probabilistic Frames: An Overview2013
- Acceleration of randomized Kaczmarz method via the Johnson–Lindenstrauss LemmaNumerical Algorithms, 2011
- A Randomized Kaczmarz Algorithm with Exponential ConvergenceJournal of Fourier Analysis and Applications, 2008
- Kaczmarz algorithm in Hilbert space and tight framesApplied and Computational Harmonic Analysis, 2007
- Convolutional frames and the frame potentialApplied and Computational Harmonic Analysis, 2005
- Analycity properties of the characteristic exponents of random matrix productsAdvances in Mathematics, 1979