•   Wikis

# Stencil codes: Wikis

Note: Many of our articles have direct quotes from sources you can cite, within the Wikipedia article! This article doesn't yet, but we're working on it! See more info or our list of citable articles.

# Encyclopedia

Stencil codes are computer codes that update array elements according to some fixed pattern, called stencils,[1] which themselves are a class of kernels.[2] A stencil code may be thought of as an integer array, containing the indices of the vertices in a geometry array (of the previous level).[3] Multiple stencil codes may be contained in an array of integer arrays known as a stencil array.[3] Stencil codes are used in many scientific and engineering application, but commonly used in solving partial differential equations, image processing, and geometric modeling.[2] Jacobi kernels and Gauss–Seidel kernels are examples of stencil codes.[1]

In operation stencil codes perform a sequence of sweeps through a given array.[1] In each sweep, the stencil code updates all array elements except the boundary.[1] Using neighboring array elements in a fixed stencil pattern, stencil codes compute values of the array and, for each element of the array, the stencil pattern of data accesses is repeated.[4]

## References

1. ^ a b c d Sloot, Peter M.A. et al. (May 28, 2002) Computational Science - ICCS 2002: International Conference, Amsterdam, The Netherlands, April 21-24, 2002. Proceedings, Part I. Page 843. Publisher: Springer. ISBN 3540435913.
2. ^ a b Roth, Gerald et al. (1997) Proceedings of SC'97: High Performance Networking and Computing. Compiling Stencils in High Performance Fortran.
3. ^ a b JPatch Wiki. (2008) JPatch Subdivision Algorithm. Accessed June 19, 2008.
4. ^ Yang, Laurence T.; Guo, Minyi. (August 12, 2005) High-Performance Computing : Paradigm and Infrastructure. Page 221. Publisher: Wiley-Interscience. ISBN 047165471X