-pc_type lu -pc_factor_mat_solver_package superlu_dist On Dec 21, 2011 6:19 AM, "Dominik Szczerba" <dominik at itis.ethz.ch> wrote:
> I am successfully solving my indefinite systems with MUMPS but only > for very small problems. To give a feeling, a mere couple thousands > elements. If I only double the problem size, it silently freezes, even > with max verbosity via the control parameters. Did anyone succeed here > with big problems? Any recommendations for a drop-in replacement for > MUMPS? > > Thanks for any hints, > Dominik > > > > Options used: > -mat_mumps_icntl_4 3 -mat_mumps_icntl_28 2 -mat_mumps_icntl_29 > > Output: > > ****** FACTORIZATION STEP ******** > > > GLOBAL STATISTICS PRIOR NUMERICAL FACTORIZATION ... > NUMBER OF WORKING PROCESSES = 16 > OUT-OF-CORE OPTION (ICNTL(22)) = 0 > REAL SPACE FOR FACTORS = 1438970073 > INTEGER SPACE FOR FACTORS = 11376442 > MAXIMUM FRONTAL SIZE (ESTIMATED) = 16868 > NUMBER OF NODES IN THE TREE = 43676 > Convergence error after scaling for ONE-NORM (option 7/8) = 0.21D+01 > Maximum effective relaxed size of S = 231932340 > Average effective relaxed size of S = 182366303 > > REDISTRIB: TOTAL DATA LOCAL/SENT = 1509215 22859750 > GLOBAL TIME FOR MATRIX DISTRIBUTION = 0.8270 > ** Memory relaxation parameter ( ICNTL(14) ) : 35 > ** Rank of processor needing largest memory in facto : 0 > ** Space in MBYTES used by this processor for facto : 2017 > ** Avg. Space in MBYTES per working proc during facto : 1618 > -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.mcs.anl.gov/pipermail/petsc-users/attachments/20111221/b497fbd9/attachment.htm>
