{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:42:16Z","timestamp":1740123736610,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,7,11]],"date-time":"2017-07-11T00:00:00Z","timestamp":1499731200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s11075-017-0378-x","type":"journal-article","created":{"date-parts":[[2017,7,11]],"date-time":"2017-07-11T05:53:53Z","timestamp":1499752433000},"page":"333-354","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A supernodal block factorized sparse approximate inverse for non-symmetric linear systems"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5077-1394","authenticated-orcid":false,"given":"Massimiliano","family":"Ferronato","sequence":"first","affiliation":[]},{"given":"Giorgio","family":"Pini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,11]]},"reference":[{"key":"378_CR1","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1006\/jcph.2002.7176","volume":"182","author":"M Benzi","year":"2002","unstructured":"Benzi, M.: Preconditioning techniques for large linear systems: a survey. J. Comput. Phys. 182, 418\u2013477 (2002)","journal-title":"J. Comput. Phys."},{"key":"378_CR2","doi-asserted-by":"publisher","unstructured":"Ferronato, M.: Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives. ISRN Appl. Math. doi: 10.5402\/2012\/127647 (2012)","DOI":"10.5402\/2012\/127647"},{"key":"378_CR3","doi-asserted-by":"crossref","first-page":"1323","DOI":"10.1137\/080739987","volume":"32","author":"P Raghavan","year":"2010","unstructured":"Raghavan, P., Teranishi, K.: Parallel hybrid preconditioning: incomplete factorization with selective sparse approximate inversion. SIAM J. Sci. Comput. 32, 1323\u20131345 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"378_CR4","doi-asserted-by":"crossref","first-page":"3584","DOI":"10.1016\/j.cam.2011.04.025","volume":"236","author":"R Helfenstein","year":"2012","unstructured":"Helfenstein, R., Koko, J.: Parallel preconditioned conjugate gradient algorithm on GPU. J. Comput. Appl. Math. 236, 3584\u20133590 (2012)","journal-title":"J. Comput. Appl. Math."},{"key":"378_CR5","doi-asserted-by":"crossref","first-page":"S229","DOI":"10.1137\/120880860","volume":"35","author":"C Janna","year":"2013","unstructured":"Janna, C., Ferronato, M., Gambolati, G.: Enhanced block FSAI preconditioning using domain decomposition techniques. SIAM J. Sci. Comput. 35, S229\u2013S249 (2013)","journal-title":"SIAM J. Sci. Comput."},{"key":"378_CR6","doi-asserted-by":"crossref","first-page":"C169","DOI":"10.1137\/140968896","volume":"37","author":"E Chow","year":"2015","unstructured":"Chow, E., Patel, A.: Fine-grained parallel incomplete LU factorization. SIAM J. Sci. Comput. 37, C169\u2013C193 (2015)","journal-title":"SIAM J. Sci. Comput."},{"key":"378_CR7","doi-asserted-by":"crossref","unstructured":"Janna, C., Ferronato, M., Sartoretto, F., Gambolati, G.: FSAIPACK: A software package for high performance FSAI preconditioning. ACM Transactions on Mathematical Software 41, paper no. 10 (2015)","DOI":"10.1145\/2629475"},{"key":"378_CR8","doi-asserted-by":"crossref","first-page":"C217","DOI":"10.1137\/130930376","volume":"37","author":"L Grigori","year":"2015","unstructured":"Grigori, L., Moufawad, S.: Communication avoiding ILU0 preconditioner. SIAM J. Sci. Comput. 37, C217\u2013C246 (2015)","journal-title":"SIAM J. Sci. Comput."},{"key":"378_CR9","doi-asserted-by":"crossref","first-page":"2468","DOI":"10.1137\/090779760","volume":"32","author":"C Janna","year":"2010","unstructured":"Janna, C., Ferronato, M., Gambolati, G.: A Block FSAI-ILU parallel preconditioner for symmetric positive definite linear systems. SIAM J. Sci. Comput. 32, 2468\u20132484 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"378_CR10","doi-asserted-by":"crossref","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."},{"key":"378_CR11","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1002\/nla.813","volume":"19","author":"M Ferronato","year":"2012","unstructured":"Ferronato, M., Janna, C., Pini, G.: Efficient parallel solution to large-size sparse eigenproblems with block FSAI preconditioning. Numer. Linear Algebra Appl. 19, 797\u2013815 (2012)","journal-title":"Numer. Linear Algebra Appl."},{"key":"378_CR12","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1002\/nla.2030","volume":"23","author":"M Ferronato","year":"2016","unstructured":"Ferronato, M., Janna, C., Pini, G.: Parallel Jacobi-Davidson with block FSAI preconditioning and controlled inner iterations. Numer. Linear Algebra Appl. 23, 394\u2013409 (2016)","journal-title":"Numer. Linear Algebra Appl."},{"key":"378_CR13","doi-asserted-by":"crossref","first-page":"3357","DOI":"10.1137\/100810368","volume":"33","author":"C Janna","year":"2011","unstructured":"Janna, C., Ferronato, M.: Adaptive pattern research for Block FSAI preconditioning. SIAM J. Sci. Comput. 33, 3357\u20133380 (2011)","journal-title":"SIAM J. Sci. Comput."},{"key":"378_CR14","doi-asserted-by":"crossref","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, 1804\u20131822 (2000)","journal-title":"SIAM J. Sci. Comput."},{"key":"378_CR15","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1145\/356044.356047","volume":"9","author":"IS Duff","year":"1983","unstructured":"Duff, I.S., Reid, J.K.: The multifrontal solution of indefinite sparse symmetric linear equations. ACM Trans. Math. Softw. 9, 302\u2013325 (1983)","journal-title":"ACM Trans. Math. Softw."},{"key":"378_CR16","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1145\/76909.76910","volume":"15","author":"C Ashcraft","year":"1989","unstructured":"Ashcraft, C., Grimes, R.G.: The influence of relaxed supernode partitions on the multifrontal method. ACM Trans. Math. Softw. 15, 291\u2013309 (1989)","journal-title":"ACM Trans. Math. Softw."},{"key":"378_CR17","doi-asserted-by":"crossref","first-page":"1404","DOI":"10.1137\/0916081","volume":"16","author":"C Ashcraft","year":"1995","unstructured":"Ashcraft, C.: Compressed graphs and the minimum degree algorithm. SIAM J. Sci. Comput. 16, 1404\u20131411 (1995)","journal-title":"SIAM J. Sci. Comput."},{"key":"378_CR18","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1137\/080727695","volume":"32","author":"A Gupta","year":"2010","unstructured":"Gupta, A., George, T.: Adaptive techniques for improving the performance of incomplete factorization preconditioning. SIAM J. Sci. Comput. 32, 84\u2013110 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"378_CR19","doi-asserted-by":"crossref","first-page":"A270","DOI":"10.1137\/100818996","volume":"35","author":"N Vannieuwenhoven","year":"2013","unstructured":"Vannieuwenhoven, N., Meerbergen, K.: IMF: An Incomplete multifrontal LU-factorization for element-structured sparse linear systems. SIAM J. Sci. Comput. 35, A270\u2013A293 (2013)","journal-title":"SIAM J. Sci. Comput."},{"key":"378_CR20","doi-asserted-by":"crossref","first-page":"C72","DOI":"10.1137\/140956026","volume":"37","author":"C Janna","year":"2015","unstructured":"Janna, C., Ferronato, M., Gambolati, G.: The use of supernodes in factored sparse approximate inverse preconditioning. SIAM J. Sci. Comput. 37, C72\u2013C94 (2015)","journal-title":"SIAM J. Sci. Comput."},{"key":"378_CR21","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0168-9274(98)00117-2","volume":"30","author":"T Huckle","year":"1999","unstructured":"Huckle, T.: Approximate sparsity patterns for the inverse of a matrix and preconditioning. Appl. Numer. Math. 30, 291\u2013303 (1999)","journal-title":"Appl. Numer. Math."},{"key":"378_CR22","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1137\/S1064827597327334","volume":"21","author":"C Lin","year":"1999","unstructured":"Lin, C., Mor\u00e9, J.J.: Incomplete Cholesky factorizations with limited memory. SIAM J. Sci. Comput. 21, 24\u201345 (1999)","journal-title":"SIAM J. Sci. Comput."},{"key":"378_CR23","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1007\/s11075-014-9873-5","volume":"68","author":"C Janna","year":"2015","unstructured":"Janna, C., Castelletto, N., Ferronato, M.: The effect of graph partitioning techniques on parallel Block FSAI preconditioning: a computational study. Numer. Algorithms 68, 813\u2013836 (2015)","journal-title":"Numer. Algorithms"},{"key":"378_CR24","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Y Saad","year":"2003","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems, 2nd edn. SIAM, Philadelphia (2003)","edition":"2nd edn."},{"key":"378_CR25","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.apnum.2013.01.002","volume":"68","author":"D Mirzaei","year":"2013","unstructured":"Mirzaei, D., Schaback, R.: Direct meshless local Petrov-Galerkin (DMLPG) method: A generalized MLS approximation. Appl. Numer. Math. 68, 73\u201382 (2013)","journal-title":"Appl. Numer. Math."},{"key":"378_CR26","first-page":"11","volume":"3","author":"SN Atluri","year":"2002","unstructured":"Atluri, S.N., Zhu, T.: The meshless local Petrov-Galerkin (MLPG) method: A simple and less costly alternative to the finite element methods. Comput. Model. Eng. Sci. 3, 11\u201351 (2002)","journal-title":"Comput. Model. Eng. Sci."},{"key":"378_CR27","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1093\/imanum\/drr030","volume":"32","author":"D Mirzaei","year":"2012","unstructured":"Mirzaei, D., Schaback, R., Dehghan, M.: On generalized moving least squares and diffuse derivatives. IMA J. Numer. Anal. 32, 983\u20131000 (2012)","journal-title":"IMA J. Numer. Anal."},{"key":"378_CR28","first-page":"239","volume":"108","author":"A Mazzia","year":"2015","unstructured":"Mazzia, A., Pini, G., Sartoretto, F.: A DMPLG refinement technique for 2D and 3D potential problems. Comput. Model. Eng. Sci. 108, 239\u2013262 (2015)","journal-title":"Comput. Model. Eng. Sci."},{"key":"378_CR29","first-page":"1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The university of florida sparse matrix collection. ACM Trans. Math. Softw. 38, 1\u201325 (2011)","journal-title":"ACM Trans. Math. Softw."},{"key":"378_CR30","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1137\/0913035","volume":"13","author":"HA Vorst van der","year":"1992","unstructured":"van der Vorst, H.A.: Bi-CGSTAB: A fast and smoothly converging variant of BI-CG for the solution of nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 13, 631\u2013644 (1992)","journal-title":"SIAM J. Sci. Stat. Comput."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-017-0378-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0378-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0378-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,29]],"date-time":"2019-09-29T08:27:44Z","timestamp":1569745664000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-017-0378-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,11]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["378"],"URL":"https:\/\/doi.org\/10.1007\/s11075-017-0378-x","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2017,7,11]]}}}