mirror of
https://github.com/sfilippone/psblas3.git
synced 2026-10-07 07:04:57 +00:00
psblas3:
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/img13.png docs/html/img130.png docs/html/img131.png docs/html/img132.png docs/html/img133.png docs/html/img134.png docs/html/img135.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/img147.png docs/html/img148.png docs/html/img15.png docs/html/img16.png docs/html/img25.png docs/html/img27.png docs/html/img31.png docs/html/img33.png docs/html/img34.png docs/html/img35.png docs/html/img36.png docs/html/img37.png docs/html/img39.png docs/html/img40.png docs/html/img41.png docs/html/img42.png docs/html/img45.png docs/html/img47.png docs/html/img48.png docs/html/img49.png docs/html/img50.png docs/html/img51.png docs/html/img52.png docs/html/img53.png docs/html/img54.png docs/html/img55.png docs/html/img56.png docs/html/img57.png docs/html/img58.png docs/html/img59.png docs/html/img60.png docs/html/img61.png docs/html/img62.png docs/html/img63.png docs/html/img64.png docs/html/img65.png docs/html/img66.png docs/html/img68.png docs/html/img69.png docs/html/img70.png docs/html/img71.png docs/html/img72.png docs/html/img73.png docs/html/img74.png docs/html/img75.png docs/html/img76.png docs/html/img77.png docs/html/img78.png docs/html/img79.png docs/html/img8.png docs/html/img80.png docs/html/img81.png docs/html/img82.png docs/html/img83.png docs/html/img84.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/node1.html docs/html/node10.html docs/html/node100.html docs/html/node11.html docs/html/node112.html docs/html/node113.html docs/html/node114.html docs/html/node117.html docs/html/node119.html docs/html/node12.html docs/html/node13.html docs/html/node14.html docs/html/node15.html docs/html/node16.html docs/html/node17.html docs/html/node18.html docs/html/node19.html docs/html/node20.html docs/html/node21.html docs/html/node22.html docs/html/node23.html docs/html/node24.html docs/html/node25.html docs/html/node26.html docs/html/node27.html docs/html/node28.html docs/html/node29.html docs/html/node3.html docs/html/node30.html docs/html/node31.html docs/html/node32.html docs/html/node33.html docs/html/node34.html docs/html/node35.html docs/html/node36.html docs/html/node37.html docs/html/node38.html docs/html/node39.html docs/html/node4.html docs/html/node40.html docs/html/node41.html docs/html/node42.html docs/html/node43.html docs/html/node44.html docs/html/node45.html docs/html/node46.html docs/html/node47.html docs/html/node48.html docs/html/node49.html docs/html/node50.html docs/html/node51.html docs/html/node52.html docs/html/node53.html docs/html/node54.html docs/html/node56.html docs/html/node57.html docs/html/node6.html docs/html/node61.html docs/html/node62.html docs/html/node63.html docs/html/node67.html docs/html/node68.html docs/html/node69.html docs/html/node7.html docs/html/node70.html docs/html/node71.html docs/html/node72.html docs/html/node73.html docs/html/node74.html docs/html/node75.html docs/html/node76.html docs/html/node77.html docs/html/node8.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/node9.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/commrout.tex docs/src/datastruct.tex docs/src/methods.tex docs/src/precs.tex docs/src/psbrout.tex docs/src/toolsrout.tex docs/src/userguide.tex docs/src/userhtml.tex Big users' guide update.
This commit is contained in:
Salvatore Filippone
+27
-27
@@ -72,8 +72,8 @@ call psb_hsort(x,ix,dir,flag)
|
||||
|
||||
<P>
|
||||
These serial routines sort a sequence <IMG
|
||||
WIDTH="19" HEIGHT="14" ALIGN="BOTTOM" BORDER="0"
|
||||
SRC="img108.png"
|
||||
WIDTH="18" HEIGHT="14" ALIGN="BOTTOM" BORDER="0"
|
||||
SRC="img109.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
|
||||
@@ -98,8 +98,8 @@ Specified as: an integer, real or complex array of rank 1.
|
||||
Type:<B>optional</B>.
|
||||
<BR>
|
||||
Specified as: an integer array of (at least) the same size as <IMG
|
||||
WIDTH="19" HEIGHT="14" ALIGN="BOTTOM" BORDER="0"
|
||||
SRC="img108.png"
|
||||
WIDTH="18" HEIGHT="14" ALIGN="BOTTOM" BORDER="0"
|
||||
SRC="img109.png"
|
||||
ALT="$X$">.
|
||||
</DD>
|
||||
<DT><STRONG>dir</STRONG></DT>
|
||||
@@ -122,8 +122,8 @@ default <code>psb_lsort_up_</code>.
|
||||
</DD>
|
||||
<DT><STRONG>flag</STRONG></DT>
|
||||
<DD>Whether to keep the original values in <IMG
|
||||
WIDTH="26" HEIGHT="14" ALIGN="BOTTOM" BORDER="0"
|
||||
SRC="img109.png"
|
||||
WIDTH="27" HEIGHT="14" ALIGN="BOTTOM" BORDER="0"
|
||||
SRC="img110.png"
|
||||
ALT="$IX$">.
|
||||
<BR>
|
||||
Type:<B>optional</B>.
|
||||
@@ -154,7 +154,7 @@ Type: <B>Optional</B>
|
||||
<BR>
|
||||
An integer array of rank 1, whose entries are moved to the same
|
||||
position as the corresponding entries in <IMG
|
||||
WIDTH="14" HEIGHT="13" ALIGN="BOTTOM" BORDER="0"
|
||||
WIDTH="14" HEIGHT="14" ALIGN="BOTTOM" BORDER="0"
|
||||
SRC="img25.png"
|
||||
ALT="$x$">.
|
||||
</DD>
|
||||
@@ -184,36 +184,36 @@ position as the corresponding entries in <IMG
|
||||
$flag = psb\_sort\_ovw\_idx\_$
|
||||
-->
|
||||
<IMG
|
||||
WIDTH="181" HEIGHT="30" ALIGN="MIDDLE" BORDER="0"
|
||||
SRC="img110.png"
|
||||
ALT="$flag = psb\_sort\_ovw\_idx\_$"> then the entries in <IMG
|
||||
WIDTH="61" HEIGHT="32" ALIGN="MIDDLE" BORDER="0"
|
||||
WIDTH="180" HEIGHT="30" ALIGN="MIDDLE" BORDER="0"
|
||||
SRC="img111.png"
|
||||
ALT="$flag = psb\_sort\_ovw\_idx\_$"> then the entries in <IMG
|
||||
WIDTH="62" HEIGHT="32" ALIGN="MIDDLE" BORDER="0"
|
||||
SRC="img112.png"
|
||||
ALT="$ix(1:n)$">
|
||||
where <IMG
|
||||
WIDTH="13" HEIGHT="13" ALIGN="BOTTOM" BORDER="0"
|
||||
WIDTH="13" HEIGHT="14" ALIGN="BOTTOM" BORDER="0"
|
||||
SRC="img16.png"
|
||||
ALT="$n$"> is the size of <IMG
|
||||
WIDTH="14" HEIGHT="13" ALIGN="BOTTOM" BORDER="0"
|
||||
WIDTH="14" HEIGHT="14" ALIGN="BOTTOM" BORDER="0"
|
||||
SRC="img25.png"
|
||||
ALT="$x$"> are initialized to <!-- MATH
|
||||
$ix(i) \leftarrow
|
||||
i$
|
||||
-->
|
||||
<IMG
|
||||
WIDTH="67" HEIGHT="32" ALIGN="MIDDLE" BORDER="0"
|
||||
SRC="img112.png"
|
||||
WIDTH="66" HEIGHT="32" ALIGN="MIDDLE" BORDER="0"
|
||||
SRC="img113.png"
|
||||
ALT="$ix(i) \leftarrow
|
||||
i$">; thus, upon return from the subroutine, for each
|
||||
index <IMG
|
||||
WIDTH="9" HEIGHT="17" ALIGN="BOTTOM" BORDER="0"
|
||||
SRC="img4.png"
|
||||
ALT="$i$"> we have in <IMG
|
||||
WIDTH="36" HEIGHT="32" ALIGN="MIDDLE" BORDER="0"
|
||||
SRC="img113.png"
|
||||
WIDTH="37" HEIGHT="32" ALIGN="MIDDLE" BORDER="0"
|
||||
SRC="img114.png"
|
||||
ALT="$ix(i)$"> the position that the item <IMG
|
||||
WIDTH="31" HEIGHT="32" ALIGN="MIDDLE" BORDER="0"
|
||||
SRC="img114.png"
|
||||
SRC="img115.png"
|
||||
ALT="$x(i)$">
|
||||
occupied in the original data sequence;
|
||||
</LI>
|
||||
@@ -221,25 +221,25 @@ i$">; thus, upon return from the subroutine, for each
|
||||
$flag = psb\_sort\_keep\_idx\_$
|
||||
-->
|
||||
<IMG
|
||||
WIDTH="184" HEIGHT="30" ALIGN="MIDDLE" BORDER="0"
|
||||
SRC="img115.png"
|
||||
WIDTH="185" HEIGHT="30" ALIGN="MIDDLE" BORDER="0"
|
||||
SRC="img116.png"
|
||||
ALT="$flag = psb\_sort\_keep\_idx\_$"> the routine will assume that
|
||||
the entries in <IMG
|
||||
WIDTH="36" HEIGHT="32" ALIGN="MIDDLE" BORDER="0"
|
||||
SRC="img116.png"
|
||||
WIDTH="35" HEIGHT="32" ALIGN="MIDDLE" BORDER="0"
|
||||
SRC="img117.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="img117.png"
|
||||
SRC="img118.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:
|
||||
|
||||
<OL>
|
||||
<LI>The worst case running time for quicksort is <IMG
|
||||
WIDTH="46" HEIGHT="34" ALIGN="MIDDLE" BORDER="0"
|
||||
SRC="img118.png"
|
||||
WIDTH="45" HEIGHT="34" ALIGN="MIDDLE" BORDER="0"
|
||||
SRC="img119.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,14 +247,14 @@ 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="img117.png"
|
||||
SRC="img118.png"
|
||||
ALT="$O(n \log n)$"> as the average case;
|
||||
</LI>
|
||||
<LI>The merge-sort algorithm is implemented to take advantage of
|
||||
subsequences that may be already in the desired ordering prior to
|
||||
the subroutine call; this situation is relatively common when
|
||||
dealing with groups of indices of sparse matrix entries, thus
|
||||
merge-sort is often the preferred choice when a sorting is needed
|
||||
merge-sort is the preferred choice when a sorting is needed
|
||||
by other routines in the library.
|
||||
</LI>
|
||||
</OL>
|
||||
|
||||
Reference in New Issue
Block a user