Abstract: We describe a domain decomposition algorithm for use in the parallel adaptive meshing paradigm of Bank and Holst. Our algorithm has low communication, makes extensive use of existing sequential solvers, and exploits in several important ways data generated as part of the adaptive meshing paradigm. Numerical examples illustrate the effectiveness of the procedure. The work of this author was supported by the National Science Foundation under contract DMS-0208449. The UCSD Scicomp Beowulf cluster was built using funds provided by the National Science Foundation through SCREMS Grant 0112413, with matching funds from the University of California at San Diego.
Future talks in Scientific Computing Seminar March 31 : Roland Freund, Department of Mathematics, UC Davis. April 7 : Jin-Fa Lee, The ElectroScience Laboratory, The Ohio State University. April 28 : Gene H Golub, Department of Computer Science, Stanford University.
This seminar is easily accessible to persons with disabilities. For more information or for assistance, please contact the Mathematics Department at 743-3500.