NTRS - NASA Technical Reports Server

Back to Results
variation in efficiency of parallel algorithmsThe present study has the objective to investigate some iterative parallel-processor linear equation solving algorithms with respect to efficiency for analyses of typical linear engineering systems. Attention is given to a set of n linear equations, Ku = p, where K = an n x n positive definite, sparsely populated, symmetric matrix, u = an n x 1 vector of unknown responses, and p = an n x 1 vector of prescribed constants. This study is concerned with a hybrid method in which iteration is used to solve the problem, while a direct method is used on the local processor level. Variations in the efficiency of parallel algorithms are explored. Measures of the efficiency are based on computer experiments regarding the algorithms. For all the algorithms, the wall clock time is found to decrease as the number of processors increases.
Document ID
Document Type
Reprint (Version printed in journal)
Hayashi, A.
(Duke Univ. Durham, NC, United States)
Melosh, R. J.
(Duke Univ. Durham, NC, United States)
Utku, S.
(Duke University Durham, NC, United States)
Salama, M.
(California Institute of Technology Jet Propulsion Laboratory, Pasadena, United States)
Date Acquired
August 12, 2013
Publication Date
January 1, 1985
Publication Information
Publication: Computers and Structures
Volume: 21
Issue: 5, 19
ISSN: 0045-7949
Subject Category
Distribution Limits