Related papers: The Kaczmarz Algorithm in Hilbert $C^{*}$-modules
The randomized Kaczmarz method is an iterative algorithm that solves overdetermined systems of linear equations. Recently, the method was extended to systems of equalities and inequalities by Leventhal and Lewis. Even more recently, Needell…
The duality principle for Gabor frames is one of the pillars of Gabor analysis. We establish a far-reaching generalization to Morita equivalent $C^*$-algebras where the equivalence bimodule is a finitely generated projective Hilbert…
In this study, we consider a general time-space system, whose model operator and observation operator are locally Lipschitz continuous, over a finite time horizon and parameter identification by using Landweber-Kaczmarz regularization. The…
Phase retrieval in real or complex Hilbert spaces is the task of recovering a vector, up to an overall unimodular multiplicative constant, from magnitudes of linear measurements. In this paper, we assume that the vector is normalized, but…
We show that the unit ball of a full Hilbert $C^*$-module is sequentially compact in a certain weak topology if and only if the underlying $C^*$-algebra is finite dimensional. This provides an answer to the question posed in J.…
In this paper we present results concerning orthogonality in Hilbert $C^*$-modules. Moreover, for a $C^*$-algebra $\mathscr{A}$, we prove theorems concerning the multi-$\mathscr{A}$-linearity and its preservation by $\mathscr{A}$-linear…
We develop a stochastic approximation version of the classical Kaczmarz algorithm that is incremental in nature and takes as input noisy real time data. Our analysis shows that with probability one it mimics the behavior of the original…
The backward-backward algorithm is a tool for finding minima of a regularization of the sum of two convex functions in Hilbert spaces. We generalize this setting to Hadamard spaces and prove the convergence of an error-tolerant version of…
The Kaczmarz algorithm is popular for iteratively solving an overdetermined system of linear equations. The traditional Kaczmarz algorithm can approximate the solution in few sweeps through the equations but a randomized version of the…
The (abstract) Cuntz algebra is generated by non-unitary isometries and has therefore no intrinsic finiteness properties. To approximate the elements of the Cuntz algebra by finite-dimensional objects, we thus consider a spatial…
In this paper, by regarding the two-subspace Kaczmarz method [20] as an alternated inertial randomized Kaczmarz algorithm we present a new convergence rate estimate which is shown to be better than that in [20] under a mild condition.…
Frames in a Hilbert space that are generated by operator orbits are vastly studied because of the applications in dynamic sampling and signal recovery. We demonstrate in this paper a representation theory for frames generated by operator…
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,…
Randomized regularized Kaczmarz algorithms have recently been proposed to solve tensor recovery models with {\it consistent} linear measurements. In this work, we propose a novel algorithm based on the randomized extended Kaczmarz algorithm…
The Landweber algorithm defined on complex/real Hilbert spaces is a gradient descent algorithm for linear inverse problems. Our contribution is to present a novel method for accelerating convergence of the Landweber algorithm. In this…
We initiate a study of Hilbert modules over the polynomial algebra A=C[z_1,...,z_d] that are obtained by completing A with respect to an inner product having certain natural properties. A standard Hilbert module is a finite multiplicity…
In the first part of the paper we describe the dual \ell^2(A)^{\prime} of the standard Hilbert C*-module \ell^2(A) over an arbitrary (not necessarily unital) C*-algebra A. When A is a von Neumann algebra, this enables us to construct…
The Kaczmarz method is an iterative method for solving large systems of equations that projects iterates orthogonally onto the solution space of each equation. In contrast to direct methods such as Gaussian elimination or QR-factorization,…
The Kaczmarz method is an iterative algorithm for solving systems of linear equations Ax=b. Theoretical convergence rates for this algorithm were largely unknown until recently when work was done on a randomized version of the algorithm. It…
The Hildreth's algorithm is a row action method for solving large systems of inequalities. This algorithm is efficient for problems with sparse matrices, as opposed to direct methods such as Gaussian elimination or QR-factorization. We…