We analyse and compare three algorithms for “downdating” the Cholesky factorization of a positive definite matrix. Although the algorithms are closely related, their numerical properties differ. Two algorithms are stable in a certain “mixed” sense while the other is unstable. In addition to comparing the numerical properties of the algorithms, we compare their computational complexity and their suitability for implementation on parallel or vector computers.
No takes yet. Share an insight, caveat, or question.
Bojańczyk et al. (1987) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: