Related papers: The Kaczmarz Algorithm in Hilbert $C^{*}$-modules
This paper considers different facets of the interplay between reproducing kernel Hilbert spaces (RKHS) and stable analysis/synthesis processes: First, we analyze the structure of the reproducing kernel of a RKHS using frames and…
In this work we construct from ground up a homotopy theory of C*-algebras. This is achieved in parallel with the development of classical homotopy theory by first introducing an unstable model structure and second a stable model structure.…
To improve the numerical efficiency of iterative algorithms for inverting the frame operator, the controlled frame was introduced by Balazs et al. \cite{Balazs}, and has since been given more importance. In this paper, we introduce the…
A frame $(x_j)_{j\in J}$ for a Hilbert space $H$ is said to do phase retrieval if for all distinct vectors $x,y\in H$ the magnitude of the frame coefficients $(|\langle x, x_j\rangle|)_{j\in J}$ and $(|\langle y, x_j\rangle|)_{j\in J}$…
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 Hilbert module is a generalisation of a Hilbert space for which the inner product takes its values in a C*-algebra instead of the complex numbers. We use the bracket product to construct some Hilbert modules over a group C*-algebra which…
The Kaczmarz algorithm is an iterative technique designed to solve consistent linear systems of equations. It falls within the category of row-action methods, focusing on handling one equation per iteration. This characteristic makes it…
We study such Hilbert C*-modules over a C*-algebra $A$, that the Banach $A$-dual module carries a natural structure of Hilbert $A$-module. In this direction we prove that if $A$ is monotone complete, $M$ and $N$ are Hilbert $A$-modules, $M$…
The tubal tensor framework provides a clean and effective algebraic setting for tensor computations, supporting matrix-mimetic features like Singular Value Decomposition and Eckart-Young-like optimality results. Underlying the tubal tensor…
This partly expository paper first supplies the details of a method of factoring a stable C*-algebra A as B \otimes K in a canonical way. Then it is shown that this method can be put into a categorical framework, much like the…
In the paper we describe the C*-algebras of noncommutative spherical tight frames over some C*-algebras and then apply to study the noncommutative version of the universal classifying space.
Understanding how systems built out of modular components can be jointly optimized is an important problem in biology, engineering, and machine learning. The backpropagation algorithm is one such solution and has been instrumental in the…
In this paper we prove two results regarding reconstruction from magnitudes of frame coefficients (the so called "phase retrieval problem"). First we show that phase retrievability as an algebraic property implies that nonlinear maps are…
In this paper, we propose a federated algorithm for solving large linear systems that is inspired by the classic randomized Kaczmarz algorithm. We provide convergence guarantees of the proposed method, and as a corollary of our analysis, we…
The randomized Kaczmarz algorithm has received considerable attention recently because of its simplicity, speed, and the ability to approximately solve large-scale linear systems of equations. In this paper we propose randomized double and…
Associated to a finite measure on the real line with finite moments are recurrence coefficients in a three-term formula for orthogonal polynomials with respect to this measure. These recurrence coefficients are frequently inputs to modern…
A frame $(x_j)_{j\in J}$ for a Hilbert space $H$ allows for a linear and stable reconstruction of any vector $x\in H$ from the linear measurements $(\langle x,x_j\rangle)_{j\in J}$. However, there are many situations where some information…
We define the local multiplier module of a Hilbert module in analogy to the local multiplier algebra for $C^*$-algebras. We use properties of the local multiplier module to lift non-closed actions on $C^*$-algebras by Hilbert bimodules to…
We describe a fast solver for linear systems with reconstructable Cauchy-like structure, which requires O(rn^2) floating point operations and O(rn) memory locations, where n is the size of the matrix and r its displacement rank. The solver…
In this paper, we introduce some new iterative optimisation algorithms on Riemannian manifolds and Hilbert spaces which have good global convergence guarantees to local minima. More precisely, these algorithms have the following properties:…