Stencil computations for PDE-based applications with examples from DUNE and hypre
- Univ. of Munster, Munster (Germany)
- Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
Here, stencils are commonly used to implement efficient on–the–fly computations of linear operators arising from partial differential equations. At the same time the term “stencil” is not fully defined and can be interpreted differently depending on the application domain and the background of the software developers. Common features in stencil codes are the preservation of the structure given by the discretization of the partial differential equation and the benefit of minimal data storage. We discuss stencil concepts of different complexity, show how they are used in modern software packages like hypre and DUNE, and discuss recent efforts to extend the software to enable stencil computations of more complex problems and methods such as inf–sup–stable Stokes discretizations and mixed finite element discretizations.
- Research Organization:
- Lawrence Livermore National Laboratory (LLNL), Livermore, CA (United States)
- Sponsoring Organization:
- USDOE
- Grant/Contract Number:
- AC52-07NA27344
- OSTI ID:
- 1438745
- Report Number(s):
- LLNL-JRNL-681537
- Journal Information:
- Concurrency and Computation. Practice and Experience, Vol. 29, Issue 17; ISSN 1532-0626
- Publisher:
- WileyCopyright Statement
- Country of Publication:
- United States
- Language:
- English
Web of Science
Preparing sparse solvers for exascale computing
|
journal | January 2020 |
Similar Records
A high-performance finite-volume algorithm for solving partial differential equations governing compressible viscous flows on structured grids
Stencils and problem partitionings: Their influence on the performance of multiple processor systems