[petsc-users] optimizing repeated calls to KSPsolve?

[Jed Brown]

On Fri, Dec 10, 2010 at 22:15, Luke Bloy <luke.bloy at gmail.com> wrote:

> 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?


1. What is the high-level problem you are trying to solve?  There might be a
better way.

2. If you can afford the memory, a direct solve probably makes sense.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.mcs.anl.gov/pipermail/petsc-users/attachments/20101210/bd11fe4e/attachment.htm>