Access the full text.
Sign up today, get DeepDyve free for 14 days.
P. Cazassa, O. Christensen (1997)
Perturbation of operators and applications to frame theoryJournal of Fourier Analysis and Applications, 3
F. Natterer (1986)
The Mathematics of Computerized Tomography
Yan Tan, R. Vershynin (2017)
Phase Retrieval via Randomized Kaczmarz: Theoretical GuaranteesArXiv, abs/1706.09993
D. Needell, Rachel Ward, N. Srebro (2013)
Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithmMathematical Programming, 155
O. Christensen (2002)
An introduction to frames and Riesz bases
W. Czaja, James Tanis (2013)
Kaczmarz Algorithm and FramesArXiv, abs/1409.8310
O. Christensen (1999)
Operators with Closed Range, Pseudo-Inverses, and Perturbation of Frames for a SubspaceCanadian Mathematical Bulletin, 42
(1995)
Frame perturbations
R. Haller, R. Szwarc (2005)
Kaczmarz algorithm in Hilbert spaceStudia Mathematica, 169
Halyun Jeong, C. Güntürk (2017)
Convergence of the randomized Kaczmarz method for phase retrievalArXiv, abs/1706.10291
R. Szwarc (2005)
Kaczmarz algorithm in Hilbert space and tight framesApplied and Computational Harmonic Analysis, 22
Helly (1936)
Fourier transforms in the complex domainMonatshefte für Mathematik und Physik, 44
S. Kaczmarz (1993)
Approximate solution of systems of linear equationsInternational Journal of Control, 57
S. Kwapień, J. Mycielski (2001)
On the Kaczmarz algorithm of approximation in infinite dimensional spacesStudia Mathematica, 148
P. Casazza (1999)
THE ART OF FRAME THEORYTaiwanese Journal of Mathematics, 4
The Kaczmarz algorithm is an iterative method for solving a system of linear equations. It can be extended so as to reconstruct a vector x\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$x$\end{document} in a (separable) Hilbert space from the inner-products {〈x,ϕn〉}\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$\{\langle x, \phi _{n} \rangle \}$\end{document}. The Kaczmarz algorithm defines a sequence of approximations from the sequence {〈x,ϕn〉}\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$\{\langle x, \phi _{n} \rangle \}$\end{document}; these approximations only converge to x\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$x$\end{document} when {ϕn}\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$\{\phi _{n}\}$\end{document} is effective. We dualize the Kaczmarz algorithm so that x\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$x$\end{document} can be obtained from {〈x,ϕn〉}\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$\{\langle x, \phi _{n} \rangle \}$\end{document} by using a second sequence {ψn}\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$\{\psi _{n}\}$\end{document} in the reconstruction. This allows for the recovery of x\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$x$\end{document} even when the sequence {ϕn}\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$\{\phi _{n}\}$\end{document} is not effective; in particular, our dualization yields a reconstruction when the sequence {ϕn}\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$\{\phi _{n}\}$\end{document} is almost effective. We also obtain some partial results characterizing when the sequence of approximations from {〈x,ϕn〉}\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$\{\langle x, \phi _{n} \rangle \}$\end{document} using {ψn}\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$\{\psi _{n}\}$\end{document} converges to x\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$x$\end{document}, in which case {(ϕn,ψn)}\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$\{(\phi _{n}, \psi _{n})\}$\end{document} is called an effective pair.
Acta Applicandae Mathematicae – Springer Journals
Published: Feb 14, 2020
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.