Starting from an extension of Kaczmarz's method, obtained by us in a previous paper, we introduce new directions for projections. We prove that by this, we don't modify the set of limit points of the original extended Kaczmarz algorithm. For the class of boundary value problems or integral equations of the first kind, we describe a method for constructing these new directions. It is based on considering coarser level of discretization for the initial problem. Some numerical experiments are also presented
The method of alternating projections (MAP) is an iterative procedure for finding the projection of ...
AbstractCimmino's and Kaczmarz's methods are two classes of row projection (RP) methods for solving ...
We present a Projection onto Convex Sets (POCS) type algorithm for solving systems of linear equatio...
AbstractIn this paper we construct and theoretically analyze a class of direct projection algorithms...
AbstractIn this paper we introduce an acceleration procedure for a block version of the generalizati...
AbstractIn this paper, we present a constrained version of Kaczmarz extended algorithm for improving...
The Bregman-Kaczmarz method is an iterative method which can solve strongly convex problems with lin...
AbstractWe extend a block version of Kaczmarz's method with the “most violated constraint” control t...
The Kaczmarz method is an iterative method for solving overcomplete linear systems of equations Ax =...
AbstractLet the linear system Ax=b be rectangular but solvable. If A is a large sparse matrix, then ...
We propose a new randomized method for solving systems of nonlinear equations, which can find sparse...
ABSTRACT. The Kaczmarz method is an iterative method for solving overcomplete linear systems of equa...
We propose a deterministic Kaczmarz algorithm for solving linear systems $A\x=\b$. Different from pr...
The Kaczmarz method is an algorithm for finding the solution to an overdetermined consistent system ...
We combine two iterative algorithms for solving large-scale systems of linear inequalities, the rela...
The method of alternating projections (MAP) is an iterative procedure for finding the projection of ...
AbstractCimmino's and Kaczmarz's methods are two classes of row projection (RP) methods for solving ...
We present a Projection onto Convex Sets (POCS) type algorithm for solving systems of linear equatio...
AbstractIn this paper we construct and theoretically analyze a class of direct projection algorithms...
AbstractIn this paper we introduce an acceleration procedure for a block version of the generalizati...
AbstractIn this paper, we present a constrained version of Kaczmarz extended algorithm for improving...
The Bregman-Kaczmarz method is an iterative method which can solve strongly convex problems with lin...
AbstractWe extend a block version of Kaczmarz's method with the “most violated constraint” control t...
The Kaczmarz method is an iterative method for solving overcomplete linear systems of equations Ax =...
AbstractLet the linear system Ax=b be rectangular but solvable. If A is a large sparse matrix, then ...
We propose a new randomized method for solving systems of nonlinear equations, which can find sparse...
ABSTRACT. The Kaczmarz method is an iterative method for solving overcomplete linear systems of equa...
We propose a deterministic Kaczmarz algorithm for solving linear systems $A\x=\b$. Different from pr...
The Kaczmarz method is an algorithm for finding the solution to an overdetermined consistent system ...
We combine two iterative algorithms for solving large-scale systems of linear inequalities, the rela...
The method of alternating projections (MAP) is an iterative procedure for finding the projection of ...
AbstractCimmino's and Kaczmarz's methods are two classes of row projection (RP) methods for solving ...
We present a Projection onto Convex Sets (POCS) type algorithm for solving systems of linear equatio...