[petsc-users] Profile a matrix-free solver.

[Zou (Non-US), Ling]

Hi Song, I wonder if you have a reference paper on the preconditioning
algorithm you are working on, i.e., using the 1st order flux for
preconditioning purpose when your 'true' fluxes are evaluated using the 2nd
order AUSM scheme.

Best,

Ling

On Fri, Jan 15, 2016 at 1:34 PM, Song Gao <song.gao2 at mail.mcgill.ca> wrote:

> Thanks. I'll try to improve "my code"
>
> 2016-01-15 14:56 GMT-05:00 Jed Brown <jed at jedbrown.org>:
>
>> Matthew Knepley <knepley at gmail.com> writes:
>> > The way I read this, you are taking about 23 iterates/solve, and most of
>> > your work is residual computation which should
>> > be highly parallelizable/vectorizable. This seems great to me.
>>
>> This in the sense that it's up to you to determine whether your
>> matrix-free residual and preconditioning code is fast.  This profile
>> merely says that almost all of the run-time is in *your code*.  If your
>> code is fast, then this is good performance.  If you can use a different
>> algorithm to converge in fewer iterations, or a different representation
>> to apply the operator faster, then you could do better.
>>
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.mcs.anl.gov/pipermail/petsc-users/attachments/20160115/1bb7b5c7/attachment-0001.html>