{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:51:39Z","timestamp":1725501099419},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540757542"},{"type":"electronic","value":"9783540757559"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75755-9_110","type":"book-chapter","created":{"date-parts":[[2007,9,21]],"date-time":"2007-09-21T22:44:54Z","timestamp":1190414694000},"page":"929-937","source":"Crossref","is-referenced-by-count":0,"title":["Partitioning and Blocking Issues for a Parallel Incomplete Factorization"],"prefix":"10.1007","author":[{"given":"Pascal","family":"H\u00e9non","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Ramet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean","family":"Roman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"11-12","key":"110_CR1","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.1016\/j.parco.2003.05.010","volume":"29","author":"P.R. Amestoy","year":"2003","unstructured":"Amestoy, P.R., Duff, I.S., Pralet, S., V\u00f6mel, C.: Adapting a parallel sparse direct solver to architectures with clusters of SMPs. Parallel Computing\u00a029(11-12), 1645\u20131668 (2003)","journal-title":"Parallel Computing"},{"key":"110_CR2","unstructured":"Campbell, Y., Davis, T.A.: Incomplete LU factorization: A multifrontal approach. Tech Report TR95-024 (1995)"},{"key":"110_CR3","doi-asserted-by":"crossref","unstructured":"Chang, T.F., Vassilevski, P.S.: A framework for block ILU factorizations using block-size reduction. Math. Comput. 64 (1995)","DOI":"10.2307\/2153326"},{"key":"110_CR4","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1002\/1097-0363(20000730)33:6<767::AID-FLD28>3.0.CO;2-C","volume":"33","author":"A. Chapman","year":"2000","unstructured":"Chapman, A., Saad, Y., Wigton, L.: High-order ILU preconditioners for CFD problems. Int. J. Numer. Meth. Fluids\u00a033, 767\u2013788 (2000)","journal-title":"Int. J. Numer. Meth. Fluids"},{"key":"110_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1007\/3-540-45545-0_94","volume-title":"Computational Science - ICCS 2001","author":"A. Gupta","year":"2001","unstructured":"Gupta, A.: Recent progress in general sparse direct solvers. In: Alexandrov, V.N., Dongarra, J.J., Juliano, B.A., Renner, R.S., Tan, C.J.K. (eds.) Computational Science - ICCS 2001. LNCS, vol.\u00a02073, pp. 823\u2013840. Springer, Heidelberg (2001)"},{"key":"110_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/11823285_25","volume-title":"Euro-Par 2006 Parallel Processing","author":"C. Chevalier","year":"2006","unstructured":"Chevalier, C., Pellegrini, F.: Improvement of the Efficiency of Genetic Algorithms for Scalable Parallel Graph Partitioning in a Multi-Level Framework. In: Nagel, W.E., Walter, W.V., Lehner, W. (eds.) Euro-Par 2006. LNCS, vol.\u00a04128, pp. 243\u2013252. Springer, Heidelberg (2006)"},{"issue":"3","key":"110_CR7","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1002\/cpe.605","volume":"14","author":"K. Schloegel","year":"2002","unstructured":"Schloegel, K., Karypis, G., Kumar, V.: Parallel static and dynamic multi-constraint graph partitioning. Concurrency and Computation: Practice and Experience\u00a014(3), 219\u2013240 (2002)","journal-title":"Concurrency and Computation: Practice and Experience"},{"issue":"2","key":"110_CR8","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/S0167-8191(01)00141-7","volume":"28","author":"P. H\u00e9non","year":"2002","unstructured":"H\u00e9non, P., Ramet, P., Roman, J.: PaStiX: A High-Performance Parallel Direct Solver for Sparse Symmetric Definite Systems. Parallel Computing\u00a028(2), 301\u2013321 (2002)","journal-title":"Parallel Computing"},{"key":"110_CR9","unstructured":"H\u00e9non, P., Ramet, P., Roman, J.: Efficient algorithms for direct resolution of large sparse system on clusters of SMP nodes. In: SIAM Conference on Applied Linear Algebra, Williamsburg, Virginie, USA (July 2003)"},{"key":"110_CR10","volume-title":"Proceedings of the IEEE\/ACM SC 1997 Conference","author":"G. Karypis","year":"1997","unstructured":"Karypis, G., Kumar, V.: Parallel Threshold-based ILU Factorization. In: Proceedings of the IEEE\/ACM SC 1997 Conference, ACM Press, New York (1997)"},{"key":"110_CR11","unstructured":"Li, X.S., Demmel, J.W.: A scalable sparse direct solver using static pivoting. In: Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, San Antonio, Texas (March 22-24, 1999)"},{"issue":"2","key":"110_CR12","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1137\/0716027","volume":"16","author":"R.J. Lipton","year":"1979","unstructured":"Lipton, R.J., Rose, D.J., Tarjan, R.E.: Generalized nested dissection. SIAM Journal of Numerical Analysis\u00a016(2), 346\u2013358 (1979)","journal-title":"SIAM Journal of Numerical Analysis"},{"issue":"1","key":"110_CR13","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.G., Peyton, B.W.: On finding supernodes for sparse matrix computations. SIAM J. Matrix Anal. Appl.\u00a014(1), 242\u2013252 (1993)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"8","key":"110_CR14","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1016\/S0167-739X(01)00034-6","volume":"17","author":"M. Magolu monga Made","year":"2001","unstructured":"Magolu monga Made, M., Van der Vorst, A.: A generalized domain decomposition paradigm for parallel incomplete LU factorization preconditionings. Future Generation Computer Systems\u00a017(8), 925\u2013932 (2001)","journal-title":"Future Generation Computer Systems"},{"key":"110_CR15","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high-quality multi-level scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing\u00a020, 359\u2013392 (1998)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"110_CR16","unstructured":"Pellegrini, F.: Scotch 4.0 User\u2019s guide. Technical Report, INRIA Futurs (2005)"},{"key":"110_CR17","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1002\/(SICI)1096-9128(200002\/03)12:2\/3<69::AID-CPE472>3.0.CO;2-W","volume":"12","author":"F. Pellegrini","year":"2000","unstructured":"Pellegrini, F., Roman, J., Amestoy, P.: Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering. Concurrency: Practice and Experience\u00a012, 69\u201384 (2000)","journal-title":"Concurrency: Practice and Experience"},{"key":"110_CR18","unstructured":"Hysom, D., Pothen, A.: Level-based Incomplete LU factorization: Graph Model and Algorithms (pdf file) Tech Report UCRL-JC-150789, Lawrence Livermore National Labs, 19 (November 2002)"},{"key":"110_CR19","doi-asserted-by":"crossref","unstructured":"Raghavan, P., Teranishi, K., Ng, E.G.: A latency tolerant hybrid sparse solver using incomplete Cholesky factorization. Numer. Linear Algebra (2003)","DOI":"10.1002\/nla.327"},{"key":"110_CR20","doi-asserted-by":"publisher","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. Numerical Linear Algebra with Applications\u00a01, 387\u2013402 (1994)","journal-title":"Numerical Linear Algebra with Applications"},{"key":"110_CR21","doi-asserted-by":"crossref","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems, 2nd edn. SIAM (2003)","DOI":"10.1137\/1.9780898718003"},{"key":"110_CR22","doi-asserted-by":"crossref","first-page":"345","DOI":"10.2118\/8252-PA","volume":"21","author":"J.W. Watts III","year":"1981","unstructured":"Watts III, J.W.: A conjugate gradient truncated direct method for the iterative solution of the reservoir simulation pressure equation. Society of Petroleum Engineers Journal\u00a021, 345\u2013353 (1981)","journal-title":"Society of Petroleum Engineers Journal"}],"container-title":["Lecture Notes in Computer Science","Applied Parallel Computing. State of the Art in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75755-9_110","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:32:20Z","timestamp":1558261940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75755-9_110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540757542","9783540757559"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75755-9_110","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}