{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:09:32Z","timestamp":1761808172246,"version":"build-2065373602"},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,5,1]],"date-time":"2018-05-01T00:00:00Z","timestamp":1525132800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,5,1]],"date-time":"2018-05-01T00:00:00Z","timestamp":1525132800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational Science"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1016\/j.jocs.2018.04.008","type":"journal-article","created":{"date-parts":[[2018,4,27]],"date-time":"2018-04-27T13:43:28Z","timestamp":1524836608000},"page":"246-253","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Optimized sparse Cholesky factorization on hybrid multicore architectures"],"prefix":"10.1016","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8138-2850","authenticated-orcid":false,"given":"Meng","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2221-9874","authenticated-orcid":false,"given":"Mohamed","family":"Gadou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7036-1184","authenticated-orcid":false,"given":"Steven","family":"Rennich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7614-6899","authenticated-orcid":false,"given":"Timothy A.","family":"Davis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjay","family":"Ranka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.jocs.2018.04.008_bib0005","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1145\/1024074.1024081","article-title":"Algorithm 837: AMD, an approximate minimum degree ordering algorithm","volume":"30","author":"Amestoy","year":"2004","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"10.1016\/j.jocs.2018.04.008_bib0010","series-title":"European Conference on Parallel Processing","first-page":"851","article-title":"An extension of the StarSs programming model for platforms with multiple GPUs","author":"Ayguad\u00e9","year":"2009"},{"issue":"3","key":"10.1016\/j.jocs.2018.04.008_bib0015","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/1391989.1391995","article-title":"Algorithm 887: Cholmod, supernodal sparse Cholesky factorization and update\/downdate","volume":"35","author":"Chen","year":"2008","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"10.1016\/j.jocs.2018.04.008_bib0020","series-title":"Fundamental Numerical Methods and Data Analysis","article-title":"Fundamental numerical methods and data analysis","author":"Collins","year":"1990"},{"key":"10.1016\/j.jocs.2018.04.008_bib0025","article-title":"Direct methods for sparse linear systems","author":"Davis","year":"2006","journal-title":"SIAM"},{"issue":"3","key":"10.1016\/j.jocs.2018.04.008_bib0030","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/1024074.1024080","article-title":"Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm","volume":"30","author":"Davis","year":"2004","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"1","key":"10.1016\/j.jocs.2018.04.008_bib0035","first-page":"1","article-title":"The University of Florida sparse matrix collection","volume":"38","author":"Davis","year":"2011","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"10.1016\/j.jocs.2018.04.008_bib0040","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1017\/S0962492916000076","article-title":"A survey of direct methods for sparse linear systems","volume":"25","author":"Davis","year":"2016","journal-title":"Acta Numer."},{"issue":"3","key":"10.1016\/j.jocs.2018.04.008_bib0045","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0167-8191(86)90019-0","article-title":"Parallel implementation of multifrontal schemes","volume":"3","author":"Duff","year":"1986","journal-title":"Parallel Comput."},{"year":"2014","series-title":"Metis-Serial Graph Partitioning and Fill-Reducing Matrix Ordering, Version 5","author":"Karypis","key":"10.1016\/j.jocs.2018.04.008_bib0050"},{"issue":"1","key":"10.1016\/j.jocs.2018.04.008_bib0055","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1137\/0614019","article-title":"On finding supernodes for sparse matrix computations","volume":"14","author":"Liu","year":"1993","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/j.jocs.2018.04.008_bib0060","series-title":"International Conference on High Performance Computing for Computational Science","first-page":"93","article-title":"A scalable high performant Cholesky factorization for multicore with GPU accelerators","author":"Ltaief","year":"2010"},{"issue":"4","key":"10.1016\/j.jocs.2018.04.008_bib0065","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1137\/0914048","article-title":"A supernodal Cholesky factorization algorithm for shared-memory multiprocessors","volume":"14","author":"Ng","year":"1993","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/j.jocs.2018.04.008_bib0070","series-title":"Proceedings of the Fourth Workshop on Irregular Applications: Architectures and Algorithms","first-page":"9","article-title":"Accelerating sparse Cholesky factorization on GPUs","author":"Rennich","year":"2014"},{"key":"10.1016\/j.jocs.2018.04.008_bib0075","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.parco.2016.06.004","article-title":"Accelerating sparse Cholesky factorization on GPUs","volume":"59","author":"Rennich","year":"2016","journal-title":"Parallel Comput."},{"issue":"6","key":"10.1016\/j.jocs.2018.04.008_bib0080","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0045-7949(80)90066-8","article-title":"Algorithms and software for in-core factorization of sparse symmetric positive definite matrices","volume":"11","author":"Rose","year":"1980","journal-title":"Comput. Struct."},{"key":"10.1016\/j.jocs.2018.04.008_bib0085","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1016\/j.procs.2017.05.260","article-title":"A multithreaded algorithm for sparse Cholesky factorization on hybrid multicore architectures","volume":"108","author":"Tang","year":"2017","journal-title":"Proc. Comput. Sci."},{"issue":"5\u20136","key":"10.1016\/j.jocs.2018.04.008_bib0090","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/j.parco.2009.12.005","article-title":"Towards dense linear algebra for hybrid GPU accelerated manycore systems","volume":"36","author":"Tomov","year":"2010","journal-title":"Parallel Comput."},{"key":"10.1016\/j.jocs.2018.04.008_bib0095","series-title":"IEEE International Symposium on Parallel & Distributed Processing, Workshops and Ph.D. Forum (IPDPSW)","first-page":"1","article-title":"Dense linear algebra solvers for multicore with GPU accelerators","author":"Tomov","year":"2010"},{"key":"10.1016\/j.jocs.2018.04.008_bib0100","series-title":"LU, QR and Cholesky Factorizations Using Vector Capabilities of GPUs, Tech. Rep. UCB\/EECS-2008-49","first-page":"49","author":"Volkov","year":"2008"},{"issue":"2","key":"10.1016\/j.jocs.2018.04.008_bib0105","first-page":"17","article-title":"Algorithm 980: sparse QR factorization on the GPU","volume":"44","author":"Yeralan","year":"2017","journal-title":"ACM Trans. Math. Softw. (TOMS)"}],"container-title":["Journal of Computational Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877750317312164?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877750317312164?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T05:10:06Z","timestamp":1761801006000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1877750317312164"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5]]},"references-count":21,"alternative-id":["S1877750317312164"],"URL":"https:\/\/doi.org\/10.1016\/j.jocs.2018.04.008","relation":{},"ISSN":["1877-7503"],"issn-type":[{"type":"print","value":"1877-7503"}],"subject":[],"published":{"date-parts":[[2018,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimized sparse Cholesky factorization on hybrid multicore architectures","name":"articletitle","label":"Article Title"},{"value":"Journal of Computational Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jocs.2018.04.008","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}