1KSP Object: 1 MPI process 2 type: gmres 3 restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 4 happy breakdown tolerance=1e-30 5 maximum iterations=10000, initial guess is zero 6 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 7 left preconditioning 8 using PRECONDITIONED norm type for convergence test 9PC Object: 1 MPI process 10 type: asm 11 total subdomain blocks = 1, amount of overlap = 1 12 restriction/interpolation type - RESTRICT 13 Local solver information for first block is in the following KSP and PC objects on rank 0: 14 Use -ksp_view ::ascii_info_detail to display information for all blocks 15 KSP Object: (sub_) 1 MPI process 16 type: preonly 17 maximum iterations=10000, initial guess is zero 18 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 19 left preconditioning 20 not checking for convergence 21 PC Object: (sub_) 1 MPI process 22 type: ilu 23 out-of-place factorization 24 0 levels of fill 25 tolerance for zero pivot 2.22045e-14 26 matrix ordering: natural 27 factor fill ratio given 1., needed 1. 28 Factored matrix: 29 Mat Object: (sub_) 1 MPI process 30 type: seqaijcusparse 31 rows=64, cols=64 32 package used to perform factorization: cusparse 33 total: nonzeros=288, allocated nonzeros=288 34 not using I-node routines 35 linear system matrix, which is also used to construct the preconditioner: 36 Mat Object: (sub_) 1 MPI process 37 type: seqaijcusparse 38 rows=64, cols=64 39 total: nonzeros=288, allocated nonzeros=288 40 total number of mallocs used during MatSetValues calls=0 41 not using I-node routines 42 linear system matrix, which is also used to construct the preconditioner: 43 Mat Object: 1 MPI process 44 type: seqaijcusparse 45 rows=64, cols=64 46 total: nonzeros=288, allocated nonzeros=288 47 total number of mallocs used during MatSetValues calls=0 48 not using I-node routines 49Infinity norm of the error: 1.30446e-06 50