Row Modifications of a Sparse Cholesky Factorization

Given a sparse, symmetric positive definite matrix C and an associated sparse Cholesky factorization LDL , we develop sparse techniques for updating the factorization after a symmetric modification of a row and column of C. We show how the modification in the Cholesky factorization associated with this rank two modification of C can be computed e#ciently using a sparse rank one technique developed in an earlier paper [SIAM J. Matrix Anal. Appl., 20 (1999), pp. 606-627]. We also determine how the solution of a linear system Lx = b changes after changing a row and column of C or after a rank-r change in C