Comparison of several iterative techniques in the solution of symmetric banded equations on a two-pipe Cyber 205
By: Clyde Scandrett
Contributors: Naval Postgraduate School (U.S.). Dept. of Mathematics
Publisher: Naval Postgraduate School; Available from National Technical Information Service
Published: 1988
Place of publication: Monterey, Calif; Springfield, Va
Language: eng
Number of pages: 27
Subjects: ITERATIONS
Other titles: NPS-53-89-006.
Description: The effectiveness of several iterative techniques for solving matrix equations resulting from      finite difference approximations to self-adjoint parabolic and elliptic partial differential      equations is reviewed. The techniques include Stone's Strongly Implicit Procedure (SIP) and      several conjugate gradient algorithms with varying preconditioners. The comparison is made      on a vector machine (two-pipe Cyber 205) where vectorization of the code is done primarily      by the vector machine compiler available. It is found that of the methods studied, POLCG      (Polynominal Preconditioned Conjugate Gradient Method) and MICCG (Modified      Incomplete Cholesky Conjugate Gradient Method) appear to require the least amount of      central processing time. An advantage of MICCG and POLCG is that it is less sensitive to      increasing matrix size. Its disadvantages are that it requires an iteration parameter, has a      greater set-up time, and needs more storage than POLCG. (kr)
Notes: Cover title.

"NPS-53-89-006."

"November 1988."

AD A204 164.

Includes bibliographical references (p. 24-27)

aq/  /aq cc:9116 10/21/97