Answers are grounded in this paper and cite their sources.
Several efficient methods are given for updating the Cholesky factors of a symmetric positive definite matrix when it is modified by a rank-two correction which maintains symmetry and positive definiteness. These ideas are applied to variable metric (quasi-Newton) methods to produce numerically stable algorithms.
No takes yet. Share an insight, caveat, or question.
Donald Goldfarb (1976) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: