NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Parallel algorithms for boundary value problemsA general approach to solve boundary value problems numerically in a parallel environment is discussed. The basic algorithm consists of two steps: the local step where all the P available processors work in parallel, and the global step where one processor solves a tridiagonal linear system of the order P. The main advantages of this approach are twofold. First, this suggested approach is very flexible, especially in the local step and thus the algorithm can be used with any number of processors and with any of the SIMD or MIMD machines. Secondly, the communication complexity is very small and thus can be used as easily with shared memory machines. Several examples for using this strategy are discussed.
Document ID
19910046552
Document Type
Reprint (Version printed in journal)
Authors
Lin, Avi (NASA Lewis Research Center Cleveland, OH; Pennsylvania, University, Philadelphia, United States)
Date Acquired
August 14, 2013
Publication Date
April 1, 1991
Publication Information
Publication: Journal of Parallel and Distributed Computing
Volume: 11
ISSN: 0743-7315
Subject Category
NUMERICAL ANALYSIS
Funding Number(s)
CONTRACT_GRANT: NASA ORDER C-99066-G
Distribution Limits
Public
Copyright
Other