Bildstreifen

 

 

You are here: Home » Oberseminar » Archive » SS-2009 » Bank

 

Oberseminar Numerische Mathematik / Scientific Computing

 

Randolph E. Bank

USCD, University of California, San Diego

Convergence Analysis of a Domain Decomposition Paradigm

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.

Datum: 14.07.09
Zeit:17:00 Uhr
Ort:FU Berlin, Institut für Mathematik, Arnimallee 6, 14195 Berlin.
Raum:Foyer

News




© 2007 Freie Universität Berlin Feedback | 05.01.2012