{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T08:45:49Z","timestamp":1648629949640},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,11,26]],"date-time":"2018-11-26T00:00:00Z","timestamp":1543190400000},"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":[[2019,11]]},"DOI":"10.1007\/s11075-018-0628-6","type":"journal-article","created":{"date-parts":[[2018,11,26]],"date-time":"2018-11-26T01:36:58Z","timestamp":1543196218000},"page":"809-842","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distributed algebraic tearing and interconnecting techniques"],"prefix":"10.1007","volume":"82","author":[{"given":"N. A.","family":"Tselepidis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. K.","family":"Filelis-Papadopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G. A.","family":"Gravvanis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,26]]},"reference":[{"key":"628_CR1","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.advengsoft.2012.07.004","volume":"60","author":"E Agullo","year":"2013","unstructured":"Agullo, E., Giraud, L., Guermouche, A., Haidar, A., Roman, J.: Parallel algebraic domain decomposition solver for the solution of augmented systems. Adv. Eng. Softw. 60, 23\u201330 (2013)","journal-title":"Adv. Eng. Softw."},{"issue":"4","key":"628_CR2","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1137\/S0895479894278952","volume":"17","author":"PR Amestoy","year":"1996","unstructured":"Amestoy, P.R., Davis, T.A., Duff, I.S.: An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 17(4), 886\u2013905 (1996)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"628_CR3","doi-asserted-by":"crossref","unstructured":"Anderson, E., Bai, Z., Dongarra, J., Greenbaum, A., McKenney, A., Croz, J., Hammarling, S., Demmel, J., Bischof, C., Sorensen, D.: LAPACK: a portable linear algebra library for high-performance computers. In: Proceedings of the 1990 ACM\/IEEE Conference on Supercomputing, Supercomputing \u201990, pp. 2\u201311. IEEE Computer Society Press, Los Alamitos (1990)","DOI":"10.1109\/SUPERC.1990.129995"},{"key":"628_CR4","volume-title":"Iterative Solution Methods","author":"O Axelsson","year":"1996","unstructured":"Axelsson, O.: Iterative Solution Methods. Cambridge University Press, Cambridge (1996)"},{"issue":"2","key":"628_CR5","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(2), 418\u2013477 (2002)","journal-title":"J. Comput. Phys."},{"issue":"2","key":"628_CR6","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/S0168-9274(98)00118-4","volume":"30","author":"M Benzi","year":"1999","unstructured":"Benzi, M., T\u00fbma, M.: A comparative study of sparse approximate inverse preconditioners. Appl. Numer. Math. 30(2), 305\u2013340 (1999)","journal-title":"Appl. Numer. Math."},{"key":"628_CR7","volume-title":"Using Openmp: Portable Shared Memory Parallel Programming, vol. 10","author":"B Chapman","year":"2008","unstructured":"Chapman, B., Jost, G., Van Der Pas, R.: Using Openmp: Portable Shared Memory Parallel Programming, vol. 10. MIT Press, Cambridge (2008)"},{"key":"628_CR8","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718881","volume-title":"Direct Methods for Sparse Linear Systems","author":"TA Davis","year":"2006","unstructured":"Davis, T.A.: Direct Methods for Sparse Linear Systems. SIAM, Philadelphia (2006)"},{"issue":"1","key":"628_CR9","first-page":"1, 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. (TOMS) 38(1), 1, 1\u20131, 25 (2011)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"1","key":"628_CR10","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1137\/S1064827502412887","volume":"25","author":"CR Dohrmann","year":"2003","unstructured":"Dohrmann, C.R.: A preconditioner for substructuring based on constrained energy minimization. SIAM J. Sci. Comput. 25(1), 246\u2013258 (2003)","journal-title":"SIAM J. Sci. Comput."},{"issue":"7","key":"628_CR11","doi-asserted-by":"crossref","first-page":"1523","DOI":"10.1002\/nme.76","volume":"50","author":"C Farhat","year":"2001","unstructured":"Farhat, C., Lesoinne, M., LeTallec, P., Pierson, K., Rixen, D.: FETI-DP: a dual\u2013primal unified FETI method\u2014part I: a faster alternative to the two-level FETI method. Int. J. Numer. Methods Eng. 50(7), 1523\u20131544 (2001)","journal-title":"Int. J. Numer. Methods Eng."},{"issue":"3","key":"628_CR12","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0045-7825(94)90068-X","volume":"115","author":"C Farhat","year":"1994","unstructured":"Farhat, C., Mandel, J., Roux, F.X.: Optimal convergence properties of the FETI domain decomposition method. Comput. Methods Appl. Mech. Eng. 115(3), 365\u2013385 (1994)","journal-title":"Comput. Methods Appl. Mech. Eng."},{"issue":"6","key":"628_CR13","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1002\/nme.1620320604","volume":"32","author":"C Farhat","year":"1991","unstructured":"Farhat, C., Roux, F.-X.: A method of finite element tearing and interconnecting and its parallel solution algorithm. Int. J. Numer. Methods Eng. 32(6), 1205\u20131227 (1991)","journal-title":"Int. J. Numer. Methods Eng."},{"issue":"06","key":"628_CR14","doi-asserted-by":"crossref","first-page":"1350084","DOI":"10.1142\/S0219876213500849","volume":"11","author":"CHRISTOS K. FILELIS-PAPADOPOULOS","year":"2014","unstructured":"Filelis-Papadopoulos, C.K., Gravvanis, G.A.: Generic approximate sparse inverse matrix techniques. Int. J. Comput. Methods 11(6) (2014)","journal-title":"International Journal of Computational Methods"},{"issue":"1","key":"628_CR15","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1108\/EC-12-2014-0261","volume":"33","author":"CK Filelis-Papadopoulos","year":"2016","unstructured":"Filelis-Papadopoulos, C.K., Gravvanis, G.A.: A class of generic factored and multi-level recursive approximate inverse techniques for solving general sparse systems. Eng. Comput. 33(1), 74\u201399 (2016)","journal-title":"Eng. Comput."},{"issue":"3","key":"628_CR16","doi-asserted-by":"crossref","first-page":"276","DOI":"10.4208\/nmtma.2010.33.2","volume":"3","author":"L Giraud","year":"2010","unstructured":"Giraud, L., Haidar, A., Saad, Y.: Sparse approximations of the Schur complement for parallel algebraic hybrid solvers in 3D. Numerical Mathematics Theory, Methods and Applications 3(3), 276\u2013294 (2010)","journal-title":"Numerical Mathematics Theory, Methods and Applications"},{"key":"628_CR17","unstructured":"Golub, G., Van Loan, C.: Matrix Computations. Johns Hopkins Studies in the Mathematical Sciences. The Johns Hopkins University Press, Baltimore (2013)"},{"key":"628_CR18","volume-title":"Using MPI: Portable Parallel Programming with the Message-Passing Interface, vol. 1","author":"W Gropp","year":"1999","unstructured":"Gropp, W., Lusk, E., Skjellum, A.: Using MPI: Portable Parallel Programming with the Message-Passing Interface, vol. 1. MIT Press, Cambridge (1999)"},{"issue":"3","key":"628_CR19","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1137\/S1064827594276552","volume":"18","author":"MJ Grote","year":"1997","unstructured":"Grote, M.J., Huckle, T.: Parallel preconditioning with sparse approximate inverses. SIAM J. Sci. Comput. 18(3), 838\u2013853 (1997)","journal-title":"SIAM J. Sci. Comput."},{"key":"628_CR20","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0168-9274(01)00115-5","volume":"41","author":"VE Henson","year":"2000","unstructured":"Henson, V.E., Yang, U.M.: BoomerAMG: a parallel algebraic multigrid solver and preconditioner. Appl. Numer. Math. 41, 155\u2013177 (2000)","journal-title":"Appl. Numer. Math."},{"issue":"1","key":"628_CR21","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"628_CR22","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(1), 96\u2013129 (1998)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1","key":"628_CR23","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1002\/zamm.200900329","volume":"90","author":"A Klawonn","year":"2010","unstructured":"Klawonn, A., Rheinbach, O.: Highly scalable parallel domain decomposition methods with an application to biomechanics. ZAMM - J. Appl. Math. Mech. \/ Z. Angew. Math. Mech. 90(1), 5\u201332 (2010)","journal-title":"ZAMM - J. Appl. Math. Mech. \/ Z. Angew. Math. Mech."},{"issue":"3","key":"628_CR24","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1145\/355841.355847","volume":"5","author":"CL Lawson","year":"1979","unstructured":"Lawson, C.L., Hanson, R.J., Kincaid, D.R., Krogh, F.T.: Basic Linear Algebra Subprograms for Fortran usage. ACM Trans. Math. Softw. (TOMS) 5(3), 308\u2013323 (1979)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"3","key":"628_CR25","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1137\/16M110486X","volume":"38","author":"R Li","year":"2017","unstructured":"Li, R., Saad, Y.: Low-rank correction methods for algebraic domain decomposition preconditioners. SIAM J. Matrix Anal. Appl. 38(3), 807\u2013828 (2017)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"628_CR26","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1002\/nla.2051","volume":"23","author":"R Li","year":"2016","unstructured":"Li, R., Xi, Y., Saad, Y.: Schur complement-based domain decomposition preconditioners with low-rank corrections. Numerical Linear Algebra with Applications 23(4), 706\u2013729 (2016)","journal-title":"Numerical Linear Algebra with Applications"},{"issue":"5","key":"628_CR27","doi-asserted-by":"crossref","first-page":"1787","DOI":"10.1137\/040608350","volume":"27","author":"Z Li","year":"2006","unstructured":"Li, Z., Saad, Y.: SchurRAS: a restricted version of the overlapping Schur complement preconditioner. SIAM J. Sci. Comput. 27(5), 1787\u20131801 (2006)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"628_CR28","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1002\/cnm.1640090307","volume":"9","author":"J Mandel","year":"1993","unstructured":"Mandel, J.: Balancing domain decomposition. Commun. Numer. Methods Eng. 9(3), 233\u2013241 (1993)","journal-title":"Commun. Numer. Methods Eng."},{"issue":"3","key":"628_CR29","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/j.cam.2011.07.017","volume":"236","author":"M Manguoglu","year":"2011","unstructured":"Manguoglu, M.: A domain-decomposing parallel sparse linear system solver. J. Comput. Appl. Math. 236(3), 319\u2013325 (2011)","journal-title":"J. Comput. Appl. Math."},{"key":"628_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77209-5","volume-title":"Domain Decomposition Methods for the Numerical Solution of Partial Differential Equations, vol. 61","author":"T Mathew","year":"2008","unstructured":"Mathew, T.: Domain Decomposition Methods for the Numerical Solution of Partial Differential Equations, vol. 61. Springer Science & Business Media, Berlin (2008)"},{"key":"628_CR31","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.jocs.2017.08.020","volume":"22","author":"BE Moutafis","year":"2017","unstructured":"Moutafis, B.E., Filelis-Papadopoulos, C.K., Gravvanis, G.A.: Parallel multi-projection preconditioned methods based on semi-aggregation techniques. Journal of Computational Science 22, 45\u201354 (2017)","journal-title":"Journal of Computational Science"},{"issue":"10","key":"628_CR32","doi-asserted-by":"crossref","first-page":"3025","DOI":"10.1016\/j.cam.2010.04.016","volume":"234","author":"M Naumov","year":"2010","unstructured":"Naumov, M., Manguoglu, M., Sameh, A.H.: A tearing-based hybrid parallel sparse linear system solver. J. Comput. Appl. Math. 234(10), 3025\u20133038 (2010)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"628_CR33","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.parco.2005.07.005","volume":"32","author":"E Polizzi","year":"2006","unstructured":"Polizzi, E., Sameh, A.H.: A parallel hybrid banded system solver: the SPIKE algorithm. Parallel Comput. 32(2), 177\u2013194 (2006)","journal-title":"Parallel Comput."},{"issue":"4","key":"628_CR34","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1145\/98267.98287","volume":"16","author":"A Pothen","year":"1990","unstructured":"Pothen, A., Fan, C.-J.: Computing the block triangular form of a sparse matrix. ACM Trans. Math. Softw. (TOMS) 16(4), 303\u2013324 (1990)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"628_CR35","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. SIAM, Philadelphia (2003)"},{"issue":"3","key":"628_CR36","doi-asserted-by":"crossref","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":"1","key":"628_CR37","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1023\/A:1022326604210","volume":"40","author":"O Schenk","year":"2000","unstructured":"Schenk, O., G\u00e4rtner, K., Fichtner, W.: Efficient sparse LU factorization with left-right looking strategy on shared memory multiprocessors. BIT Numer. Math. 40 (1), 158\u2013176 (2000)","journal-title":"BIT Numer. Math."},{"issue":"3","key":"628_CR38","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.future.2003.07.011","volume":"20","author":"O Schenk","year":"2004","unstructured":"Schenk, O., G\u00e4rtner, K.: Solving unsymmetric sparse systems of linear equations with PARDISO. Futur. Gener. Comput. Syst. 20(3), 475\u2013487 (2004)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"628_CR39","volume-title":"Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations","author":"B Smith","year":"2004","unstructured":"Smith, B., Bjorstad, P., Gropp, W.: Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations. Cambridge University Press, Cambridge (2004)"},{"key":"628_CR40","doi-asserted-by":"crossref","DOI":"10.1007\/b137868","volume-title":"Domain Decomposition Methods: Algorithms and Theory, vol. 34","author":"A Toselli","year":"2005","unstructured":"Toselli, A., Widlund, O.B.: Domain Decomposition Methods: Algorithms and Theory, vol. 34. Springer, Berlin (2005)"},{"issue":"2","key":"628_CR41","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1137\/0913035","volume":"13","author":"HA der Vorst Van","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(2), 631\u2013644 (1992)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"628_CR42","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511615115","volume-title":"Iterative Krylov Methods for Large Linear Systems, vol. 13","author":"HA der Vorst Van","year":"2003","unstructured":"Van der Vorst, H.A.: Iterative Krylov Methods for Large Linear Systems, vol. 13. Cambridge University Press, Cambridge (2003)"},{"issue":"Supplement C","key":"628_CR43","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1016\/j.cam.2016.08.033","volume":"311","author":"Y Zhu","year":"2017","unstructured":"Zhu, Y., Sameh, A.H.: PSPIKE+: a family of parallel hybrid sparse linear system solvers. J. Comput. Appl. Math. 311(Supplement C), 682\u2013703 (2017)","journal-title":"J. Comput. Appl. Math."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-018-0628-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-018-0628-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-018-0628-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,3]],"date-time":"2020-03-03T01:10:23Z","timestamp":1583197823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-018-0628-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,26]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["628"],"URL":"https:\/\/doi.org\/10.1007\/s11075-018-0628-6","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,26]]},"assertion":[{"value":"20 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 November 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}