<div class="gmail_quote">On Mon, May 9, 2011 at 18:29, Danesh Daroui <span dir="ltr"><<a href="mailto:danesh.daroui@ltu.se">danesh.daroui@ltu.se</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
<div id=":3cp">No I didn't put "no-debugging" when I compiled. I will re-compile it. I<br>
am solving a set of Maxwell equations in integral form. I know that my<br>
coefficient matrix has a large condition number too. Would you please<br>
explain more about "-ksp_view" and "-log_summary"?</div></blockquote><div><br></div><div><div>Just run your code with these options. They are put in a database by PetscInitialize() and used by the solver when you called KSPSetFromOptions().</div>
</div><div> </div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;"><div id=":3cp"> How can I use these<br>
options? I think the problem is deeper than some sort of compilation<br>
flags. Can I get number of iterations and know whether the solution has<br>
converged or not?</div></blockquote><div><br></div><div>Yes, both in code and on the command line. Run with -help for full options and references to the API. -ksp_monitor -ksp_converged_reason will be a good start.</div>
<div> </div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;"><div id=":3cp"> In my case, the slow convergence can be due to badly<br>
conditioned matrices. I expected to use default preconditioner which<br>
should ILU I guess.</div></blockquote></div><br><div>Yeah, -ksp_view will show the configuration for the solver. ILU may not work well for your problem.</div>