<html><head><meta http-equiv="Content-Type" content="text/html; charset=us-ascii"></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class=""><br class=""><div>Hi,</div><div><br class=""></div><div><div>I tried to follow Matthew's suggestion by dividing the system in the complex field into two systems in the real numbers field. In practice I used three subspaces of Krylov, one for the first system in the real number field and two for the system in the complex number field. Using real numbers, I was able to use the ML and Hypre preconditioners again.</div><div>I have performed the following tests using the following default options and using the PETSc version configured with "--with-scalar-type=real (default value)":</div><div><br class=""></div><div>(1) -pc_type gamg -pc_gamg_agg_nsmooths 1 -pc_gamg_reuse_interpolation true -pc_gamg_square_graph 1 -pc_gamg_threshold 0. -ksp_rtol 1.e-7</div><div>(2) -ksp_type preonly -pc_type lu -pc_factor_mat_solver_type mumps</div><div>(3) -ksp_type preonly -pc_type lu -pc_factor_mat_solver_type superlu_dist</div><div>4) -pc_type ml -ksp_monitor -ksp_rtol 1.e-7</div><div>(5) -pc_type hypre -ksp_rtol 1.e-7</div><div><br class=""></div><div>All methods resolve both systems correctly, but iterative methods (1,4,5) are faster. Among iterative methods using Hypre or ML PCs, I get better performance (solve time) than GAMG. </div><div><br class=""></div><div>Previously configuring PETSc with --with-scalar-type=complex I had only been able to perform the tests (1,2,3) and in that case the resolution times were roughly the same and comparable to the resolution time of case 1) when using only real numbers.</div><div><br class=""></div><div>Finally, I have a question. In my simulation I solve the two systems at each step of the calculation, and it was my habit to use the following option after the first resolution and before solving the system in the second time step:</div><div><br class=""></div><div>call KSPSetInitialGuessNonzero(ksp,PETSC_TRUE,ierr)</div><div><br class=""></div><div>Since this option was incompatible with the use of MUMPS or SuperLU_Dist, I commented on it and noticed, to my surprise, that iterative methods were not affected by this comment, rather they were slightly faster. Is this normal? Or do I use this command incorrectly?</div><div><br class=""></div><div>Thanks</div><div><br class=""></div><div>Pierpaolo</div></div><div><br class=""><blockquote type="cite" class=""><div class="">Il giorno 23 lug 2018, alle ore 15:43, Mark Adams <<a href="mailto:mfadams@lbl.gov" class="">mfadams@lbl.gov</a>> ha scritto:</div><br class="Apple-interchange-newline"><div class=""><div dir="ltr" class="">Note, as Barry said, GAMG works with native complex numbers. You can start with your original complex build and use '-pc_type gamg'.<div class="">Mark</div></div><br class=""><div class="gmail_quote"><div dir="ltr" class="">On Mon, Jul 23, 2018 at 6:52 AM Pierpaolo Minelli <<a href="mailto:pierpaolo.minelli@cnr.it" class="">pierpaolo.minelli@cnr.it</a>> wrote:<br class=""></div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><br class="">
<br class="">
> Il giorno 20 lug 2018, alle ore 19:58, Smith, Barry F. <<a href="mailto:bsmith@mcs.anl.gov" target="_blank" class="">bsmith@mcs.anl.gov</a>> ha scritto:<br class="">
> <br class="">
> <br class="">
> <br class="">
>> On Jul 20, 2018, at 7:01 AM, Pierpaolo Minelli <<a href="mailto:pierpaolo.minelli@cnr.it" target="_blank" class="">pierpaolo.minelli@cnr.it</a>> wrote:<br class="">
>> <br class="">
>> Hi,<br class="">
>> <br class="">
>> in my code I have to solve both a system in the field of real numbers and in the field of complex numbers.<br class="">
>> My approach has been as follows.<br class="">
>> First I configured PETSc with the --with-scalar-type=complex option.<br class="">
>> Using this option I have unfortunately lost the possibility to use the two preconditioners ML and Hypre.<br class="">
> <br class="">
> You should still be able to use the PETSc PCGAMG algebraic multigrid solver. Have you tried that? If there are issues let us know because we would like to continue to improve the performance of PCGAMG to get it to be closer to as good as ML and hypre.<br class="">
> <br class="">
> Barry<br class="">
> <br class="">
<br class="">
I will try to convert, as suggested by Matthew, my complex system in a system twice as large in real numbers. When i finish, i will try to use ML, Hypre and GAMG and i let you know if there are any performance differences.<br class="">
<br class="">
Thanks<br class="">
<br class="">
Pierpaolo<br class="">
<br class="">
<br class="">
>> I later created two subspaces of Krylov and tried to solve the two systems as I used to when solving the only equation in the real numbers field.<br class="">
>> In order to correctly solve the system in the field of real numbers I had to transform the coefficients from real to complex with an imaginary part equal to zero.<br class="">
>> <br class="">
>> Is there a possibility to use a different and better approach to solve my problem?<br class="">
>> <br class="">
>> Perhaps an approach where you can continue to use ML and Hypre for system solving in the real numbers field or where you don't need to use complex numbers when real numbers would actually suffice?<br class="">
>> <br class="">
>> Thanks in advance<br class="">
>> <br class="">
>> Pierpaolo<br class="">
>> <br class="">
> <br class="">
<br class="">
</blockquote></div>
</div></blockquote></div><br class=""></body></html>