Software design for finite difference schemes based on index notation

Authors:
Krister hlander;Kurt Otto
Affiliations:
Department of Information Technology, Uppsala University, Box 337, 751 05 Uppsala, Sweden;Department of Information Technology, Uppsala University, Box 337, 751 05 Uppsala, Sweden
Venue:
Future Generation Computer Systems
Year:
2006

Citing 3
Cited 0

Library for architecture-independent development of structured grid applications

ACM SIGPLAN Notices - Workshop on languages, compilers and run-time environments for distributed memory multiprocessors
Iterative Solution of the Helmholtz Equation by a Second-Order Method

SIAM Journal on Matrix Analysis and Applications
On the Role of Mathematical Abstractions for Scientific Computing

Proceedings of the IFIP TC2/WG2.5 Working Conference on the Architecture of Scientific Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

A formulation of finite difference schemes based on the index notation of tensor algebra is advocated. Finite difference operators on regular grids may be described as sparse, banded, ''tensors''. Especially for higher space dimensions, it is claimed that a band tensor formulation better corresponds to the inherent problem structure than does conventional matrix notation. Tensor algebra is commonly expressed using index notation. The standard index notation is extended with the notion of index offsets, thereby allowing the common traversal of band tensor diagonals. The transition from mathematical index notation to implementation is presented. It is emphasized that efficient band tensor computations must exploit the particular problem structure, which calls for a combination of general index notation software with special-purpose band tensor routines.