<div dir="ltr"><div>Thanks, Barry.<br><br></div>Fande,<br></div><div class="gmail_extra"><br><div class="gmail_quote">On Wed, Mar 8, 2017 at 3:55 PM, Barry Smith <span dir="ltr"><<a href="mailto:bsmith@mcs.anl.gov" target="_blank">bsmith@mcs.anl.gov</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><br>
A proposed fix <a href="https://urldefense.proofpoint.com/v2/url?u=https-3A__bitbucket.org_petsc_petsc_pull-2Drequests_645_do-2Dnot-2Dassume-2Dthat-2Dall-2Dksp-2Dmethods-2Dsupport&d=DQIFAg&c=54IZrppPQZKX9mLzcGdPfFD1hxrcB__aEkJFOKJFd00&r=DUUt3SRGI0_JgtNaS3udV68GRkgV4ts7XKfj2opmiCY&m=RbF_pG6G05IcrxiELCCV36C6Cb_GqQZ7H84RH1hRQik&s=p1nuatzGn2KrF98argO7-qTt4U64Rzny3KoN-IJLOv4&e=" rel="noreferrer" target="_blank">https://urldefense.proofpoint.<wbr>com/v2/url?u=https-3A__<wbr>bitbucket.org_petsc_petsc_<wbr>pull-2Drequests_645_do-2Dnot-<wbr>2Dassume-2Dthat-2Dall-2Dksp-<wbr>2Dmethods-2Dsupport&d=DQIFAg&<wbr>c=<wbr>54IZrppPQZKX9mLzcGdPfFD1hxrcB_<wbr>_aEkJFOKJFd00&r=DUUt3SRGI0_<wbr>JgtNaS3udV68GRkgV4ts7XKfj2opmi<wbr>CY&m=RbF_<wbr>pG6G05IcrxiELCCV36C6Cb_<wbr>GqQZ7H84RH1hRQik&s=<wbr>p1nuatzGn2KrF98argO7-<wbr>qTt4U64Rzny3KoN-IJLOv4&e=</a><br>
<br>
Needs Jed's approval.<br>
<span class="HOEnZb"><font color="#888888"><br>
Barry<br>
</font></span><div class="HOEnZb"><div class="h5"><br>
<br>
<br>
> On Mar 8, 2017, at 10:33 AM, Barry Smith <<a href="mailto:bsmith@mcs.anl.gov">bsmith@mcs.anl.gov</a>> wrote:<br>
><br>
><br>
> Please tell us how you got this output.<br>
><br>
> PETSc CG doesn't even implement right preconditioning. If you ask for it it should error out. CG supports no norm computation with left preconditioning.<br>
><br>
> Barry<br>
><br>
>> On Mar 8, 2017, at 10:26 AM, Kong, Fande <<a href="mailto:fande.kong@inl.gov">fande.kong@inl.gov</a>> wrote:<br>
>><br>
>> Hi All,<br>
>><br>
>> The NONE norm type is supported only when CG is used with a right preconditioner. Any reason for this?<br>
>><br>
>><br>
>><br>
>> 0 Nonlinear |R| = 1.732051e+00<br>
>> 0 Linear |R| = 0.000000e+00<br>
>> 1 Linear |R| = 0.000000e+00<br>
>> 2 Linear |R| = 0.000000e+00<br>
>> 3 Linear |R| = 0.000000e+00<br>
>> 4 Linear |R| = 0.000000e+00<br>
>> 5 Linear |R| = 0.000000e+00<br>
>> 6 Linear |R| = 0.000000e+00<br>
>> 1 Nonlinear |R| = 1.769225e-08<br>
>> 0 Linear |R| = 0.000000e+00<br>
>> 1 Linear |R| = 0.000000e+00<br>
>> 2 Linear |R| = 0.000000e+00<br>
>> 3 Linear |R| = 0.000000e+00<br>
>> 4 Linear |R| = 0.000000e+00<br>
>> 5 Linear |R| = 0.000000e+00<br>
>> 6 Linear |R| = 0.000000e+00<br>
>> 7 Linear |R| = 0.000000e+00<br>
>> 8 Linear |R| = 0.000000e+00<br>
>> 9 Linear |R| = 0.000000e+00<br>
>> 10 Linear |R| = 0.000000e+00<br>
>> 2 Nonlinear |R| = 0.000000e+00<br>
>> SNES Object: 1 MPI processes<br>
>> type: newtonls<br>
>> maximum iterations=50, maximum function evaluations=10000<br>
>> tolerances: relative=1e-08, absolute=1e-50, solution=1e-50<br>
>> total number of linear solver iterations=18<br>
>> total number of function evaluations=23<br>
>> norm schedule ALWAYS<br>
>> SNESLineSearch Object: 1 MPI processes<br>
>> type: bt<br>
>> interpolation: cubic<br>
>> alpha=1.000000e-04<br>
>> maxstep=1.000000e+08, minlambda=1.000000e-12<br>
>> tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08<br>
>> maximum iterations=40<br>
>> KSP Object: 1 MPI processes<br>
>> type: cg<br>
>> maximum iterations=10000, initial guess is zero<br>
>> tolerances: relative=1e-05, absolute=1e-50, divergence=10000.<br>
>> right preconditioning<br>
>> using NONE norm type for convergence test<br>
>> PC Object: 1 MPI processes<br>
>> type: hypre<br>
>> HYPRE BoomerAMG preconditioning<br>
>> HYPRE BoomerAMG: Cycle type V<br>
>> HYPRE BoomerAMG: Maximum number of levels 25<br>
>> HYPRE BoomerAMG: Maximum number of iterations PER hypre call 1<br>
>> HYPRE BoomerAMG: Convergence tolerance PER hypre call 0.<br>
>> HYPRE BoomerAMG: Threshold for strong coupling 0.25<br>
>> HYPRE BoomerAMG: Interpolation truncation factor 0.<br>
>> HYPRE BoomerAMG: Interpolation: max elements per row 0<br>
>> HYPRE BoomerAMG: Number of levels of aggressive coarsening 0<br>
>> HYPRE BoomerAMG: Number of paths for aggressive coarsening 1<br>
>> HYPRE BoomerAMG: Maximum row sums 0.9<br>
>> HYPRE BoomerAMG: Sweeps down 1<br>
>> HYPRE BoomerAMG: Sweeps up 1<br>
>> HYPRE BoomerAMG: Sweeps on coarse 1<br>
>> HYPRE BoomerAMG: Relax down symmetric-SOR/Jacobi<br>
>> HYPRE BoomerAMG: Relax up symmetric-SOR/Jacobi<br>
>> HYPRE BoomerAMG: Relax on coarse Gaussian-elimination<br>
>> HYPRE BoomerAMG: Relax weight (all) 1.<br>
>> HYPRE BoomerAMG: Outer relax weight (all) 1.<br>
>> HYPRE BoomerAMG: Using CF-relaxation<br>
>> HYPRE BoomerAMG: Not using more complex smoothers.<br>
>> HYPRE BoomerAMG: Measure type local<br>
>> HYPRE BoomerAMG: Coarsen type Falgout<br>
>> HYPRE BoomerAMG: Interpolation type classical<br>
>> linear system matrix followed by preconditioner matrix:<br>
>> Mat Object: 1 MPI processes<br>
>> type: mffd<br>
>> rows=9, cols=9<br>
>> Matrix-free approximation:<br>
>> err=1.49012e-08 (relative error in function evaluation)<br>
>> Using wp compute h routine<br>
>> Does not compute normU<br>
>> Mat Object: () 1 MPI processes<br>
>> type: seqaij<br>
>> rows=9, cols=9<br>
>> total: nonzeros=49, allocated nonzeros=49<br>
>> total number of mallocs used during MatSetValues calls =0<br>
>> not using I-node routines<br>
>><br>
>> Fande,<br>
>><br>
><br>
<br>
</div></div></blockquote></div><br></div>