Randy Bank, Professor of Mathematics, UCSD
Convergence Analysis of a Domain Decomposition Paradigm
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 both global problem size N and the number of subdomains p used in the domain decomposition partition. Numerical examples illustrate the effectiveness of the procedure.
Main Campus - Engineering Classroom Wing (View Map)
1111 Engineering DR
Name: Ian Cunningham