For each routine introduced in this chapter, you can use the ScaLAPACK name. The naming convention for ScaLAPACK routines is similar to that used for LAPACK routines (see Routine Naming Conventions). A general rule is that each routine name in ScaLAPACK, which has an LAPACK equivalent, is simply the LAPACK name prefixed by initial letter p.
ScaLAPACK names have the structure p?yyzzz or p?yyzz, which is described below.
The initial letter p is a distinctive prefix of ScaLAPACK routines and is present in each such routine.
The second symbol ? indicates the data type:
real, single precision
real, double precision
complex, single precision
complex, double precision
The second and third letters yy indicate the matrix type as:
general
general band
a pair of general matrices (for a generalized problem)
general tridiagonal (diagonally dominant-like)
general band (diagonally dominant-like)
symmetric or Hermitian positive-definite
symmetric or Hermitian positive-definite band
symmetric or Hermitian positive-definite tridiagonal
symmetric
symmetric tridiagonal (real)
Hermitian
orthogonal
triangular (or quasi-triangular)
trapezoidal
unitary
For computational routines, the last three letters zzz indicate the computation performed and have the same meaning as for LAPACK routines.
For driver routines, the last two letters zz or three letters zzz have the following meaning:
a simple driver for solving a linear system
an expert driver for solving a linear system
a driver for solving a linear least squares problem
a simple driver for solving a symmetric eigenvalue problem
a simple driver for solving an eigenvalue problem using a divide and conquer algorithm
an expert driver for solving a symmetric eigenvalue problem
a driver for computing a singular value decomposition
an expert driver for solving a generalized symmetric definite eigenvalue problem
Simple driver here means that the driver just solves the general problem, whereas an expert driver is more versatile and can also optionally perform some related computations (such, for example, as refining the solution and computing error bounds after the linear system is solved).
Copyright © 1994 - 2011, Intel Corporation. All rights reserved.