[petsc-users] Rectangular matrices turned into square?
Adam Denchfield
adenchfi at hawk.iit.edu
Wed Jul 12 14:55:13 CDT 2017
Hi,
Below I've attached the text file with my ksp_view. It's a time-dependent
problem so I included ten time-steps. The information doesn't seem to be
much different in the multiple time steps.
______________
Regards,
*Adam Denchfield*
*Peer Career Coach - Career Services*
Illinois Institute of Technology
*Bachelors of Science in Applied Physics (2018)*
Email: adenchfi at hawk.iit.edu
My LinkedIn <http://www.linkedin.com/in/adamrobertdenchfield> My
ResearchGate Profile <https://www.researchgate.net/profile/Adam_Denchfield>
On Wed, Jul 12, 2017 at 2:48 PM, Barry Smith <bsmith at mcs.anl.gov> wrote:
>
> Adam,
>
> Please send the output from KSP view. We don't "change" the matrix but
> we might have some intermediate matrix of that other side, or it could be a
> bug in our output.
>
> Barry
>
> > On Jul 12, 2017, at 2:45 PM, Adam Denchfield <adenchfi at hawk.iit.edu>
> wrote:
> >
> > Hi,
> >
> > I'm using the FEniCS package, which uses DOLFIN/petsc4py (and thus
> petsc). If I'm understanding the libraries right, I'm assembling
> rectangular matrices and sending them to be solved in a KrylovSolver.
> However, with -ksp_view, I'm seeing 2112x2112 matrices, not 1062x2112
> matrices. Does PETSc do conversions like this automatically during
> preconditioning or something? Trying to identify if this would be a
> behaviour on PETSc's part.
> >
> > Regards,
> > Adam Denchfield
> > Peer Career Coach - Career Services
> > Illinois Institute of Technology
> > Bachelors of Science in Applied Physics (2018)
> > Email: adenchfi at hawk.iit.edu
> > My LinkedIn My ResearchGate Profile
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.mcs.anl.gov/pipermail/petsc-users/attachments/20170712/9ea4d899/attachment-0001.html>
-------------- next part --------------
KSP Object: 2 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: 2 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 2 MPI processes
type: mpiaij
rows=1056, cols=1056
package used to perform factorization: mumps
total: nonzeros=51008, allocated nonzeros=51008
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -8
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 932479.
[1] 869485.
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 34069.
[1] 32553.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 932479.
[1] 869485.
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 1
[1] 1
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 1
[1] 1
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 544
[1] 512
RINFOG(1) (global estimated flops for the elimination after analysis): 1.80196e+06
RINFOG(2) (global estimated flops for the assembly after factorization): 66622.
RINFOG(3) (global estimated flops for the elimination after factorization): 1.80196e+06
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 51008
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 12612
INFOG(5) (estimated maximum front size in the complete tree): 73
INFOG(6) (number of nodes in the complete tree): 277
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 51008
INFOG(10) (total integer space store the matrix factors after factorization): 12612
INFOG(11) (order of largest frontal matrix after factorization): 73
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 1
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 2
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 1
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 2
INFOG(20) (estimated number of entries in the factors): 51008
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 1
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 2
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 51008
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 0, 0
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=1056, cols=1056
total: nonzeros=7264, allocated nonzeros=7264
total number of mallocs used during MatSetValues calls =0
not using I-node (on process 0) routines
KSP Object: 2 MPI processes
type: bcgs
maximum iterations=10000000
tolerances: relative=3e-15, absolute=3e-15, divergence=10000.
left preconditioning
using nonzero initial guess
using PRECONDITIONED norm type for convergence test
PC Object: 2 MPI processes
type: hypre
HYPRE BoomerAMG preconditioning
HYPRE BoomerAMG: Cycle type V
HYPRE BoomerAMG: Maximum number of levels 25
HYPRE BoomerAMG: Maximum number of iterations PER hypre call 1
HYPRE BoomerAMG: Convergence tolerance PER hypre call 0.
HYPRE BoomerAMG: Threshold for strong coupling 0.25
HYPRE BoomerAMG: Interpolation truncation factor 0.
HYPRE BoomerAMG: Interpolation: max elements per row 0
HYPRE BoomerAMG: Number of levels of aggressive coarsening 0
HYPRE BoomerAMG: Number of paths for aggressive coarsening 1
HYPRE BoomerAMG: Maximum row sums 0.9
HYPRE BoomerAMG: Sweeps down 1
HYPRE BoomerAMG: Sweeps up 1
HYPRE BoomerAMG: Sweeps on coarse 1
HYPRE BoomerAMG: Relax down symmetric-SOR/Jacobi
HYPRE BoomerAMG: Relax up symmetric-SOR/Jacobi
HYPRE BoomerAMG: Relax on coarse Gaussian-elimination
HYPRE BoomerAMG: Relax weight (all) 1.
HYPRE BoomerAMG: Outer relax weight (all) 1.
HYPRE BoomerAMG: Using CF-relaxation
HYPRE BoomerAMG: Not using more complex smoothers.
HYPRE BoomerAMG: Measure type local
HYPRE BoomerAMG: Coarsen type Falgout
HYPRE BoomerAMG: Interpolation type classical
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=2112, cols=2112, bs=2
total: nonzeros=29056, allocated nonzeros=29056
total number of mallocs used during MatSetValues calls =0
using I-node (on process 0) routines: found 531 nodes, limit used is 5
KSP Object: 2 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: 2 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 2 MPI processes
type: mpiaij
rows=4160, cols=4160
package used to perform factorization: mumps
total: nonzeros=308450, allocated nonzeros=308450
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -8
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 8.38453e+06
[1] 1.25452e+07
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 182266.
[1] 301283.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 8.38453e+06
[1] 1.25452e+07
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 6
[1] 7
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 6
[1] 7
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 1736
[1] 2424
RINFOG(1) (global estimated flops for the elimination after analysis): 2.09297e+07
RINFOG(2) (global estimated flops for the assembly after factorization): 483549.
RINFOG(3) (global estimated flops for the elimination after factorization): 2.09297e+07
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 308450
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 49482
INFOG(5) (estimated maximum front size in the complete tree): 167
INFOG(6) (number of nodes in the complete tree): 881
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 308450
INFOG(10) (total integer space store the matrix factors after factorization): 49482
INFOG(11) (order of largest frontal matrix after factorization): 167
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 7
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 13
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 7
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 13
INFOG(20) (estimated number of entries in the factors): 308450
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 6
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 12
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 308450
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 2, 4
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=4160, cols=4160
total: nonzeros=47360, allocated nonzeros=47360
total number of mallocs used during MatSetValues calls =0
not using I-node (on process 0) routines
KSP Object: 2 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: 2 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 2 MPI processes
type: mpiaij
rows=1056, cols=1056
package used to perform factorization: mumps
total: nonzeros=51008, allocated nonzeros=51008
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -8
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 932479.
[1] 869485.
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 34069.
[1] 32553.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 932479.
[1] 869485.
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 1
[1] 1
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 1
[1] 1
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 544
[1] 512
RINFOG(1) (global estimated flops for the elimination after analysis): 1.80196e+06
RINFOG(2) (global estimated flops for the assembly after factorization): 66622.
RINFOG(3) (global estimated flops for the elimination after factorization): 1.80196e+06
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 51008
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 12612
INFOG(5) (estimated maximum front size in the complete tree): 73
INFOG(6) (number of nodes in the complete tree): 277
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 51008
INFOG(10) (total integer space store the matrix factors after factorization): 12612
INFOG(11) (order of largest frontal matrix after factorization): 73
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 1
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 2
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 1
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 2
INFOG(20) (estimated number of entries in the factors): 51008
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 1
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 2
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 51008
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 0, 0
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=1056, cols=1056
total: nonzeros=7264, allocated nonzeros=7264
total number of mallocs used during MatSetValues calls =0
not using I-node (on process 0) routines
TC = 0.50000
TC = 0.50000
KSP Object: 2 MPI processes
type: bcgs
maximum iterations=10000000
tolerances: relative=3e-15, absolute=3e-15, divergence=10000.
left preconditioning
using nonzero initial guess
using PRECONDITIONED norm type for convergence test
PC Object: 2 MPI processes
type: hypre
HYPRE BoomerAMG preconditioning
HYPRE BoomerAMG: Cycle type V
HYPRE BoomerAMG: Maximum number of levels 25
HYPRE BoomerAMG: Maximum number of iterations PER hypre call 1
HYPRE BoomerAMG: Convergence tolerance PER hypre call 0.
HYPRE BoomerAMG: Threshold for strong coupling 0.25
HYPRE BoomerAMG: Interpolation truncation factor 0.
HYPRE BoomerAMG: Interpolation: max elements per row 0
HYPRE BoomerAMG: Number of levels of aggressive coarsening 0
HYPRE BoomerAMG: Number of paths for aggressive coarsening 1
HYPRE BoomerAMG: Maximum row sums 0.9
HYPRE BoomerAMG: Sweeps down 1
HYPRE BoomerAMG: Sweeps up 1
HYPRE BoomerAMG: Sweeps on coarse 1
HYPRE BoomerAMG: Relax down symmetric-SOR/Jacobi
HYPRE BoomerAMG: Relax up symmetric-SOR/Jacobi
HYPRE BoomerAMG: Relax on coarse Gaussian-elimination
HYPRE BoomerAMG: Relax weight (all) 1.
HYPRE BoomerAMG: Outer relax weight (all) 1.
HYPRE BoomerAMG: Using CF-relaxation
HYPRE BoomerAMG: Not using more complex smoothers.
HYPRE BoomerAMG: Measure type local
HYPRE BoomerAMG: Coarsen type Falgout
HYPRE BoomerAMG: Interpolation type classical
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=2112, cols=2112, bs=2
total: nonzeros=29056, allocated nonzeros=29056
total number of mallocs used during MatSetValues calls =0
using I-node (on process 0) routines: found 531 nodes, limit used is 5
KSP Object: 2 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: 2 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 2 MPI processes
type: mpiaij
rows=4160, cols=4160
package used to perform factorization: mumps
total: nonzeros=308450, allocated nonzeros=308450
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -8
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 8.38453e+06
[1] 1.25452e+07
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 182266.
[1] 301283.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 8.38453e+06
[1] 1.25452e+07
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 6
[1] 7
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 6
[1] 7
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 1736
[1] 2424
RINFOG(1) (global estimated flops for the elimination after analysis): 2.09297e+07
RINFOG(2) (global estimated flops for the assembly after factorization): 483549.
RINFOG(3) (global estimated flops for the elimination after factorization): 2.09297e+07
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 308450
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 49482
INFOG(5) (estimated maximum front size in the complete tree): 167
INFOG(6) (number of nodes in the complete tree): 881
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 308450
INFOG(10) (total integer space store the matrix factors after factorization): 49482
INFOG(11) (order of largest frontal matrix after factorization): 167
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 7
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 13
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 7
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 13
INFOG(20) (estimated number of entries in the factors): 308450
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 6
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 12
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 308450
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 2, 4
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=4160, cols=4160
total: nonzeros=47360, allocated nonzeros=47360
total number of mallocs used during MatSetValues calls =0
not using I-node (on process 0) routines
KSP Object: 2 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: 2 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 2 MPI processes
type: mpiaij
rows=1056, cols=1056
package used to perform factorization: mumps
total: nonzeros=51008, allocated nonzeros=51008
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -8
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 932479.
[1] 869485.
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 34069.
[1] 32553.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 932479.
[1] 869485.
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 1
[1] 1
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 1
[1] 1
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 544
[1] 512
RINFOG(1) (global estimated flops for the elimination after analysis): 1.80196e+06
RINFOG(2) (global estimated flops for the assembly after factorization): 66622.
RINFOG(3) (global estimated flops for the elimination after factorization): 1.80196e+06
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 51008
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 12612
INFOG(5) (estimated maximum front size in the complete tree): 73
INFOG(6) (number of nodes in the complete tree): 277
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 51008
INFOG(10) (total integer space store the matrix factors after factorization): 12612
INFOG(11) (order of largest frontal matrix after factorization): 73
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 1
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 2
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 1
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 2
INFOG(20) (estimated number of entries in the factors): 51008
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 1
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 2
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 51008
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 0, 0
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=1056, cols=1056
total: nonzeros=7264, allocated nonzeros=7264
total number of mallocs used during MatSetValues calls =0
not using I-node (on process 0) routine
TC = 1.00000
TC = 1.00000
KSP Object: 2 MPI processes
type: bcgs
maximum iterations=10000000
tolerances: relative=3e-15, absolute=3e-15, divergence=10000.
left preconditioning
using nonzero initial guess
using PRECONDITIONED norm type for convergence test
PC Object: 2 MPI processes
type: hypre
HYPRE BoomerAMG preconditioning
HYPRE BoomerAMG: Cycle type V
HYPRE BoomerAMG: Maximum number of levels 25
HYPRE BoomerAMG: Maximum number of iterations PER hypre call 1
HYPRE BoomerAMG: Convergence tolerance PER hypre call 0.
HYPRE BoomerAMG: Threshold for strong coupling 0.25
HYPRE BoomerAMG: Interpolation truncation factor 0.
HYPRE BoomerAMG: Interpolation: max elements per row 0
HYPRE BoomerAMG: Number of levels of aggressive coarsening 0
HYPRE BoomerAMG: Number of paths for aggressive coarsening 1
HYPRE BoomerAMG: Maximum row sums 0.9
HYPRE BoomerAMG: Sweeps down 1
HYPRE BoomerAMG: Sweeps up 1
HYPRE BoomerAMG: Sweeps on coarse 1
HYPRE BoomerAMG: Relax down symmetric-SOR/Jacobi
HYPRE BoomerAMG: Relax up symmetric-SOR/Jacobi
HYPRE BoomerAMG: Relax on coarse Gaussian-elimination
HYPRE BoomerAMG: Relax weight (all) 1.
HYPRE BoomerAMG: Outer relax weight (all) 1.
HYPRE BoomerAMG: Using CF-relaxation
HYPRE BoomerAMG: Not using more complex smoothers.
HYPRE BoomerAMG: Measure type local
HYPRE BoomerAMG: Coarsen type Falgout
HYPRE BoomerAMG: Interpolation type classical
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=2112, cols=2112, bs=2
total: nonzeros=29056, allocated nonzeros=29056
total number of mallocs used during MatSetValues calls =0
using I-node (on process 0) routines: found 531 nodes, limit used is 5
KSP Object: 2 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: 2 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 2 MPI processes
type: mpiaij
rows=4160, cols=4160
package used to perform factorization: mumps
total: nonzeros=308450, allocated nonzeros=308450
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -8
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 8.38453e+06
[1] 1.25452e+07
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 182266.
[1] 301283.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 8.38453e+06
[1] 1.25452e+07
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 6
[1] 7
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 6
[1] 7
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 1736
[1] 2424
RINFOG(1) (global estimated flops for the elimination after analysis): 2.09297e+07
RINFOG(2) (global estimated flops for the assembly after factorization): 483549.
RINFOG(3) (global estimated flops for the elimination after factorization): 2.09297e+07
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 308450
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 49482
INFOG(5) (estimated maximum front size in the complete tree): 167
INFOG(6) (number of nodes in the complete tree): 881
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 308450
INFOG(10) (total integer space store the matrix factors after factorization): 49482
INFOG(11) (order of largest frontal matrix after factorization): 167
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 7
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 13
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 7
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 13
INFOG(20) (estimated number of entries in the factors): 308450
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 6
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 12
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 308450
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 2, 4
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=4160, cols=4160
total: nonzeros=47360, allocated nonzeros=47360
total number of mallocs used during MatSetValues calls =0
not using I-node (on process 0) routines
KSP Object: 2 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: 2 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 2 MPI processes
type: mpiaij
rows=1056, cols=1056
package used to perform factorization: mumps
total: nonzeros=51008, allocated nonzeros=51008
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -8
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 932479.
[1] 869485.
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 34069.
[1] 32553.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 932479.
[1] 869485.
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 1
[1] 1
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 1
[1] 1
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 544
[1] 512
RINFOG(1) (global estimated flops for the elimination after analysis): 1.80196e+06
RINFOG(2) (global estimated flops for the assembly after factorization): 66622.
RINFOG(3) (global estimated flops for the elimination after factorization): 1.80196e+06
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 51008
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 12612
INFOG(5) (estimated maximum front size in the complete tree): 73
INFOG(6) (number of nodes in the complete tree): 277
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 51008
INFOG(10) (total integer space store the matrix factors after factorization): 12612
INFOG(11) (order of largest frontal matrix after factorization): 73
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 1
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 2
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 1
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 2
INFOG(20) (estimated number of entries in the factors): 51008
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 1
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 2
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 51008
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 0, 0
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=1056, cols=1056
total: nonzeros=7264, allocated nonzeros=7264
total number of mallocs used during MatSetValues calls =0
not using I-node (on process 0) routines
TC = 1.50000
TC = 1.50000
KSP Object: 2 MPI processes
type: bcgs
maximum iterations=10000000
tolerances: relative=3e-15, absolute=3e-15, divergence=10000.
left preconditioning
using nonzero initial guess
using PRECONDITIONED norm type for convergence test
PC Object: 2 MPI processes
type: hypre
HYPRE BoomerAMG preconditioning
HYPRE BoomerAMG: Cycle type V
HYPRE BoomerAMG: Maximum number of levels 25
HYPRE BoomerAMG: Maximum number of iterations PER hypre call 1
HYPRE BoomerAMG: Convergence tolerance PER hypre call 0.
HYPRE BoomerAMG: Threshold for strong coupling 0.25
HYPRE BoomerAMG: Interpolation truncation factor 0.
HYPRE BoomerAMG: Interpolation: max elements per row 0
HYPRE BoomerAMG: Number of levels of aggressive coarsening 0
HYPRE BoomerAMG: Number of paths for aggressive coarsening 1
HYPRE BoomerAMG: Maximum row sums 0.9
HYPRE BoomerAMG: Sweeps down 1
HYPRE BoomerAMG: Sweeps up 1
HYPRE BoomerAMG: Sweeps on coarse 1
HYPRE BoomerAMG: Relax down symmetric-SOR/Jacobi
HYPRE BoomerAMG: Relax up symmetric-SOR/Jacobi
HYPRE BoomerAMG: Relax on coarse Gaussian-elimination
HYPRE BoomerAMG: Relax weight (all) 1.
HYPRE BoomerAMG: Outer relax weight (all) 1.
HYPRE BoomerAMG: Using CF-relaxation
HYPRE BoomerAMG: Not using more complex smoothers.
HYPRE BoomerAMG: Measure type local
HYPRE BoomerAMG: Coarsen type Falgout
HYPRE BoomerAMG: Interpolation type classical
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=2112, cols=2112, bs=2
total: nonzeros=29056, allocated nonzeros=29056
total number of mallocs used during MatSetValues calls =0
using I-node (on process 0) routines: found 531 nodes, limit used is 5
KSP Object: 2 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: 2 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 2 MPI processes
type: mpiaij
rows=4160, cols=4160
package used to perform factorization: mumps
total: nonzeros=308450, allocated nonzeros=308450
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -8
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 8.38453e+06
[1] 1.25452e+07
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 182266.
[1] 301283.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 8.38453e+06
[1] 1.25452e+07
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 6
[1] 7
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 6
[1] 7
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 1736
[1] 2424
RINFOG(1) (global estimated flops for the elimination after analysis): 2.09297e+07
RINFOG(2) (global estimated flops for the assembly after factorization): 483549.
RINFOG(3) (global estimated flops for the elimination after factorization): 2.09297e+07
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 308450
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 49482
INFOG(5) (estimated maximum front size in the complete tree): 167
INFOG(6) (number of nodes in the complete tree): 881
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 308450
INFOG(10) (total integer space store the matrix factors after factorization): 49482
INFOG(11) (order of largest frontal matrix after factorization): 167
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 7
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 13
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 7
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 13
INFOG(20) (estimated number of entries in the factors): 308450
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 6
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 12
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 308450
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 2, 4
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=4160, cols=4160
total: nonzeros=47360, allocated nonzeros=47360
total number of mallocs used during MatSetValues calls =0
not using I-node (on process 0) routines
KSP Object: 2 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: 2 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 2 MPI processes
type: mpiaij
rows=1056, cols=1056
package used to perform factorization: mumps
total: nonzeros=51008, allocated nonzeros=51008
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -8
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 932479.
[1] 869485.
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 34069.
[1] 32553.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 932479.
[1] 869485.
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 1
[1] 1
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 1
[1] 1
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 544
[1] 512
RINFOG(1) (global estimated flops for the elimination after analysis): 1.80196e+06
RINFOG(2) (global estimated flops for the assembly after factorization): 66622.
RINFOG(3) (global estimated flops for the elimination after factorization): 1.80196e+06
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 51008
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 12612
INFOG(5) (estimated maximum front size in the complete tree): 73
INFOG(6) (number of nodes in the complete tree): 277
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 51008
INFOG(10) (total integer space store the matrix factors after factorization): 12612
INFOG(11) (order of largest frontal matrix after factorization): 73
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 1
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 2
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 1
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 2
INFOG(20) (estimated number of entries in the factors): 51008
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 1
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 2
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 51008
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 0, 0
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=1056, cols=1056
total: nonzeros=7264, allocated nonzeros=7264
total number of mallocs used during MatSetValues calls =0
not using I-node (on process 0) routines
TC = 2.00000
TC = 2.00000
KSP Object: 2 MPI processes
type: bcgs
maximum iterations=10000000
tolerances: relative=3e-15, absolute=3e-15, divergence=10000.
left preconditioning
using nonzero initial guess
using PRECONDITIONED norm type for convergence test
PC Object: 2 MPI processes
type: hypre
HYPRE BoomerAMG preconditioning
HYPRE BoomerAMG: Cycle type V
HYPRE BoomerAMG: Maximum number of levels 25
HYPRE BoomerAMG: Maximum number of iterations PER hypre call 1
HYPRE BoomerAMG: Convergence tolerance PER hypre call 0.
HYPRE BoomerAMG: Threshold for strong coupling 0.25
HYPRE BoomerAMG: Interpolation truncation factor 0.
HYPRE BoomerAMG: Interpolation: max elements per row 0
HYPRE BoomerAMG: Number of levels of aggressive coarsening 0
HYPRE BoomerAMG: Number of paths for aggressive coarsening 1
HYPRE BoomerAMG: Maximum row sums 0.9
HYPRE BoomerAMG: Sweeps down 1
HYPRE BoomerAMG: Sweeps up 1
HYPRE BoomerAMG: Sweeps on coarse 1
HYPRE BoomerAMG: Relax down symmetric-SOR/Jacobi
HYPRE BoomerAMG: Relax up symmetric-SOR/Jacobi
HYPRE BoomerAMG: Relax on coarse Gaussian-elimination
HYPRE BoomerAMG: Relax weight (all) 1.
HYPRE BoomerAMG: Outer relax weight (all) 1.
HYPRE BoomerAMG: Using CF-relaxation
HYPRE BoomerAMG: Not using more complex smoothers.
HYPRE BoomerAMG: Measure type local
HYPRE BoomerAMG: Coarsen type Falgout
HYPRE BoomerAMG: Interpolation type classical
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=2112, cols=2112, bs=2
total: nonzeros=29056, allocated nonzeros=29056
total number of mallocs used during MatSetValues calls =0
using I-node (on process 0) routines: found 531 nodes, limit used is 5
KSP Object: 2 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: 2 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 2 MPI processes
type: mpiaij
rows=4160, cols=4160
package used to perform factorization: mumps
total: nonzeros=308450, allocated nonzeros=308450
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -8
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 8.38453e+06
[1] 1.25452e+07
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 182266.
[1] 301283.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 8.38453e+06
[1] 1.25452e+07
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 6
[1] 7
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 6
[1] 7
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 1736
[1] 2424
RINFOG(1) (global estimated flops for the elimination after analysis): 2.09297e+07
RINFOG(2) (global estimated flops for the assembly after factorization): 483549.
RINFOG(3) (global estimated flops for the elimination after factorization): 2.09297e+07
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 308450
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 49482
INFOG(5) (estimated maximum front size in the complete tree): 167
INFOG(6) (number of nodes in the complete tree): 881
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 308450
INFOG(10) (total integer space store the matrix factors after factorization): 49482
INFOG(11) (order of largest frontal matrix after factorization): 167
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 7
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 13
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 7
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 13
INFOG(20) (estimated number of entries in the factors): 308450
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 6
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 12
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 308450
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 2, 4
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=4160, cols=4160
total: nonzeros=47360, allocated nonzeros=47360
total number of mallocs used during MatSetValues calls =0
not using I-node (on process 0) routines
KSP Object: 2 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: 2 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 2 MPI processes
type: mpiaij
rows=1056, cols=1056
package used to perform factorization: mumps
total: nonzeros=51008, allocated nonzeros=51008
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -8
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 932479.
[1] 869485.
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 34069.
[1] 32553.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 932479.
[1] 869485.
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 1
[1] 1
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 1
[1] 1
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 544
[1] 512
RINFOG(1) (global estimated flops for the elimination after analysis): 1.80196e+06
RINFOG(2) (global estimated flops for the assembly after factorization): 66622.
RINFOG(3) (global estimated flops for the elimination after factorization): 1.80196e+06
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 51008
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 12612
INFOG(5) (estimated maximum front size in the complete tree): 73
INFOG(6) (number of nodes in the complete tree): 277
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 51008
INFOG(10) (total integer space store the matrix factors after factorization): 12612
INFOG(11) (order of largest frontal matrix after factorization): 73
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 1
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 2
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 1
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 2
INFOG(20) (estimated number of entries in the factors): 51008
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 1
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 2
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 51008
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 0, 0
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=1056, cols=1056
total: nonzeros=7264, allocated nonzeros=7264
total number of mallocs used during MatSetValues calls =0
not using I-node (on process 0) routines
TC = 2.50000
TC = 2.50000
KSP Object: 2 MPI processes
type: bcgs
maximum iterations=10000000
tolerances: relative=3e-15, absolute=3e-15, divergence=10000.
left preconditioning
using nonzero initial guess
using PRECONDITIONED norm type for convergence test
PC Object: 2 MPI processes
type: hypre
HYPRE BoomerAMG preconditioning
HYPRE BoomerAMG: Cycle type V
HYPRE BoomerAMG: Maximum number of levels 25
HYPRE BoomerAMG: Maximum number of iterations PER hypre call 1
HYPRE BoomerAMG: Convergence tolerance PER hypre call 0.
HYPRE BoomerAMG: Threshold for strong coupling 0.25
HYPRE BoomerAMG: Interpolation truncation factor 0.
HYPRE BoomerAMG: Interpolation: max elements per row 0
HYPRE BoomerAMG: Number of levels of aggressive coarsening 0
HYPRE BoomerAMG: Number of paths for aggressive coarsening 1
HYPRE BoomerAMG: Maximum row sums 0.9
HYPRE BoomerAMG: Sweeps down 1
HYPRE BoomerAMG: Sweeps up 1
HYPRE BoomerAMG: Sweeps on coarse 1
HYPRE BoomerAMG: Relax down symmetric-SOR/Jacobi
HYPRE BoomerAMG: Relax up symmetric-SOR/Jacobi
HYPRE BoomerAMG: Relax on coarse Gaussian-elimination
HYPRE BoomerAMG: Relax weight (all) 1.
HYPRE BoomerAMG: Outer relax weight (all) 1.
HYPRE BoomerAMG: Using CF-relaxation
HYPRE BoomerAMG: Not using more complex smoothers.
HYPRE BoomerAMG: Measure type local
HYPRE BoomerAMG: Coarsen type Falgout
HYPRE BoomerAMG: Interpolation type classical
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=2112, cols=2112, bs=2
total: nonzeros=29056, allocated nonzeros=29056
total number of mallocs used during MatSetValues calls =0
using I-node (on process 0) routines: found 531 nodes, limit used is 5
KSP Object: 2 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: 2 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 2 MPI processes
type: mpiaij
rows=4160, cols=4160
package used to perform factorization: mumps
total: nonzeros=308450, allocated nonzeros=308450
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -8
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 8.38453e+06
[1] 1.25452e+07
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 182266.
[1] 301283.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 8.38453e+06
[1] 1.25452e+07
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 6
[1] 7
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 6
[1] 7
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 1736
[1] 2424
RINFOG(1) (global estimated flops for the elimination after analysis): 2.09297e+07
RINFOG(2) (global estimated flops for the assembly after factorization): 483549.
RINFOG(3) (global estimated flops for the elimination after factorization): 2.09297e+07
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 308450
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 49482
INFOG(5) (estimated maximum front size in the complete tree): 167
INFOG(6) (number of nodes in the complete tree): 881
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 308450
INFOG(10) (total integer space store the matrix factors after factorization): 49482
INFOG(11) (order of largest frontal matrix after factorization): 167
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 7
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 13
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 7
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 13
INFOG(20) (estimated number of entries in the factors): 308450
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 6
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 12
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 308450
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 2, 4
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=4160, cols=4160
total: nonzeros=47360, allocated nonzeros=47360
total number of mallocs used during MatSetValues calls =0
not using I-node (on process 0) routines
KSP Object: 2 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: 2 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 2 MPI processes
type: mpiaij
rows=1056, cols=1056
package used to perform factorization: mumps
total: nonzeros=51008, allocated nonzeros=51008
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -8
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 932479.
[1] 869485.
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 34069.
[1] 32553.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 932479.
[1] 869485.
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 1
[1] 1
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 1
[1] 1
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 544
[1] 512
RINFOG(1) (global estimated flops for the elimination after analysis): 1.80196e+06
RINFOG(2) (global estimated flops for the assembly after factorization): 66622.
RINFOG(3) (global estimated flops for the elimination after factorization): 1.80196e+06
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 51008
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 12612
INFOG(5) (estimated maximum front size in the complete tree): 73
INFOG(6) (number of nodes in the complete tree): 277
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 51008
INFOG(10) (total integer space store the matrix factors after factorization): 12612
INFOG(11) (order of largest frontal matrix after factorization): 73
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 1
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 2
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 1
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 2
INFOG(20) (estimated number of entries in the factors): 51008
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 1
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 2
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 51008
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 0, 0
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=1056, cols=1056
total: nonzeros=7264, allocated nonzeros=7264
total number of mallocs used during MatSetValues calls =0
not using I-node (on process 0) routines
TC = 3.00000
TC = 3.00000
KSP Object: 2 MPI processes
type: bcgs
maximum iterations=10000000
tolerances: relative=3e-15, absolute=3e-15, divergence=10000.
left preconditioning
using nonzero initial guess
using PRECONDITIONED norm type for convergence test
PC Object: 2 MPI processes
type: hypre
HYPRE BoomerAMG preconditioning
HYPRE BoomerAMG: Cycle type V
HYPRE BoomerAMG: Maximum number of levels 25
HYPRE BoomerAMG: Maximum number of iterations PER hypre call 1
HYPRE BoomerAMG: Convergence tolerance PER hypre call 0.
HYPRE BoomerAMG: Threshold for strong coupling 0.25
HYPRE BoomerAMG: Interpolation truncation factor 0.
HYPRE BoomerAMG: Interpolation: max elements per row 0
HYPRE BoomerAMG: Number of levels of aggressive coarsening 0
HYPRE BoomerAMG: Number of paths for aggressive coarsening 1
HYPRE BoomerAMG: Maximum row sums 0.9
HYPRE BoomerAMG: Sweeps down 1
HYPRE BoomerAMG: Sweeps up 1
HYPRE BoomerAMG: Sweeps on coarse 1
HYPRE BoomerAMG: Relax down symmetric-SOR/Jacobi
HYPRE BoomerAMG: Relax up symmetric-SOR/Jacobi
HYPRE BoomerAMG: Relax on coarse Gaussian-elimination
HYPRE BoomerAMG: Relax weight (all) 1.
HYPRE BoomerAMG: Outer relax weight (all) 1.
HYPRE BoomerAMG: Using CF-relaxation
HYPRE BoomerAMG: Not using more complex smoothers.
HYPRE BoomerAMG: Measure type local
HYPRE BoomerAMG: Coarsen type Falgout
HYPRE BoomerAMG: Interpolation type classical
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=2112, cols=2112, bs=2
total: nonzeros=29056, allocated nonzeros=29056
total number of mallocs used during MatSetValues calls =0
using I-node (on process 0) routines: found 531 nodes, limit used is 5
KSP Object: 2 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: 2 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 2 MPI processes
type: mpiaij
rows=4160, cols=4160
package used to perform factorization: mumps
total: nonzeros=308450, allocated nonzeros=308450
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -8
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 8.38453e+06
[1] 1.25452e+07
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 182266.
[1] 301283.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 8.38453e+06
[1] 1.25452e+07
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 6
[1] 7
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 6
[1] 7
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 1736
[1] 2424
RINFOG(1) (global estimated flops for the elimination after analysis): 2.09297e+07
RINFOG(2) (global estimated flops for the assembly after factorization): 483549.
RINFOG(3) (global estimated flops for the elimination after factorization): 2.09297e+07
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 308450
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 49482
INFOG(5) (estimated maximum front size in the complete tree): 167
INFOG(6) (number of nodes in the complete tree): 881
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 308450
INFOG(10) (total integer space store the matrix factors after factorization): 49482
INFOG(11) (order of largest frontal matrix after factorization): 167
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 7
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 13
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 7
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 13
INFOG(20) (estimated number of entries in the factors): 308450
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 6
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 12
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 308450
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 2, 4
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=4160, cols=4160
total: nonzeros=47360, allocated nonzeros=47360
total number of mallocs used during MatSetValues calls =0
not using I-node (on process 0) routines
KSP Object: 2 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: 2 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 2 MPI processes
type: mpiaij
rows=1056, cols=1056
package used to perform factorization: mumps
total: nonzeros=51008, allocated nonzeros=51008
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -8
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 932479.
[1] 869485.
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 34069.
[1] 32553.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 932479.
[1] 869485.
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 1
[1] 1
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 1
[1] 1
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 544
[1] 512
RINFOG(1) (global estimated flops for the elimination after analysis): 1.80196e+06
RINFOG(2) (global estimated flops for the assembly after factorization): 66622.
RINFOG(3) (global estimated flops for the elimination after factorization): 1.80196e+06
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 51008
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 12612
INFOG(5) (estimated maximum front size in the complete tree): 73
INFOG(6) (number of nodes in the complete tree): 277
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 51008
INFOG(10) (total integer space store the matrix factors after factorization): 12612
INFOG(11) (order of largest frontal matrix after factorization): 73
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 1
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 2
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 1
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 2
INFOG(20) (estimated number of entries in the factors): 51008
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 1
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 2
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 51008
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 0, 0
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=1056, cols=1056
total: nonzeros=7264, allocated nonzeros=7264
total number of mallocs used during MatSetValues calls =0
not using I-node (on process 0) routines
TC = 3.50000
TC = 3.50000
KSP Object: 2 MPI processes
type: bcgs
maximum iterations=10000000
tolerances: relative=3e-15, absolute=3e-15, divergence=10000.
left preconditioning
using nonzero initial guess
using PRECONDITIONED norm type for convergence test
PC Object: 2 MPI processes
type: hypre
HYPRE BoomerAMG preconditioning
HYPRE BoomerAMG: Cycle type V
HYPRE BoomerAMG: Maximum number of levels 25
HYPRE BoomerAMG: Maximum number of iterations PER hypre call 1
HYPRE BoomerAMG: Convergence tolerance PER hypre call 0.
HYPRE BoomerAMG: Threshold for strong coupling 0.25
HYPRE BoomerAMG: Interpolation truncation factor 0.
HYPRE BoomerAMG: Interpolation: max elements per row 0
HYPRE BoomerAMG: Number of levels of aggressive coarsening 0
HYPRE BoomerAMG: Number of paths for aggressive coarsening 1
HYPRE BoomerAMG: Maximum row sums 0.9
HYPRE BoomerAMG: Sweeps down 1
HYPRE BoomerAMG: Sweeps up 1
HYPRE BoomerAMG: Sweeps on coarse 1
HYPRE BoomerAMG: Relax down symmetric-SOR/Jacobi
HYPRE BoomerAMG: Relax up symmetric-SOR/Jacobi
HYPRE BoomerAMG: Relax on coarse Gaussian-elimination
HYPRE BoomerAMG: Relax weight (all) 1.
HYPRE BoomerAMG: Outer relax weight (all) 1.
HYPRE BoomerAMG: Using CF-relaxation
HYPRE BoomerAMG: Not using more complex smoothers.
HYPRE BoomerAMG: Measure type local
HYPRE BoomerAMG: Coarsen type Falgout
HYPRE BoomerAMG: Interpolation type classical
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=2112, cols=2112, bs=2
total: nonzeros=29056, allocated nonzeros=29056
total number of mallocs used during MatSetValues calls =0
using I-node (on process 0) routines: found 531 nodes, limit used is 5
KSP Object: 2 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: 2 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 2 MPI processes
type: mpiaij
rows=4160, cols=4160
package used to perform factorization: mumps
total: nonzeros=308450, allocated nonzeros=308450
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -8
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 8.38453e+06
[1] 1.25452e+07
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 182266.
[1] 301283.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 8.38453e+06
[1] 1.25452e+07
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 6
[1] 7
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 6
[1] 7
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 1736
[1] 2424
RINFOG(1) (global estimated flops for the elimination after analysis): 2.09297e+07
RINFOG(2) (global estimated flops for the assembly after factorization): 483549.
RINFOG(3) (global estimated flops for the elimination after factorization): 2.09297e+07
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 308450
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 49482
INFOG(5) (estimated maximum front size in the complete tree): 167
INFOG(6) (number of nodes in the complete tree): 881
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 308450
INFOG(10) (total integer space store the matrix factors after factorization): 49482
INFOG(11) (order of largest frontal matrix after factorization): 167
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 7
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 13
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 7
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 13
INFOG(20) (estimated number of entries in the factors): 308450
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 6
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 12
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 308450
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 2, 4
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=4160, cols=4160
total: nonzeros=47360, allocated nonzeros=47360
total number of mallocs used during MatSetValues calls =0
not using I-node (on process 0) routines
KSP Object: 2 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: 2 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 2 MPI processes
type: mpiaij
rows=1056, cols=1056
package used to perform factorization: mumps
total: nonzeros=51008, allocated nonzeros=51008
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -8
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 932479.
[1] 869485.
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 34069.
[1] 32553.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 932479.
[1] 869485.
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 1
[1] 1
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 1
[1] 1
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 544
[1] 512
RINFOG(1) (global estimated flops for the elimination after analysis): 1.80196e+06
RINFOG(2) (global estimated flops for the assembly after factorization): 66622.
RINFOG(3) (global estimated flops for the elimination after factorization): 1.80196e+06
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 51008
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 12612
INFOG(5) (estimated maximum front size in the complete tree): 73
INFOG(6) (number of nodes in the complete tree): 277
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 51008
INFOG(10) (total integer space store the matrix factors after factorization): 12612
INFOG(11) (order of largest frontal matrix after factorization): 73
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 1
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 2
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 1
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 2
INFOG(20) (estimated number of entries in the factors): 51008
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 1
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 2
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 51008
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 0, 0
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=1056, cols=1056
total: nonzeros=7264, allocated nonzeros=7264
total number of mallocs used during MatSetValues calls =0
not using I-node (on process 0) routines
TC = 4.00000
TC = 4.00000
KSP Object: 2 MPI processes
type: bcgs
maximum iterations=10000000
tolerances: relative=3e-15, absolute=3e-15, divergence=10000.
left preconditioning
using nonzero initial guess
using PRECONDITIONED norm type for convergence test
PC Object: 2 MPI processes
type: hypre
HYPRE BoomerAMG preconditioning
HYPRE BoomerAMG: Cycle type V
HYPRE BoomerAMG: Maximum number of levels 25
HYPRE BoomerAMG: Maximum number of iterations PER hypre call 1
HYPRE BoomerAMG: Convergence tolerance PER hypre call 0.
HYPRE BoomerAMG: Threshold for strong coupling 0.25
HYPRE BoomerAMG: Interpolation truncation factor 0.
HYPRE BoomerAMG: Interpolation: max elements per row 0
HYPRE BoomerAMG: Number of levels of aggressive coarsening 0
HYPRE BoomerAMG: Number of paths for aggressive coarsening 1
HYPRE BoomerAMG: Maximum row sums 0.9
HYPRE BoomerAMG: Sweeps down 1
HYPRE BoomerAMG: Sweeps up 1
HYPRE BoomerAMG: Sweeps on coarse 1
HYPRE BoomerAMG: Relax down symmetric-SOR/Jacobi
HYPRE BoomerAMG: Relax up symmetric-SOR/Jacobi
HYPRE BoomerAMG: Relax on coarse Gaussian-elimination
HYPRE BoomerAMG: Relax weight (all) 1.
HYPRE BoomerAMG: Outer relax weight (all) 1.
HYPRE BoomerAMG: Using CF-relaxation
HYPRE BoomerAMG: Not using more complex smoothers.
HYPRE BoomerAMG: Measure type local
HYPRE BoomerAMG: Coarsen type Falgout
HYPRE BoomerAMG: Interpolation type classical
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=2112, cols=2112, bs=2
total: nonzeros=29056, allocated nonzeros=29056
total number of mallocs used during MatSetValues calls =0
using I-node (on process 0) routines: found 531 nodes, limit used is 5
KSP Object: 2 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: 2 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 2 MPI processes
type: mpiaij
rows=4160, cols=4160
package used to perform factorization: mumps
total: nonzeros=308450, allocated nonzeros=308450
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -8
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 8.38453e+06
[1] 1.25452e+07
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 182266.
[1] 301283.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 8.38453e+06
[1] 1.25452e+07
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 6
[1] 7
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 6
[1] 7
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 1736
[1] 2424
RINFOG(1) (global estimated flops for the elimination after analysis): 2.09297e+07
RINFOG(2) (global estimated flops for the assembly after factorization): 483549.
RINFOG(3) (global estimated flops for the elimination after factorization): 2.09297e+07
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 308450
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 49482
INFOG(5) (estimated maximum front size in the complete tree): 167
INFOG(6) (number of nodes in the complete tree): 881
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 308450
INFOG(10) (total integer space store the matrix factors after factorization): 49482
INFOG(11) (order of largest frontal matrix after factorization): 167
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 7
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 13
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 7
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 13
INFOG(20) (estimated number of entries in the factors): 308450
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 6
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 12
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 308450
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 2, 4
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=4160, cols=4160
total: nonzeros=47360, allocated nonzeros=47360
total number of mallocs used during MatSetValues calls =0
not using I-node (on process 0) routines
KSP Object: 2 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: 2 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 2 MPI processes
type: mpiaij
rows=1056, cols=1056
package used to perform factorization: mumps
total: nonzeros=51008, allocated nonzeros=51008
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -8
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 932479.
[1] 869485.
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 34069.
[1] 32553.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 932479.
[1] 869485.
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 1
[1] 1
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 1
[1] 1
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 544
[1] 512
RINFOG(1) (global estimated flops for the elimination after analysis): 1.80196e+06
RINFOG(2) (global estimated flops for the assembly after factorization): 66622.
RINFOG(3) (global estimated flops for the elimination after factorization): 1.80196e+06
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 51008
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 12612
INFOG(5) (estimated maximum front size in the complete tree): 73
INFOG(6) (number of nodes in the complete tree): 277
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 51008
INFOG(10) (total integer space store the matrix factors after factorization): 12612
INFOG(11) (order of largest frontal matrix after factorization): 73
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 1
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 2
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 1
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 2
INFOG(20) (estimated number of entries in the factors): 51008
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 1
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 2
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 51008
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 0, 0
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=1056, cols=1056
total: nonzeros=7264, allocated nonzeros=7264
total number of mallocs used during MatSetValues calls =0
not using I-node (on process 0) routines
TC = 4.50000
TC = 4.50000
KSP Object: 2 MPI processes
type: bcgs
maximum iterations=10000000
tolerances: relative=3e-15, absolute=3e-15, divergence=10000.
left preconditioning
using nonzero initial guess
using PRECONDITIONED norm type for convergence test
PC Object: 2 MPI processes
type: hypre
HYPRE BoomerAMG preconditioning
HYPRE BoomerAMG: Cycle type V
HYPRE BoomerAMG: Maximum number of levels 25
HYPRE BoomerAMG: Maximum number of iterations PER hypre call 1
HYPRE BoomerAMG: Convergence tolerance PER hypre call 0.
HYPRE BoomerAMG: Threshold for strong coupling 0.25
HYPRE BoomerAMG: Interpolation truncation factor 0.
HYPRE BoomerAMG: Interpolation: max elements per row 0
HYPRE BoomerAMG: Number of levels of aggressive coarsening 0
HYPRE BoomerAMG: Number of paths for aggressive coarsening 1
HYPRE BoomerAMG: Maximum row sums 0.9
HYPRE BoomerAMG: Sweeps down 1
HYPRE BoomerAMG: Sweeps up 1
HYPRE BoomerAMG: Sweeps on coarse 1
HYPRE BoomerAMG: Relax down symmetric-SOR/Jacobi
HYPRE BoomerAMG: Relax up symmetric-SOR/Jacobi
HYPRE BoomerAMG: Relax on coarse Gaussian-elimination
HYPRE BoomerAMG: Relax weight (all) 1.
HYPRE BoomerAMG: Outer relax weight (all) 1.
HYPRE BoomerAMG: Using CF-relaxation
HYPRE BoomerAMG: Not using more complex smoothers.
HYPRE BoomerAMG: Measure type local
HYPRE BoomerAMG: Coarsen type Falgout
HYPRE BoomerAMG: Interpolation type classical
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=2112, cols=2112, bs=2
total: nonzeros=29056, allocated nonzeros=29056
total number of mallocs used during MatSetValues calls =0
using I-node (on process 0) routines: found 531 nodes, limit used is 5
KSP Object: 2 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: 2 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 2 MPI processes
type: mpiaij
rows=4160, cols=4160
package used to perform factorization: mumps
total: nonzeros=308450, allocated nonzeros=308450
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -8
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 8.38453e+06
[1] 1.25452e+07
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 182266.
[1] 301283.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 8.38453e+06
[1] 1.25452e+07
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 6
[1] 7
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 6
[1] 7
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 1736
[1] 2424
RINFOG(1) (global estimated flops for the elimination after analysis): 2.09297e+07
RINFOG(2) (global estimated flops for the assembly after factorization): 483549.
RINFOG(3) (global estimated flops for the elimination after factorization): 2.09297e+07
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 308450
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 49482
INFOG(5) (estimated maximum front size in the complete tree): 167
INFOG(6) (number of nodes in the complete tree): 881
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 308450
INFOG(10) (total integer space store the matrix factors after factorization): 49482
INFOG(11) (order of largest frontal matrix after factorization): 167
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 7
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 13
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 7
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 13
INFOG(20) (estimated number of entries in the factors): 308450
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 6
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 12
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 308450
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 2, 4
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=4160, cols=4160
total: nonzeros=47360, allocated nonzeros=47360
total number of mallocs used during MatSetValues calls =0
not using I-node (on process 0) routines
KSP Object: 2 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: 2 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 2 MPI processes
type: mpiaij
rows=1056, cols=1056
package used to perform factorization: mumps
total: nonzeros=51008, allocated nonzeros=51008
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -8
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 932479.
[1] 869485.
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 34069.
[1] 32553.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 932479.
[1] 869485.
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 1
[1] 1
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 1
[1] 1
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 544
[1] 512
RINFOG(1) (global estimated flops for the elimination after analysis): 1.80196e+06
RINFOG(2) (global estimated flops for the assembly after factorization): 66622.
RINFOG(3) (global estimated flops for the elimination after factorization): 1.80196e+06
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 51008
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 12612
INFOG(5) (estimated maximum front size in the complete tree): 73
INFOG(6) (number of nodes in the complete tree): 277
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 51008
INFOG(10) (total integer space store the matrix factors after factorization): 12612
INFOG(11) (order of largest frontal matrix after factorization): 73
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 1
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 2
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 1
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 2
INFOG(20) (estimated number of entries in the factors): 51008
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 1
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 2
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 51008
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 0, 0
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=1056, cols=1056
total: nonzeros=7264, allocated nonzeros=7264
total number of mallocs used during MatSetValues calls =0
not using I-node (on process 0) routines
TC = 5.00000
TC = 5.00000
More information about the petsc-users
mailing list