base/tools/psb_cdins.f90
 docs/html/footnode.html
 docs/html/img100.png
 docs/html/img101.png
 docs/html/img102.png
 docs/html/img103.png
 docs/html/img104.png
 docs/html/img105.png
 docs/html/img106.png
 docs/html/img107.png
 docs/html/img108.png
 docs/html/img109.png
 docs/html/img110.png
 docs/html/img111.png
 docs/html/img112.png
 docs/html/img113.png
 docs/html/img114.png
 docs/html/img115.png
 docs/html/img116.png
 docs/html/img117.png
 docs/html/img118.png
 docs/html/img119.png
 docs/html/img120.png
 docs/html/img121.png
 docs/html/img122.png
 docs/html/img123.png
 docs/html/img124.png
 docs/html/img125.png
 docs/html/img126.png
 docs/html/img127.png
 docs/html/img128.png
 docs/html/img129.png
 docs/html/img130.png
 docs/html/img131.png
 docs/html/img132.png
 docs/html/img134.png
 docs/html/img135.png
 docs/html/img136.png
 docs/html/img137.png
 docs/html/img138.png
 docs/html/img139.png
 docs/html/img140.png
 docs/html/img141.png
 docs/html/img142.png
 docs/html/img143.png
 docs/html/img144.png
 docs/html/img145.png
 docs/html/img146.png
 docs/html/img85.png
 docs/html/img86.png
 docs/html/img87.png
 docs/html/img88.png
 docs/html/img89.png
 docs/html/img90.png
 docs/html/img91.png
 docs/html/img92.png
 docs/html/img93.png
 docs/html/img94.png
 docs/html/img95.png
 docs/html/img96.png
 docs/html/img97.png
 docs/html/img98.png
 docs/html/img99.png
 docs/html/index.html
 docs/html/node100.html
 docs/html/node112.html
 docs/html/node117.html
 docs/html/node119.html
 docs/html/node56.html
 docs/html/node57.html
 docs/html/node61.html
 docs/html/node62.html
 docs/html/node63.html
 docs/html/node67.html
 docs/html/node68.html
 docs/html/node71.html
 docs/html/node80.html
 docs/html/node82.html
 docs/html/node84.html
 docs/html/node85.html
 docs/html/node86.html
 docs/html/node88.html
 docs/html/node92.html
 docs/html/node93.html
 docs/html/node94.html
 docs/html/node95.html
 docs/html/node96.html
 docs/html/node97.html
 docs/html/node98.html
 docs/html/node99.html
 docs/html/userhtml.html
 docs/psblas-3.0.pdf
 docs/src/toolsrout.tex
 docs/src/userguide.tex
 docs/src/userhtml.tex
 test/pargen/runs/ppde.inp
 util/psb_d_genpde_impl.f90

New docs for LIDX in CDALL.
This commit is contained in:
Salvatore Filippone
2012-04-16 12:35:14 +00:00
parent 4afc6f1f41
commit 4accecb0c9
96 changed files with 1725 additions and 1657 deletions
+13 -13
View File
@@ -73,7 +73,7 @@ call psb_hsort(x,ix,dir,flag)
<P>
These serial routines sort a sequence <IMG
WIDTH="18" HEIGHT="14" ALIGN="BOTTOM" BORDER="0"
SRC="img104.png"
SRC="img106.png"
ALT="$X$"> into ascending or
descending order. The argument meaning is identical for the three
calls; the only difference is the algorithm used to accomplish the
@@ -99,7 +99,7 @@ Type:<B>optional</B>.
<BR>
Specified as: an integer array of (at least) the same size as <IMG
WIDTH="18" HEIGHT="14" ALIGN="BOTTOM" BORDER="0"
SRC="img104.png"
SRC="img106.png"
ALT="$X$">.
</DD>
<DT><STRONG>dir</STRONG></DT>
@@ -123,7 +123,7 @@ default <code>psb_lsort_up_</code>.
<DT><STRONG>flag</STRONG></DT>
<DD>Whether to keep the original values in <IMG
WIDTH="27" HEIGHT="14" ALIGN="BOTTOM" BORDER="0"
SRC="img105.png"
SRC="img107.png"
ALT="$IX$">.
<BR>
Type:<B>optional</B>.
@@ -185,10 +185,10 @@ position as the corresponding entries in <IMG
-->
<IMG
WIDTH="180" HEIGHT="30" ALIGN="MIDDLE" BORDER="0"
SRC="img106.png"
SRC="img108.png"
ALT="$flag = psb\_sort\_ovw\_idx\_$"> then the entries in <IMG
WIDTH="62" HEIGHT="32" ALIGN="MIDDLE" BORDER="0"
SRC="img107.png"
SRC="img109.png"
ALT="$ix(1:n)$">
where <IMG
WIDTH="13" HEIGHT="13" ALIGN="BOTTOM" BORDER="0"
@@ -202,7 +202,7 @@ position as the corresponding entries in <IMG
-->
<IMG
WIDTH="66" HEIGHT="32" ALIGN="MIDDLE" BORDER="0"
SRC="img108.png"
SRC="img110.png"
ALT="$ix(i) \leftarrow
i$">; thus, upon return from the subroutine, for each
index <IMG
@@ -210,10 +210,10 @@ i$">; thus, upon return from the subroutine, for each
SRC="img4.png"
ALT="$i$"> we have in <IMG
WIDTH="37" HEIGHT="32" ALIGN="MIDDLE" BORDER="0"
SRC="img109.png"
SRC="img111.png"
ALT="$ix(i)$"> the position that the item <IMG
WIDTH="31" HEIGHT="32" ALIGN="MIDDLE" BORDER="0"
SRC="img110.png"
SRC="img112.png"
ALT="$x(i)$">
occupied in the original data sequence;
</LI>
@@ -222,16 +222,16 @@ i$">; thus, upon return from the subroutine, for each
-->
<IMG
WIDTH="185" HEIGHT="30" ALIGN="MIDDLE" BORDER="0"
SRC="img111.png"
SRC="img113.png"
ALT="$flag = psb\_sort\_keep\_idx\_$"> the routine will assume that
the entries in <IMG
WIDTH="35" HEIGHT="32" ALIGN="MIDDLE" BORDER="0"
SRC="img112.png"
SRC="img114.png"
ALT="$ix(:)$"> have already been initialized by the user;
</LI>
<LI>The three sorting algorithms have a similar <IMG
WIDTH="74" HEIGHT="32" ALIGN="MIDDLE" BORDER="0"
SRC="img113.png"
SRC="img115.png"
ALT="$O(n \log n)$"> expected
running time; in the average case quicksort will be the
fastest and merge-sort the slowest. However note that:
@@ -239,7 +239,7 @@ i$">; thus, upon return from the subroutine, for each
<OL>
<LI>The worst case running time for quicksort is <IMG
WIDTH="45" HEIGHT="34" ALIGN="MIDDLE" BORDER="0"
SRC="img114.png"
SRC="img116.png"
ALT="$O(n^2)$">; the algorithm
implemented here follows the well-known median-of-three heuristics,
but the worst case may still apply;
@@ -247,7 +247,7 @@ i$">; thus, upon return from the subroutine, for each
<LI>The worst case running time for merge-sort and heap-sort is
<IMG
WIDTH="74" HEIGHT="32" ALIGN="MIDDLE" BORDER="0"
SRC="img113.png"
SRC="img115.png"
ALT="$O(n \log n)$"> as the average case;
</LI>
<LI>The merge-sort algorithm is implemented to take advantage of