{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T23:05:15Z","timestamp":1779836715203,"version":"3.53.1"},"reference-count":10,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2008,11,7]],"date-time":"2008-11-07T00:00:00Z","timestamp":1226016000000},"content-version":"unspecified","delay-in-days":6155,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Funct. Prog."],"published-print":{"date-parts":[[1992,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>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.<\/jats:p>","DOI":"10.1017\/s0956796800000265","type":"journal-article","created":{"date-parts":[[2008,11,7]],"date-time":"2008-11-07T11:14:32Z","timestamp":1226056472000},"page":"61-72","source":"Crossref","is-referenced-by-count":9,"title":["A study of sparse matrix representations for solving linear systems in a functional language"],"prefix":"10.1017","volume":"2","author":[{"given":"Roger L.","family":"Wainwright","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marian E.","family":"Sexton","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2008,11,7]]},"reference":[{"key":"S0956796800000265_ref010","doi-asserted-by":"publisher","DOI":"10.21236\/ADA185275"},{"key":"S0956796800000265_ref009","first-page":"92","volume-title":"Proc. Int. Conf. on Parallel Processing","author":"Wise","year":"1986"},{"key":"S0956796800000265_ref001","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-18991-2_38"},{"key":"S0956796800000265_ref006","first-page":"85","volume-title":"Proc. ACM\/IEEE Symp. on Applied Computing","author":"Page","year":"1990"},{"key":"S0956796800000265_ref005","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380200107"},{"key":"S0956796800000265_ref007","volume-title":"Functional Programming Languages and Computer Architectures","volume":"201","author":"Turner","year":"1985"},{"key":"S0956796800000265_ref002","doi-asserted-by":"publisher","DOI":"10.1109\/52.16906"},{"key":"S0956796800000265_ref003","volume-title":"SIMPLE: Part I - An exercise in future scientific programming","author":"Ekanadham","year":"1987"},{"key":"S0956796800000265_ref004","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(90)90035-N"},{"key":"S0956796800000265_ref008","doi-asserted-by":"publisher","DOI":"10.1145\/15042.15053"}],"container-title":["Journal of Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0956796800000265","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T22:35:08Z","timestamp":1779834908000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0956796800000265\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["S0956796800000265"],"URL":"https:\/\/doi.org\/10.1017\/s0956796800000265","relation":{},"ISSN":["0956-7968","1469-7653"],"issn-type":[{"value":"0956-7968","type":"print"},{"value":"1469-7653","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}