.png){kind=icon}
Return
Acceleration scheme for parallel projected aggregation methods for solving large linear systems
.png){kind=icon}
PRE
AI
DOI：10.1023/A:1021565305371.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The Projected Aggregation methods generate the new point (k+)1 as the projection of x(k) onto an aggregate hyperplane usually arising from linear combinations of the hyperplanes defined by the blocks. The aim of this paper is to improve the speed of convergence of a particular kind of them by projecting the directions given by the blocks onto the aggregate hyperplane defined in the last iteration. For that purpose we apply the scheme introduced in A new method for solving large sparse systems of linear equations using row projections [11], for a given block projection algorithm, to some new methods here introduced whose main features are related to the fact that the projections do not need to be accurately computed. Adaptative splitting schemes are applied which take into account the structure and conditioning of the matrix. It is proved that these new highly parallel algorithms improve the original convergence rate and present numerical results which show their computational efficiency.
Keywords:
projected aggregation methods
row partition strategies
parallel iterative methods
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
8.1K
Citations:
2.1W
Organization
No organization information available
Cited Papers
No cited papers available