Algorithms and data structures for massively parallel generic adaptive finite element codes

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Wolfgang Bangerth Texas A&M University, College Station, TX
Carsten Burstedde The University of Texas at Austin, TX
Timo Heister University of Göttingen, Germany
Martin Kronbichler Uppsala University, Sweden
Algorithms and data structures for massively parallel generic adaptive finite element codes Published by ACM 2012 Article
  • Research
  • Refereed
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 12
· Downloads (12 Months): 157
· Downloads (cumulative): 333
· Citation Count: 2

Published in:
Cover Image
 
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 38 Issue 2, December 2011
Article No. 14
ACM New York, NY, USA
table of contents doi>10.1145/2049673.2049678

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder