Related papers: Kaczmarz Algorithm and Frames
Frame theory is recently an active research area in mathematics, computer science and engineering with many exciting applications in a variety of different fields. This theory has been generalized rapidly and various generalizations of…
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 randomized version of the Kaczmarz method for the solution of linear systems is known to converge linearly in expectation. In this work we extend this result and show that the recently proposed Randomized Sparse Kaczmarz method for…
We introduce a localization concept for operator-valued frames, where the quality of localization is measured by the associated operator-valued Gram matrix belonging to some suitable Banach algebra. We prove that intrinsic localization of…
In this paper we discuss some topics related to the general theory of frames. In particular we focus our attention to the existence of different 'reconstruction formulas' for a given vector of a certain Hilbert space and to some refinement…
The Kaczmarz method is successfully used for solving discretizations of linear inverse problems, especially in computed tomography where it is known as ART. Practitioners often observe and appreciate its fast convergence in the first few…
The construction of frames for a Hilbert space H can be equated to the decomposition of the frame operator as a sum of positive operators having rank one. This realization provides a different approach to questions regarding frames with…
The considered problem is uniform convergence of sequences of hypergeometric series. We give necessary and sufficient conditions for uniformly dominated convergence of infinite sums of proper bivariate hypergeometric terms. These conditions…
In [Steinerberger, Q. Appl. Math., 79:3, 419-429, 2021] and [Shao, SIAM J. Matrix Anal. Appl. 44(1), 212-239, 2023], two new types of Kaczmarz algorithms, which share some similarities, for consistent linear systems were proposed. These two…
In the present paper, we examine the perturbation of continuous frames and Riesz-type frames in Hilbert $C^*$-modules. We extend the Casazza-Christensen general perturbation theorem for Hilbert space frames to continuous frames in Hilbert…
We characterize the frames on an infinite dimensional separable Hilbert space that can be projected to a tight frame for an infinite dimensional subspace. A result of Casazza and Leon states that an arbitrary frame for a 2N- or…
The main purpose of our paper is a new approach to design of algorithms of Kaczmarz type in the framework of operators in Hilbert space. Our applications include a diverse list of optimization problems, new Karhunen-Lo\`eve transforms, and…
The randomized Kaczmarz algorithm is one of the most popular approaches for solving large-scale linear systems due to its simplicity and efficiency. In this paper, we propose two classes of global randomized Kaczmarz methods for solving…
The characteristic feature of inverse problems is their instability with respect to data perturbations. In order to stabilize the inversion process, regularization methods have to be developed and applied. In this work we introduce and…
The Kaczmarz method for solving a linear system $Ax = b$ interprets such a system as a collection of equations $\left\langle a_i, x\right\rangle = b_i$, where $a_i$ is the $i-$th row of $A$, then picks such an equation and corrects $x_{k+1}…
We use proof mining techniques to obtain a uniform rate of asymptotic regularity for the instance of the parallel algorithm used by L\'opez-Acedo and Xu to find common fixed points of finite families of $k$-strict pseudocontractive…
In this paper, we focus on frames of operators or K-frames on Hilbert spaces in Parseval cases. Since equal-norm tight frames play important roles for robust data transmission, we aim to study this topics on Parseval K-frames. We will show…
The Kaczmarz method is an algorithm for finding the solution to an overdetermined consistent system of linear equations Ax=b by iteratively projecting onto the solution spaces. The randomized version put forth by Strohmer and Vershynin…
Finite frames, or spanning sets for finite-dimensional Hilbert spaces, are a ubiquitous tool in signal processing. There has been much recent work on understanding the global structure of collections of finite frames with prescribed…
In the framework of inverse linear problems on infinite-dimensional Hilbert space, we prove the convergence of the conjugate gradient iterates to an exact solution to the inverse problem in the most general case where the self-adjoint,…