{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:29:30Z","timestamp":1742970570891,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662438794"},{"type":"electronic","value":"9783662438800"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43880-0_40","type":"book-chapter","created":{"date-parts":[[2014,6,25]],"date-time":"2014-06-25T09:42:01Z","timestamp":1403689321000},"page":"355-362","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["How to Make a Domain Decomposition Method More Robust"],"prefix":"10.1007","author":[{"given":"Nicole","family":"Spillane","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,6,26]]},"reference":[{"issue":"3\u20134","key":"40_CR1","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1080\/00207168808803625","volume":"23","author":"Z Dost\u00e0l","year":"1988","unstructured":"Dost\u00e0l, Z.: Conjugate gradient method with preconditioning by projector. Int. J. Comput. Math. 23(3\u20134), 315\u2013323 (1988)","journal-title":"Int. J. Comput. Math."},{"key":"40_CR2","doi-asserted-by":"publisher","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":"11","key":"40_CR3","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1002\/nme.4534","volume":"95","author":"N Spillane","year":"2013","unstructured":"Spillane, N., Rixen, D.J.: Automatic spectral coarse spaces for robust finite element tearing and interconnecting and balanced domain decomposition algorithms. Int. J. Numer. Methods Eng. 95(11), 953\u2013990 (2013)","journal-title":"Int. J. Numer. Methods Eng."},{"key":"40_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/b137868","volume-title":"Domain Decomposition Methods: Algorithms and Theory","author":"A Toselli","year":"2005","unstructured":"Toselli, A., Widlund, O.: Domain Decomposition Methods: Algorithms and Theory. Springer, Heidelberg (2005)"},{"key":"40_CR5","unstructured":"Brezina, M., Heberton, C., Mandel, J., Van\u011bk, P.: An iterative method with convergence rate chosen a priori. Technical Report 140, CCM, University of Colorado Denver (1999)"},{"issue":"05","key":"40_CR6","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1051\/m2an\/2011073","volume":"46","author":"Y Efendiev","year":"2012","unstructured":"Efendiev, Y., Galvis, J., Lazarov, R., Willems, J.: Robust domain decomposition preconditioners for abstract symmetric positive definite bilinear forms. ESAIM 46(05), 1175\u20131199 (2012)","journal-title":"ESAIM"},{"issue":"23\u201324","key":"40_CR7","doi-asserted-by":"publisher","first-page":"1255","DOI":"10.1016\/j.crma.2011.10.021","volume":"349","author":"N Spillane","year":"2011","unstructured":"Spillane, N., Dolean, V., Hauret, P., Nataf, F., Pechstein, C., Scheichl, R.: A robust two level domain decomposition preconditioner for systems of PDEs. C. R. Math. 349(23\u201324), 1255\u20131259 (2011)","journal-title":"C. R. Math."},{"issue":"4","key":"40_CR8","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/s00211-013-0576-y","volume":"126","author":"N Spillane","year":"2014","unstructured":"Spillane, N., Dolean, V., Hauret, P., Nataf, F., Pechstein, C., Scheichl, R.: Abstract robust coarse spaces for systems of PDEs via generalized eigenproblems in the overlaps. Numer. Math. 126(4), 741\u2013770 (2014)","journal-title":"Numer. Math."}],"container-title":["Lecture Notes in Computer Science","Large-Scale Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43880-0_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T18:20:10Z","timestamp":1676398810000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-43880-0_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662438794","9783662438800"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43880-0_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"26 June 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}