optimizers/cpkrylov

cpcglanczos_zero?

Closed this issue · 5 comments

dpo commented

cpcglanczos_zero takes B as input to compute u. Does it have an advantage? No other method takes B as input.

diserafi commented

CP-Krylov solvers are formally equivalent to standard Krylov solvers with constraint preconditioners, provided that the starting guess satisfies exactly the second block of equations in the saddle-point system. According to this, I developed an implementation of standard CG-Lanczos for saddle-point systems (cpcglanczos_zero), where Bvk + Cqk is never computed because it is zero. This was done only for comparison purposes.

dpo commented

Ok. I propose that we remove this file from the repository or users may be confused. I can move it to a branch or remove it altogether. What do you prefer?

diserafi commented

Please, move it to a branch.

dpo commented

See #6. The alternative-implementations branch still contains cpcglanczos_zero.m.

diserafi commented

OK. Thanks.