Elias Karabelas <[email protected]> writes: > I have a question about preconditioned solvers. So, I have a > Sparsematrix, say A, and now for some reason I would like to add some > rank-one term u v^T to that matrix.
You can use Sherman-Morrison/Woodbury, but it costs an extra preconditioner application and Krylov with the old preconditioner converges in one extra iteration, so it's a wash. You might prefer it for repeated solves though.
signature.asc
Description: PGP signature
