This thesis is concerned with four approaches to preconditioning for large, sparse linear systems. Two procedures for computing the incomplete factorization of the inverse of nonsysmmetric and symmetric matrices are presented, and the resulting sparse approximated inverses are used as explicit preconditioners for CG and GMERS methods. Some theoretical properties of the preconditioners are discussed. Finally some numerical results are given.