Journal of Functional Programming

Articles

Sparse matrix representations in a functional language

P. W. Granta1, J. A. Sharpa1, M. F. Webstera1 and X. Zhanga1

a1 Department of Computer Science, University of Wales, Swansea, Swansea SA2 8PP, UK

Abstract

This paper investigates several sparse matrix representation schemes and associated algorithms in Haskell for solving linear systems of equations arising from solving realistic computational fluid dynamics problems using a finite element algorithm. This work complements that of Wainwright and Sexton (1992) in that a Choleski direct solver (with an emphasis on its forward/backward substitution steps) is examined. Experimental evidence comparing time and space efficiency of these matrix representation schemes is reported, together with associated forward/backward substitution implementations. Our results are in general agreement with Wainwright and Sexton's.