Classical domain decomposition techniques allow the modelling of wave propa
gation in large structures with multiprocessor resources. Indeed, domain de
composition can be viewed as a natural way for parallelism. In the first pa
rt of our work we analyze a well-known technique, the Schur complement meth
od, and discuss its viability in terms of efficiency and complexity. Later,
we introduce a novel domain decomposition algorithm, which is aimed at mes
sage-passing environments and reduces considerably the communication betwee
n processes. The result is a technique very competitive in the framework of
parallel computing, which gives good results from the modelling viewpoint.
(C) 1999 Elsevier Science Ltd. All rights reserved.