<div class="gmail_quote">On Fri, Dec 10, 2010 at 22:15, Luke Bloy <span dir="ltr"><<a href="mailto:luke.bloy@gmail.com">luke.bloy@gmail.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
My problem is that i have a large number (~500,000) of b vectors that I would like to find solutions for. My plan is to call KSPsolve repeatedly with each b. However I wonder if there are any solvers or approaches that might benefit from the fact that my A matrix does not change. Are there any decompositions that might still be sparse that would offer a speed up?</blockquote>
</div><br><div>1. What is the high-level problem you are trying to solve? There might be a better way.</div><div><br></div><div>2. If you can afford the memory, a direct solve probably makes sense.</div>