A study of sparse matrix representations for solving linear systems in a functional language

1 January 1992

journal article
research article
Published by Cambridge University Press (CUP) in Journal of Functional Programming

Vol. 2 (1) , 61-72
https://doi.org/10.1017/s0956796800000265

Abstract

This paper compares three different sparse matrix representations in Miranda for solving linear systems of equations: quadtrees, binary trees and run-length encoding. It compares the three data structures in each of two common linear system solvers, Conjugate Gradient and SOR. The test problems used in the paper arise from a simple reservoir model.

Keywords

This publication has 6 references indexed in Scilit:

A report on the sisal language project
Journal of Parallel and Distributed Computing, 1990
A case study comparison of four declarative programming languages
Software: Practice and Experience, 1990
Functional programming with quadtrees
IEEE Software, 1989
Future scientific programming on parallel machines
Published by Springer Nature ,1988
Costs of Quadtree Representation of Non-dense Matrices.
Published by Defense Technical Information Center (DTIC) ,1987
An overview of Miranda
ACM SIGPLAN Notices, 1986