{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T16:42:41Z","timestamp":1761237761204},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,11,6]],"date-time":"2010-11-06T00:00:00Z","timestamp":1289001600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer. Math."],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s00211-010-0336-1","type":"journal-article","created":{"date-parts":[[2010,11,5]],"date-time":"2010-11-05T00:50:55Z","timestamp":1288918255000},"page":"247-269","source":"Crossref","is-referenced-by-count":5,"title":["Robust incomplete factorization for nonsymmetric matrices"],"prefix":"10.1007","volume":"118","author":[{"given":"A.","family":"Rafiei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Bollh\u00f6fer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,11,6]]},"reference":[{"issue":"3","key":"336_CR1","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1137\/S1064827595294691","volume":"19","author":"M. Benzi","year":"1998","unstructured":"Benzi M., T\u016fma M.: A sparse approximate inverse preconditioner for nonsymmetric linear systems. SIAM J. Sci. Comput. 19(3), 968\u2013994 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"336_CR2","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1002\/nla.320","volume":"10","author":"M. Benzi","year":"2003","unstructured":"Benzi M., T\u016fma M.: A robust incomplete factorization preconditioner for positive definite matrices. Numer. Linear Algebra Appl. 10, 385\u2013400 (2003)","journal-title":"Numer. Linear Algebra Appl."},{"key":"336_CR3","unstructured":"Benzi, M., T\u016fma, M.: SPARSLAB software package (2009). http:\/\/www2.cs.cas.cz\/tuma\/sparslab.html . Accessed 17 November 2009"},{"key":"336_CR4","doi-asserted-by":"crossref","first-page":"1318","DOI":"10.1137\/S1064827599356900","volume":"22","author":"M. Benzi","year":"2000","unstructured":"Benzi M., Cullum J.K., T\u016fma M.: Robust approximate inverse preconditioning for the conjugate gradient method. SIAM J. Sci. Comput. 22, 1318\u20131332 (2000)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1\u20133","key":"336_CR5","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0024-3795(01)00385-8","volume":"338","author":"M. Bollh\u00f6fer","year":"2001","unstructured":"Bollh\u00f6fer M.: A robust ILU based on monitoring the growth of the inverse factors. Linear Algebra Appl. 338(1\u20133), 201\u2013218 (2001)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"336_CR6","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1137\/S0895479800372110","volume":"24","author":"M. Bollh\u00f6fer","year":"2002","unstructured":"Bollh\u00f6fer M., Saad Y.: On the relations between ILUs and factored approximate inverses. SIAM J. Matrix Anal. Appl. 24(1), 219\u2013237 (2002)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"336_CR7","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1137\/S1064827502403411","volume":"25","author":"M. Bollh\u00f6fer","year":"2003","unstructured":"Bollh\u00f6fer M.: A robust and efficient ILU that incorporates the growth of the inverse triangular factors. SIAM J. Sci. Comput. 25(1), 86\u2013103 (2003)","journal-title":"SIAM J. Sci. Comput."},{"key":"336_CR8","unstructured":"Bollh\u00f6fer, M.: ILUPACK software package (2009). http:\/\/www-public.tu-bs.de\/bolle\/ilupack"},{"key":"336_CR9","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1137\/0716029","volume":"16","author":"A. Cline","year":"1979","unstructured":"Cline A., Moler C.B., Wilkinson J.: An estimate for the condition number of a matrix. SIAM J. Numer. Anal. 16, 368\u2013375 (1979)","journal-title":"SIAM J. Numer. Anal."},{"key":"336_CR10","unstructured":"Davis, T.: University of Florida Sparse Matrix Collection (2009). http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/ . Accessed 17 November 2009"},{"key":"336_CR11","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1996","unstructured":"Golub G.H., Van Loan C.F.: Matrix Computations, 3rd edn. The John Hopkins University Press, Baltimore (1996)","edition":"3"},{"issue":"2","key":"336_CR12","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1137\/0914029","volume":"14","author":"R.W. Freund","year":"1993","unstructured":"Freund R.W.: A transpose-free quasi-minimal residual algorithm for non-hermitian linear systems. SIAM J. Sci. Comput. 14(2), 470\u2013482 (1993)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"336_CR13","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."},{"key":"336_CR14","unstructured":"Karypis, G.: METIS-Family of multilevel partitioning Algorithms\/Karypis Lab. http:\/\/glaros.dtc.umn.edu\/gkhome\/views\/metis"},{"key":"336_CR15","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/1099-1506(200104\/05)8:3<165::AID-NLA235>3.0.CO;2-9","volume":"8","author":"S.A. Kharchenko","year":"2001","unstructured":"Kharchenko S.A., Kolotilina L.Yu., Nikishin A.A., Yeremin A.Yu.: A robust AINV-type method for constructing sparse approximate inverse preconditioners in factored form. Numer. Linear Algebra Appl. 8, 165\u2013179 (2001)","journal-title":"Numer. Linear Algebra Appl."},{"issue":"2","key":"336_CR16","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1137\/S1064827502405094","volume":"25","author":"N. Li","year":"2003","unstructured":"Li N., Saad Y., Chow E.: Crout version of ILU for general sparse matrices. SIAM J. Sci. Comput. 25(2), 716\u2013728 (2003)","journal-title":"SIAM J. Sci. Comput."},{"key":"336_CR17","unstructured":"Matlab version 7.5.0.338 (R2007b), The Math works Inc"},{"issue":"1","key":"336_CR18","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.cam.2007.07.003","volume":"219","author":"A. Rafiei","year":"2008","unstructured":"Rafiei A., Toutounian F.: New breakdown-free variant of AINV method for nonsymmetric positive definite matrices. J. Comput. Appl. Math. 219(1), 72\u201380 (2008)","journal-title":"J. Comput. Appl. Math."},{"key":"336_CR19","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1016\/j.cam.2009.01.011","volume":"230","author":"A. Rafiei","year":"2009","unstructured":"Rafiei A., Toutounian F.: Breakdown-free version of ILU factorization for nonsymmetric positive definite matrices. J. Comput. Appl. Math. 230, 699\u2013705 (2009)","journal-title":"J. Comput. Appl. Math."},{"key":"336_CR20","unstructured":"Rafiei, A., Bollh\u00f6fer, M.: Extension of inverse-based dropping techniques for ILU preconditioners. http:\/\/www.digibib.tu-bs.de\/?docid=00035624"},{"key":"336_CR21","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Y. Saad","year":"1996","unstructured":"Saad Y.: Iterative Methods for Sparse Linear Systems. PWS publishing, Boston (1996)"},{"key":"336_CR22","doi-asserted-by":"crossref","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. Numer. Linear Algebra Appl. 1, 387\u2013402 (1994)","journal-title":"Numer. Linear Algebra Appl."},{"key":"336_CR23","unstructured":"Saad, Y.: SPARSKIT and sparse examples. NA Digest (1994). http:\/\/www-users.cs.umn.edu\/saad\/software . Accessed 17 November 2009"},{"key":"336_CR24","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. Comput. 7, 856\u2013869 (1986)","journal-title":"SIAM J. Sci. Comput."},{"key":"336_CR25","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1137\/0913035","volume":"12","author":"H.A. Vorst van der","year":"1992","unstructured":"van der Vorst H.A.: Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of non-symmetric linear systems. SIAM J. Sci. Stat. Comput. 12, 631\u2013644 (1992)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"336_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-017-1116-6","volume-title":"Computational Methods for General Sparse Matrices","author":"Z. Zlatev","year":"1991","unstructured":"Zlatev Z.: Computational Methods for General Sparse Matrices. Kluwer, Dordrecht (1991)"}],"container-title":["Numerische Mathematik"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-010-0336-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00211-010-0336-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-010-0336-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T16:22:44Z","timestamp":1558628564000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00211-010-0336-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,6]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["336"],"URL":"https:\/\/doi.org\/10.1007\/s00211-010-0336-1","relation":{},"ISSN":["0029-599X","0945-3245"],"issn-type":[{"value":"0029-599X","type":"print"},{"value":"0945-3245","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,6]]}}}