Abstract Recursion relations have been used to allow the solution of the invariant imbedding equations with singularities. We demonstrate that these same relations can be used in an efficient implementation of invariant imbedding for massively parallel computers. The parallel implementation of invariant imbedding can be used in conjuction with the method of lines to solve partial differential equations. We consider the problem of assigning lines to processors to minimize communication delays and the effect of asynchronous relaxation. Each algorithm is implemented and run on the NCUBE/ten hypercube, and timing data, speedup and normalized speedup are given. Operation counts are also given for each algorithm.
[1]
Gérard M. Baudet,et al.
Asynchronous Iterative Methods for Multiprocessors
,
1978,
JACM.
[2]
E.D. Denman,et al.
An introduction to invariant imbedding
,
1977,
Proceedings of the IEEE.
[3]
Erich Rothe,et al.
Zweidimensionale parabolische Randwertaufgaben als Grenzfall eindimensionaler Randwertaufgaben
,
1930
.
[4]
Gunter H. Meyer,et al.
One-Dimensional Parabolic Free Boundary Problems
,
1977
.
[5]
Richard C. Allen,et al.
An invariant imbedding algorithm for the solution of inhomogeneous linear two-point boundary value problems
,
1974
.