A multilevel block incomplete Cholesky preconditioner for solving normal equations in linear least squares problems

Jun Zhang, Tong Xiao

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

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 languageEnglish
Pages (from-to)59-80
Number of pages22
JournalJournal of Applied Mathematics and Computing
Volume11
Issue number1-2
DOIs
StatePublished - Jan 2003

Keywords

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

ASJC Scopus subject areas

  • Computational Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'A multilevel block incomplete Cholesky preconditioner for solving normal equations in linear least squares problems'. Together they form a unique fingerprint.

Cite this