Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods

Abstract

A template is a description of a general algorithm rather than the executable object code or the source code more commonly found in a conventional software library. Nevertheless, although templates are general descriptions of key algorithms, they offer whatever degree of customization the user may desire. For example, they can be configured for the specific data structure of a problem or for the specific computing system on which the problem is to run. We focus on the use of iterative methods for solving large sparse systems of linear equations. Templates are not language specific. Rather, they are displayed in an Algol-like structure, which is readily translatable into the target language such as FORTRAN (with the use of the Basic Linear Algebra Subprograms, or BLAS, whenever possible) and C.

DateOfInformation

Wed Apr 9 10:06:37 1997

Domain

Numerical Programs and Routines!Linear algebra

Keyword

template; sparse linear systems; iterative method; numerical library

Name

Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods

TargetEnvironment

Not Available

Webpage

http://www.netlib.org/templates/index.html

ContactIs

HPC-Netlib Maintainers