{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:27:48Z","timestamp":1725568068589},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540290674"},{"type":"electronic","value":"9783540334989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11558958_76","type":"book-chapter","created":{"date-parts":[[2006,2,23]],"date-time":"2006-02-23T15:02:16Z","timestamp":1140706936000},"page":"637-643","source":"Crossref","is-referenced-by-count":1,"title":["Parallel Hybrid Sparse Solvers Through Flexible Incomplete Cholesky Preconditioning"],"prefix":"10.1007","author":[{"given":"Keita","family":"Teranishi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Padma","family":"Raghavan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"76_CR1","unstructured":"Balay, S., Gropp, W.D., Mcinnes, L.C., Smith, B.F.: PETSc users manual. Tech. Rep. ANL-95\/11 - Revision 2.1.1, Argonne National Laboratories (2002)"},{"key":"76_CR2","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1177\/109434200101500106","volume":"15","author":"E. Chow","year":"2001","unstructured":"Chow, E.: Parallel implementation and practical use of sparse approximate inverse preconditioners with a priori sparsity patterns. Int. J. High Perf. Comput. Apps.\u00a015, 56\u201374 (2001)","journal-title":"Int. J. High Perf. Comput. Apps."},{"key":"76_CR3","volume-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"A. George","year":"1981","unstructured":"George, A., Liu, J.W.-H.: Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs (1981)"},{"issue":"3","key":"76_CR4","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/S1064827594276552","volume":"18","author":"M.J. Grote","year":"1997","unstructured":"Grote, M.J., Huckle, T.: Parallel preconditioning with sparse approximate inverses. SIAM J. Sci. Comput.\u00a018(3), 838\u2013853 (1997)","journal-title":"SIAM J. Sci. Comput."},{"key":"76_CR5","doi-asserted-by":"crossref","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"M.R. Hestenes","year":"1952","unstructured":"Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. National Bureau Standard J. Res.\u00a049, 409\u2013436 (1952)","journal-title":"National Bureau Standard J. Res."},{"key":"76_CR6","series-title":"IMA","first-page":"229","volume-title":"Graph Theory and Sparse Matrix Computations","author":"M. Jones","year":"1994","unstructured":"Jones, M., Plassmann, P.: The efficient parallel iterative solution of large sparse linear systems. In: George, A., Gilbert, J.R., Liu, J.W.H. (eds.) Graph Theory and Sparse Matrix Computations. IMA, vol.\u00a056, pp. 229\u2013245. Springer, Heidelberg (1994)"},{"issue":"1","key":"76_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/jpdc.1997.1403","volume":"48","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A parallel algorithm for multilevel graph partitioning and sparse matrix ordering. Journal of Parallel and Distributed Computing\u00a048(1), 71\u201395 (1998)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"1","key":"76_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1137\/0614004","volume":"14","author":"L.Y. Kolotilina","year":"1993","unstructured":"Kolotilina, L.Y., Yeremin, A.Y.: Factorized sparse approximate inverse preconditionings. I. Theory. SIAM J. Matrix Anal. Appl.\u00a014(1), 45\u201358 (1993)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"76_CR9","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/0611010","volume":"11","author":"J.W.-H. Liu","year":"1990","unstructured":"Liu, J.W.-H.: The role of elimination trees in sparse factorization. SIAM J. Matrix Anal. Appl.\u00a011(1), 134\u2013172 (1990)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"76_CR10","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1137\/0614019","volume":"14","author":"J.W.-H. Liu","year":"1993","unstructured":"Liu, J.W.-H., Ng, E., Peyton, B.W.: On finding supernods for sparse matrix ccomputation. SIAM J. Matrix Anal. Appl.\u00a014(1), 242\u2013252 (1993)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"76_CR11","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1137\/0914063","volume":"14","author":"E.G. Ng","year":"1993","unstructured":"Ng, E.G., Peyton, B.W.: Block sparse Cholesky algorithmon advanced uniprocessor computers. SIAM J. Sci. Comput.\u00a014, 1034\u20131056 (1993)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"76_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1142\/S0129626498000067","volume":"9","author":"P. Raghavan","year":"1998","unstructured":"Raghavan, P.: Efficient parallel triangular solution using selective inversion. Parallel Processing Letters\u00a09(1), 29\u201340 (1998)","journal-title":"Parallel Processing Letters"},{"key":"76_CR13","unstructured":"Raghavan, P.: DSCPACK:Domain-separator codes for solving sparse linear systems. Tech. Rep.CSE-02-004,Department ofComputer Science and Engineering, The Pennsylvania State University (2002)"},{"key":"76_CR14","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1002\/nla.327","volume":"10","author":"P. Raghavan","year":"2003","unstructured":"Raghavan, P., Teranishi, K., Ng, E.G.: A latency tolerant hybrid sparse solver using incomplete Cholesky factorization. Numer. Linear Algebra Appl.\u00a010, 541\u2013560 (2003)","journal-title":"Numer. Linear Algebra Appl."},{"key":"76_CR15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative method for sparse linear systems","author":"Y. Saad","year":"2003","unstructured":"Saad, Y.: Iterative method for sparse linear systems, 2nd edn. SIAM, Philadelphia (2003)","edition":"2"},{"key":"76_CR16","unstructured":"Teranishi, K.: Scalable Hybrid Sprase Lienar Solvers. PhD thesis, Department of Computer Science and Engineering, The Pennsylvania State University (2004)"},{"key":"76_CR17","doi-asserted-by":"crossref","unstructured":"Teranishi, K., Raghavan, P., Ng, E.: A new data-mapping scheme for latencytolerant distributed sparse triangular solution. In: SuperComputing 2002, pp. 238\u2013247 (2002)","DOI":"10.1109\/SC.2002.10020"},{"key":"76_CR18","unstructured":"Teranishi, K., Raghavan, P., Sun, J., Micharelis, P.: A hybrid preconditioner for sparse systems from thermo-mechanical applications. Intl. J. Numerical Methods in Engineering (submitted)"},{"key":"76_CR19","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1137\/0719024","volume":"19","author":"Z. Zlatev","year":"1982","unstructured":"Zlatev, Z.: Use of iterative refinement in the solution of sparse linear systems. SIAM J. Numer. Anal.\u00a019, 381\u2013399 (1982)","journal-title":"SIAM J. Numer. Anal."}],"container-title":["Lecture Notes in Computer Science","Applied Parallel Computing. State of the Art in Scientific Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11558958_76.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:11:12Z","timestamp":1619507472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11558958_76"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540290674","9783540334989"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11558958_76","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}