{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:18Z","timestamp":1759637958182},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2016]]},"DOI":"10.1109\/access.2016.2546544","type":"journal-article","created":{"date-parts":[[2016,3,24]],"date-time":"2016-03-24T18:21:38Z","timestamp":1458843698000},"page":"2166-2176","source":"Crossref","is-referenced-by-count":44,"title":["Spark-Based Large-Scale Matrix Inversion for Big Data Processing"],"prefix":"10.1109","volume":"4","author":[{"given":"Jun","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nirwan","family":"Ansari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/SUPERC.1990.129995","article-title":"Lapack: A portable linear algebra library for high-performance computers","author":"anderson","year":"1990","journal-title":"Proc ACM\/IEEE Conf Supercomput"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICAPP.1996.562917"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1377603.1377606"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19328-6_14"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2132876.2132885"},{"key":"ref15","first-page":"5561","article-title":"A parallel method for matrix inversion based on Gauss–Jordan algorithm","volume":"9","author":"yang","year":"2013","journal-title":"J Comput Inf Syst"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2011.66"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2013.06.015"},{"key":"ref18","first-page":"1","article-title":"Parallel out-of-core matrix inversion","author":"caron","year":"2001","journal-title":"Proc IEEE Parallel Distrib Process Symp"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2014.6863129"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719642"},{"key":"ref3","author":"press","year":"2007","journal-title":"Numerical Recipes The Art of Scientific Computing"},{"key":"ref6","article-title":"Spark: Cluster computing with working sets","author":"zaharia","year":"2010","journal-title":"Proc 2nd USENIX Conf Hot Topics Cloud Comput"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2546544"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2600212.2600220"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MWSCAS.2003.1562564"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.2307\/2322413"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09766-4_155"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CloudCom.2010.17"},{"key":"ref22","article-title":"Computing explicit matrix inverses by recursion","author":"karlsson","year":"2006"},{"key":"ref21","article-title":"Matrix computations and optimization in Apache spark","author":"zadeh","year":"2015"},{"key":"ref24","first-page":"1","article-title":"Tachyon: Memory throughput I\/O for cluster computing frameworks","volume":"18","author":"li","year":"2013","journal-title":"Proc 3rd ACM SIGOPS Int Workshop Large Scale Distrib Syst Middleware"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2011.122211.00017"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/iel7\/6287639\/7419931\/07440788.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/7419931\/07440788.pdf?arnumber=7440788","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:26:52Z","timestamp":1642004812000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7440788\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/access.2016.2546544","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}