Hostname: page-component-77f85d65b8-5ngxj Total loading time: 0 Render date: 2026-03-29T12:27:04.243Z Has data issue: false hasContentIssue false

Sparse matrix representations in a functional language

Published online by Cambridge University Press:  07 November 2008

P. W. Grant
Affiliation:
Department of Computer Science, University of Wales, Swansea, Swansea SA2 8PP, UK
J. A. Sharp
Affiliation:
Department of Computer Science, University of Wales, Swansea, Swansea SA2 8PP, UK
M. F. Webster
Affiliation:
Department of Computer Science, University of Wales, Swansea, Swansea SA2 8PP, UK
X. Zhang
Affiliation:
Department of Computer Science, University of Wales, Swansea, Swansea SA2 8PP, UK
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Articles
Copyright
Copyright © Cambridge University Press 1996
Submit a response

Discussions

No Discussions have been published for this article.