Parallel algorithms for the direct solution of finite element equations on a distributed memory computer
This work constitutes the first phase of a long-term project, namely the efficient implementation of direct solution methods for complex finite element problems on distributed memory parallel computers. Although for the most part limited to the one-dimensional case, our results demonstrate the potential of parallel computing for this class of problems. It is found that the efficiency of the proposed algorithms increases as the problem size increases. We have shown that a performance model can be developed and used for predicting with good accuracy the behavior of the proposed algorithms. Finally, our preliminary results for the two-dimensional case are encouraging. Work is underway to further generalize the present approach to complex multi-dimensional problems.
Unable to display preview. Download preview PDF.
- L. Bomans and D. Roose, Benchmarking the iPSC/2 Hypercube Multiprocessor, Concurrency, Practice and Experience, Vol.1, 3–18 (1989)Google Scholar
- G.C. Fox, M.A. Johnson, G.A. Lyzenga, S.W. Otto, J.K. Salmon, and D.W. Walker, Solving Problems on Concurrent Processors (Vol.1), Prentice Hall (1988)Google Scholar
- A. Krechel, H.J. Plum, and K. Stuben, Parallel Solution of Tridiagonal Linear Systems, Proc. of the 1st European Workshop on Hypercube and Distributed Computers, F. André and J.P. Verjus (eds), North Holland, 49–63 (1989)Google Scholar
- J.N. Reddy, Applied Functional Analysis and Variational Methods in Engineering, Mc Graw Hill (1986)Google Scholar