Skip to main content
    • Aa
    • Aa

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

  • Roger L. Wainwright (a1) and Marian E. Sexton (a2)

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.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

F. W. Burton and J. G. Kollias 1989. Functional programming with quadtrees. IEEE Software, 9097 (01).

J. T. Feo , D. C. Cann and R. R. Oldehoeft 1990. A report on the Sisal language project. J. Parallel and Distributed Computing, 10: 349366.

A. C. Fleck 1990. A case study comparison of four declarative programming languages. Software – Practice and Experience, 20 (1): 4965 (01).

D. Turner 1986. An overview of Miranda. SIGPLAN Notices, 158166 (12).

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Functional Programming
  • ISSN: 0956-7968
  • EISSN: 1469-7653
  • URL: /core/journals/journal-of-functional-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 9 *
Loading metrics...

Abstract views

Total abstract views: 66 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 23rd June 2017. This data will be updated every 24 hours.