Algorithms and data structures for massively parallel generic adaptive finite element codes
Abstract
Today's largest supercomputers have 100,000s of processor cores and offer the potential to solve partial differential equations discretized by billions of unknowns. However, the complexity of scaling to such large machines and problem sizes has so far prevented the emergence of generic software libraries that support such computations, although these would lower the threshold of entry and enable many more applications to benefit from large-scale computing.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Dec 01, 2011
- Source ID
- 10.1145/2049673.2049678
Entities
People
- Carsten Burstedde
- Martin Kronbichler
- Timo Heister
- Wolfgang Bangerth
Organizations
- Air Force Office of Scientific Research
- King Abdullah University of Science and Technology
- National Science Foundation Division of Mathematical Sciences
- United States Department of Energy
- University of Göttingen
- University of Texas at Austin
- Uppsala University