1 |
O. Axelsson, Iterative solution methods, Cambridge University Press, Cambridge, 1996.
|
2 |
M. Benzi, Preconditioning techniques for large linear systems: A survey, J. of Computational Physics 182 (2002), 418-477.
DOI
ScienceOn
|
3 |
M. Benzi and M. Tuma, A comparative study of sparse approximate inverse preconditioners, Appl. Numer. Math. 30 (1999), 305-340.
DOI
ScienceOn
|
4 |
M. Benzi and M. Tuma, A robust preconditioner with low memory requirements for large sparse least squares problems, SIAM J. Sci. Comput. 25 (2003), 499-512.
DOI
ScienceOn
|
5 |
M. Benzi and M. Tuma, A robust incomplete factorization preconditioner for positive definite matrices, Numer. Linear Algebra Appl. 10 (2003), 385-400.
DOI
ScienceOn
|
6 |
A. Bjorck, Numerical methods for least squares problems, SIAM, Philadelphia, 1996.
|
7 |
B. N. Datta, Numerical linear algebra and applications, Pacific Grove, CA: Brooks/Cole Publishing Company, 1995.
|
8 |
T. Davis, University of Florida Sparse Matrix Collection, http://www.cise.ufl.edu/-davis/sparse/, 2008.
|
9 |
A. Jennings and M. A. Ajiz, Incomplete methods for saving Ax = b, SIAM J. Sci. Stat. Comput. 5 (1984), 978-987.
DOI
|
10 |
National Institute of Standards, Matrix Market, http://math.nist.gov/MatrixMarket, 2008.
|
11 |
Y. Saad, Iterative Methods for Sparse linear Systems, PWS press, New York, 1995.
|
12 |
M. Tismenetsky, Anew preconditioning technique for solving large sparse linear systems, Linear Algebra Appl. 154/156 (1991), 331-353.
DOI
ScienceOn
|