Related papers: Kaczmarz Algorithm and Frames
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.
We characterize orthonormal bases, Riesz bases and frames which arise from the action of a countable discrete group $\Gamma$ on a single element $\psi$ of a given Hilbert space $\mathcal{H}$. As $\Gamma$ might not be abelian, this is done…
Frame theory provides a robust method for recovering vectors in a Hilbert space from inner product data, though the associated decomposition formula can be computationally demanding. We relax the frame condition by studying sequences that…
The Kaczmarz algorithm in Hilbert spaces is a classical iterative method for stably recovering vectors from inner product data. In this paper, we extend the algorithm to the setting of Hilbert $C^*$-modules and establish analogues of its…
We develope a local theory for frames on finite dimensional Hilbert spaces. In particular, a bounded frame on a finite dimensional Hilbert space contains a subset which is a good Riesz basis for a percentage (arbitrarily close to one) of…
We give a comprehensive introduction to a general modular frame construction in Hilbert C*-modules and to related modular operators on them. The Hilbert space situation appears as a special case. The reported investigations rely on the idea…
Recently, frame multipliers, pair frames, and controlled frames have been investigated to improve the numerical efficiency of iterative algorithms for inverting the frame operator and other applications of frames. In this paper, the concept…
A common criterion in the design of finite Hilbert space frames is minimal coherence, as this leads to error reduction in various signal processing applications. Frames that achieve minimal coherence relative to all unit-norm frames are…
In this paper we deal with the connection of frames with the class of Hilbert Schmidt operators. First we give an easy criteria for operators being in this class using frames. It is the equivalent to the criteria using orthonormal bases.…
A finite-dimensional Hilbert space is usually described in terms of an orthonormal basis, but in certain approaches or applications a description in terms of a finite overcomplete system of vectors, called a finite tight frame, may offer…
We show that every frame for a Hilbert space H can be written as a (multiple of a) sum of three orthonormal bases for H. A result of N.J. Kalton is included which shows that this is best possible in that: A frame can be represented as a…
Finite frame theory has become a powerful tool for many applications of mathematics. In this paper we introduce a new area of research in frame theory: Integer frames. These are frames having all integer coordinates with respect to a fixed…
This paper investigates the properties of continuous frames, with a particular focus on phase retrieval and norm retrieval in the context of Hilbert spaces. We introduce the concept of continuous near-Riesz bases and prove their invariance…
Randomized Kaczmarz is a simple iterative method for finding solutions of linear systems $Ax = b$. We point out that the arising sequence $(x_k)_{k=1}^{\infty}$ tends to converge to the solution $x$ in an interesting way: generically, as $k…
We apply Lax-Milgram theorem to characterize scalable and piecewise scalable frame in finite and infinite-dimensional Hilbert spaces. We also introduce a method for approximating the inverse frame operator using finite-dimensional linear…
Unit norm finite frames are generalizations of orthonormal bases with many applications in signal processing. An important property of a frame is its coherence, a measure of how close any two vectors of the frame are to each other. Low…
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$ in a (separable) Hilbert space from the inner-products $\{\langle x, \phi_{n} \rangle\}$. The…
The Kaczmarz method is an efficient iterative algorithm for large-scale linear systems. However, its linear convergence rate suffers from ill-conditioned problems and is highly sensitive to the smallest nonzero singular value. In this work,…
Given a discrete group and a unitary representation on a Hilbert space $\mathcal{H}$, we prove that the notions of operator Bracket map and Gramian coincide on a dense set of $\mathcal{H}$. As a consequence, combining this result with known…
Frames and orthonormal bases are naturally linked to bounded operators. To tackle unbounded operators those sequences might not be well suited. This has already been noted by von Neumann in the 1920ies. But modern frame theory also…