<div dir="ltr"><div class="gmail_quote"><div dir="ltr">On Fri, Jul 6, 2018 at 11:44 AM Lawrence Mitchell <<a href="mailto:lawrence.mitchell@imperial.ac.uk">lawrence.mitchell@imperial.ac.uk</a>> wrote:<br></div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><br>
> On 6 Jul 2018, at 17:30, zakaryah <<a href="mailto:zakaryah@gmail.com" target="_blank">zakaryah@gmail.com</a>> wrote:<br>
> <br>
> Thanks for your help, Barry.<br>
> <br>
> I agree about the preconditioning. I still don't understand why I don't need a particular solver for my shell matrix. My reasoning is that KSP is easy with M but difficult with A, since A has a dense row and column, whereas M is entirely sparse. Sherman-Morrison seems to be an efficient way of dealing with this but I could be wrong.<br>
<br>
As Barry says, low-rank perturbations are not terrible for the convergence of Krylov methods. E.g. <br>
<br>
Theorem 2.1 of <a href="https://arxiv.org/pdf/1508.07633.pdf" rel="noreferrer" target="_blank">https://arxiv.org/pdf/1508.07633.pdf</a></blockquote><div><br></div><div>While I agree with you guys that Krylov methods will probably work fine, my understanding of Strakos' results</div><div>are that theorems of this kind crumble under rounding error perturbations. Maybe Patrick has a rejoinder for this.</div><div><br></div><div> Thanks,</div><div><br></div><div> Matt</div><div> </div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><br>
and a refinement in <a href="https://arxiv.org/pdf/1612.08369.pdf" rel="noreferrer" target="_blank">https://arxiv.org/pdf/1612.08369.pdf</a> with improved bounds.<br>
<br>
Cheers,<br>
<br>
Lawrence</blockquote></div><br clear="all"><div><br></div>-- <br><div dir="ltr" class="gmail_signature" data-smartmail="gmail_signature"><div dir="ltr"><div><div dir="ltr"><div>What most experimenters take for granted before they begin their experiments is infinitely more interesting than any results to which their experiments lead.<br>-- Norbert Wiener</div><div><br></div><div><a href="http://www.caam.rice.edu/~mk51/" target="_blank">https://www.cse.buffalo.edu/~knepley/</a><br></div></div></div></div></div></div>