1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69
|
<!DOCTYPE HTML PUBLIC "-//IETF//DTD HTML 2.0//EN">
<!--Converted with LaTeX2HTML 96.1-h (September 30, 1996) by Nikos Drakos (nikos@cbl.leeds.ac.uk), CBLU, University of Leeds -->
<HTML>
<HEAD>
<TITLE>Structure and Functionality</TITLE>
<META NAME="description" CONTENT="Structure and Functionality">
<META NAME="keywords" CONTENT="slug">
<META NAME="resource-type" CONTENT="document">
<META NAME="distribution" CONTENT="global">
<LINK REL=STYLESHEET HREF="slug.css">
</HEAD>
<BODY LANG="EN" >
<A NAME="tex2html2239" HREF="node11.html"><IMG WIDTH=37 HEIGHT=24 ALIGN=BOTTOM ALT="next" SRC="http://www.netlib.org/utk/icons/next_motif.gif"></A> <A NAME="tex2html2237" HREF="node8.html"><IMG WIDTH=26 HEIGHT=24 ALIGN=BOTTOM ALT="up" SRC="http://www.netlib.org/utk/icons/up_motif.gif"></A> <A NAME="tex2html2231" HREF="node9.html"><IMG WIDTH=63 HEIGHT=24 ALIGN=BOTTOM ALT="previous" SRC="http://www.netlib.org/utk/icons/previous_motif.gif"></A> <A NAME="tex2html2241" HREF="node1.html"><IMG WIDTH=65 HEIGHT=24 ALIGN=BOTTOM ALT="contents" SRC="http://www.netlib.org/utk/icons/contents_motif.gif"></A> <A NAME="tex2html2242" HREF="node190.html"><IMG WIDTH=43 HEIGHT=24 ALIGN=BOTTOM ALT="index" SRC="http://www.netlib.org/utk/icons/index_motif.gif"></A> <BR>
<B> Next:</B> <A NAME="tex2html2240" HREF="node11.html">Software Components</A>
<B>Up:</B> <A NAME="tex2html2238" HREF="node8.html">Essentials</A>
<B> Previous:</B> <A NAME="tex2html2232" HREF="node9.html">ScaLAPACK</A>
<BR> <P>
<H1><A NAME="SECTION04120000000000000000">Structure and Functionality</A></H1>
<A NAME="structure"> </A><A NAME="374"> </A>
<P>
ScaLAPACK can solve systems of linear equations, linear least squares
problems, eigenvalue problems, and singular value problems.
ScaLAPACK can also handle many
associated computations such as matrix factorizations<A NAME="375"> </A>
or estimating condition numbers.
<P>
Like LAPACK, the ScaLAPACK
routines are based on block-partitioned algorithms<A NAME="376"> </A><A NAME="377"> </A> in order to minimize the
frequency of data movement between different levels of the memory hierarchy<A NAME="378"> </A><A NAME="379"> </A>.
The fundamental building blocks of the ScaLAPACK library are distributed-memory<A NAME="380"> </A> versions of the Level 1,
Level 2, and Level 3 BLAS, called the Parallel
BLAS or PBLAS [<A HREF="node189.html#lawn100">26</A>, <A HREF="node189.html#petitet96a">104</A>], and a set of Basic Linear Algebra Communication
Subprograms (BLACS) [<A HREF="node189.html#lawn94">54</A>]
for communication
tasks that arise frequently in parallel linear algebra computations.
In the ScaLAPACK routines, the majority of interprocessor communication occurs
within the PBLAS, so the source code of
the top software layer of ScaLAPACK looks similar to that of LAPACK.
<P>
ScaLAPACK contains <B>driver routines</B><A NAME="384"> </A> for solving standard types of
problems,
<B>computational routines</B><A NAME="386"> </A> to perform a distinct
computational task, and <B>auxiliary routines</B><A NAME="388"> </A>
to perform a certain
subtask or common low-level computation. Each driver routine
typically calls a sequence of
computational routines. Taken as a whole, the computational routines
can perform a wider range of tasks than are covered by the driver
routines.
Many of the auxiliary routines may be of use to numerical analysts
or software developers, so we have documented the Fortran source for
these routines with the same level of detail used for the ScaLAPACK
computational routines and driver routines.
<P>
Dense and band matrices are provided for,
but not general sparse matrices. Similar functionality
is provided for real and complex matrices.
See Chapter <A HREF="node38.html#chapcontents">3</A> for a complete summary of the
contents.
<P>
Not all the facilities of LAPACK are covered by Release 1.5 of ScaLAPACK.
<P>
<BR> <HR>
<P><ADDRESS>
<I>Susan Blackford <BR>
Tue May 13 09:21:01 EDT 1997</I>
</ADDRESS>
</BODY>
</HTML>
|