{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T12:10:34Z","timestamp":1759839034351},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,5,16]],"date-time":"2014-05-16T00:00:00Z","timestamp":1400198400000},"content-version":"tdm","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":[[2015,4]]},"DOI":"10.1007\/s11075-014-9873-5","type":"journal-article","created":{"date-parts":[[2014,5,15]],"date-time":"2014-05-15T03:00:01Z","timestamp":1400122801000},"page":"813-836","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["The effect of graph partitioning techniques on parallel Block FSAI preconditioning: a computational study"],"prefix":"10.1007","volume":"68","author":[{"given":"Carlo","family":"Janna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Castelletto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimiliano","family":"Ferronato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,5,16]]},"reference":[{"key":"9873_CR1","first-page":"23","volume":"37","author":"J Cerd\u00e0n","year":"2010","unstructured":"Cerd\u00e0n, J., Faraj, T., Malla, N., Marin, J., Mas, J.: Block approximate inverse preconditioners for sparse nonsymmetric linear systems. Electron. Trans. Numer. Anal. 37, 23\u201340 (2010)","journal-title":"Electron. Trans. Numer. Anal."},{"key":"9873_CR2","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/j.cam.2011.07.025","volume":"236","author":"L Bergamaschi","year":"2011","unstructured":"Bergamaschi, L., Martinez, A.: FSAI-based parallel Mixed Constraint Preconditioners for saddle point problems arising in geomechanics. J. Comput. Appl. Math. 236, 308\u2013318 (2011)","journal-title":"J. Comput. Appl. Math."},{"key":"9873_CR3","doi-asserted-by":"crossref","first-page":"1398","DOI":"10.1002\/cnm.1366","volume":"27","author":"BS Lazarov","year":"2011","unstructured":"Lazarov, B.S., Sigmund, O.: Factored parallel preconditioner for the saddle point problem. Int. J. Numer. Methods Biomed. Eng. 27, 1398\u20131410 (2011)","journal-title":"Int. J. Numer. Methods Biomed. Eng."},{"key":"9873_CR4","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1002\/nag.1012","volume":"36","author":"M Ferronato","year":"2012","unstructured":"Ferronato, M., Janna, C., Pini, G.: Parallel solution to ill-conditioned FE geomechanical problems. Int. J. Numer. Anal. Methods Geomech. 36, 422\u2013437 (2012)","journal-title":"Int. J. Numer. Anal. Methods Geomech."},{"key":"9873_CR5","doi-asserted-by":"crossref","first-page":"1707","DOI":"10.1002\/nme.3309","volume":"89","author":"M Ferronato","year":"2012","unstructured":"Ferronato, M., Janna, C., Pini, G.: Shifted FSAI preconditioners for the efficient parallel solution of non-linear groundwater flow models. Int. J. Numer. Methods Eng. 89, 1707\u20131719 (2012)","journal-title":"Int. J. Numer. Methods Eng."},{"key":"9873_CR6","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1007\/s10596-012-9276-4","volume":"16","author":"C Janna","year":"2012","unstructured":"Janna, C., Ferronato, M., Gambolati, G.: Parallel inexact constraint preconditioning for ill-conditioned consolidation problems. Comput. Geosci. 16, 661\u2013675 (2012)","journal-title":"Comput. Geosci."},{"key":"9873_CR7","doi-asserted-by":"crossref","unstructured":"Ferronato, M.: Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives. ISRN Appl. Math. (2012). doi: 10.5402\/2012\/127647","DOI":"10.5402\/2012\/127647"},{"key":"9873_CR8","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":"9873_CR9","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":"9873_CR10","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":"9873_CR11","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. SIAM J. Sci. Comput. 35, S229\u2013S249 (2013)","journal-title":"SIAM J. Sci. Comput."},{"key":"9873_CR12","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":"9873_CR13","doi-asserted-by":"crossref","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, 45\u201358 (1993)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9873_CR14","doi-asserted-by":"crossref","first-page":"1652","DOI":"10.1137\/S1064827597326845","volume":"20","author":"M Benzi","year":"1999","unstructured":"Benzi, M., Szyld, D.B., Duin, A.: Orderings for incomplete factorization preconditioning of nonsymmetric problems. SIAM J. Sci. Comput. 20, 1652\u20131670 (1999)","journal-title":"SIAM J. Sci. Comput."},{"key":"9873_CR15","doi-asserted-by":"crossref","first-page":"1851","DOI":"10.1137\/S1064827598339372","volume":"21","author":"M Benzi","year":"2000","unstructured":"Benzi, M., T\u016fma, M.: Orderings for factorized sparse approximate inverse preconditioners. SIAM J. Sci. Comput. 21, 1851\u20131868 (2000)","journal-title":"SIAM J. Sci. Comput."},{"key":"9873_CR16","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1002\/nla.323","volume":"10","author":"JK Cullum","year":"2003","unstructured":"Cullum, J.K., Johnson, K., T\u016fma, M.: Effects of problem decomposition (partitioning) on the rate of convergence of parallel numerical algorithms. Numer. Linear Algebra Appl. 10, 445\u2013465 (2003)","journal-title":"Numer. Linear Algebra Appl."},{"key":"9873_CR17","doi-asserted-by":"crossref","unstructured":"Cuthill, E., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. In: Proceedings of the 1969 24th National Conference, pp. 157\u2013172 (1969)","DOI":"10.1145\/800195.805928"},{"key":"9873_CR18","volume-title":"Computer Implementation of the Finite Element Method. Tech. Rep. STAN-CS-208","author":"A George","year":"1971","unstructured":"George, A.: Computer Implementation of the Finite Element Method. Tech. Rep. STAN-CS-208. Department of Computer Science, Stanford University, Stanford (1971)"},{"key":"9873_CR19","volume-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"JA Georges","year":"1981","unstructured":"Georges, J.A., Liu, J.W.: Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"9873_CR20","doi-asserted-by":"crossref","first-page":"1801","DOI":"10.1109\/PROC.1967.6011","volume":"55","author":"WF Tinney","year":"1967","unstructured":"Tinney, W.F., Walker, J.W.: Direct solutions of sparse network equations by optimally ordered triangular factorization. Proc. IEEE 55, 1801\u20131809 (1967)","journal-title":"Proc. IEEE"},{"key":"9873_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/1031001","volume":"31","author":"A George","year":"1989","unstructured":"George, A., Liu, J.W.: The evolution of the minimum degree ordering algorithm. SIAM Rev. 31, 1\u201319 (1989)","journal-title":"SIAM Rev."},{"key":"9873_CR22","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1137\/S0895479894278952","volume":"17","author":"P Amestoy","year":"1996","unstructured":"Amestoy, P., Davis, T., Duff, I.: An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 17, 886\u2013905 (1996)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9873_CR23","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1002\/cpe.4330060203","volume":"6","author":"S Barnard","year":"1994","unstructured":"Barnard, S., Simon, H.D.: A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurr Pract Experience 6, 101\u2013117 (1994)","journal-title":"Concurr Pract Experience"},{"key":"9873_CR24","doi-asserted-by":"crossref","unstructured":"Hendrickson, B., Leland, R.: A multilevel algorithm for partitioning graphs. In: Proceedings of the ACM\/IEEE Conference on Supercomputing (1995)","DOI":"10.1145\/224170.224228"},{"key":"9873_CR25","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","volume":"48","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: Multilevel k-way partitioning scheme for irregular graphs. J. Parallel Distrib. Comput. 48, 96\u2013129 (1998)","journal-title":"J. Parallel Distrib. Comput."},{"key":"9873_CR26","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1999","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20, 359\u2013392 (1999)","journal-title":"SIAM J. Sci. Comput."},{"key":"9873_CR27","doi-asserted-by":"crossref","unstructured":"Chevalier, C., Pellegrini, F.: Improvement of the efficiency of genetic algorithms for scalable parallel graph partitioning in a multi-level framework. In: Proceedings of EuroPar 2006. Lecture Notes on Computer Science, no. 4128, pp. 243\u2013252 (2006)","DOI":"10.1007\/11823285_25"},{"key":"9873_CR28","doi-asserted-by":"crossref","unstructured":"Pellegrini, F.: A parallelisable multi-level banded diffusion scheme for computing balanced partitions with smooth boundaries. In: Proceedings of EuroPar 2007. Lecture Notes on Computer Science, no. 4641, pp. 191\u2013200 (2007)","DOI":"10.1007\/978-3-540-74466-5_22"},{"key":"9873_CR29","unstructured":"Pellegrini, F.: SCOTCH, software package and libraries for sequential and parallel graph partitioning, static mapping, and sparse matrix block ordering, and sequential mesh and hypergraph partitioning (version 5.1.10). Electronic document available at http:\/\/www.labri.fr\/perso\/pelegrin\/scotch (2010)"},{"key":"9873_CR30","unstructured":"Karypis, G., Kumar, V.: METIS - A software package for partitioning unstructured graphs, partitioning meshes and computing fill-reducing orderings of sparse matrices - Version 5.0. Electronic document available at http:\/\/glaros.dtc.umn.edu\/gkhome\/metis\/metis\/overview (2011)"},{"key":"9873_CR31","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1137\/030601132","volume":"26","author":"RM Holland","year":"2005","unstructured":"Holland, R.M., Wathen, A.J., Shaw, G.J.: Sparse approximate inverses and target matrices. SIAM J. Sci. Comput. 26, 1000\u20131011 (2005)","journal-title":"SIAM J. Sci. Comput."},{"key":"9873_CR32","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1002\/nla.1680010405","volume":"1","author":"Y Saad","year":"1994","unstructured":"Saad, Y.: ILUT: a dual threshold incomplete ILU factorization. Numer. Linear Algebra Appl. 1, 387\u2013402 (1994)","journal-title":"Numer. Linear Algebra Appl."},{"key":"9873_CR33","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1137\/S1064827502405094","volume":"25","author":"N Li","year":"2003","unstructured":"Li, N., Saad, Y., Chow, E.: Crout version of ILU for general sparse matrices. SIAM J. Sci. Comput. 25, 716\u2013728 (2003)","journal-title":"SIAM J. Sci. Comput."},{"key":"9873_CR34","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1016\/j.advengsoft.2008.11.010","volume":"40","author":"C Janna","year":"2009","unstructured":"Janna, C., Comerlati, A., Gambolati, G.: A comparison of projective and direct solvers for finite elements in elastostatics. Adv. Eng. Softw. 40, 675\u2013685 (2009)","journal-title":"Adv. Eng. Softw."},{"key":"9873_CR35","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":"9873_CR36","doi-asserted-by":"crossref","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, 838\u2013853 (1997)","journal-title":"SIAM J. Sci. Comput."},{"key":"9873_CR37","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":"9873_CR38","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1023988426844","volume":"25","author":"T Huckle","year":"2003","unstructured":"Huckle, T.: Factorized sparse approximate inverses for preconditioning. J. Supercomput. 25, 109\u2013117 (2003)","journal-title":"J. Supercomput."},{"key":"9873_CR39","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1002\/nla.1680010208","volume":"1","author":"IE Kaporin","year":"1994","unstructured":"Kaporin, I.E.: New convergence results and preconditioning strategies for the conjugate gradient method. Numer. Linear Algebra Appl. 1, 179\u2013210 (1994)","journal-title":"Numer. Linear Algebra Appl."},{"key":"9873_CR40","volume-title":"LAPACK User\u2019s Guide","author":"G Anderson","year":"1992","unstructured":"Anderson, G., Bai, Z., Bischof, C., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Kenney, A.M., Ostrouchov, S., Sorensen, D.: LAPACK User\u2019s Guide. SIAM, Philadelphia (1992)"},{"key":"9873_CR41","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1137\/S1064827598335842","volume":"21","author":"R Bridson","year":"1999","unstructured":"Bridson, R., Tang, W.P.: Ordering, anisotropy and factored sparse approximate inverses. SIAM J. Sci. Comput. 21, 867\u2013882 (1999)","journal-title":"SIAM J. Sci. Comput."},{"key":"9873_CR42","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":"2"},{"key":"9873_CR43","doi-asserted-by":"crossref","unstructured":"Saad, Y.: SPARSKIT, a basic tool-kit for sparse matrix computations (Version 2). Electronic document available at http:\/\/www-users.cs.umn.edu\/~saad\/software\/SPARSKIT (1988)","DOI":"10.1145\/55364.55412"},{"key":"9873_CR44","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Technol. J. 49, 291\u2013307 (1970)","journal-title":"Bell Syst. Technol. J."},{"key":"9873_CR45","first-page":"225","volume":"40","author":"IS Duff","year":"2013","unstructured":"Duff, I.S., Kaya, K.: Preconditioners based on strong subgraphs. Electron. Trans. Numer. Anal. 40, 225\u2013249 (2013)","journal-title":"Electron. Trans. Numer. Anal."},{"key":"9873_CR46","doi-asserted-by":"crossref","first-page":"A63","DOI":"10.1137\/120898760","volume":"36","author":"E Vecharinsky","year":"2014","unstructured":"Vecharinsky, E., Saad, Y., Sosonika, M.: Graph partitioning using matrix values for preconditioning symmetric positive definite systems. SIAM J. Sci. Comput. 36, A63\u2013A87 (2014)","journal-title":"SIAM J. Sci. Comput."},{"key":"9873_CR47","doi-asserted-by":"crossref","first-page":"W11547","DOI":"10.1029\/2010WR009161","volume":"46","author":"P Teatini","year":"2010","unstructured":"Teatini, P., Ferronato, M., Gambolati, G., Ba\u00f9, D., Putti, M.: Anthropogenic Venice uplift by seawater pumping into a heterogeneous aquifer system. Water Resour. Res. 46, W11547 (2010). doi: 10.1029\/2010WR009161","journal-title":"Water Resour. Res."},{"key":"9873_CR48","doi-asserted-by":"crossref","first-page":"1918","DOI":"10.1016\/j.enconman.2010.02.024","volume":"51","author":"M Ferronato","year":"2010","unstructured":"Ferronato, M., Gambolati, G., Janna, C., Teatini, P.: Geomechanical issues of anthropogenic CO2 sequestration in exploited gas fields. Energy Convers. Manag. 51, 1918\u20131928 (2010)","journal-title":"Energy Convers. Manag."},{"key":"9873_CR49","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."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-014-9873-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-014-9873-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-014-9873-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,26]],"date-time":"2024-05-26T17:43:26Z","timestamp":1716745406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-014-9873-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,16]]},"references-count":49,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["9873"],"URL":"https:\/\/doi.org\/10.1007\/s11075-014-9873-5","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,16]]}}}