a1 Department of Mathematical and Computer Sciences, The University of Tulsa, 600 South College Avenue, Tulsa, OK 74104–3189, USA
a2 Amoco Production Company, Research Center, P.O. Box 3385, Tulsa, OK 74102, USA
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.