This commit is contained in:
pasquadambra
2021-04-01 11:35:13 +02:00
18 changed files with 95 additions and 51 deletions
+11 -6
View File
@@ -65,8 +65,9 @@ class="cmti-12">Improving multifrontal methods by means of block low-rank</span>
class="cmti-12">representations</span><span
class="cmr-12">, SIAM Journal on Scientific Computing, volume 37 (3), 2015,</span>
<span
class="cmr-12">A1452&#8211;A1474. See also </span><span
class="cmtt-12">http://mumps.enseeiht.fr</span><span
class="cmr-12">A1452&#8211;A1474. See also </span><a
href="http://mumps.enseeiht.fr" class="url" ><span
class="cmtt-12">http://mumps.enseeiht.fr</span></a><span
class="cmr-12">.</span>
</p>
<p class="bibitem" ><span class="biblabel">
@@ -331,8 +332,11 @@ class="cmti-12">- an Unsymmetric-pattern Multifrontal Method with a Column Pre-o
class="cmti-12">Strategy</span><span
class="cmr-12">, ACM Transactions on Mathematical Software, 30, 2004, 196&#8211;199.</span>
<span
class="cmr-12">(See also </span><span
class="cmtt-12">http://www.cise.ufl.edu/~davis/</span><span
class="cmr-12">(See also </span><a
href="http://www.cise.ufl.edu/~davis/" class="url" ><span
class="cmtt-12">http://www.cise.ufl.edu/</span><span
class="cmtt-12">~</span><span
class="cmtt-12">davis/</span></a><span
class="cmr-12">)</span>
</p>
<p class="bibitem" ><span class="biblabel">
@@ -440,8 +444,9 @@ class="cmti-12">PSBLAS 3.5.0 User&#8217;s Guide. A Reference</span>
<span
class="cmti-12">Guide for the Parallel Sparse BLAS Library</span><span
class="cmr-12">, 2012, available from</span>
<span
class="cmtt-12">https://github.com/sfilippone/psblas3/tree/master/docs</span><span
<a
href="https://github.com/sfilippone/psblas3/tree/master/docs" class="url" ><span
class="cmtt-12">https://github.com/sfilippone/psblas3/tree/master/docs</span></a><span
class="cmr-12">.</span>
</p>
<p class="bibitem" ><span class="biblabel">
+4 -2
View File
@@ -36,7 +36,8 @@ class="cmr-12">This section describes the basics for building and applying AMG4P
<span
class="cmr-12">and multilevel (i.e., AMG) preconditioners with the Krylov solvers included in</span>
<span
class="cmr-12">PSBLAS </span><span class="cite"><span
class="cmr-12">PSBLAS</span><span
class="cmr-12">&#x00A0;</span><span class="cite"><span
class="cmr-12">[</span><a
href="userhtmlli5.html#XPSBLASGUIDE"><span
class="cmr-12">20</span></a><span
@@ -432,7 +433,8 @@ class="cmr-12">linear system comes from a standard discretization of basic scala
<span
class="cmr-12">problems. However, this does not necessarily correspond to the shortest execution time</span>
<span
class="cmr-12">on parallel computers.</span>
class="cmr-12">on parallel</span><span
class="cmr-12">&#x00A0;computers.</span>
<div class="subsectionTOCS">
<span
class="cmr-12">&#x00A0;</span><span class="subsectionToc" ><span
+20
View File
@@ -1565,9 +1565,15 @@ class="cmtt-10x-x-109">&#8217;</span> </td><td style="white-space:nowrap;
class="td11"><span class="lstinline"></span><!--l. 501--><p class="noindent" ><span
class="cmtt-10x-x-109">integer</span> </td><td style="white-space:normal; text-align:left;" id="TBL-8-4-3"
class="td11"><!--l. 501--><p class="noindent" >Any integer
<<<<<<< HEAD
<span
class="cmmi-10x-x-109">&#x003E; </span>0 </td><td style="white-space:normal; text-align:left;" id="TBL-8-4-4"
class="td11"><!--l. 501--><p class="noindent" >-1 </td><td style="white-space:normal; text-align:left;" id="TBL-8-4-5"
=======
<!--l. 501--><p class="noindent" ><span
class="cmmi-10x-x-109">&#x003E; </span>0 </td><td style="white-space:wrap; text-align:left;" id="TBL-8-4-4"
class="td11"><!--l. 501--><p class="noindent" >-1 </td><td style="white-space:wrap; text-align:left;" id="TBL-8-4-5"
>>>>>>> b7eba989ad763746ba3317b0316a49c8861f7568
class="td11"><!--l. 501--><p class="noindent" >Number of iterations after which a trace is to
be printed. </td>
</tr><tr
@@ -1580,9 +1586,15 @@ class="cmtt-10x-x-109">&#8217;</span> </td><td style="white-space:nowrap; t
class="td11"><span class="lstinline"></span><!--l. 502--><p class="noindent" ><span
class="cmtt-10x-x-109">integer</span> </td><td style="white-space:normal; text-align:left;" id="TBL-8-5-3"
class="td11"><!--l. 502--><p class="noindent" >Any integer
<<<<<<< HEAD
<span
class="cmmi-10x-x-109">&#x003E; </span>0 </td><td style="white-space:normal; text-align:left;" id="TBL-8-5-4"
class="td11"><!--l. 502--><p class="noindent" >-1 </td><td style="white-space:normal; text-align:left;" id="TBL-8-5-5"
=======
<!--l. 502--><p class="noindent" ><span
class="cmmi-10x-x-109">&#x003E; </span>0 </td><td style="white-space:wrap; text-align:left;" id="TBL-8-5-4"
class="td11"><!--l. 502--><p class="noindent" >-1 </td><td style="white-space:wrap; text-align:left;" id="TBL-8-5-5"
>>>>>>> b7eba989ad763746ba3317b0316a49c8861f7568
class="td11"><!--l. 502--><p class="noindent" >Number of iterations after which a residual is
to be calculated. </td>
</tr><tr
@@ -1596,11 +1608,19 @@ class="td11"><span class="lstinline"></span><!--l. 503--><p class="noindent" ><s
class="cmtt-10x-x-109">real</span><span
class="cmtt-10x-x-109">(</span><span
class="cmtt-10x-x-109">kind_parameter</span><span
<<<<<<< HEAD
class="cmtt-10x-x-109">)</span> </td><td style="white-space:normal; text-align:left;" id="TBL-8-6-3"
class="td11"><!--l. 503--><p class="noindent" >Any real <span
class="cmmi-10x-x-109">&#x003C;</span>
1 </td><td style="white-space:normal; text-align:left;" id="TBL-8-6-4"
class="td11"><!--l. 503--><p class="noindent" >0 </td><td style="white-space:normal; text-align:left;" id="TBL-8-6-5"
=======
class="cmtt-10x-x-109">)</span> </td><td style="white-space:wrap; text-align:left;" id="TBL-8-6-3"
class="td11"><!--l. 503--><p class="noindent" >Any real
<!--l. 503--><p class="noindent" ><span
class="cmmi-10x-x-109">&#x003C; </span>1 </td><td style="white-space:wrap; text-align:left;" id="TBL-8-6-4"
class="td11"><!--l. 503--><p class="noindent" >0 </td><td style="white-space:wrap; text-align:left;" id="TBL-8-6-5"
>>>>>>> b7eba989ad763746ba3317b0316a49c8861f7568
class="td11"><!--l. 503--><p class="noindent" >Tolerance for the stopping criterion on the
residual. </td>
</tr><tr