{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:42:22Z","timestamp":1725565342623},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220602"},{"type":"electronic","value":"9783540247685"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24768-5_3","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T01:14:08Z","timestamp":1284167648000},"page":"20-28","source":"Crossref","is-referenced-by-count":1,"title":["ILUTP_Mem: A Space-Efficient Incomplete LU Preconditioner"],"prefix":"10.1007","author":[{"given":"Tzu-Yi","family":"Chen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Axelsson, O., Munksgaard, N.: Analysis of incomplete factorizations with fixed storage allocation. In: Evans, D. (ed.) Preconditioning Methods Theory and Applications, pp. 219\u2013241. Gordon and Breach (1983)","DOI":"10.1090\/S0025-5718-1983-0679442-3"},{"issue":"4","key":"3_CR2","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1137\/S1064827599361308","volume":"22","author":"M. Benzi","year":"2000","unstructured":"Benzi, M., Haws, J.C., Tuma, M.: Preconditioning highly indefinite and nonsymmetric matrices. SIAM J. Sci. Comput.\u00a022(4), 1333\u20131353 (2000)","journal-title":"SIAM J. Sci. Comput."},{"key":"3_CR3","unstructured":"Chen, T.-Y.: Preconditioning sparse matrices for computing eigenvalues and solving linear systems of equations. PhD thesis, University of California at Berkeley (December 2001)"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/S0377-0427(97)00171-4","volume":"86","author":"E. Chow","year":"1997","unstructured":"Chow, E., Saad, Y.: Experimental study of ILU preconditioners for indefinite matrices. J. Comp. and Appl. Math.\u00a086, 387\u2013414 (1997)","journal-title":"J. Comp. and Appl. Math."},{"key":"3_CR5","unstructured":"Davis, T.: University of Florida sparse matrix collection. NA Digest\u00a092(42) (October 16, 1994) and NA Digest\u00a096(28) (July 23, 1996) and NA Digest\u00a097(23) (June 7, 1997), available at: http:\/\/www.cise.ufl.edu\/~davis\/sparse\/"},{"key":"3_CR6","unstructured":"Davis, T.A., Gilbert, J.R., Larimore, S.I., Ng, E.G.: A column approximate minimum degree ordering algorithm. Technical Report TR-00-005, Department of Computer and Information Science and Engineering, University of Florida (October 2000)"},{"issue":"4","key":"3_CR7","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1137\/S0895479897317661","volume":"20","author":"S. Duff","year":"1999","unstructured":"Duff, S., Koster, J.: The design and use of algorithms for permuting large entries to the diagonal of sparse matrices. SIAM J. Matrix Anal. Appl.\u00a020(4), 889\u2013901 (1999)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"3_CR8","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/S0895479899358443","volume":"22","author":"S. Duff","year":"2001","unstructured":"Duff, S., Koster, J.: On algorithms for permuting large entries to the diagonal of a sparse matrix. SIAM J. Matrix Anal. Appl.\u00a022(4), 973\u2013996 (2001)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"3_CR9","unstructured":"Eijkhout, V.: Overview of iterative linear system solver packages. Lapack working note 141 (July 1998)"},{"key":"3_CR10","first-page":"409","volume":"24","author":"J.R. Gilbert","year":"2000","unstructured":"Gilbert, J.R., Toledo, S.: An assessment of incomplete-LU preconditioners for nonsymmetric linear systems. Informatica\u00a024, 409\u2013425 (2000)","journal-title":"Informatica"},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/200979.200981","volume":"21","author":"M.T. Jones","year":"1995","unstructured":"Jones, M.T., Plassmann, P.E.: An improved incomplete Cholesky factorization. ACM Trans. on Math. Softw.\u00a021(1), 5\u201317 (1995)","journal-title":"ACM Trans. on Math. Softw."},{"key":"3_CR12","unstructured":"Lin, C.-J., Mor\u00e9, J.J.: Incomplete Cholesky factorizations with limited memory. Technical Report MCS-P682-0897, Argonne National Laboratory (August 1997)"},{"key":"3_CR13","unstructured":"UC Berkeley Millennium Project, http:\/\/www.millennium.berkeley.edu\/"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1145\/355887.355893","volume":"6","author":"N. Munksgaard","year":"1980","unstructured":"Munksgaard, N.: Solving sparse symmetric sets of linear equations by preconditioned conjugate gradients. ACM Trans. on Math. Softw.\u00a06, 206\u2013219 (1980)","journal-title":"ACM Trans. on Math. Softw."},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1002\/nla.1680010405","volume":"4","author":"Y. Saad","year":"1994","unstructured":"Saad, Y.: ILUT: A dual threshold incomplete LU factorization. Numer. Linear Algebra Appl.\u00a04, 387\u2013402 (1994)","journal-title":"Numer. Linear Algebra Appl."},{"key":"3_CR16","unstructured":"Saad, Y.: Iterative methods for sparse linear systems. PWS publishing company (1996)"},{"issue":"3","key":"3_CR17","doi-asserted-by":"publisher","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.\u00a07(3), 856\u2013869 (1986)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-0427(00)00412-X","volume":"123","author":"Y. Saad","year":"2000","unstructured":"Saad, Y., van der Vorst, H.A.: Iterative solution of linear systems in the 20th century. J. of Comp. and Appl. Math.\u00a0123, 1\u201333 (2000)","journal-title":"J. of Comp. and Appl. Math."},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"1703","DOI":"10.1002\/nme.1620381007","volume":"38","author":"M. Suarjana","year":"1995","unstructured":"Suarjana, M., Law, K.H.: A robust incomplete factorization based on value and space constraints. Int. J. Numer. Meth. Engng.\u00a038, 1703\u20131719 (1995)","journal-title":"Int. J. Numer. Meth. Engng."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24768-5_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:08:39Z","timestamp":1620011319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24768-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220602","9783540247685"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24768-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}