Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
From MaRDI portal
Publication:5940992
DOI10.1016/S0167-8191(00)00100-9zbMath0972.68189OpenAlexW1975826938MaRDI QIDQ5940992
Dan Gordon, Rachel Gordon, Yair Censor
Publication date: 20 August 2001
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-8191(00)00100-9
Related Items
Hybrid projection methods for equilibrium problems with non‐Lipschitz type bifunctions ⋮ A general extending and constraining procedure for linear iterative methods ⋮ An accelerated randomized Kaczmarz algorithm ⋮ Improved constraint consensus methods for seeking feasibility in nonlinear programs ⋮ A hybrid Kaczmarz-conjugate gradient algorithm for image reconstruction ⋮ Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration ⋮ An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces ⋮ CADD: a seamless solution to the domain decomposition problem of subdomain boundaries and cross-points ⋮ Differential evolution with multi-constraint consensus methods for constrained optimization ⋮ Numerical investigation of Fredholm integral equation of the first kind with noisy data ⋮ AIR tools II: algebraic iterative reconstruction methods, improved implementation ⋮ Sampling and reconstruction by means of weighted inverses ⋮ Convergence results of Landweber iterations for linear systems ⋮ Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems ⋮ The standard forms and convergence theory of the Kaczmarz-Tanabe type methods for solving linear systems ⋮ AIR tools -- a MATLAB package of algebraic iterative reconstruction methods ⋮ Projection methods for the linear split feasibility problems ⋮ Generalized projections onto convex sets ⋮ Enhancement of the Kaczmarz algorithm with projection adjustment ⋮ Weighting algorithm and relaxation strategies of the Landweber method for image reconstruction ⋮ On the incomplete oblique projections method for solving box constrained least squares problems ⋮ Column-oriented algebraic iterative methods for nonnegative constrained least squares problems ⋮ Accelerating the distributed Kaczmarz algorithm by strong over-relaxation ⋮ Choosing the relaxation parameter in sequential block-iterativemethods for linear systems ⋮ The convergence of the block cyclic projection with an overrelaxation parameter for compressed sensing based tomography ⋮ Improving solver success in reaching feasibility for sets of nonlinear constraints ⋮ Controlling noise error in block iterative methods ⋮ Representations and expansions of weighted pseudoinverse matrices, iterative methods, and problem regularization. I. positive definite weights ⋮ Representations and expansions of weighted pseudoinverse matrices, iterative methods, and problem regularization. II. singular weights ⋮ Incomplete oblique projections for solving large inconsistent linear systems ⋮ Constrained Kaczmarz extended algorithm for image reconstruction ⋮ A geometric approach to quadratic optimization: an improved method for solving strongly underdetermined systems in CT ⋮ Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations ⋮ On image reconstruction algorithms for binary electromagnetic geotomography ⋮ Projected subgradient algorithms on systems of equilibrium problems ⋮ Inexact block Newton methods for solving nonlinear equations ⋮ Computational acceleration of projection algorithms for the linear best approximation problem ⋮ Parallelization of reconstruction algorithms in three-dimensional electron microscopy ⋮ Binary steering in discrete tomography reconstruction with sequential and simultaneous iterative algorithms ⋮ GPU computing with Kaczmarz's and other iterative algorithms for linear systems ⋮ Methods for computing weighted pseudoinverses and weighted normal pseudosolutions with singular weights ⋮ A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming ⋮ Weighted Generalized Inverses, Oblique Projections, and Least-Squares Problems ⋮ Notes on flexible sequential block iterative methods ⋮ A Geometrical Look at Iterative Methods for Operators with Fixed Points ⋮ Projected randomized Kaczmarz methods ⋮ Parallel ART for image reconstruction in CT using processor arrays ⋮ Surrounding the solution of a linear system of equations from all sides ⋮ Projection onto simplicial cones by a semi-smooth Newton method ⋮ Convergence and Semi-Convergence of a Class of Constrained Block Iterative Methods ⋮ Kaczmarz method with oblique projection ⋮ A Linear Programming Relaxation for Binary Tomography with Smoothness Priors ⋮ Convergence analysis of SART: optimization and statistics ⋮ A Kaczmarz Algorithm for Solving Tree Based Distributed Systems of Equations ⋮ Projection onto simplicial cones by Picard's method ⋮ An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems
