Generated gh-pages for commit 4bbf3d8

Author: Dillon Shaver <dshaver@anl.gov>

    link PPLIST in Lanczos FAQ

Author: dshaver14

_sources/faq.rst.txt

@@ -141,7 +141,7 @@ Pre-Processing and Numerics
 
   ``Warning: Lanczos reached a residual of 12.840714 (target: 0.000010) after 50 x 50 iterations in Level=7!``  
 
-  This warning is from parRSB (parallel recursive spectral bisection) which is used to distribute the elements to MPI ranks.
+  This warning is from parRSB (parallel recursive spectral bisection) which can be used to distribute the elements to MPI ranks for large problems in lieu of *genmap* (see :ref:`build_pplist`).
   parRSB guarantees "load-balancing", meaning the numbers of elements for each MPI rank are as close as possible.
   It also tries to minimize the communication between ranks by finding the minimal number of separators for the graph partition. 
   For each cut, we find the Fiedler vector, the eigenvector of the smallest positive eigenvalue of the graph Laplacian.

faq.html

@@ -194,7 +194,7 @@ <h2>Pre-Processing and Numerics<a class="headerlink" href="#pre-processing-and-n
 <p><strong>I received a warning message about Lanczos failing to reach a residual target, what does this mean and what should I do about it?</strong></p>
 <blockquote>
 <div><p><code class="docutils literal notranslate"><span class="pre">Warning:</span> <span class="pre">Lanczos</span> <span class="pre">reached</span> <span class="pre">a</span> <span class="pre">residual</span> <span class="pre">of</span> <span class="pre">12.840714</span> <span class="pre">(target:</span> <span class="pre">0.000010)</span> <span class="pre">after</span> <span class="pre">50</span> <span class="pre">x</span> <span class="pre">50</span> <span class="pre">iterations</span> <span class="pre">in</span> <span class="pre">Level=7!</span></code></p>
-<p>This warning is from parRSB (parallel recursive spectral bisection) which is used to distribute the elements to MPI ranks.
+<p>This warning is from parRSB (parallel recursive spectral bisection) which can be used to distribute the elements to MPI ranks for large problems in lieu of <em>genmap</em> (see <a class="reference internal" href="build.html#build-pplist"><span class="std std-ref">Preprocessor List</span></a>).
 parRSB guarantees “load-balancing”, meaning the numbers of elements for each MPI rank are as close as possible.
 It also tries to minimize the communication between ranks by finding the minimal number of separators for the graph partition.
 For each cut, we find the Fiedler vector, the eigenvector of the smallest positive eigenvalue of the graph Laplacian.