Stencil computations for PDE‐based applications with examples from DUNE and hypre. (24th February 2017)

• Record Type: Journal Article
• Authors: Engwer, C.; Falgout, R. D.; Yang, U. M.
• Other Names: Lengauer Christian guestEditor.; Bolten Matthias guestEditor.; Falgout Robert guestEditor.; Schenk Olaf guestEditor.; Zhou Xiaobo guestEditor.; Zhao Laiping guestEditor.
• Is Part Of: Concurrency and computation. Volume 29:Number 17(2017)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2017-02-24
• Subjects: partial differential equations, stencil computations; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.4097
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: 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.