On Thu, May 17, 2012 at 1:47 PM, Zhenglun (Alan) Wei <span dir="ltr"><<a href="mailto:zhenglun.wei@gmail.com" target="_blank">zhenglun.wei@gmail.com</a>></span> wrote:<br><div class="gmail_quote"><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
Dear All,<br>
I hope you're having a nice day.<br>
I was trying to solve the Poisson equation with /src/ksp/ksp/exmaples/<u></u>tutorial/ex45.c; however, it always give me the same result. I recalled the PetscLogStages and resolved this problem. However, the process of reconstructing DM costs a lot of computational time. I wonder do I have to use PetscLogStages to solve this problem, since, I thought, this function is only needed for using DMMG. Or as long as DM twice in one program, then I need to call PetscLogStages.<br>
</blockquote><div><br></div><div>I cannot understand what you mean. PetscLog functions only affect logging.</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">
thanks,<br>
Alan<br>
</blockquote></div><br><br clear="all"><div><br></div>-- <br>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<br>