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