| TR#: | CS0864 |
| Class: | CS |
| Title: | PARALLELIZABLE APPROXIMATE SOLVERS FOR
RECURSIONS ARISING IN PRECONDITIONING. |
| Authors: | Yair Shapira |
| CS0864.pdf | |
| Abstract: | For the recursions used in the Incomplete LU (ILU) preconditioner, namely, the incomplete decomposition, forward elimination and back substitution processes, a parallelizable approximate solver is presented. The present analysis shown that the solution of the recursions depends only weakly on the initial conditions and may be interpreted to indicate that the inexact solution is close to the exact one. The method is based on a domain decomposition approach, suitable for parallel implementations with message passing architectures. It required a fixed number of communications steps per preconditioned iteration, independently of the number of subdomains or the size of the problem. The subdomains are either cubes (suitable for mesh-connected arrays of processors) or constructed by the data-flow rule of the recursions (suitable for line-connected arrays with possibly SIMD or vector processors). Numerical examples show that, in both cases, the overhead in the number of iterations required for convergence of the preconditioned iteration is small relatively to the speed-up gained. |
| Copyright | The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information |
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1995/CS/CS0864), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1995
To the main CS technical reports page