AbstractIn this paper, we present a constrained version of Kaczmarz extended algorithm for improving image reconstruction from projections in computerized tomography. We prove convergence of our algorithm in the general inconsistent case to a “constrained” least squares solution of the reconstruction problem, under weaker hypothesis than those proposed in a previous paper by Koltracht and Lancaster for classical Kaczmarz’s projection method. Numerical experiments and comparisons are also presented on some model problems from the field of electromagnetic geotomography
Motivated by a class of nonlinear imaging inverse problems, for instance, multispectral computed tom...
AbstractIn this paper we construct and theoretically analyze a class of direct projection algorithms...
AbstractLet the linear system Ax=b be rectangular but solvable. If A is a large sparse matrix, then ...
AbstractIn this paper, we present a constrained version of Kaczmarz extended algorithm for improving...
In the first part of this paper we propose an extension of Cimmino's reflections algorithm to incon...
O método de Kaczmarz é um algoritmo iterativo que soluciona sistemas lineares do tipo Ax = b através...
Algebraic Reconstruction Techniques (ART), on their both successive or simultaneous formulation, hav...
The Kaczmarz’s alternating projection method has been widely used for solving a consistent (mostly o...
AbstractWe present a unifying framework for a wide class of iterative methods in numerical linear al...
Starting from an extension of Kaczmarz's method, obtained by us in a previous paper, we introduce n...
We propose two new algebraic reconstruction techniques based on Kaczmarz's method that produce a reg...
In this paper we introduce a multigrid method for sparse, possibly rank-deficient and inconsistent l...
Solving systems of linear equations, iterative methods are widely used for computing e ciency, thoug...
We combine two iterative algorithms for solving large-scale systems of linear inequalities, the rela...
The Kaczmarz method is an iterative method for solving overcomplete linear systems of equations Ax =...
Motivated by a class of nonlinear imaging inverse problems, for instance, multispectral computed tom...
AbstractIn this paper we construct and theoretically analyze a class of direct projection algorithms...
AbstractLet the linear system Ax=b be rectangular but solvable. If A is a large sparse matrix, then ...
AbstractIn this paper, we present a constrained version of Kaczmarz extended algorithm for improving...
In the first part of this paper we propose an extension of Cimmino's reflections algorithm to incon...
O método de Kaczmarz é um algoritmo iterativo que soluciona sistemas lineares do tipo Ax = b através...
Algebraic Reconstruction Techniques (ART), on their both successive or simultaneous formulation, hav...
The Kaczmarz’s alternating projection method has been widely used for solving a consistent (mostly o...
AbstractWe present a unifying framework for a wide class of iterative methods in numerical linear al...
Starting from an extension of Kaczmarz's method, obtained by us in a previous paper, we introduce n...
We propose two new algebraic reconstruction techniques based on Kaczmarz's method that produce a reg...
In this paper we introduce a multigrid method for sparse, possibly rank-deficient and inconsistent l...
Solving systems of linear equations, iterative methods are widely used for computing e ciency, thoug...
We combine two iterative algorithms for solving large-scale systems of linear inequalities, the rela...
The Kaczmarz method is an iterative method for solving overcomplete linear systems of equations Ax =...
Motivated by a class of nonlinear imaging inverse problems, for instance, multispectral computed tom...
AbstractIn this paper we construct and theoretically analyze a class of direct projection algorithms...
AbstractLet the linear system Ax=b be rectangular but solvable. If A is a large sparse matrix, then ...