## Abstract

An incomplete factorization method for preconditioning symmetric positive definite matrices is introduced to solve normal equations. The normal equations are form to solve linear least squares problems. The procedure is based on a block incomplete Cholesky factorization and a multilevel recursive strategy with an approximate Schur complement matrix formed implicitly. A diagonal perturbation strategy is implemented to enhance factorization robustness. The factors obtained are used as a preconditioner for the conjugate gradient method. Numerical experiments are used to show the robustness and efficiency of this preconditioning technique, and to compare it with two other preconditioners.

Original language | English |
---|---|

Pages (from-to) | 59-80 |

Number of pages | 22 |

Journal | Journal of Applied Mathematics and Computing |

Volume | 11 |

Issue number | 1-2 |

DOIs | |

State | Published - Jan 2003 |

## Keywords

- Conjugate gradient
- Incomplete Cholesky factorization
- Multilevel IC preconditioner
- Normal equation

## ASJC Scopus subject areas

- Computational Mathematics
- Applied Mathematics