Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
- 1 May 2001
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 27 (6) , 777-808
- https://doi.org/10.1016/s0167-8191(00)00100-9
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- On Projection Algorithms for Solving Convex Feasibility ProblemsSIAM Review, 1996
- Signal processing applications of oblique projection operatorsIEEE Transactions on Signal Processing, 1994
- Inconsistent signal feasibility problems: least-squares solutions in a product spaceIEEE Transactions on Signal Processing, 1994
- A parallel projection method for overdetermined nonlinear systems of equationsNumerical Algorithms, 1993
- A Block Projection Method for Sparse MatricesSIAM Journal on Scientific and Statistical Computing, 1992
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problemsLinear Algebra and its Applications, 1989
- Finite series-expansion reconstruction methodsProceedings of the IEEE, 1983
- Strong underrelaxation in Kaczmarz's method for inconsistent systemsNumerische Mathematik, 1983
- Iterative algorithms for large partitioned linear systems, with applications to image reconstructionLinear Algebra and its Applications, 1981
- The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programmingUSSR Computational Mathematics and Mathematical Physics, 1967