fdurastante/psblas3
1
0
Fork 0
mirror of https://github.com/sfilippone/psblas3.git synced 2026-10-16 10:52:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

Document DESC%CNV method and MOLD arguments to CDASB and PREC%BUILD

Browse Source
This commit is contained in:
Salvatore Filippone
2017-12-14 17:09:59 +00:00
parent 4beef03aec
commit c3633b6fb2
140 changed files with 24695 additions and 24798 deletions
Download Patch File Download Diff File Expand all files Collapse all files
docs/html/node50.html
+51 -61
View File
@@ -1,97 +1,87 @@
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<!--Converted with LaTeX2HTML 2012 (1.2)
original version by: Nikos Drakos, CBLU, University of Leeds
* revised and updated by: Marcus Hennecke, Ross Moore, Herb Swan
* with significant contributions from:
Jens Lippmann, Marek Rouchal, Martin Wilck and others -->
<!--Converted with LaTeX2HTML 2017.2 (Released Jan 23, 2017) -->
<HTML>
<HEAD>
<TITLE>Heap data structure</TITLE>
<META NAME="description" CONTENT="Heap data structure">
<TITLE>Preconditioner data structure</TITLE>
<META NAME="description" CONTENT="Preconditioner data structure">
<META NAME="keywords" CONTENT="userhtml">
<META NAME="resource-type" CONTENT="document">
<META NAME="distribution" CONTENT="global">
<META NAME="Generator" CONTENT="LaTeX2HTML v2012">
<META NAME="Generator" CONTENT="LaTeX2HTML v2017.2">
<META HTTP-EQUIV="Content-Style-Type" CONTENT="text/css">
<LINK REL="STYLESHEET" HREF="userhtml.css">
<LINK REL="previous" HREF="node49.html">
<LINK REL="next" HREF="node51.html">
<LINK REL="previous" HREF="node43.html">
<LINK REL="up" HREF="node9.html">
<LINK REL="next" HREF="node51.html">
</HEAD>
<BODY >
<!--Navigation Panel-->
<A NAME="tex2html858"
<DIV CLASS="navigation"><!--Navigation Panel-->
<A NAME="tex2html863"
HREF="node51.html">
<IMG WIDTH="37" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="next" SRC="next.png"></A>
<A NAME="tex2html854"
<A NAME="tex2html859"
HREF="node9.html">
<IMG WIDTH="26" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="up" SRC="up.png"></A>
<A NAME="tex2html850"
<A NAME="tex2html853"
HREF="node49.html">
<IMG WIDTH="63" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="previous" SRC="prev.png"></A>
<A NAME="tex2html856"
<A NAME="tex2html861"
HREF="node1.html">
<IMG WIDTH="65" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="contents" SRC="contents.png"></A>
<BR>
<B> Next:</B> <A NAME="tex2html859"
HREF="node51.html">Computational routines</A>
<B> Up:</B> <A NAME="tex2html855"
<B> Next:</B> <A NAME="tex2html864"
HREF="node51.html">Heap data structure</A>
<B> Up:</B> <A NAME="tex2html860"
HREF="node9.html">Data Structures and Classes</A>
<B> Previous:</B> <A NAME="tex2html851"
HREF="node49.html">Preconditioner data structure</A>
&nbsp; <B> <A NAME="tex2html857"
<B> Previous:</B> <A NAME="tex2html854"
HREF="node49.html">clone Clone</A>
&nbsp; <B> <A NAME="tex2html862"
HREF="node1.html">Contents</A></B>
<BR>
<BR>
<BR></DIV>
<!--End of Navigation Panel-->
<H2><A NAME="SECTION00045000000000000000">
Heap data structure</A>
<H2><A NAME="SECTION00044000000000000000"></A>
<A NAME="sec:prec"></A>
<BR>
Preconditioner data structure
</H2>
Our base library offers support for simple well known preconditioners
like Diagonal Scaling or Block Jacobi with incomplete
factorization ILU(0).
<P>
Among the tools routines of sec.&nbsp;<A HREF="node70.html#sec:toolsrout">6</A>, we have a number
of sorting utilities; the heap sort is implemented in terms of heaps
having the following signatures:
<DL>
<DT><STRONG><TT>psb_T_heap</TT></STRONG></DT>
<DD>: a heap containing elements of type T, where T
can be <code>i,s,c,d,z</code> for integer, real and complex data;
</DD>
<DT><STRONG><TT>psb_T_idx_heap</TT></STRONG></DT>
<DD>: a heap containing elements of type T, as
above, together with an integer index.
</DD>
</DL>
Given a heap object, the following methods are defined on it:
<DL>
<DT><STRONG>init</STRONG></DT>
<DD>Initialize memory; also choose ascending or descending
order;
</DD>
<DT><STRONG>howmany</STRONG></DT>
<DD>Current heap occupancy;
</DD>
<DT><STRONG>insert</STRONG></DT>
<DD>Add an item (or an item and its index);
</DD>
<DT><STRONG>get_first</STRONG></DT>
<DD>Remove and return the first element;
</DD>
<DT><STRONG>dump</STRONG></DT>
<DD>Print on file;
</DD>
<DT><STRONG>free</STRONG></DT>
<DD>Release memory.
</DD>
</DL>
These objects are used in MLD2P4 to implement the factorization
algorithms.
A preconditioner is held in the precdata<TT> psb_prec_type</TT> data structure reported in
figure&nbsp;<A HREF="#fig:prectype">6</A>. The <code>psb_prec_type</code>
data type may contain a simple preconditioning matrix with the
associated communication descriptor.
The internal preconditioner is allocated appropriately with the
dynamic type corresponding to the desired preconditioner.
<DIV ALIGN="CENTER"><A NAME="fig:prectype"></A><A NAME="939"></A>
<TABLE>
<CAPTION ALIGN="BOTTOM"><STRONG>Figure 6:</STRONG>
The PSBLAS defined data type that contains a preconditioner.</CAPTION>
<TR><TD><SMALL CLASS="SMALL">
</SMALL>
<DIV ALIGN="CENTER"></DIV><TABLE WIDTH="90%">
<TR><TD>
<PRE>
type psb_Tprec_type
class(psb_T_base_prec_type), allocatable :: prec
end type psb_Tprec_type
</PRE></TD></TR>
</TABLE>
<DIV ALIGN="CENTER"></DIV></TD></TR>
</TABLE>
</DIV>
<P>
<BR><HR>