Metrics
99 Record Views
Book chapter
Domain decomposition for particle methods on the sphere
Parallel Algorithms for Irregularly Structured Problems: Third International Workshop, IRREGULAR '96, Santa Barbara, CA, USA, August 19 - 21, 1996. Proceedings, pp.119-130
Lecture Notes in Computer Science, volume 1117, Springer Berlin Heidelberg
06/16/2005
Abstract
We present an algorithm for efficient parallelization of particle methods when the domain is the surface of a sphere. Such applications typically arise when dealing with directional data. We propose a domain decomposition scheme based on geometric partitioning that provides domains suitable for practical implementation. This algorithm has the advantage of being fast enough to be applied dynamically, and at the same time provides good partitions, comparable in quality to those produced by spectral graph partitioning schemes.
Related links
Details
- Title
- Domain decomposition for particle methods on the sphere
- Publication Details
- Parallel Algorithms for Irregularly Structured Problems: Third International Workshop, IRREGULAR '96, Santa Barbara, CA, USA, August 19 - 21, 1996. Proceedings, pp.119-130
- Resource Type
- Book chapter
- Publisher
- Springer Berlin Heidelberg; Berlin, Heidelberg
- Series
- Lecture Notes in Computer Science; volume 1117
- Copyright
- © 1996 Springer-Verlag Berlin Heidelberg
- Identifiers
- 99380178095606600
- Academic Unit
- Hal Marcus College of Science and Engineering ; Computer Science
- Language
- English