Preconditioners based on the ISM factorization

[1] M. Benzi, C. D. Meyer, and M. Tůma. A sparse approximate inverse preconditioner for the conjugate gradient method. SIAM J. Sci. Comput., 17(5):1135{1149, 1996.10.1137/S1064827594271421Search in Google Scholar

[2] M. Benzi and M. Tůma. A sparse approximate inverse preconditioner for nonsymmetric linear systems. SIAM J. Sci. Comput., 19(3):968-994, 1998.10.1137/S1064827595294691Search in Google Scholar

[3] M. Benzi and M. Tůma. A comparative study of sparse approximate inverse preconditioners. Appl. Numer. Math., 30(2-3):305{340, 1999.10.1016/S0168-9274(98)00118-4Search in Google Scholar

[4] M. Benzi and M. Tůma. A robust preconditioner with low memory requirements for large sparse least squares problems. SIAM J. Sci. Comput., 25(2):499{512, 2003.10.1137/S106482750240649XSearch in Google Scholar

[5] Å. Björck. Numerical methods for Least Squares Problems. SIAM, Philadelphia, 1996.10.1137/1.9781611971484Search in Google Scholar

[6] M. Bollhöfer. A robust and e_cient ILU that incorporates the growth of the inverse triangular factors. SIAM J. Sci. Comput., 25(1):86{103, 2003.10.1137/S1064827502403411Search in Google Scholar

[7] M. Bollhöfer and Y. Saad. On the relations between ILUs and factored approximate inverses. SIAM J. Matrix Anal. Appl., 24(1):219{237, 2002.10.1137/S0895479800372110Search in Google Scholar

[8] R. Bru, J. Cerdán, J. Marín, and J. Mas. Preconditioning sparse nonsymmetric linear systems with the Sherman-Morrison formula. SIAM J. Sci. Comput., 25(2):701-715, 2003.10.1137/S1064827502407524Search in Google Scholar

[9] R. Bru, J. Marín, J. Mas, and M. Tůma. Balanced incomplete factorization. SIAM J. Sci. Comput., 30(5):2302{2318, 2008.10.1137/070696088Search in Google Scholar

[10] R. Bru, J. Marín, J. Mas, and M. Tůma. Improved balanced incomplete factorization. SIAM J. Matrix Anal. Appl., 31(5):2431-2452, 2010.10.1137/090747804Search in Google Scholar

[11] R. Bru, J. Marín, J. Mas, and M. Tůma. Preconditioned iterative methods for solving linear least squares problems. SIAM J. Sci. Comput., 36(4):A2002{A2022, 2014.10.1137/130931588Search in Google Scholar

[12] J. Cerdán, T. Faraj, N. Malla, J. Marín, and J Mas. Block approximate inverse preconditioners for sparse nonsymmetric linear systems. ETNA, 37:23-40, 2010.Search in Google Scholar

[13] E. Chow and Y. Saad. Approximate inverse preconditioners via sparsesparse iterations. SIAM J. Sci. Comput., 19(3):995-1023, 1998.10.1137/S1064827594270415Search in Google Scholar

[14] M. J. Grote and T. Huckle. Parallel preconditioning with sparse approximate inverses. SIAM J. Sci. Comput., 18(3):838{853, 1997.10.1137/S1064827594276552Search in Google Scholar

[15] I. E. Kaporin. High quality preconditioning of a general symmetric positive definite matrix based on its UTU + UTR + RTU decomposition. Numer. Linear Algebra Appl., 5:483-509, 1998.10.1002/(SICI)1099-1506(199811/12)5:6<483::AID-NLA156>3.0.CO;2-7Search in Google Scholar

[16] Y. Saad. ILUT: a dual threshold incomplete LU factorization. Numer. Linear Algebra Appl., 1(4):387-402, 1994.Search in Google Scholar

[17] Y. Saad. Iterative Methods for Sparse Linear Systems. PWS Publishing Co., Boston, 1996.Search in Google Scholar

[18] M. Tismenetsky. A new preconditioning technique for solving large sparse linear systems. Linear Algebra Appl., 154{156:331-353, 1991.10.1016/0024-3795(91)90383-8Search in Google Scholar

[19] X.Wang, K. A. Gallivan, and R. Bramley. CIMGS: an incomplete orthogonal factorization preconditioner. SIAM J. Sci. Comput., 18(2):516-536, 1997.Search in Google Scholar