{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:42:21Z","timestamp":1740181341020,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T00:00:00Z","timestamp":1679875200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T00:00:00Z","timestamp":1679875200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872422"],"award-info":[{"award-number":["61872422"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["CCF Trans. HPC"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s42514-023-00142-2","type":"journal-article","created":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T15:05:02Z","timestamp":1679929502000},"page":"160-170","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["HeuriSPAI: a heuristic sparse approximate inverse preconditioning algorithm on GPU"],"prefix":"10.1007","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2983-9921","authenticated-orcid":false,"given":"Jiaquan","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinyue","family":"Chu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yizhou","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,27]]},"reference":[{"key":"142_CR1","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.parco.2017.05.006","volume":"68","author":"H Anzt","year":"2017","unstructured":"Anzt, H., Gates, M., Dongarra, J., et al.: Preconditioned Krylov solvers on GPUs. Parallel Comput. 68, 32\u201344 (2017)","journal-title":"Parallel Comput."},{"key":"142_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.parco.2017.10.003","volume":"71","author":"H Anzt","year":"2018","unstructured":"Anzt, H., Huckle, T.K., Brackle, J., Dongarra, J.: Incomplete sparse approximate inverses for parallel preconditioning. Parallel Comput. 71, 1\u201322 (2018)","journal-title":"Parallel Comput."},{"issue":"5","key":"142_CR3","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.1137\/S1064827594271421","volume":"17","author":"M Benzi","year":"1996","unstructured":"Benzi, M., Meyer, C.D., Tuma, M.: A sparse approximate inverse preconditioner for the conjugate gradient method. SIAM J. Sci. Comput. 17(5), 1135\u20131149 (1996)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"142_CR4","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1137\/S1064827599356900","volume":"22","author":"M Benzi","year":"2000","unstructured":"Benzi, M., Cullum, J., Tuma, M.: Robust approximate inverse preconditioning for the conjugate gradient method. SIAM J. Sci. Comput. 22(4), 1318\u20131332 (2000)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"142_CR5","doi-asserted-by":"publisher","first-page":"C53","DOI":"10.1137\/15M1027826","volume":"38","author":"M Bernaschi","year":"2016","unstructured":"Bernaschi, M., Bisson, M., Fantozzi, C., Janna, C.: A factored sparse approximate inverse preconditioned conjugate gradient solver on graphics processing units. SIAM. J. Sci. Comput. 38(1), C53\u2013C72 (2016)","journal-title":"SIAM. J. Sci. Comput."},{"issue":"1","key":"142_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1140\/epjst\/e2012-01638-7","volume":"210","author":"T Brandes","year":"2012","unstructured":"Brandes, T., Arnold, A., Soddemann, T., Reith, D.: CPU vs. GPU - performance comparison for the Gram-Schmidt algorithm. Eur Phys J Spec Top 210(1), 73\u201388 (2012)","journal-title":"Eur Phys J Spec Top"},{"issue":"5","key":"142_CR7","doi-asserted-by":"publisher","first-page":"1804","DOI":"10.1137\/S106482759833913X","volume":"21","author":"E Chow","year":"2000","unstructured":"Chow, E.: A priori sparsity patterns for parallel sparse approximate inverse preconditioners. SIAM J. Sci. Comput. 21(5), 1804\u20131822 (2000)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1\u20132","key":"142_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1080\/00207169208804097","volume":"44","author":"JDF Cosgrove","year":"1992","unstructured":"Cosgrove, J.D.F., Diaz, J.C., Griewank, A.: Approximate inverse preconditioning for sparse linear systems. Int. J. Comput. Math. 44(1\u20132), 91\u2013110 (1992)","journal-title":"Int. J. Comput. Math."},{"issue":"1","key":"142_CR9","first-page":"1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The university of florida sparse matrix collection. ACM T. Math. Software 38(1), 1\u201325 (2011)","journal-title":"ACM T. Math. Software"},{"issue":"9","key":"142_CR10","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1109\/TPDS.2012.286","volume":"24","author":"MM Dehnavi","year":"2013","unstructured":"Dehnavi, M.M., Fern$$\\acute{\\text{ a }}$$ndez, D. M., Gaudiot, J. L., Giannacopoulos, D. D.: Parallel sparse approximate inverse preconditioning on graphic processing units. IEEE T. Parall. Distr 24(9), 852\u20131861 (2013)","journal-title":"IEEE T. Parall. Distr"},{"issue":"4","key":"142_CR11","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1137\/S0895479897317788","volume":"20","author":"ACNV Duin","year":"1999","unstructured":"Duin, A.C.N.V.: Scalable parallel preconditioning with the sparse approximate inverse of triangular systems. SIAM J. Matrix Anal. Appl. 20(4), 987\u20131006 (1999)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"142_CR12","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.cam.2013.07.049","volume":"256","author":"M Ferronato","year":"2014","unstructured":"Ferronato, M., Janna, C., Pini, G.: A generalized block FSAI preconditioner for nonsymmetric linear systems. J. Comput. Appl. Math. 256, 230\u2013241 (2014)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"142_CR13","doi-asserted-by":"publisher","first-page":"2088","DOI":"10.1016\/j.jpdc.2013.10.002","volume":"74","author":"J Gao","year":"2014","unstructured":"Gao, J., Liang, R., Wang, J.: Research on the conjugate gradient algorithm with a modified incomplete Cholesky preconditioner on GPU. J. Parallel Distr. Com. 74(2), 2088\u20132098 (2014)","journal-title":"J. Parallel Distr. Com."},{"issue":"10","key":"142_CR14","doi-asserted-by":"publisher","first-page":"2122","DOI":"10.1080\/00207160.2017.1280156","volume":"94","author":"J Gao","year":"2017","unstructured":"Gao, J., Wu, K., Wang, Y., Qi, P., He, G.: GPU-accelerated preconditioned GMRES method for two-dimensional Maxwell\u2019s equations. Int. J. Comput. Math. 94(10), 2122\u20132144 (2017)","journal-title":"Int. J. Comput. Math."},{"key":"142_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2020.102724","volume":"101","author":"J Gao","year":"2021","unstructured":"Gao, J., Chen, Q., He, G.: A thread-adaptive sparse approximate inverse preconditioning algorithm on multi-GPUs. Parallel Comput. 101, 102724 (2021)","journal-title":"Parallel Comput."},{"issue":"3","key":"142_CR16","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/S1064827594276552","volume":"18","author":"M Grote","year":"1997","unstructured":"Grote, M., Huckle, T.: Parallel preconditioning with sparse approximate inverses. SIAM J. Sci. Comput. 18(3), 838\u2013853 (1997)","journal-title":"SIAM J. Sci. Comput."},{"issue":"7","key":"142_CR17","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.5598","volume":"32","author":"G He","year":"2020","unstructured":"He, G., Yin, R., Gao, J.: An efficient sparse approximate inverse preconditioning algorithm on GPU. Concurr. Comput.-Pract. Exp. 32(7), e5598 (2020)","journal-title":"Concurr. Comput.-Pract. Exp."},{"issue":"4","key":"142_CR18","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1002\/nla.614","volume":"16","author":"Z Jia","year":"2009","unstructured":"Jia, Z., Zhu, B.: A power sparse approximate inverse preconditioning procedure for large sparse linear systems. Numer. Linear Algebr. 16(4), 259\u2013299 (2009)","journal-title":"Numer. Linear Algebr."},{"issue":"1","key":"142_CR19","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1137\/0614004","volume":"14","author":"LY Kolotilina","year":"1993","unstructured":"Kolotilina, L.Y., Yeremin, A.Y.: Factorized sparse approximate inverse preconditioning I. Theory. SIAM J. Matrix Anal. Appl. 14(1), 45\u201358 (1993)","journal-title":"Theory. SIAM J. Matrix Anal. Appl."},{"key":"142_CR20","unstructured":"NVIDIA, CUBLAS Library, v11.1 (2021)"},{"key":"142_CR21","unstructured":"NVIDIA, CUDA C Programming Guide, v11.1 (2021)"},{"key":"142_CR22","unstructured":"NVIDIA, CUSPARSE Library, v11.1 (2021)"},{"issue":"5","key":"142_CR23","doi-asserted-by":"publisher","first-page":"S412","DOI":"10.1137\/15M1026419","volume":"38","author":"K Rupp","year":"2016","unstructured":"Rupp, K., Tillet, R., Rudolf, F.: ViennaCL\u2013linear algebra library for multi- and many-core architectures. SIAM J. Sci. Comput. 38(5), S412\u2013S439 (2016)","journal-title":"SIAM J. Sci. Comput."},{"key":"142_CR24","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative Methods for Sparse Linear Systems, second version","author":"Y Saad","year":"2003","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems, second version. SIAM, Philadelphia, PA (2003)"},{"issue":"3","key":"142_CR25","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1137\/0907058","volume":"7","author":"Y Saad","year":"1986","unstructured":"Saad, Y., Schultz, M.H.: GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 7(3), 856\u2013869 (1986)","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"3","key":"142_CR26","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1137\/0903021","volume":"3","author":"HA van der Vorst","year":"1982","unstructured":"van der Vorst, H.A.: A vectorizable variant of some ICCG methods. SIAM J. Sci. Stat. Comput. 3(3), 350\u2013356 (1982)","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"3","key":"142_CR27","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1137\/0913035","volume":"12","author":"HA van der Vorst","year":"1992","unstructured":"van der Vorst, H.A.: Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of non-symmetirc linear systems. SIAM J. Sci. Stat. Comput. 12(3), 631\u2013644 (1992)","journal-title":"SIAM J. Sci. Stat. Comput."}],"container-title":["CCF Transactions on High Performance Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42514-023-00142-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42514-023-00142-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42514-023-00142-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T09:13:10Z","timestamp":1687770790000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42514-023-00142-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,27]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["142"],"URL":"https:\/\/doi.org\/10.1007\/s42514-023-00142-2","relation":{},"ISSN":["2524-4922","2524-4930"],"issn-type":[{"type":"print","value":"2524-4922"},{"type":"electronic","value":"2524-4930"}],"subject":[],"published":{"date-parts":[[2023,3,27]]},"assertion":[{"value":"29 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}