Kaczmarz algorithm in Hilbert space and tight frames

DOI10.1016/J.ACHA.2006.11.001MaRDI QIDQ877581zbMATH OpenOpenAlexFDO

Authors Ryszard Szwarc

Publication date 3 May 2007

Published in Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0509236

zbMATH Keywords

tight frameBessel sequence

Mathematics Subject Classification ID

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Abstract: We prove that any tight frame in Hilbert space can be obtained by the Kaczmarz algorithm. An explicit way of constructing this correspondence is given. The uniqueness of the correspondence is determined.

Cites work

• Approximate solution of systems of linear equations†
• Kaczmarz algorithm in Hilbert space
• On the Kaczmarz algorithm of approximation in infinite-dimensional spaces

Cited in

(6)

• Stability of the Kaczmarz reconstruction for stationary sequences
• Kaczmarz algorithm and frames
• The dual Kaczmarz algorithm
• Kaczmarz algorithm in Hilbert space
• A Kaczmarz algorithm for sequences of projections, infinite products, and applications to frames in IFS \(L^2\) spaces
• Almost sure convergence of the Kaczmarz algorithm with random measurements

This page was built for publication: Kaczmarz algorithm in Hilbert space and tight frames

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877581)