Solving elliptic difference equations on a linear array of processors. (English) Zbl 0601.65077

Saad, Y.; Sameh, A.; Saylor, P.

SIAM J. Sci. Stat. Comput. 6, 1049-1063 (1985).

Authors’ summary: We consider the organization of three iterative methods for solving self-adjoint elliptic difference equations on a set of linearly connected processors. These algorithms are the cyclic Chebyshev semi-iterative scheme, a preconditioned conjugate gradient method, and a generalization of the Chebyshev method. We also compare their performance on this multiprocessor as a function of the cost of interprocessor communication.

Reviewer: I.H.Mufti

MSC:

65N22	Numerical solution of discretized equations for boundary value problems involving PDEs
65F10	Iterative numerical methods for linear systems
35J25	Boundary value problems for second-order elliptic equations

Keywords:

parallel algorithms; cyclic Chebyshev semi-iterative scheme; preconditioned conjugate gradient method; multiprocessor