Skip to search formSkip to main contentSkip to account menu

Kaczmarz method

Known as: Kaczmar's algorithm 
The Kaczmarz method or Kaczmarz's algorithm is an iterative algorithm for solving linear equation systems . It was first discovered by the Polish… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
To exploit the benefits of massive multiple‐input multiple‐output (M‐MIMO) technology in scenarios where base stations (BSs) need… 
Highly Cited
2016
Highly Cited
2016
We study the problem of recovering a vector $\bx\in \bbR^n$ from its magnitude measurements $y_i=|\langle \ba_i, \bx\rangle|, i=1… 
Highly Cited
2016
Highly Cited
2016
We combine two iterative algorithms for solving large-scale systems of linear inequalities, the relaxation method of Agmon… 
2016
2016
Using the Kaczmarz algorithm, we obtain a Fourier series formulation for functions in the L2 space of singular measures on the… 
2014
2014
The randomized Kaczmarz method is an iterative algorithm that solves systems of linear equations. Recently, the randomized method… 
Highly Cited
2014
Highly Cited
2014
An algorithmic framework to compute sparse or minimal-TV solutions of linear systems is proposed. The framework includes both the… 
2013
2013
Abstract. In this contribution a coherent relation between the algebraic and the transform-based reconstruction technique for… 
Highly Cited
2010
Highly Cited
2010
The Kaczmarz method is an algorithm for finding the solution to an overdetermined consistent system of linear equations Ax = b by… 
Highly Cited
2006
Highly Cited
2006
We introduce a class of stabilizing Newton--Kaczmarz methods for nonlinear ill-posed problems and analyze their convergence and…