[Home]   [  News]   [  Events]   [  People]   [  Research]   [  Education]   [Visitor Info]   [UCSD Only]   [Admin]
Home > Events > CCoM > Abstract
Search this site:


Directors:
Randolph E. Bank
Philip E. Gill
Michael Holst

Administrative Contact:
Terry Le

Office: AP&M 7431
Phone: (858)534-9813
Fax: (858)534-5273
E-mail: tele@ucsd.edu
Convergence Analysis of a Domain Decomposition Paradigm

Randolph E. Bank
Department of Mathematics, UCSD

Abstract:

We describe a domain decomposition algorithm for use in several variants of the parallel adaptive meshing paradigm of Bank and Holst. This 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. We show that for an idealized version of the algorithm, the rate of convergence is independent of both the global problem size N and the number of subdomains p used in the domain decomposition partition. Numerical examples illustrate the effectiveness of the procedure.

This is joint work with Panayot Vassilevski, LawrenceLivermore National Laboratory

Tuesday, October 9, 2007
11:00AM AP&M 2402