

 
TOPIC:
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
#
SECTION:
1
2
3
4
5
6
7
8
9
n
l
 artsagg(l)  utility to aggregate ARTS objects in time domain
 artsasagg(l)  utility to aggregate AS matrix objects in time domain
 artsases(l)  utility to display AS matrix objects from ARTS files
 artsdump(l)  utility to dump an ARTS file to stdout in a humanreadable format
 artsintfmagg(l)  utility to aggregate interface matrix objects in time domain
 artsintfms(l)  utility to display interface matrix objects from ARTS files
 artsnetagg(l)  utility to aggregate net matrix objects in time domain
 artsnets(l)  utility to display net matrix objects from ARTS files
 artsnexthopagg(l)  utility to aggregate nexthop table objects in time domain
 artsnexthops(l)  utility to display IP nexthop table objects from ARTS files
 artsportagg(l)  utility to aggregate port table objects in time domain
 artsportmagg(l)  utility to aggregate port matrix objects in time domain
 artsportms(l)  utility to display port matrix objects from ARTS files
 artsports(l)  utility to display port table objects from ARTS files
 artsprotoagg(l)  utility to aggregate protocol table objects in time domain
 artsprotos(l)  utility to display protocol table objects from ARTS files
 artstoc(l)  utility to display oneline summary of ARTS objects from ARTS files
 artstos(l)  utility to display TOS table objects from ARTS files
 avs2ps(l)  convert AVS image input on stdin to monochrome PostScript on stdout
 balls(l)  preprocessor for spacefilling models in Raster3D molecular graphics package
 cdbtf2(l)  compute an LU factorization of a real mbyn band matrix A without using partial pivoting with row interchanges
 cdbtf2(l)  compute an LU factorization of a real mbyn band matrix A without using partial pivoting with row interchanges
 cdbtrf(l)  compute an LU factorization of a real mbyn band matrix A without using partial pivoting or row interchanges
 cdbtrf(l)  compute an LU factorization of a real mbyn band matrix A without using partial pivoting or row interchanges
 cdttrf(l)  compute an LU factorization of a complex tridiagonal matrix A using elimination without partial pivoting
 cdttrf(l)  compute an LU factorization of a complex tridiagonal matrix A using elimination without partial pivoting
 cdttrsv(l)  solve one of the systems of equations L * X = B, L**T * X = B, or L**H * X = B,
 cdttrsv(l)  solve one of the systems of equations L * X = B, L**T * X = B, or L**H * X = B,
 clahqr2(l)  i an auxiliary routine called by CHSEQR to update the eigenvalues and Schur decomposition already computed by CHSEQR, by dealing with the Hessenberg submatrix in rows and columns ILO to IHI
 clahqr2(l)  i an auxiliary routine called by CHSEQR to update the eigenvalues and Schur decomposition already computed by CHSEQR, by dealing with the Hessenberg submatrix in rows and columns ILO to IHI
 clamsh(l)  send multiple shifts through a small
 clamsh(l)  send multiple shifts through a small
 clanv2(l)  compute the Schur factorization of a complex 2by2 nonhermitian matrix in standard form
 clanv2(l)  compute the Schur factorization of a complex 2by2 nonhermitian matrix in standard form
 claref(l)  applie one or several Householder reflectors of size 3 to one or two matrices
 claref(l)  applie one or several Householder reflectors of size 3 to one or two matrices
 cpttrsv(l)  solve one of the triangular systems L * X = B, or L**H * X = B,
 cpttrsv(l)  solve one of the triangular systems L * X = B, or L**H * X = B,
 csteqr2(l)  i a modified version of LAPACK routine CSTEQR
 csteqr2(l)  i a modified version of LAPACK routine CSTEQR
 cstrc(l)  convert between ANSI Cstrings and strings
 cstrd(l)  cstrd
 ctrmvt(l)  perform the matrixvector operations x := conjg
 ctrmvt(l)  perform the matrixvector operations x := conjg
 ddbtf2(l)  compute an LU factorization of a real mbyn band matrix A without using partial pivoting with row interchanges
 ddbtf2(l)  compute an LU factorization of a real mbyn band matrix A without using partial pivoting with row interchanges
 ddbtrf(l)  compute an LU factorization of a real mbyn band matrix A without using partial pivoting or row interchanges
 ddbtrf(l)  compute an LU factorization of a real mbyn band matrix A without using partial pivoting or row interchanges
 ddttrf(l)  compute an LU factorization of a complex tridiagonal matrix A using elimination without partial pivoting
 ddttrf(l)  compute an LU factorization of a complex tridiagonal matrix A using elimination without partial pivoting
 ddttrsv(l)  solve one of the systems of equations L * X = B, L**T * X = B, or L**H * X = B,
 ddttrsv(l)  solve one of the systems of equations L * X = B, L**T * X = B, or L**H * X = B,
 dlamsh(l)  send multiple shifts through a small
 dlamsh(l)  send multiple shifts through a small
 dlapst(l)  Define a permutation INDX that sorts the numbers in D in increasing order
 dlapst(l)  Define a permutation INDX that sorts the numbers in D in increasing order
 dlaref(l)  applie one or several Householder reflectors of size 3 to one or two matrices
 dlaref(l)  applie one or several Householder reflectors of size 3 to one or two matrices
 dlasorte(l)  sort eigenpairs so that real eigenpairs are together and complex are together
 dlasorte(l)  sort eigenpairs so that real eigenpairs are together and complex are together
 dlasrt2(l)  the numbers in D in increasing order
 dlasrt2(l)  the numbers in D in increasing order
 dpttrsv(l)  solve one of the triangular systems L**T* X = B, or L * X = B,
 dpttrsv(l)  solve one of the triangular systems L**T* X = B, or L * X = B,
 dstein2(l)  compute the eigenvectors of a real symmetric tridiagonal matrix T corresponding to specified eigenvalues, using inverse iteration
 dstein2(l)  compute the eigenvectors of a real symmetric tridiagonal matrix T corresponding to specified eigenvalues, using inverse iteration
 dsteqr2(l)  i a modified version of LAPACK routine DSTEQR
 dsteqr2(l)  i a modified version of LAPACK routine DSTEQR
 dtrmvt(l)  perform the matrixvector operations x := T' *y, and w := T *z,
 dtrmvt(l)  perform the matrixvector operations x := T' *y, and w := T *z,
 dx(l)  start the Data Explorer visualization system. Optionally directly start the User Interface
 frame(3)  frames of text
 getfields(3)  break a string into fields
 getmfields(l)  getmfields
 idea(1)  launch IntelliJ IDEA Java Integrated Development Environment
 Intro(l)  introduction to BEGEMOT library
 intro(1)  introduction to general commands
 label3d(l)  process a Raster3D scene containing labels
 normal3d(l)  apply transformation matrix in Raster3D input file
 panic(9)  bring down system on fatal error
 pbm2hp(l)  printer driver of PBMP4file for HP Laserjet printers
 pbmrot90(l)  rotates a PBMP4file by 90 degree
 pbmshift(l)  shift a PBMP4file to the right lower corner
 pcdbsv(l)  solve a system of linear equations A
 pcdbsv(l)  solve a system of linear equations A
 pcdbtrf(l)  compute a LU factorization of an NbyN complex banded diagonally dominantlike distributed matrix with bandwidth BWL, BWU
 pcdbtrf(l)  compute a LU factorization of an NbyN complex banded diagonally dominantlike distributed matrix with bandwidth BWL, BWU
 pcdbtrs(l)  solve a system of linear equations A
 pcdbtrs(l)  solve a system of linear equations A
 pcdbtrsv(l)  solve a banded triangular system of linear equations A
 pcdbtrsv(l)  solve a banded triangular system of linear equations A
 pcdtsv(l)  solve a system of linear equations A
 pcdtsv(l)  solve a system of linear equations A
 pcdttrf(l)  compute a LU factorization of an NbyN complex tridiagonal diagonally dominantlike distributed matrix A
 pcdttrf(l)  compute a LU factorization of an NbyN complex tridiagonal diagonally dominantlike distributed matrix A
 pcdttrs(l)  solve a system of linear equations A
 pcdttrs(l)  solve a system of linear equations A
 pcdttrsv(l)  solve a tridiagonal triangular system of linear equations A
 pcdttrsv(l)  solve a tridiagonal triangular system of linear equations A
 pcgbsv(l)  solve a system of linear equations A
 pcgbsv(l)  solve a system of linear equations A
 pcgbtrf(l)  compute a LU factorization of an NbyN complex banded distributed matrix with bandwidth BWL, BWU
 pcgbtrf(l)  compute a LU factorization of an NbyN complex banded distributed matrix with bandwidth BWL, BWU
 pcgbtrs(l)  solve a system of linear equations A
 pcgbtrs(l)  solve a system of linear equations A
 pcgebd2(l)  reduce a complex general MbyN distributed matrix sub
 pcgebd2(l)  reduce a complex general MbyN distributed matrix sub
 pcgebrd(l)  reduce a complex general MbyN distributed matrix sub
 pcgebrd(l)  reduce a complex general MbyN distributed matrix sub
 pcgecon(l)  estimate the reciprocal of the condition number of a general distributed complex matrix A
 pcgecon(l)  estimate the reciprocal of the condition number of a general distributed complex matrix A
 pcgeequ(l)  compute row and column scalings intended to equilibrate an MbyN distributed matrix sub
 pcgeequ(l)  compute row and column scalings intended to equilibrate an MbyN distributed matrix sub
 pcgehd2(l)  reduce a complex general distributed matrix sub
 pcgehd2(l)  reduce a complex general distributed matrix sub
 pcgehrd(l)  reduce a complex general distributed matrix sub
 pcgehrd(l)  reduce a complex general distributed matrix sub
 pcgelq2(l)  compute a LQ factorization of a complex distributed MbyN matrix sub
 pcgelq2(l)  compute a LQ factorization of a complex distributed MbyN matrix sub
 pcgelqf(l)  compute a LQ factorization of a complex distributed MbyN matrix sub
 pcgelqf(l)  compute a LQ factorization of a complex distributed MbyN matrix sub
 pcgels(l)  solve overdetermined or underdetermined complex linear systems involving an MbyN matrix sub
 pcgels(l)  solve overdetermined or underdetermined complex linear systems involving an MbyN matrix sub
 pcgeql2(l)  compute a QL factorization of a complex distributed MbyN matrix sub
 pcgeql2(l)  compute a QL factorization of a complex distributed MbyN matrix sub
 pcgeqlf(l)  compute a QL factorization of a complex distributed MbyN matrix sub
 pcgeqlf(l)  compute a QL factorization of a complex distributed MbyN matrix sub
 pcgeqpf(l)  compute a QR factorization with column pivoting of a MbyN distributed matrix sub
 pcgeqpf(l)  compute a QR factorization with column pivoting of a MbyN distributed matrix sub
 pcgeqr2(l)  compute a QR factorization of a complex distributed MbyN matrix sub
 pcgeqr2(l)  compute a QR factorization of a complex distributed MbyN matrix sub
 pcgeqrf(l)  compute a QR factorization of a complex distributed MbyN matrix sub
 pcgeqrf(l)  compute a QR factorization of a complex distributed MbyN matrix sub
 pcgerfs(l)  improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solutions
 pcgerfs(l)  improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solutions
 pcgerq2(l)  compute a RQ factorization of a complex distributed MbyN matrix sub
 pcgerq2(l)  compute a RQ factorization of a complex distributed MbyN matrix sub
 pcgerqf(l)  compute a RQ factorization of a complex distributed MbyN matrix sub
 pcgerqf(l)  compute a RQ factorization of a complex distributed MbyN matrix sub
 pcgesv(l)  compute the solution to a complex system of linear equations sub
 pcgesv(l)  compute the solution to a complex system of linear equations sub
 pcgesvx(l)  use the LU factorization to compute the solution to a complex system of linear equations A
 pcgesvx(l)  use the LU factorization to compute the solution to a complex system of linear equations A
 pcgetf2(l)  compute an LU factorization of a general MbyN distributed matrix sub
 pcgetf2(l)  compute an LU factorization of a general MbyN distributed matrix sub
 pcgetrf(l)  compute an LU factorization of a general MbyN distributed matrix sub
 pcgetrf(l)  compute an LU factorization of a general MbyN distributed matrix sub
 pcgetri(l)  compute the inverse of a distributed matrix using the LU factorization computed by PCGETRF
 pcgetri(l)  compute the inverse of a distributed matrix using the LU factorization computed by PCGETRF
 pcgetrs(l)  solve a system of distributed linear equations op
 pcgetrs(l)  solve a system of distributed linear equations op
 pcggqrf(l)  compute a generalized QR factorization of an NbyM matrix sub
 pcggqrf(l)  compute a generalized QR factorization of an NbyM matrix sub
 pcggrqf(l)  compute a generalized RQ factorization of an MbyN matrix sub
 pcggrqf(l)  compute a generalized RQ factorization of an MbyN matrix sub
 pcheevd(l)  compute all the eigenvalues and eigenvectors of a Hermitian matrix A by using a divide and conquer algorithm
 pcheevd(l)  compute all the eigenvalues and eigenvectors of a Hermitian matrix A by using a divide and conquer algorithm
 pcheev(l)  compute selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix A by calling the recommended sequence of ScaLAPACK routines
 pcheev(l)  compute selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix A by calling the recommended sequence of ScaLAPACK routines
 pcheevx(l)  compute selected eigenvalues and, optionally, eigenvectors of a complex hermitian matrix A by calling the recommended sequence of ScaLAPACK routines
 pcheevx(l)  compute selected eigenvalues and, optionally, eigenvectors of a complex hermitian matrix A by calling the recommended sequence of ScaLAPACK routines
 pchegs2(l)  reduce a complex Hermitiandefinite generalized eigenproblem to standard form
 pchegs2(l)  reduce a complex Hermitiandefinite generalized eigenproblem to standard form
 pchegst(l)  reduce a complex Hermitiandefinite generalized eigenproblem to standard form
 pchegst(l)  reduce a complex Hermitiandefinite generalized eigenproblem to standard form
 pchetd2(l)  reduce a complex Hermitian matrix sub
 pchetd2(l)  reduce a complex Hermitian matrix sub
 pchetrd(l)  reduce a complex Hermitian matrix sub
 pchetrd(l)  reduce a complex Hermitian matrix sub
 pclabrd(l)  reduce the first NB rows and columns of a complex general MbyN distributed matrix sub
 pclabrd(l)  reduce the first NB rows and columns of a complex general MbyN distributed matrix sub
 pclacgv(l)  conjugate a complex vector of length N, sub
 pclacgv(l)  conjugate a complex vector of length N, sub
 pclacon(l)  estimate the 1norm of a square, complex distributed matrix A
 pclacon(l)  estimate the 1norm of a square, complex distributed matrix A
 pclaconsb(l)  look for two consecutive small subdiagonal elements by seeing the effect of starting a double shift QR iteration given by H44, H33, & H43H34 and see if this would make a subdiagonal negligible
 pclaconsb(l)  look for two consecutive small subdiagonal elements by seeing the effect of starting a double shift QR iteration given by H44, H33, & H43H34 and see if this would make a subdiagonal negligible
 pclacp2(l)  copie all or part of a distributed matrix A to another distributed matrix B
 pclacp2(l)  copie all or part of a distributed matrix A to another distributed matrix B
 pclacp3(l)  i an auxiliary routine that copies from a global parallel array into a local replicated array or vise versa
 pclacp3(l)  i an auxiliary routine that copies from a global parallel array into a local replicated array or vise versa
 pclacpy(l)  copie all or part of a distributed matrix A to another distributed matrix B
 pclacpy(l)  copie all or part of a distributed matrix A to another distributed matrix B
 pclaevswp(l)  move the eigenvectors
 pclaevswp(l)  move the eigenvectors
 pclahqr(l)  i an auxiliary routine used to find the Schur decomposition and or eigenvalues of a matrix already in Hessenberg form from cols ILO to IHI
 pclahqr(l)  i an auxiliary routine used to find the Schur decomposition and or eigenvalues of a matrix already in Hessenberg form from cols ILO to IHI
 pclahrd(l)  reduce the first NB columns of a complex general Nby
 pclahrd(l)  reduce the first NB columns of a complex general Nby
 pclange(l)  return the value of the one norm, or the Frobenius norm,
 pclange(l)  return the value of the one norm, or the Frobenius norm,
 pclanhe(l)  return the value of the one norm, or the Frobenius norm,
 pclanhe(l)  return the value of the one norm, or the Frobenius norm,
 pclanhs(l)  return the value of the one norm, or the Frobenius norm,
 pclanhs(l)  return the value of the one norm, or the Frobenius norm,
 pclansy(l)  return the value of the one norm, or the Frobenius norm,
 pclansy(l)  return the value of the one norm, or the Frobenius norm,
 pclantr(l)  return the value of the one norm, or the Frobenius norm,
 pclantr(l)  return the value of the one norm, or the Frobenius norm,
 pclapiv(l)  applie either P
 pclapiv(l)  applie either P
 pclapv2(l)  applie either P
 pclapv2(l)  applie either P
 pclaqge(l)  equilibrate a general MbyN distributed matrix sub
 pclaqge(l)  equilibrate a general MbyN distributed matrix sub
 pclaqsy(l)  equilibrate a symmetric distributed matrix sub
 pclaqsy(l)  equilibrate a symmetric distributed matrix sub
 pclarfb(l)  applie a complex block reflector Q or its conjugate transpose Q**H to a complex MbyN distributed matrix sub
 pclarfb(l)  applie a complex block reflector Q or its conjugate transpose Q**H to a complex MbyN distributed matrix sub
 pclarfc(l)  applie a complex elementary reflector Q**H to a complex MbyN distributed matrix sub
 pclarfc(l)  applie a complex elementary reflector Q**H to a complex MbyN distributed matrix sub
 pclarfg(l)  generate a complex elementary reflector H of order n, such that H * sub
 pclarfg(l)  generate a complex elementary reflector H of order n, such that H * sub
 pclarf(l)  applie a complex elementary reflector Q to a complex MbyN distributed matrix sub
 pclarf(l)  applie a complex elementary reflector Q to a complex MbyN distributed matrix sub
 pclarft(l)  form the triangular factor T of a complex block reflector H of order n, which is defined as a product of k elementary reflectors
 pclarft(l)  form the triangular factor T of a complex block reflector H of order n, which is defined as a product of k elementary reflectors
 pclarzb(l)  applie a complex block reflector Q or its conjugate transpose Q**H to a complex MbyN distributed matrix sub
 pclarzb(l)  applie a complex block reflector Q or its conjugate transpose Q**H to a complex MbyN distributed matrix sub
 pclarzc(l)  applie a complex elementary reflector Q**H to a complex MbyN distributed matrix sub
 pclarzc(l)  applie a complex elementary reflector Q**H to a complex MbyN distributed matrix sub
 pclarz(l)  applie a complex elementary reflector Q to a complex MbyN distributed matrix sub
 pclarz(l)  applie a complex elementary reflector Q to a complex MbyN distributed matrix sub
 pclarzt(l)  form the triangular factor T of a complex block reflector H of order > n, which is defined as a product of k elementary reflectors as returned by PCTZRZF
 pclarzt(l)  form the triangular factor T of a complex block reflector H of order > n, which is defined as a product of k elementary reflectors as returned by PCTZRZF
 pclascl(l)  multiplie the MbyN complex distributed matrix sub
 pclascl(l)  multiplie the MbyN complex distributed matrix sub
 pclase2(l)  initialize an MbyN distributed matrix sub
 pclase2(l)  initialize an MbyN distributed matrix sub
 pclaset(l)  initialize an MbyN distributed matrix sub
 pclaset(l)  initialize an MbyN distributed matrix sub
 pclasmsub(l)  look for a small subdiagonal element from the bottom of the matrix that it can safely set to zero
 pclasmsub(l)  look for a small subdiagonal element from the bottom of the matrix that it can safely set to zero
 pclassq(l)  return the values scl and smsq such that
 pclassq(l)  return the values scl and smsq such that
 pclaswp(l)  perform a series of row or column interchanges on the distributed matrix sub
 pclaswp(l)  perform a series of row or column interchanges on the distributed matrix sub
 pclatra(l)  compute the trace of an NbyN distributed matrix sub
 pclatra(l)  compute the trace of an NbyN distributed matrix sub
 pclatrd(l)  reduce NB rows and columns of a complex Hermitian distributed matrix sub
 pclatrd(l)  reduce NB rows and columns of a complex Hermitian distributed matrix sub
 pclatrs(l)  solve a triangular system
 pclatrs(l)  solve a triangular system
 pclatrz(l)  reduce the MbyN
 pclatrz(l)  reduce the MbyN
 pclattrs(l)  solve one of the triangular systems A * x = s*b, A**T * x = s*b, or A**H * x = s*b,
 pclattrs(l)  solve one of the triangular systems A * x = s*b, A**T * x = s*b, or A**H * x = s*b,
 pclauu2(l)  compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the matrix sub
 pclauu2(l)  compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the matrix sub
 pclauum(l)  compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the distributed matrix sub
 pclauum(l)  compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the distributed matrix sub
 pclawil(l)  get the transform given by H44,H33, & H43H34 into V starting at row M
 pclawil(l)  get the transform given by H44,H33, & H43H34 into V starting at row M
 pcmax1(l)  compute the global index of the maximum element in absolute value of a distributed vector sub
 pcmax1(l)  compute the global index of the maximum element in absolute value of a distributed vector sub
 pcpbsv(l)  solve a system of linear equations A
 pcpbsv(l)  solve a system of linear equations A
 pcpbtrf(l)  compute a Cholesky factorization of an NbyN complex banded symmetric positive definite distributed matrix with bandwidth BW
 pcpbtrf(l)  compute a Cholesky factorization of an NbyN complex banded symmetric positive definite distributed matrix with bandwidth BW
 pcpbtrs(l)  solve a system of linear equations A
 pcpbtrs(l)  solve a system of linear equations A
 pcpbtrsv(l)  solve a banded triangular system of linear equations A
 pcpbtrsv(l)  solve a banded triangular system of linear equations A
 pcpocon(l)  estimate the reciprocal of the condition number
 pcpocon(l)  estimate the reciprocal of the condition number
 pcpoequ(l)  compute row and column scalings intended to equilibrate a distributed Hermitian positive definite matrix sub
 pcpoequ(l)  compute row and column scalings intended to equilibrate a distributed Hermitian positive definite matrix sub
 pcporfs(l)  improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and provides error bounds and backward error estimates for the solutions
 pcporfs(l)  improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and provides error bounds and backward error estimates for the solutions
 pcposv(l)  compute the solution to a complex system of linear equations sub
 pcposv(l)  compute the solution to a complex system of linear equations sub
 pcposvx(l)  use the Cholesky factorization A = U**H*U or A = L*L**H to compute the solution to a complex system of linear equations A
 pcposvx(l)  use the Cholesky factorization A = U**H*U or A = L*L**H to compute the solution to a complex system of linear equations A
 pcpotf2(l)  compute the Cholesky factorization of a complex hermitian positive definite distributed matrix sub
 pcpotf2(l)  compute the Cholesky factorization of a complex hermitian positive definite distributed matrix sub
 pcpotrf(l)  compute the Cholesky factorization of an NbyN complex hermitian positive definite distributed matrix sub
 pcpotrf(l)  compute the Cholesky factorization of an NbyN complex hermitian positive definite distributed matrix sub
 pcpotri(l)  compute the inverse of a complex Hermitian positive definite distributed matrix sub
 pcpotri(l)  compute the inverse of a complex Hermitian positive definite distributed matrix sub
 pcpotrs(l)  solve a system of linear equations sub
 pcpotrs(l)  solve a system of linear equations sub
 pcptsv(l)  solve a system of linear equations A
 pcptsv(l)  solve a system of linear equations A
 pcpttrf(l)  compute a Cholesky factorization of an NbyN complex tridiagonal symmetric positive definite distributed matrix A
 pcpttrf(l)  compute a Cholesky factorization of an NbyN complex tridiagonal symmetric positive definite distributed matrix A
 pcpttrs(l)  solve a system of linear equations A
 pcpttrs(l)  solve a system of linear equations A
 pcpttrsv(l)  solve a tridiagonal triangular system of linear equations A
 pcpttrsv(l)  solve a tridiagonal triangular system of linear equations A
 pcsrscl(l)  multiplie an Nelement complex distributed vector sub
 pcsrscl(l)  multiplie an Nelement complex distributed vector sub
 pcstein(l)  compute the eigenvectors of a symmetric tridiagonal matrix in parallel, using inverse iteration
 pcstein(l)  compute the eigenvectors of a symmetric tridiagonal matrix in parallel, using inverse iteration
 pctrcon(l)  estimate the reciprocal of the condition number of a triangular distributed matrix A
 pctrcon(l)  estimate the reciprocal of the condition number of a triangular distributed matrix A
 pctrevc(l)  compute some or all of the right and/or left eigenvectors of a complex upper triangular matrix T in parallel
 pctrevc(l)  compute some or all of the right and/or left eigenvectors of a complex upper triangular matrix T in parallel
 pctrrfs(l)  provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix
 pctrrfs(l)  provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix
 pctrti2(l)  compute the inverse of a complex upper or lower triangular block matrix sub
 pctrti2(l)  compute the inverse of a complex upper or lower triangular block matrix sub
 pctrtri(l)  compute the inverse of a upper or lower triangular distributed matrix sub
 pctrtri(l)  compute the inverse of a upper or lower triangular distributed matrix sub
 pctrtrs(l)  solve a triangular system of the form sub
 pctrtrs(l)  solve a triangular system of the form sub
 pctzrzf(l)  reduce the MbyN
 pctzrzf(l)  reduce the MbyN
 pcung2l(l)  generate an MbyN complex distributed matrix Q denoting A
 pcung2l(l)  generate an MbyN complex distributed matrix Q denoting A
 pcung2r(l)  generate an MbyN complex distributed matrix Q denoting A
 pcung2r(l)  generate an MbyN complex distributed matrix Q denoting A
 pcungl2(l)  generate an MbyN complex distributed matrix Q denoting A
 pcungl2(l)  generate an MbyN complex distributed matrix Q denoting A
 pcunglq(l)  generate an MbyN complex distributed matrix Q denoting A
 pcunglq(l)  generate an MbyN complex distributed matrix Q denoting A
 pcungql(l)  generate an MbyN complex distributed matrix Q denoting A
 pcungql(l)  generate an MbyN complex distributed matrix Q denoting A
 pcungqr(l)  generate an MbyN complex distributed matrix Q denoting A
 pcungqr(l)  generate an MbyN complex distributed matrix Q denoting A
 pcungr2(l)  generate an MbyN complex distributed matrix Q denoting A
 pcungr2(l)  generate an MbyN complex distributed matrix Q denoting A
 pcungrq(l)  generate an MbyN complex distributed matrix Q denoting A
 pcungrq(l)  generate an MbyN complex distributed matrix Q denoting A
 pcunm2l(l)  overwrite the general complex MbyN distributed matrix sub
 pcunm2l(l)  overwrite the general complex MbyN distributed matrix sub
 pcunm2r(l)  overwrite the general complex MbyN distributed matrix sub
 pcunm2r(l)  overwrite the general complex MbyN distributed matrix sub
 pcunmbr(l)  VECT = 'Q', PCUNMBR overwrites the general complex distributed MbyN matrix sub
 pcunmbr(l)  VECT = 'Q', PCUNMBR overwrites the general complex distributed MbyN matrix sub
 pcunmhr(l)  overwrite the general complex MbyN distributed matrix sub
 pcunmhr(l)  overwrite the general complex MbyN distributed matrix sub
 pcunml2(l)  overwrite the general complex MbyN distributed matrix sub
 pcunml2(l)  overwrite the general complex MbyN distributed matrix sub
 pcunmlq(l)  overwrite the general complex MbyN distributed matrix sub
 pcunmlq(l)  overwrite the general complex MbyN distributed matrix sub
 pcunmql(l)  overwrite the general complex MbyN distributed matrix sub
 pcunmql(l)  overwrite the general complex MbyN distributed matrix sub
 pcunmqr(l)  overwrite the general complex MbyN distributed matrix sub
 pcunmqr(l)  overwrite the general complex MbyN distributed matrix sub
 pcunmr2(l)  overwrite the general complex MbyN distributed matrix sub
 pcunmr2(l)  overwrite the general complex MbyN distributed matrix sub
 pcunmr3(l)  overwrite the general complex MbyN distributed matrix sub
 pcunmr3(l)  overwrite the general complex MbyN distributed matrix sub
 pcunmrq(l)  overwrite the general complex MbyN distributed matrix sub
 pcunmrq(l)  overwrite the general complex MbyN distributed matrix sub
 pcunmrz(l)  overwrite the general complex MbyN distributed matrix sub
 pcunmrz(l)  overwrite the general complex MbyN distributed matrix sub
 pcunmtr(l)  overwrite the general complex MbyN distributed matrix sub
 pcunmtr(l)  overwrite the general complex MbyN distributed matrix sub
 pddbsv(l)  solve a system of linear equations A
 pddbsv(l)  solve a system of linear equations A
 pddbtrf(l)  compute a LU factorization of an NbyN real banded diagonally dominantlike distributed matrix with bandwidth BWL, BWU
 pddbtrf(l)  compute a LU factorization of an NbyN real banded diagonally dominantlike distributed matrix with bandwidth BWL, BWU
 pddbtrs(l)  solve a system of linear equations A
 pddbtrs(l)  solve a system of linear equations A
 pddbtrsv(l)  solve a banded triangular system of linear equations A
 pddbtrsv(l)  solve a banded triangular system of linear equations A
 pddtsv(l)  solve a system of linear equations A
 pddtsv(l)  solve a system of linear equations A
 pddttrf(l)  compute a LU factorization of an NbyN real tridiagonal diagonally dominantlike distributed matrix A
 pddttrf(l)  compute a LU factorization of an NbyN real tridiagonal diagonally dominantlike distributed matrix A
 pddttrs(l)  solve a system of linear equations A
 pddttrs(l)  solve a system of linear equations A
 pddttrsv(l)  solve a tridiagonal triangular system of linear equations A
 pddttrsv(l)  solve a tridiagonal triangular system of linear equations A
 pdgbsv(l)  solve a system of linear equations A
 pdgbsv(l)  solve a system of linear equations A
 pdgbtrf(l)  compute a LU factorization of an NbyN real banded distributed matrix with bandwidth BWL, BWU
 pdgbtrf(l)  compute a LU factorization of an NbyN real banded distributed matrix with bandwidth BWL, BWU
 pdgbtrs(l)  solve a system of linear equations A
 pdgbtrs(l)  solve a system of linear equations A
 pdgebd2(l)  reduce a real general MbyN distributed matrix sub
 pdgebd2(l)  reduce a real general MbyN distributed matrix sub
 pdgebrd(l)  reduce a real general MbyN distributed matrix sub
 pdgebrd(l)  reduce a real general MbyN distributed matrix sub
 pdgecon(l)  estimate the reciprocal of the condition number of a general distributed real matrix A
 pdgecon(l)  estimate the reciprocal of the condition number of a general distributed real matrix A
 pdgeequ(l)  compute row and column scalings intended to equilibrate an MbyN distributed matrix sub
 pdgeequ(l)  compute row and column scalings intended to equilibrate an MbyN distributed matrix sub
 pdgehd2(l)  reduce a real general distributed matrix sub
 pdgehd2(l)  reduce a real general distributed matrix sub
 pdgehrd(l)  reduce a real general distributed matrix sub
 pdgehrd(l)  reduce a real general distributed matrix sub
 pdgelq2(l)  compute a LQ factorization of a real distributed MbyN matrix sub
 pdgelq2(l)  compute a LQ factorization of a real distributed MbyN matrix sub
 pdgelqf(l)  compute a LQ factorization of a real distributed MbyN matrix sub
 pdgelqf(l)  compute a LQ factorization of a real distributed MbyN matrix sub
 pdgels(l)  solve overdetermined or underdetermined real linear systems involving an MbyN matrix sub
 pdgels(l)  solve overdetermined or underdetermined real linear systems involving an MbyN matrix sub
 pdgeql2(l)  compute a QL factorization of a real distributed MbyN matrix sub
 pdgeql2(l)  compute a QL factorization of a real distributed MbyN matrix sub
 pdgeqlf(l)  compute a QL factorization of a real distributed MbyN matrix sub
 pdgeqlf(l)  compute a QL factorization of a real distributed MbyN matrix sub
 pdgeqpf(l)  compute a QR factorization with column pivoting of a MbyN distributed matrix sub
 pdgeqpf(l)  compute a QR factorization with column pivoting of a MbyN distributed matrix sub
 pdgeqr2(l)  compute a QR factorization of a real distributed MbyN matrix sub
 pdgeqr2(l)  compute a QR factorization of a real distributed MbyN matrix sub
 pdgeqrf(l)  compute a QR factorization of a real distributed MbyN matrix sub
 pdgeqrf(l)  compute a QR factorization of a real distributed MbyN matrix sub
 pdgerfs(l)  improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solutions
 pdgerfs(l)  improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solutions
 pdgerq2(l)  compute a RQ factorization of a real distributed MbyN matrix sub
 pdgerq2(l)  compute a RQ factorization of a real distributed MbyN matrix sub
 pdgerqf(l)  compute a RQ factorization of a real distributed MbyN matrix sub
 pdgerqf(l)  compute a RQ factorization of a real distributed MbyN matrix sub
 pdgesvd(l)  compute the singular value decomposition
 pdgesvd(l)  compute the singular value decomposition
 pdgesv(l)  compute the solution to a real system of linear equations sub
 pdgesv(l)  compute the solution to a real system of linear equations sub
 pdgesvx(l)  use the LU factorization to compute the solution to a real system of linear equations A
 pdgesvx(l)  use the LU factorization to compute the solution to a real system of linear equations A
 pdgetf2(l)  compute an LU factorization of a general MbyN distributed matrix sub
 pdgetf2(l)  compute an LU factorization of a general MbyN distributed matrix sub
 pdgetrf(l)  compute an LU factorization of a general MbyN distributed matrix sub
 pdgetrf(l)  compute an LU factorization of a general MbyN distributed matrix sub
 pdgetri(l)  compute the inverse of a distributed matrix using the LU factorization computed by PDGETRF
 pdgetri(l)  compute the inverse of a distributed matrix using the LU factorization computed by PDGETRF
 pdgetrs(l)  solve a system of distributed linear equations op
 pdgetrs(l)  solve a system of distributed linear equations op
 pdggqrf(l)  compute a generalized QR factorization of an NbyM matrix sub
 pdggqrf(l)  compute a generalized QR factorization of an NbyM matrix sub
 pdggrqf(l)  compute a generalized RQ factorization of an MbyN matrix sub
 pdggrqf(l)  compute a generalized RQ factorization of an MbyN matrix sub
 pdlabad(l)  take as input the values computed by PDLAMCH for underflow and overflow, and returns the square root of each of these values if the log of LARGE is sufficiently large
 pdlabad(l)  take as input the values computed by PDLAMCH for underflow and overflow, and returns the square root of each of these values if the log of LARGE is sufficiently large
 pdlabrd(l)  reduce the first NB rows and columns of a real general MbyN distributed matrix sub
 pdlabrd(l)  reduce the first NB rows and columns of a real general MbyN distributed matrix sub
 pdlacon(l)  estimate the 1norm of a square, real distributed matrix A
 pdlacon(l)  estimate the 1norm of a square, real distributed matrix A
 pdlaconsb(l)  look for two consecutive small subdiagonal elements by seeing the effect of starting a double shift QR iteration given by H44, H33, & H43H34 and see if this would make a subdiagonal negligible
 pdlaconsb(l)  look for two consecutive small subdiagonal elements by seeing the effect of starting a double shift QR iteration given by H44, H33, & H43H34 and see if this would make a subdiagonal negligible
 pdlacp2(l)  copie all or part of a distributed matrix A to another distributed matrix B
 pdlacp2(l)  copie all or part of a distributed matrix A to another distributed matrix B
 pdlacp3(l)  i an auxiliary routine that copies from a global parallel array into a local replicated array or vise versa
 pdlacp3(l)  i an auxiliary routine that copies from a global parallel array into a local replicated array or vise versa
 pdlacpy(l)  copie all or part of a distributed matrix A to another distributed matrix B
 pdlacpy(l)  copie all or part of a distributed matrix A to another distributed matrix B
 pdlaed0(l)  compute all eigenvalues and corresponding eigenvectors of a symmetric tridiagonal matrix using the divide and conquer method
 pdlaed0(l)  compute all eigenvalues and corresponding eigenvectors of a symmetric tridiagonal matrix using the divide and conquer method
 pdlaed1(l)  compute the updated eigensystem of a diagonal matrix after modification by a rankone symmetric matrix,
 pdlaed1(l)  compute the updated eigensystem of a diagonal matrix after modification by a rankone symmetric matrix,
 pdlaed2(l)  sort the two sets of eigenvalues together into a single sorted set
 pdlaed2(l)  sort the two sets of eigenvalues together into a single sorted set
 pdlaed3(l)  find the roots of the secular equation, as defined by the values in D, W, and RHO, between 1 and K
 pdlaed3(l)  find the roots of the secular equation, as defined by the values in D, W, and RHO, between 1 and K
 pdlaedz(l)  Form the zvector which consists of the last row of Q_1 and the first row of Q_2
 pdlaedz(l)  Form the zvector which consists of the last row of Q_1 and the first row of Q_2
 pdlaevswp(l)  move the eigenvectors
 pdlaevswp(l)  move the eigenvectors
 pdlahqr(l)  i an auxiliary routine used to find the Schur decomposition and or eigenvalues of a matrix already in Hessenberg form from cols ILO to IHI
 pdlahqr(l)  i an auxiliary routine used to find the Schur decomposition and or eigenvalues of a matrix already in Hessenberg form from cols ILO to IHI
 pdlahrd(l)  reduce the first NB columns of a real general Nby
 pdlahrd(l)  reduce the first NB columns of a real general Nby
 pdlamch(l)  determine double precision machine parameters
 pdlamch(l)  determine double precision machine parameters
 pdlange(l)  return the value of the one norm, or the Frobenius norm,
 pdlange(l)  return the value of the one norm, or the Frobenius norm,
 pdlanhs(l)  return the value of the one norm, or the Frobenius norm,
 pdlanhs(l)  return the value of the one norm, or the Frobenius norm,
 pdlansy(l)  return the value of the one norm, or the Frobenius norm,
 pdlansy(l)  return the value of the one norm, or the Frobenius norm,
 pdlantr(l)  return the value of the one norm, or the Frobenius norm,
 pdlantr(l)  return the value of the one norm, or the Frobenius norm,
 pdlapiv(l)  applie either P
 pdlapiv(l)  applie either P
 pdlapv2(l)  applie either P
 pdlapv2(l)  applie either P
 pdlaqge(l)  equilibrate a general MbyN distributed matrix sub
 pdlaqge(l)  equilibrate a general MbyN distributed matrix sub
 pdlaqsy(l)  equilibrate a symmetric distributed matrix sub
 pdlaqsy(l)  equilibrate a symmetric distributed matrix sub
 pdlared1d(l)  redistribute a 1D array It assumes that the input array, BYCOL, is distributed across rows and that all process column contain the same copy of BYCOL
 pdlared1d(l)  redistribute a 1D array It assumes that the input array, BYCOL, is distributed across rows and that all process column contain the same copy of BYCOL
 pdlared2d(l)  redistribute a 1D array It assumes that the input array, BYROW, is distributed across columns and that all process rows contain the same copy of BYROW
 pdlared2d(l)  redistribute a 1D array It assumes that the input array, BYROW, is distributed across columns and that all process rows contain the same copy of BYROW
 pdlarfb(l)  applie a real block reflector Q or its transpose Q**T to a real distributed MbyN matrix sub
 pdlarfb(l)  applie a real block reflector Q or its transpose Q**T to a real distributed MbyN matrix sub
 pdlarfg(l)  generate a real elementary reflector H of order n, such that H * sub
 pdlarfg(l)  generate a real elementary reflector H of order n, such that H * sub
 pdlarf(l)  applie a real elementary reflector Q
 pdlarf(l)  applie a real elementary reflector Q
 pdlarft(l)  form the triangular factor T of a real block reflector H of order n, which is defined as a product of k elementary reflectors
 pdlarft(l)  form the triangular factor T of a real block reflector H of order n, which is defined as a product of k elementary reflectors
 pdlarzb(l)  applie a real block reflector Q or its transpose Q**T to a real distributed MbyN matrix sub
 pdlarzb(l)  applie a real block reflector Q or its transpose Q**T to a real distributed MbyN matrix sub
 pdlarz(l)  applie a real elementary reflector Q
 pdlarz(l)  applie a real elementary reflector Q
 pdlarzt(l)  form the triangular factor T of a real block reflector H of order > n, which is defined as a product of k elementary reflectors as returned by PDTZRZF
 pdlarzt(l)  form the triangular factor T of a real block reflector H of order > n, which is defined as a product of k elementary reflectors as returned by PDTZRZF
 pdlascl(l)  multiplie the MbyN real distributed matrix sub
 pdlascl(l)  multiplie the MbyN real distributed matrix sub
 pdlase2(l)  initialize an MbyN distributed matrix sub
 pdlase2(l)  initialize an MbyN distributed matrix sub
 pdlaset(l)  initialize an MbyN distributed matrix sub
 pdlaset(l)  initialize an MbyN distributed matrix sub
 pdlasmsub(l)  look for a small subdiagonal element from the bottom of the matrix that it can safely set to zero
 pdlasmsub(l)  look for a small subdiagonal element from the bottom of the matrix that it can safely set to zero
 pdlasrt(l)  Sort the numbers in D in increasing order and the corresponding vectors in Q
 pdlasrt(l)  Sort the numbers in D in increasing order and the corresponding vectors in Q
 pdlassq(l)  return the values scl and smsq such that
 pdlassq(l)  return the values scl and smsq such that
 pdlaswp(l)  perform a series of row or column interchanges on the distributed matrix sub
 pdlaswp(l)  perform a series of row or column interchanges on the distributed matrix sub
 pdlatra(l)  compute the trace of an NbyN distributed matrix sub
 pdlatra(l)  compute the trace of an NbyN distributed matrix sub
 pdlatrd(l)  reduce NB rows and columns of a real symmetric distributed matrix sub
 pdlatrd(l)  reduce NB rows and columns of a real symmetric distributed matrix sub
 pdlatrs(l)  solve a triangular system
 pdlatrs(l)  solve a triangular system
 pdlatrz(l)  reduce the MbyN
 pdlatrz(l)  reduce the MbyN
 pdlauu2(l)  compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the matrix sub
 pdlauu2(l)  compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the matrix sub
 pdlauum(l)  compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the distributed matrix sub
 pdlauum(l)  compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the distributed matrix sub
 pdlawil(l)  get the transform given by H44,H33, & H43H34 into V starting at row M
 pdlawil(l)  get the transform given by H44,H33, & H43H34 into V starting at row M
 pdorg2l(l)  generate an MbyN real distributed matrix Q denoting A
 pdorg2l(l)  generate an MbyN real distributed matrix Q denoting A
 pdorg2r(l)  generate an MbyN real distributed matrix Q denoting A
 pdorg2r(l)  generate an MbyN real distributed matrix Q denoting A
 pdorgl2(l)  generate an MbyN real distributed matrix Q denoting A
 pdorgl2(l)  generate an MbyN real distributed matrix Q denoting A
 pdorglq(l)  generate an MbyN real distributed matrix Q denoting A
 pdorglq(l)  generate an MbyN real distributed matrix Q denoting A
 pdorgql(l)  generate an MbyN real distributed matrix Q denoting A
 pdorgql(l)  generate an MbyN real distributed matrix Q denoting A
 pdorgqr(l)  generate an MbyN real distributed matrix Q denoting A
 pdorgqr(l)  generate an MbyN real distributed matrix Q denoting A
 pdorgr2(l)  generate an MbyN real distributed matrix Q denoting A
 pdorgr2(l)  generate an MbyN real distributed matrix Q denoting A
 pdorgrq(l)  generate an MbyN real distributed matrix Q denoting A
 pdorgrq(l)  generate an MbyN real distributed matrix Q denoting A
 pdorm2l(l)  overwrite the general real MbyN distributed matrix sub
 pdorm2l(l)  overwrite the general real MbyN distributed matrix sub
 pdorm2r(l)  overwrite the general real MbyN distributed matrix sub
 pdorm2r(l)  overwrite the general real MbyN distributed matrix sub
 pdormbr(l)  VECT = 'Q', PDORMBR overwrites the general real distributed MbyN matrix sub
 pdormbr(l)  VECT = 'Q', PDORMBR overwrites the general real distributed MbyN matrix sub
 pdormhr(l)  overwrite the general real MbyN distributed matrix sub
 pdormhr(l)  overwrite the general real MbyN distributed matrix sub
 pdorml2(l)  overwrite the general real MbyN distributed matrix sub
 pdorml2(l)  overwrite the general real MbyN distributed matrix sub
 pdormlq(l)  overwrite the general real MbyN distributed matrix sub
 pdormlq(l)  overwrite the general real MbyN distributed matrix sub
 pdormql(l)  overwrite the general real MbyN distributed matrix sub
 pdormql(l)  overwrite the general real MbyN distributed matrix sub
 pdormqr(l)  overwrite the general real MbyN distributed matrix sub
 pdormqr(l)  overwrite the general real MbyN distributed matrix sub
 pdormr2(l)  overwrite the general real MbyN distributed matrix sub
 pdormr2(l)  overwrite the general real MbyN distributed matrix sub
 pdormr3(l)  overwrite the general real MbyN distributed matrix sub
 pdormr3(l)  overwrite the general real MbyN distributed matrix sub
 pdormrq(l)  overwrite the general real MbyN distributed matrix sub
 pdormrq(l)  overwrite the general real MbyN distributed matrix sub
 pdormrz(l)  overwrite the general real MbyN distributed matrix sub
 pdormrz(l)  overwrite the general real MbyN distributed matrix sub
 pdormtr(l)  overwrite the general real MbyN distributed matrix sub
 pdormtr(l)  overwrite the general real MbyN distributed matrix sub
 pdpbsv(l)  solve a system of linear equations A
 pdpbsv(l)  solve a system of linear equations A
 pdpbtrf(l)  compute a Cholesky factorization of an NbyN real banded symmetric positive definite distributed matrix with bandwidth BW
 pdpbtrf(l)  compute a Cholesky factorization of an NbyN real banded symmetric positive definite distributed matrix with bandwidth BW
 pdpbtrs(l)  solve a system of linear equations A
 pdpbtrs(l)  solve a system of linear equations A
 pdpbtrsv(l)  solve a banded triangular system of linear equations A
 pdpbtrsv(l)  solve a banded triangular system of linear equations A
 pdpocon(l)  estimate the reciprocal of the condition number
 pdpocon(l)  estimate the reciprocal of the condition number
 pdpoequ(l)  compute row and column scalings intended to equilibrate a distributed symmetric positive definite matrix sub
 pdpoequ(l)  compute row and column scalings intended to equilibrate a distributed symmetric positive definite matrix sub
 pdporfs(l)  improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and provides error bounds and backward error estimates for the solutions
 pdporfs(l)  improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and provides error bounds and backward error estimates for the solutions
 pdposv(l)  compute the solution to a real system of linear equations sub
 pdposv(l)  compute the solution to a real system of linear equations sub
 pdposvx(l)  use the Cholesky factorization A = U**T*U or A = L*L**T to compute the solution to a real system of linear equations A
 pdposvx(l)  use the Cholesky factorization A = U**T*U or A = L*L**T to compute the solution to a real system of linear equations A
 pdpotf2(l)  compute the Cholesky factorization of a real symmetric positive definite distributed matrix sub
 pdpotf2(l)  compute the Cholesky factorization of a real symmetric positive definite distributed matrix sub
 pdpotrf(l)  compute the Cholesky factorization of an NbyN real symmetric positive definite distributed matrix sub
 pdpotrf(l)  compute the Cholesky factorization of an NbyN real symmetric positive definite distributed matrix sub
 pdpotri(l)  compute the inverse of a real symmetric positive definite distributed matrix sub
 pdpotri(l)  compute the inverse of a real symmetric positive definite distributed matrix sub
 pdpotrs(l)  solve a system of linear equations sub
 pdpotrs(l)  solve a system of linear equations sub
 pdptsv(l)  solve a system of linear equations A
 pdptsv(l)  solve a system of linear equations A
 pdpttrf(l)  compute a Cholesky factorization of an NbyN real tridiagonal symmetric positive definite distributed matrix A
 pdpttrf(l)  compute a Cholesky factorization of an NbyN real tridiagonal symmetric positive definite distributed matrix A
 pdpttrs(l)  solve a system of linear equations A
 pdpttrs(l)  solve a system of linear equations A
 pdpttrsv(l)  solve a tridiagonal triangular system of linear equations A
 pdpttrsv(l)  solve a tridiagonal triangular system of linear equations A
 pdrscl(l)  multiplie an Nelement real distributed vector sub
 pdrscl(l)  multiplie an Nelement real distributed vector sub
 pdstebz(l)  compute the eigenvalues of a symmetric tridiagonal matrix in parallel
 pdstebz(l)  compute the eigenvalues of a symmetric tridiagonal matrix in parallel
 pdstedc(l)  tridiagonal matrix in parallel, using the divide and conquer algorithm
 pdstedc(l)  tridiagonal matrix in parallel, using the divide and conquer algorithm
 pdstein(l)  compute the eigenvectors of a symmetric tridiagonal matrix in parallel, using inverse iteration
 pdstein(l)  compute the eigenvectors of a symmetric tridiagonal matrix in parallel, using inverse iteration
 pdsyevd(l)  compute all the eigenvalues and eigenvectors of a real symmetric matrix A by calling the recommended sequence of ScaLAPACK routines
 pdsyevd(l)  compute all the eigenvalues and eigenvectors of a real symmetric matrix A by calling the recommended sequence of ScaLAPACK routines
 pdsyev(l)  compute all eigenvalues and, optionally, eigenvectors of a real symmetric matrix A by calling the recommended sequence of ScaLAPACK routines
 pdsyev(l)  compute all eigenvalues and, optionally, eigenvectors of a real symmetric matrix A by calling the recommended sequence of ScaLAPACK routines
 pdsyevx(l)  compute selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix A by calling the recommended sequence of ScaLAPACK routines
 pdsyevx(l)  compute selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix A by calling the recommended sequence of ScaLAPACK routines
 pdsygs2(l)  reduce a real symmetricdefinite generalized eigenproblem to standard form
 pdsygs2(l)  reduce a real symmetricdefinite generalized eigenproblem to standard form
 pdsygst(l)  reduce a real symmetricdefinite generalized eigenproblem to standard form
 pdsygst(l)  reduce a real symmetricdefinite generalized eigenproblem to standard form
 pdsytd2(l)  reduce a real symmetric matrix sub
 pdsytd2(l)  reduce a real symmetric matrix sub
 pdsytrd(l)  reduce a real symmetric matrix sub
 pdsytrd(l)  reduce a real symmetric matrix sub
 pdtrcon(l)  estimate the reciprocal of the condition number of a triangular distributed matrix A
 pdtrcon(l)  estimate the reciprocal of the condition number of a triangular distributed matrix A
 pdtrrfs(l)  provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix
 pdtrrfs(l)  provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix
 pdtrti2(l)  compute the inverse of a real upper or lower triangular block matrix sub
 pdtrti2(l)  compute the inverse of a real upper or lower triangular block matrix sub
 pdtrtri(l)  compute the inverse of a upper or lower triangular distributed matrix sub
 pdtrtri(l)  compute the inverse of a upper or lower triangular distributed matrix sub
 pdtrtrs(l)  solve a triangular system of the form sub
 pdtrtrs(l)  solve a triangular system of the form sub
 pdtzrzf(l)  reduce the MbyN
 pdtzrzf(l)  reduce the MbyN
 pdzsum1(l)  return the sum of absolute values of a complex distributed vector sub
 pdzsum1(l)  return the sum of absolute values of a complex distributed vector sub
 prstat(l)  print struct stat human readable on a file
 pscsum1(l)  return the sum of absolute values of a complex distributed vector sub
 pscsum1(l)  return the sum of absolute values of a complex distributed vector sub
 psdbsv(l)  solve a system of linear equations A
 psdbsv(l)  solve a system of linear equations A
 psdbtrf(l)  compute a LU factorization of an NbyN real banded diagonally dominantlike distributed matrix with bandwidth BWL, BWU
 psdbtrf(l)  compute a LU factorization of an NbyN real banded diagonally dominantlike distributed matrix with bandwidth BWL, BWU
 psdbtrs(l)  solve a system of linear equations A
 psdbtrs(l)  solve a system of linear equations A
 psdbtrsv(l)  solve a banded triangular system of linear equations A
 psdbtrsv(l)  solve a banded triangular system of linear equations A
 psdtsv(l)  solve a system of linear equations A
 psdtsv(l)  solve a system of linear equations A
 psdttrf(l)  compute a LU factorization of an NbyN real tridiagonal diagonally dominantlike distributed matrix A
 psdttrf(l)  compute a LU factorization of an NbyN real tridiagonal diagonally dominantlike distributed matrix A
 psdttrs(l)  solve a system of linear equations A
 psdttrs(l)  solve a system of linear equations A
 psdttrsv(l)  solve a tridiagonal triangular system of linear equations A
 psdttrsv(l)  solve a tridiagonal triangular system of linear equations A
 psgbsv(l)  solve a system of linear equations A
 psgbsv(l)  solve a system of linear equations A
 psgbtrf(l)  compute a LU factorization of an NbyN real banded distributed matrix with bandwidth BWL, BWU
 psgbtrf(l)  compute a LU factorization of an NbyN real banded distributed matrix with bandwidth BWL, BWU
 psgbtrs(l)  solve a system of linear equations A
 psgbtrs(l)  solve a system of linear equations A
 psgebd2(l)  reduce a real general MbyN distributed matrix sub
 psgebd2(l)  reduce a real general MbyN distributed matrix sub
 psgebrd(l)  reduce a real general MbyN distributed matrix sub
 psgebrd(l)  reduce a real general MbyN distributed matrix sub
 psgecon(l)  estimate the reciprocal of the condition number of a general distributed real matrix A
 psgecon(l)  estimate the reciprocal of the condition number of a general distributed real matrix A
 psgeequ(l)  compute row and column scalings intended to equilibrate an MbyN distributed matrix sub
 psgeequ(l)  compute row and column scalings intended to equilibrate an MbyN distributed matrix sub
 psgehd2(l)  reduce a real general distributed matrix sub
 psgehd2(l)  reduce a real general distributed matrix sub
 psgehrd(l)  reduce a real general distributed matrix sub
 psgehrd(l)  reduce a real general distributed matrix sub
 psgelq2(l)  compute a LQ factorization of a real distributed MbyN matrix sub
 psgelq2(l)  compute a LQ factorization of a real distributed MbyN matrix sub
 psgelqf(l)  compute a LQ factorization of a real distributed MbyN matrix sub
 psgelqf(l)  compute a LQ factorization of a real distributed MbyN matrix sub
 psgels(l)  solve overdetermined or underdetermined real linear systems involving an MbyN matrix sub
 psgels(l)  solve overdetermined or underdetermined real linear systems involving an MbyN matrix sub
 psgeql2(l)  compute a QL factorization of a real distributed MbyN matrix sub
 psgeql2(l)  compute a QL factorization of a real distributed MbyN matrix sub
 psgeqlf(l)  compute a QL factorization of a real distributed MbyN matrix sub
 psgeqlf(l)  compute a QL factorization of a real distributed MbyN matrix sub
 psgeqpf(l)  compute a QR factorization with column pivoting of a MbyN distributed matrix sub
 psgeqpf(l)  compute a QR factorization with column pivoting of a MbyN distributed matrix sub
 psgeqr2(l)  compute a QR factorization of a real distributed MbyN matrix sub
 psgeqr2(l)  compute a QR factorization of a real distributed MbyN matrix sub
 psgeqrf(l)  compute a QR factorization of a real distributed MbyN matrix sub
 psgeqrf(l)  compute a QR factorization of a real distributed MbyN matrix sub
 psgerfs(l)  improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solutions
 psgerfs(l)  improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solutions
 psgerq2(l)  compute a RQ factorization of a real distributed MbyN matrix sub
 psgerq2(l)  compute a RQ factorization of a real distributed MbyN matrix sub
 psgerqf(l)  compute a RQ factorization of a real distributed MbyN matrix sub
 psgerqf(l)  compute a RQ factorization of a real distributed MbyN matrix sub
 psgesvd(l)  compute the singular value decomposition
 psgesvd(l)  compute the singular value decomposition
 psgesv(l)  compute the solution to a real system of linear equations sub
 psgesv(l)  compute the solution to a real system of linear equations sub
 psgesvx(l)  use the LU factorization to compute the solution to a real system of linear equations A
 psgesvx(l)  use the LU factorization to compute the solution to a real system of linear equations A
 psgetf2(l)  compute an LU factorization of a general MbyN distributed matrix sub
 psgetf2(l)  compute an LU factorization of a general MbyN distributed matrix sub
 psgetrf(l)  compute an LU factorization of a general MbyN distributed matrix sub
 psgetrf(l)  compute an LU factorization of a general MbyN distributed matrix sub
 psgetri(l)  compute the inverse of a distributed matrix using the LU factorization computed by PSGETRF
 psgetri(l)  compute the inverse of a distributed matrix using the LU factorization computed by PSGETRF
 psgetrs(l)  solve a system of distributed linear equations op
 psgetrs(l)  solve a system of distributed linear equations op
 psggqrf(l)  compute a generalized QR factorization of an NbyM matrix sub
 psggqrf(l)  compute a generalized QR factorization of an NbyM matrix sub
 psggrqf(l)  compute a generalized RQ factorization of an MbyN matrix sub
 psggrqf(l)  compute a generalized RQ factorization of an MbyN matrix sub
 pslabad(l)  take as input the values computed by PSLAMCH for underflow and overflow, and returns the square root of each of these values if the log of LARGE is sufficiently large
 pslabad(l)  take as input the values computed by PSLAMCH for underflow and overflow, and returns the square root of each of these values if the log of LARGE is sufficiently large
 pslabrd(l)  reduce the first NB rows and columns of a real general MbyN distributed matrix sub
 pslabrd(l)  reduce the first NB rows and columns of a real general MbyN distributed matrix sub
 pslacon(l)  estimate the 1norm of a square, real distributed matrix A
 pslacon(l)  estimate the 1norm of a square, real distributed matrix A
 pslaconsb(l)  look for two consecutive small subdiagonal elements by seeing the effect of starting a double shift QR iteration given by H44, H33, & H43H34 and see if this would make a subdiagonal negligible
 pslaconsb(l)  look for two consecutive small subdiagonal elements by seeing the effect of starting a double shift QR iteration given by H44, H33, & H43H34 and see if this would make a subdiagonal negligible
 pslacp2(l)  copie all or part of a distributed matrix A to another distributed matrix B
 pslacp2(l)  copie all or part of a distributed matrix A to another distributed matrix B
 pslacp3(l)  i an auxiliary routine that copies from a global parallel array into a local replicated array or vise versa
 pslacp3(l)  i an auxiliary routine that copies from a global parallel array into a local replicated array or vise versa
 pslacpy(l)  copie all or part of a distributed matrix A to another distributed matrix B
 pslacpy(l)  copie all or part of a distributed matrix A to another distributed matrix B
 pslaed0(l)  compute all eigenvalues and corresponding eigenvectors of a symmetric tridiagonal matrix using the divide and conquer method
 pslaed0(l)  compute all eigenvalues and corresponding eigenvectors of a symmetric tridiagonal matrix using the divide and conquer method
 pslaed1(l)  compute the updated eigensystem of a diagonal matrix after modification by a rankone symmetric matrix,
 pslaed1(l)  compute the updated eigensystem of a diagonal matrix after modification by a rankone symmetric matrix,
 pslaed2(l)  sort the two sets of eigenvalues together into a single sorted set
 pslaed2(l)  sort the two sets of eigenvalues together into a single sorted set
 pslaed3(l)  find the roots of the secular equation, as defined by the values in D, W, and RHO, between 1 and K
 pslaed3(l)  find the roots of the secular equation, as defined by the values in D, W, and RHO, between 1 and K
 pslaedz(l)  Form the zvector which consists of the last row of Q_1 and the first row of Q_2
 pslaedz(l)  Form the zvector which consists of the last row of Q_1 and the first row of Q_2
 pslaevswp(l)  move the eigenvectors
 pslaevswp(l)  move the eigenvectors
 pslahqr(l)  i an auxiliary routine used to find the Schur decomposition and or eigenvalues of a matrix already in Hessenberg form from cols ILO to IHI
 pslahqr(l)  i an auxiliary routine used to find the Schur decomposition and or eigenvalues of a matrix already in Hessenberg form from cols ILO to IHI
 pslahrd(l)  reduce the first NB columns of a real general Nby
 pslahrd(l)  reduce the first NB columns of a real general Nby
 pslamch(l)  determine single precision machine parameters
 pslamch(l)  determine single precision machine parameters
 pslange(l)  return the value of the one norm, or the Frobenius norm,
 pslange(l)  return the value of the one norm, or the Frobenius norm,
 pslanhs(l)  return the value of the one norm, or the Frobenius norm,
 pslanhs(l)  return the value of the one norm, or the Frobenius norm,
 pslansy(l)  return the value of the one norm, or the Frobenius norm,
 pslansy(l)  return the value of the one norm, or the Frobenius norm,
 pslantr(l)  return the value of the one norm, or the Frobenius norm,
 pslantr(l)  return the value of the one norm, or the Frobenius norm,
 pslapiv(l)  applie either P
 pslapiv(l)  applie either P
 pslapv2(l)  applie either P
 pslapv2(l)  applie either P
 pslaqge(l)  equilibrate a general MbyN distributed matrix sub
 pslaqge(l)  equilibrate a general MbyN distributed matrix sub
 pslaqsy(l)  equilibrate a symmetric distributed matrix sub
 pslaqsy(l)  equilibrate a symmetric distributed matrix sub
 pslared1d(l)  redistribute a 1D array It assumes that the input array, BYCOL, is distributed across rows and that all process column contain the same copy of BYCOL
 pslared1d(l)  redistribute a 1D array It assumes that the input array, BYCOL, is distributed across rows and that all process column contain the same copy of BYCOL
 pslared2d(l)  redistribute a 1D array It assumes that the input array, BYROW, is distributed across columns and that all process rows contain the same copy of BYROW
 pslared2d(l)  redistribute a 1D array It assumes that the input array, BYROW, is distributed across columns and that all process rows contain the same copy of BYROW
 pslarfb(l)  applie a real block reflector Q or its transpose Q**T to a real distributed MbyN matrix sub
 pslarfb(l)  applie a real block reflector Q or its transpose Q**T to a real distributed MbyN matrix sub
 pslarfg(l)  generate a real elementary reflector H of order n, such that H * sub
 pslarfg(l)  generate a real elementary reflector H of order n, such that H * sub
 pslarf(l)  applie a real elementary reflector Q
 pslarf(l)  applie a real elementary reflector Q
 pslarft(l)  form the triangular factor T of a real block reflector H of order n, which is defined as a product of k elementary reflectors
 pslarft(l)  form the triangular factor T of a real block reflector H of order n, which is defined as a product of k elementary reflectors
 pslarzb(l)  applie a real block reflector Q or its transpose Q**T to a real distributed MbyN matrix sub
 pslarzb(l)  applie a real block reflector Q or its transpose Q**T to a real distributed MbyN matrix sub
 pslarz(l)  applie a real elementary reflector Q
 pslarz(l)  applie a real elementary reflector Q
 pslarzt(l)  form the triangular factor T of a real block reflector H of order > n, which is defined as a product of k elementary reflectors as returned by PSTZRZF
 pslarzt(l)  form the triangular factor T of a real block reflector H of order > n, which is defined as a product of k elementary reflectors as returned by PSTZRZF
 pslascl(l)  multiplie the MbyN real distributed matrix sub
 pslascl(l)  multiplie the MbyN real distributed matrix sub
 pslase2(l)  initialize an MbyN distributed matrix sub
 pslase2(l)  initialize an MbyN distributed matrix sub
 pslaset(l)  initialize an MbyN distributed matrix sub
 pslaset(l)  initialize an MbyN distributed matrix sub
 pslasmsub(l)  look for a small subdiagonal element from the bottom of the matrix that it can safely set to zero
 pslasmsub(l)  look for a small subdiagonal element from the bottom of the matrix that it can safely set to zero
 pslasrt(l)  Sort the numbers in D in increasing order and the corresponding vectors in Q
 pslasrt(l)  Sort the numbers in D in increasing order and the corresponding vectors in Q
 pslassq(l)  return the values scl and smsq such that
 pslassq(l)  return the values scl and smsq such that
 pslaswp(l)  perform a series of row or column interchanges on the distributed matrix sub
 pslaswp(l)  perform a series of row or column interchanges on the distributed matrix sub
 pslatra(l)  compute the trace of an NbyN distributed matrix sub
 pslatra(l)  compute the trace of an NbyN distributed matrix sub
 pslatrd(l)  reduce NB rows and columns of a real symmetric distributed matrix sub
 pslatrd(l)  reduce NB rows and columns of a real symmetric distributed matrix sub
 pslatrs(l)  solve a triangular system
 pslatrs(l)  solve a triangular system
 pslatrz(l)  reduce the MbyN
 pslatrz(l)  reduce the MbyN
 pslauu2(l)  compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the matrix sub
 pslauu2(l)  compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the matrix sub
 pslauum(l)  compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the distributed matrix sub
 pslauum(l)  compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the distributed matrix sub
 pslawil(l)  get the transform given by H44,H33, & H43H34 into V starting at row M
 pslawil(l)  get the transform given by H44,H33, & H43H34 into V starting at row M
 psorg2l(l)  generate an MbyN real distributed matrix Q denoting A
 psorg2l(l)  generate an MbyN real distributed matrix Q denoting A
 psorg2r(l)  generate an MbyN real distributed matrix Q denoting A
 psorg2r(l)  generate an MbyN real distributed matrix Q denoting A
 psorgl2(l)  generate an MbyN real distributed matrix Q denoting A
 psorgl2(l)  generate an MbyN real distributed matrix Q denoting A
 psorglq(l)  generate an MbyN real distributed matrix Q denoting A
 psorglq(l)  generate an MbyN real distributed matrix Q denoting A
 psorgql(l)  generate an MbyN real distributed matrix Q denoting A
 psorgql(l)  generate an MbyN real distributed matrix Q denoting A
 psorgqr(l)  generate an MbyN real distributed matrix Q denoting A
 psorgqr(l)  generate an MbyN real distributed matrix Q denoting A
 psorgr2(l)  generate an MbyN real distributed matrix Q denoting A
 psorgr2(l)  generate an MbyN real distributed matrix Q denoting A
 psorgrq(l)  generate an MbyN real distributed matrix Q denoting A
 psorgrq(l)  generate an MbyN real distributed matrix Q denoting A
 psorm2l(l)  overwrite the general real MbyN distributed matrix sub
 psorm2l(l)  overwrite the general real MbyN distributed matrix sub
 psorm2r(l)  overwrite the general real MbyN distributed matrix sub
 psorm2r(l)  overwrite the general real MbyN distributed matrix sub
 psormbr(l)  VECT = 'Q', PSORMBR overwrites the general real distributed MbyN matrix sub
 psormbr(l)  VECT = 'Q', PSORMBR overwrites the general real distributed MbyN matrix sub
 psormhr(l)  overwrite the general real MbyN distributed matrix sub
 psormhr(l)  overwrite the general real MbyN distributed matrix sub
 psorml2(l)  overwrite the general real MbyN distributed matrix sub
 psorml2(l)  overwrite the general real MbyN distributed matrix sub
 psormlq(l)  overwrite the general real MbyN distributed matrix sub
 psormlq(l)  overwrite the general real MbyN distributed matrix sub
 psormql(l)  overwrite the general real MbyN distributed matrix sub
 psormql(l)  overwrite the general real MbyN distributed matrix sub
 psormqr(l)  overwrite the general real MbyN distributed matrix sub
 psormqr(l)  overwrite the general real MbyN distributed matrix sub
 psormr2(l)  overwrite the general real MbyN distributed matrix sub
 psormr2(l)  overwrite the general real MbyN distributed matrix sub
 psormr3(l)  overwrite the general real MbyN distributed matrix sub
 psormr3(l)  overwrite the general real MbyN distributed matrix sub
 psormrq(l)  overwrite the general real MbyN distributed matrix sub
 psormrq(l)  overwrite the general real MbyN distributed matrix sub
 psormrz(l)  overwrite the general real MbyN distributed matrix sub
 psormrz(l)  overwrite the general real MbyN distributed matrix sub
 psormtr(l)  overwrite the general real MbyN distributed matrix sub
 psormtr(l)  overwrite the general real MbyN distributed matrix sub
 pspbsv(l)  solve a system of linear equations A
 pspbsv(l)  solve a system of linear equations A
 pspbtrf(l)  compute a Cholesky factorization of an NbyN real banded symmetric positive definite distributed matrix with bandwidth BW
 pspbtrf(l)  compute a Cholesky factorization of an NbyN real banded symmetric positive definite distributed matrix with bandwidth BW
 pspbtrs(l)  solve a system of linear equations A
 pspbtrs(l)  solve a system of linear equations A
 pspbtrsv(l)  solve a banded triangular system of linear equations A
 pspbtrsv(l)  solve a banded triangular system of linear equations A
 pspocon(l)  estimate the reciprocal of the condition number
 pspocon(l)  estimate the reciprocal of the condition number
 pspoequ(l)  compute row and column scalings intended to equilibrate a distributed symmetric positive definite matrix sub
 pspoequ(l)  compute row and column scalings intended to equilibrate a distributed symmetric positive definite matrix sub
 psporfs(l)  improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and provides error bounds and backward error estimates for the solutions
 psporfs(l)  improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and provides error bounds and backward error estimates for the solutions
 psposv(l)  compute the solution to a real system of linear equations sub
 psposv(l)  compute the solution to a real system of linear equations sub
 psposvx(l)  use the Cholesky factorization A = U**T*U or A = L*L**T to compute the solution to a real system of linear equations A
 psposvx(l)  use the Cholesky factorization A = U**T*U or A = L*L**T to compute the solution to a real system of linear equations A
 pspotf2(l)  compute the Cholesky factorization of a real symmetric positive definite distributed matrix sub
 pspotf2(l)  compute the Cholesky factorization of a real symmetric positive definite distributed matrix sub
 pspotrf(l)  compute the Cholesky factorization of an NbyN real symmetric positive definite distributed matrix sub
 pspotrf(l)  compute the Cholesky factorization of an NbyN real symmetric positive definite distributed matrix sub
 pspotri(l)  compute the inverse of a real symmetric positive definite distributed matrix sub
 pspotri(l)  compute the inverse of a real symmetric positive definite distributed matrix sub
 pspotrs(l)  solve a system of linear equations sub
 pspotrs(l)  solve a system of linear equations sub
 psptsv(l)  solve a system of linear equations A
 psptsv(l)  solve a system of linear equations A
 pspttrf(l)  compute a Cholesky factorization of an NbyN real tridiagonal symmetric positive definite distributed matrix A
 pspttrf(l)  compute a Cholesky factorization of an NbyN real tridiagonal symmetric positive definite distributed matrix A
 pspttrs(l)  solve a system of linear equations A
 pspttrs(l)  solve a system of linear equations A
 pspttrsv(l)  solve a tridiagonal triangular system of linear equations A
 pspttrsv(l)  solve a tridiagonal triangular system of linear equations A
 psrscl(l)  multiplie an Nelement real distributed vector sub
 psrscl(l)  multiplie an Nelement real distributed vector sub
 psstebz(l)  compute the eigenvalues of a symmetric tridiagonal matrix in parallel
 psstebz(l)  compute the eigenvalues of a symmetric tridiagonal matrix in parallel
 psstedc(l)  tridiagonal matrix in parallel, using the divide and conquer algorithm
 psstedc(l)  tridiagonal matrix in parallel, using the divide and conquer algorithm
 psstein(l)  compute the eigenvectors of a symmetric tridiagonal matrix in parallel, using inverse iteration
 psstein(l)  compute the eigenvectors of a symmetric tridiagonal matrix in parallel, using inverse iteration
 pssyevd(l)  compute all the eigenvalues and eigenvectors of a real symmetric matrix A by calling the recommended sequence of ScaLAPACK routines
 pssyevd(l)  compute all the eigenvalues and eigenvectors of a real symmetric matrix A by calling the recommended sequence of ScaLAPACK routines
 pssyev(l)  compute all eigenvalues and, optionally, eigenvectors of a real symmetric matrix A by calling the recommended sequence of ScaLAPACK routines
 pssyev(l)  compute all eigenvalues and, optionally, eigenvectors of a real symmetric matrix A by calling the recommended sequence of ScaLAPACK routines
 pssyevx(l)  compute selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix A by calling the recommended sequence of ScaLAPACK routines
 pssyevx(l)  compute selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix A by calling the recommended sequence of ScaLAPACK routines
 pssygs2(l)  reduce a real symmetricdefinite generalized eigenproblem to standard form
 pssygs2(l)  reduce a real symmetricdefinite generalized eigenproblem to standard form
 pssygst(l)  reduce a real symmetricdefinite generalized eigenproblem to standard form
 pssygst(l)  reduce a real symmetricdefinite generalized eigenproblem to standard form
 pssyntrd(l)  i a prototype version of PSSYTRD which uses tailored codes
 pssyntrd(l)  i a prototype version of PSSYTRD which uses tailored codes
 pssytd2(l)  reduce a real symmetric matrix sub
 pssytd2(l)  reduce a real symmetric matrix sub
 pssytrd(l)  reduce a real symmetric matrix sub
 pssytrd(l)  reduce a real symmetric matrix sub
 pstrcon(l)  estimate the reciprocal of the condition number of a triangular distributed matrix A
 pstrcon(l)  estimate the reciprocal of the condition number of a triangular distributed matrix A
 pstrrfs(l)  provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix
 pstrrfs(l)  provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix
 pstrti2(l)  compute the inverse of a real upper or lower triangular block matrix sub
 pstrti2(l)  compute the inverse of a real upper or lower triangular block matrix sub
 pstrtri(l)  compute the inverse of a upper or lower triangular distributed matrix sub
 pstrtri(l)  compute the inverse of a upper or lower triangular distributed matrix sub
 pstrtrs(l)  solve a triangular system of the form sub
 pstrtrs(l)  solve a triangular system of the form sub
 pstzrzf(l)  reduce the MbyN
 pstzrzf(l)  reduce the MbyN
 pzdbsv(l)  solve a system of linear equations A
 pzdbsv(l)  solve a system of linear equations A
 pzdbtrf(l)  compute a LU factorization of an NbyN complex banded diagonally dominantlike distributed matrix with bandwidth BWL, BWU
 pzdbtrf(l)  compute a LU factorization of an NbyN complex banded diagonally dominantlike distributed matrix with bandwidth BWL, BWU
 pzdbtrs(l)  solve a system of linear equations A
 pzdbtrs(l)  solve a system of linear equations A
 pzdbtrsv(l)  solve a banded triangular system of linear equations A
 pzdbtrsv(l)  solve a banded triangular system of linear equations A
 pzdrscl(l)  multiplie an Nelement complex distributed vector sub
 pzdrscl(l)  multiplie an Nelement complex distributed vector sub
 pzdtsv(l)  solve a system of linear equations A
 pzdtsv(l)  solve a system of linear equations A
 pzdttrf(l)  compute a LU factorization of an NbyN complex tridiagonal diagonally dominantlike distributed matrix A
 pzdttrf(l)  compute a LU factorization of an NbyN complex tridiagonal diagonally dominantlike distributed matrix A
 pzdttrs(l)  solve a system of linear equations A
 pzdttrs(l)  solve a system of linear equations A
 pzdttrsv(l)  solve a tridiagonal triangular system of linear equations A
 pzdttrsv(l)  solve a tridiagonal triangular system of linear equations A
 pzgbsv(l)  solve a system of linear equations A
 pzgbsv(l)  solve a system of linear equations A
 pzgbtrf(l)  compute a LU factorization of an NbyN complex banded distributed matrix with bandwidth BWL, BWU
 pzgbtrf(l)  compute a LU factorization of an NbyN complex banded distributed matrix with bandwidth BWL, BWU
 pzgbtrs(l)  solve a system of linear equations A
 pzgbtrs(l)  solve a system of linear equations A
 pzgebd2(l)  reduce a complex general MbyN distributed matrix sub
 pzgebd2(l)  reduce a complex general MbyN distributed matrix sub
 pzgebrd(l)  reduce a complex general MbyN distributed matrix sub
 pzgebrd(l)  reduce a complex general MbyN distributed matrix sub
 pzgecon(l)  estimate the reciprocal of the condition number of a general distributed complex matrix A
 pzgecon(l)  estimate the reciprocal of the condition number of a general distributed complex matrix A
 pzgeequ(l)  compute row and column scalings intended to equilibrate an MbyN distributed matrix sub
 pzgeequ(l)  compute row and column scalings intended to equilibrate an MbyN distributed matrix sub
 pzgehd2(l)  reduce a complex general distributed matrix sub
 pzgehd2(l)  reduce a complex general distributed matrix sub
 pzgehrd(l)  reduce a complex general distributed matrix sub
 pzgehrd(l)  reduce a complex general distributed matrix sub
 pzgelq2(l)  compute a LQ factorization of a complex distributed MbyN matrix sub
 pzgelq2(l)  compute a LQ factorization of a complex distributed MbyN matrix sub
 pzgelqf(l)  compute a LQ factorization of a complex distributed MbyN matrix sub
 pzgelqf(l)  compute a LQ factorization of a complex distributed MbyN matrix sub
 pzgels(l)  solve overdetermined or underdetermined complex linear systems involving an MbyN matrix sub
 pzgels(l)  solve overdetermined or underdetermined complex linear systems involving an MbyN matrix sub
 pzgeql2(l)  compute a QL factorization of a complex distributed MbyN matrix sub
 pzgeql2(l)  compute a QL factorization of a complex distributed MbyN matrix sub
 pzgeqlf(l)  compute a QL factorization of a complex distributed MbyN matrix sub
 pzgeqlf(l)  compute a QL factorization of a complex distributed MbyN matrix sub
 pzgeqpf(l)  compute a QR factorization with column pivoting of a MbyN distributed matrix sub
 pzgeqpf(l)  compute a QR factorization with column pivoting of a MbyN distributed matrix sub
 pzgeqr2(l)  compute a QR factorization of a complex distributed MbyN matrix sub
 pzgeqr2(l)  compute a QR factorization of a complex distributed MbyN matrix sub
 pzgeqrf(l)  compute a QR factorization of a complex distributed MbyN matrix sub
 pzgeqrf(l)  compute a QR factorization of a complex distributed MbyN matrix sub
 pzgerfs(l)  improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solutions
 pzgerfs(l)  improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solutions
 pzgerq2(l)  compute a RQ factorization of a complex distributed MbyN matrix sub
 pzgerq2(l)  compute a RQ factorization of a complex distributed MbyN matrix sub
 pzgerqf(l)  compute a RQ factorization of a complex distributed MbyN matrix sub
 pzgerqf(l)  compute a RQ factorization of a complex distributed MbyN matrix sub
 pzgesv(l)  compute the solution to a complex system of linear equations sub
 pzgesv(l)  compute the solution to a complex system of linear equations sub
 pzgesvx(l)  use the LU factorization to compute the solution to a complex system of linear equations A
 pzgesvx(l)  use the LU factorization to compute the solution to a complex system of linear equations A
 pzgetf2(l)  compute an LU factorization of a general MbyN distributed matrix sub
 pzgetf2(l)  compute an LU factorization of a general MbyN distributed matrix sub
 pzgetrf(l)  compute an LU factorization of a general MbyN distributed matrix sub
 pzgetrf(l)  compute an LU factorization of a general MbyN distributed matrix sub
 pzgetri(l)  compute the inverse of a distributed matrix using the LU factorization computed by PZGETRF
 pzgetri(l)  compute the inverse of a distributed matrix using the LU factorization computed by PZGETRF
 pzgetrs(l)  solve a system of distributed linear equations op
 pzgetrs(l)  solve a system of distributed linear equations op
 pzggqrf(l)  compute a generalized QR factorization of an NbyM matrix sub
 pzggqrf(l)  compute a generalized QR factorization of an NbyM matrix sub
 pzggrqf(l)  compute a generalized RQ factorization of an MbyN matrix sub
 pzggrqf(l)  compute a generalized RQ factorization of an MbyN matrix sub
 pzheevd(l)  compute all the eigenvalues and eigenvectors of a Hermitian matrix A by using a divide and conquer algorithm
 pzheevd(l)  compute all the eigenvalues and eigenvectors of a Hermitian matrix A by using a divide and conquer algorithm
 pzheev(l)  compute selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix A by calling the recommended sequence of ScaLAPACK routines
 pzheev(l)  compute selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix A by calling the recommended sequence of ScaLAPACK routines
 pzheevx(l)  compute selected eigenvalues and, optionally, eigenvectors of a complex hermitian matrix A by calling the recommended sequence of ScaLAPACK routines
 pzheevx(l)  compute selected eigenvalues and, optionally, eigenvectors of a complex hermitian matrix A by calling the recommended sequence of ScaLAPACK routines
 pzhegs2(l)  reduce a complex Hermitiandefinite generalized eigenproblem to standard form
 pzhegs2(l)  reduce a complex Hermitiandefinite generalized eigenproblem to standard form
 pzhegst(l)  reduce a complex Hermitiandefinite generalized eigenproblem to standard form
 pzhegst(l)  reduce a complex Hermitiandefinite generalized eigenproblem to standard form
 pzhetd2(l)  reduce a complex Hermitian matrix sub
 pzhetd2(l)  reduce a complex Hermitian matrix sub
 pzhetrd(l)  reduce a complex Hermitian matrix sub
 pzhetrd(l)  reduce a complex Hermitian matrix sub
 pzlabrd(l)  reduce the first NB rows and columns of a complex general MbyN distributed matrix sub
 pzlabrd(l)  reduce the first NB rows and columns of a complex general MbyN distributed matrix sub
 pzlacgv(l)  conjugate a complex vector of length N, sub
 pzlacgv(l)  conjugate a complex vector of length N, sub
 pzlacon(l)  estimate the 1norm of a square, complex distributed matrix A
 pzlacon(l)  estimate the 1norm of a square, complex distributed matrix A
 pzlaconsb(l)  look for two consecutive small subdiagonal elements by seeing the effect of starting a double shift QR iteration given by H44, H33, & H43H34 and see if this would make a subdiagonal negligible
 pzlaconsb(l)  look for two consecutive small subdiagonal elements by seeing the effect of starting a double shift QR iteration given by H44, H33, & H43H34 and see if this would make a subdiagonal negligible
 pzlacp2(l)  copie all or part of a distributed matrix A to another distributed matrix B
 pzlacp2(l)  copie all or part of a distributed matrix A to another distributed matrix B
 pzlacp3(l)  i an auxiliary routine that copies from a global parallel array into a local replicated array or vise versa
 pzlacp3(l)  i an auxiliary routine that copies from a global parallel array into a local replicated array or vise versa
 pzlacpy(l)  copie all or part of a distributed matrix A to another distributed matrix B
 pzlacpy(l)  copie all or part of a distributed matrix A to another distributed matrix B
 pzlaevswp(l)  move the eigenvectors
 pzlaevswp(l)  move the eigenvectors
 pzlahqr(l)  i an auxiliary routine used to find the Schur decomposition and or eigenvalues of a matrix already in Hessenberg form from cols ILO to IHI
 pzlahqr(l)  i an auxiliary routine used to find the Schur decomposition and or eigenvalues of a matrix already in Hessenberg form from cols ILO to IHI
 pzlahrd(l)  reduce the first NB columns of a complex general Nby
 pzlahrd(l)  reduce the first NB columns of a complex general Nby
 pzlange(l)  return the value of the one norm, or the Frobenius norm,
 pzlange(l)  return the value of the one norm, or the Frobenius norm,
 pzlanhe(l)  return the value of the one norm, or the Frobenius norm,
 pzlanhe(l)  return the value of the one norm, or the Frobenius norm,
 pzlanhs(l)  return the value of the one norm, or the Frobenius norm,
 pzlanhs(l)  return the value of the one norm, or the Frobenius norm,
 pzlansy(l)  return the value of the one norm, or the Frobenius norm,
 pzlansy(l)  return the value of the one norm, or the Frobenius norm,
 pzlantr(l)  return the value of the one norm, or the Frobenius norm,
 pzlantr(l)  return the value of the one norm, or the Frobenius norm,
 pzlapiv(l)  applie either P
 pzlapiv(l)  applie either P
 pzlapv2(l)  applie either P
 pzlapv2(l)  applie either P
 pzlaqge(l)  equilibrate a general MbyN distributed matrix sub
 pzlaqge(l)  equilibrate a general MbyN distributed matrix sub
 pzlaqsy(l)  equilibrate a symmetric distributed matrix sub
 pzlaqsy(l)  equilibrate a symmetric distributed matrix sub
 pzlarfb(l)  applie a complex block reflector Q or its conjugate transpose Q**H to a complex MbyN distributed matrix sub
 pzlarfb(l)  applie a complex block reflector Q or its conjugate transpose Q**H to a complex MbyN distributed matrix sub
 pzlarfc(l)  applie a complex elementary reflector Q**H to a complex MbyN distributed matrix sub
 pzlarfc(l)  applie a complex elementary reflector Q**H to a complex MbyN distributed matrix sub
 pzlarfg(l)  generate a complex elementary reflector H of order n, such that H * sub
 pzlarfg(l)  generate a complex elementary reflector H of order n, such that H * sub
 pzlarf(l)  applie a complex elementary reflector Q to a complex MbyN distributed matrix sub
 pzlarf(l)  applie a complex elementary reflector Q to a complex MbyN distributed matrix sub
 pzlarft(l)  form the triangular factor T of a complex block reflector H of order n, which is defined as a product of k elementary reflectors
 pzlarft(l)  form the triangular factor T of a complex block reflector H of order n, which is defined as a product of k elementary reflectors
 pzlarzb(l)  applie a complex block reflector Q or its conjugate transpose Q**H to a complex MbyN distributed matrix sub
 pzlarzb(l)  applie a complex block reflector Q or its conjugate transpose Q**H to a complex MbyN distributed matrix sub
 pzlarzc(l)  applie a complex elementary reflector Q**H to a complex MbyN distributed matrix sub
 pzlarzc(l)  applie a complex elementary reflector Q**H to a complex MbyN distributed matrix sub
 pzlarz(l)  applie a complex elementary reflector Q to a complex MbyN distributed matrix sub
 pzlarz(l)  applie a complex elementary reflector Q to a complex MbyN distributed matrix sub
 pzlarzt(l)  form the triangular factor T of a complex block reflector H of order > n, which is defined as a product of k elementary reflectors as returned by PZTZRZF
 pzlarzt(l)  form the triangular factor T of a complex block reflector H of order > n, which is defined as a product of k elementary reflectors as returned by PZTZRZF
 pzlascl(l)  multiplie the MbyN complex distributed matrix sub
 pzlascl(l)  multiplie the MbyN complex distributed matrix sub
 pzlase2(l)  initialize an MbyN distributed matrix sub
 pzlase2(l)  initialize an MbyN distributed matrix sub
 pzlaset(l)  initialize an MbyN distributed matrix sub
 pzlaset(l)  initialize an MbyN distributed matrix sub
 pzlasmsub(l)  look for a small subdiagonal element from the bottom of the matrix that it can safely set to zero
 pzlasmsub(l)  look for a small subdiagonal element from the bottom of the matrix that it can safely set to zero
 pzlassq(l)  return the values scl and smsq such that
 pzlassq(l)  return the values scl and smsq such that
 pzlaswp(l)  perform a series of row or column interchanges on the distributed matrix sub
 pzlaswp(l)  perform a series of row or column interchanges on the distributed matrix sub
 pzlatra(l)  compute the trace of an NbyN distributed matrix sub
 pzlatra(l)  compute the trace of an NbyN distributed matrix sub
 pzlatrd(l)  reduce NB rows and columns of a complex Hermitian distributed matrix sub
 pzlatrd(l)  reduce NB rows and columns of a complex Hermitian distributed matrix sub
 pzlatrs(l)  solve a triangular system
 pzlatrs(l)  solve a triangular system
 pzlatrz(l)  reduce the MbyN
 pzlatrz(l)  reduce the MbyN
 pzlattrs(l)  solve one of the triangular systems A * x = s*b, A**T * x = s*b, or A**H * x = s*b,
 pzlattrs(l)  solve one of the triangular systems A * x = s*b, A**T * x = s*b, or A**H * x = s*b,
 pzlauu2(l)  compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the matrix sub
 pzlauu2(l)  compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the matrix sub
 pzlauum(l)  compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the distributed matrix sub
 pzlauum(l)  compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the distributed matrix sub
 pzlawil(l)  get the transform given by H44,H33, & H43H34 into V starting at row M
 pzlawil(l)  get the transform given by H44,H33, & H43H34 into V starting at row M
 pzmax1(l)  compute the global index of the maximum element in absolute value of a distributed vector sub
 pzmax1(l)  compute the global index of the maximum element in absolute value of a distributed vector sub
 pzpbsv(l)  solve a system of linear equations A
 pzpbsv(l)  solve a system of linear equations A
 pzpbtrf(l)  compute a Cholesky factorization of an NbyN complex banded symmetric positive definite distributed matrix with bandwidth BW
 pzpbtrf(l)  compute a Cholesky factorization of an NbyN complex banded symmetric positive definite distributed matrix with bandwidth BW
 pzpbtrs(l)  solve a system of linear equations A
 pzpbtrs(l)  solve a system of linear equations A
 pzpbtrsv(l)  solve a banded triangular system of linear equations A
 pzpbtrsv(l)  solve a banded triangular system of linear equations A
 pzpocon(l)  estimate the reciprocal of the condition number
 pzpocon(l)  estimate the reciprocal of the condition number
 pzpoequ(l)  compute row and column scalings intended to equilibrate a distributed Hermitian positive definite matrix sub
 pzpoequ(l)  compute row and column scalings intended to equilibrate a distributed Hermitian positive definite matrix sub
 pzporfs(l)  improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and provides error bounds and backward error estimates for the solutions
 pzporfs(l)  improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and provides error bounds and backward error estimates for the solutions
 pzposv(l)  compute the solution to a complex system of linear equations sub
 pzposv(l)  compute the solution to a complex system of linear equations sub
 pzposvx(l)  use the Cholesky factorization A = U**H*U or A = L*L**H to compute the solution to a complex system of linear equations A
 pzposvx(l)  use the Cholesky factorization A = U**H*U or A = L*L**H to compute the solution to a complex system of linear equations A
 pzpotf2(l)  compute the Cholesky factorization of a complex hermitian positive definite distributed matrix sub
 pzpotf2(l)  compute the Cholesky factorization of a complex hermitian positive definite distributed matrix sub
 pzpotrf(l)  compute the Cholesky factorization of an NbyN complex hermitian positive definite distributed matrix sub
 pzpotrf(l)  compute the Cholesky factorization of an NbyN complex hermitian positive definite distributed matrix sub
 pzpotri(l)  compute the inverse of a complex Hermitian positive definite distributed matrix sub
 pzpotri(l)  compute the inverse of a complex Hermitian positive definite distributed matrix sub
 pzpotrs(l)  solve a system of linear equations sub
 pzpotrs(l)  solve a system of linear equations sub
 pzptsv(l)  solve a system of linear equations A
 pzptsv(l)  solve a system of linear equations A
 pzpttrf(l)  compute a Cholesky factorization of an NbyN complex tridiagonal symmetric positive definite distributed matrix A
 pzpttrf(l)  compute a Cholesky factorization of an NbyN complex tridiagonal symmetric positive definite distributed matrix A
 pzpttrs(l)  solve a system of linear equations A
 pzpttrs(l)  solve a system of linear equations A
 pzpttrsv(l)  solve a tridiagonal triangular system of linear equations A
 pzpttrsv(l)  solve a tridiagonal triangular system of linear equations A
 pzstein(l)  compute the eigenvectors of a symmetric tridiagonal matrix in parallel, using inverse iteration
 pzstein(l)  compute the eigenvectors of a symmetric tridiagonal matrix in parallel, using inverse iteration
 pztrcon(l)  estimate the reciprocal of the condition number of a triangular distributed matrix A
 pztrcon(l)  estimate the reciprocal of the condition number of a triangular distributed matrix A
 pztrevc(l)  compute some or all of the right and/or left eigenvectors of a complex upper triangular matrix T in parallel
 pztrevc(l)  compute some or all of the right and/or left eigenvectors of a complex upper triangular matrix T in parallel
 pztrrfs(l)  provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix
 pztrrfs(l)  provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix
 pztrti2(l)  compute the inverse of a complex upper or lower triangular block matrix sub
 pztrti2(l)  compute the inverse of a complex upper or lower triangular block matrix sub
 pztrtri(l)  compute the inverse of a upper or lower triangular distributed matrix sub
 pztrtri(l)  compute the inverse of a upper or lower triangular distributed matrix sub
 pztrtrs(l)  solve a triangular system of the form sub
 pztrtrs(l)  solve a triangular system of the form sub
 pztzrzf(l)  reduce the MbyN
 pztzrzf(l)  reduce the MbyN
 pzung2l(l)  generate an MbyN complex distributed matrix Q denoting A
 pzung2l(l)  generate an MbyN complex distributed matrix Q denoting A
 pzung2r(l)  generate an MbyN complex distributed matrix Q denoting A
 pzung2r(l)  generate an MbyN complex distributed matrix Q denoting A
 pzungl2(l)  generate an MbyN complex distributed matrix Q denoting A
 pzungl2(l)  generate an MbyN complex distributed matrix Q denoting A
 pzunglq(l)  generate an MbyN complex distributed matrix Q denoting A
 pzunglq(l)  generate an MbyN complex distributed matrix Q denoting A
 pzungql(l)  generate an MbyN complex distributed matrix Q denoting A
 pzungql(l)  generate an MbyN complex distributed matrix Q denoting A
 pzungqr(l)  generate an MbyN complex distributed matrix Q denoting A
 pzungqr(l)  generate an MbyN complex distributed matrix Q denoting A
 pzungr2(l)  generate an MbyN complex distributed matrix Q denoting A
 pzungr2(l)  generate an MbyN complex distributed matrix Q denoting A
 pzungrq(l)  generate an MbyN complex distributed matrix Q denoting A
 pzungrq(l)  generate an MbyN complex distributed matrix Q denoting A
 pzunm2l(l)  overwrite the general complex MbyN distributed matrix sub
 pzunm2l(l)  overwrite the general complex MbyN distributed matrix sub
 pzunm2r(l)  overwrite the general complex MbyN distributed matrix sub
 pzunm2r(l)  overwrite the general complex MbyN distributed matrix sub
 pzunmbr(l)  VECT = 'Q', PZUNMBR overwrites the general complex distributed MbyN matrix sub
 pzunmbr(l)  VECT = 'Q', PZUNMBR overwrites the general complex distributed MbyN matrix sub
 pzunmhr(l)  overwrite the general complex MbyN distributed matrix sub
 pzunmhr(l)  overwrite the general complex MbyN distributed matrix sub
 pzunml2(l)  overwrite the general complex MbyN distributed matrix sub
 pzunml2(l)  overwrite the general complex MbyN distributed matrix sub
 pzunmlq(l)  overwrite the general complex MbyN distributed matrix sub
 pzunmlq(l)  overwrite the general complex MbyN distributed matrix sub
 pzunmql(l)  overwrite the general complex MbyN distributed matrix sub
 pzunmql(l)  overwrite the general complex MbyN distributed matrix sub
 pzunmqr(l)  overwrite the general complex MbyN distributed matrix sub
 pzunmqr(l)  overwrite the general complex MbyN distributed matrix sub
 pzunmr2(l)  overwrite the general complex MbyN distributed matrix sub
 pzunmr2(l)  overwrite the general complex MbyN distributed matrix sub
 pzunmr3(l)  overwrite the general complex MbyN distributed matrix sub
 pzunmr3(l)  overwrite the general complex MbyN distributed matrix sub
 pzunmrq(l)  overwrite the general complex MbyN distributed matrix sub
 pzunmrq(l)  overwrite the general complex MbyN distributed matrix sub
 pzunmrz(l)  overwrite the general complex MbyN distributed matrix sub
 pzunmrz(l)  overwrite the general complex MbyN distributed matrix sub
 pzunmtr(l)  overwrite the general complex MbyN distributed matrix sub
 pzunmtr(l)  overwrite the general complex MbyN distributed matrix sub
 r3d_objects(l)  types used by the Raster3D package These are the object descriptor types, and the required parameters, recognized by the render program and other components of the Raster3D package
 r3dtops(l)  Raster3D to PostScript label conversion
 rastep(l) 
 raster3d(l)  molecular graphics package
 raster3d(l)  molecular graphics package
 readline(3)  get a line from a user with editing
 render(l)  Raster3D molecular graphics package rendering program
 ribbon(l)  Raster3D molecular graphics package ribbondrawer
 rods(l)  Raster3D preprocessor for ballandstick models
 rpoll(3)  callback functions for file descriptors and timers
 sdbtf2(l)  compute an LU factorization of a real mbyn band matrix A without using partial pivoting with row interchanges
 sdbtf2(l)  compute an LU factorization of a real mbyn band matrix A without using partial pivoting with row interchanges
 sdbtrf(l)  compute an LU factorization of a real mbyn band matrix A without using partial pivoting or row interchanges
 sdbtrf(l)  compute an LU factorization of a real mbyn band matrix A without using partial pivoting or row interchanges
 sdttrf(l)  compute an LU factorization of a complex tridiagonal matrix A using elimination without partial pivoting
 sdttrf(l)  compute an LU factorization of a complex tridiagonal matrix A using elimination without partial pivoting
 sdttrsv(l)  solve one of the systems of equations L * X = B, L**T * X = B, or L**H * X = B,
 sdttrsv(l)  solve one of the systems of equations L * X = B, L**T * X = B, or L**H * X = B,
 setfields(l)  setfields
 slamsh(l)  send multiple shifts through a small
 slamsh(l)  send multiple shifts through a small
 slapst(l)  Define a permutation INDX that sorts the numbers in D in increasing order
 slapst(l)  Define a permutation INDX that sorts the numbers in D in increasing order
 slaref(l)  applie one or several Householder reflectors of size 3 to one or two matrices
 slaref(l)  applie one or several Householder reflectors of size 3 to one or two matrices
 slasorte(l)  sort eigenpairs so that real eigenpairs are together and complex are together
 slasorte(l)  sort eigenpairs so that real eigenpairs are together and complex are together
 slasrt2(l)  the numbers in D in increasing order
 slasrt2(l)  the numbers in D in increasing order
 spttrsv(l)  solve one of the triangular systems L**T* X = B, or L * X = B,
 spttrsv(l)  solve one of the triangular systems L**T* X = B, or L * X = B,
 sstein2(l)  compute the eigenvectors of a real symmetric tridiagonal matrix T corresponding to specified eigenvalues, using inverse iteration
 sstein2(l)  compute the eigenvectors of a real symmetric tridiagonal matrix T corresponding to specified eigenvalues, using inverse iteration
 ssteqr2(l)  i a modified version of LAPACK routine SSTEQR
 ssteqr2(l)  i a modified version of LAPACK routine SSTEQR
 stereo3d(l)  render a Raster3D scene as a sidebyside stereo pair
 strmvt(l)  perform the matrixvector operations x := T' *y, and w := T *z,
 strmvt(l)  perform the matrixvector operations x := T' *y, and w := T *z,
 strnchr(l)  locate character in string
 strnlen(3)  strnlen
 strsave(l)  return a fresh copy of a string
 strtrimsp(l)  trim leading and/or trailing whitespace from a string
 vcgdemomaker(l)  produces demo specifications for vcg
 vcg(l)  visualization of compiler graphs
 verb(l)  print verbose messages
 warn(3)  warn
 xalloc(l)  memory allocation with simple error check
 xmalloc(3)  memory allocation functions for Publib
 xstrsave(l)  xstrsave
 xvcg(l)  visualization of compiler graphs
 zdbtf2(l)  compute an LU factorization of a real mbyn band matrix A without using partial pivoting with row interchanges
 zdbtf2(l)  compute an LU factorization of a real mbyn band matrix A without using partial pivoting with row interchanges
 zdbtrf(l)  compute an LU factorization of a real mbyn band matrix A without using partial pivoting or row interchanges
 zdbtrf(l)  compute an LU factorization of a real mbyn band matrix A without using partial pivoting or row interchanges
 zdttrf(l)  compute an LU factorization of a complex tridiagonal matrix A using elimination without partial pivoting
 zdttrf(l)  compute an LU factorization of a complex tridiagonal matrix A using elimination without partial pivoting
 zdttrsv(l)  solve one of the systems of equations L * X = B, L**T * X = B, or L**H * X = B,
 zdttrsv(l)  solve one of the systems of equations L * X = B, L**T * X = B, or L**H * X = B,
 zlahqr2(l)  i an auxiliary routine called by ZHSEQR to update the eigenvalues and Schur decomposition already computed by ZHSEQR, by dealing with the Hessenberg submatrix in rows and columns ILO to IHI
 zlahqr2(l)  i an auxiliary routine called by ZHSEQR to update the eigenvalues and Schur decomposition already computed by ZHSEQR, by dealing with the Hessenberg submatrix in rows and columns ILO to IHI
 zlamsh(l)  send multiple shifts through a small
 zlamsh(l)  send multiple shifts through a small
 zlanv2(l)  compute the Schur factorization of a complex 2by2 nonhermitian matrix in standard form
 zlanv2(l)  compute the Schur factorization of a complex 2by2 nonhermitian matrix in standard form
 zlaref(l)  applie one or several Householder reflectors of size 3 to one or two matrices
 zlaref(l)  applie one or several Householder reflectors of size 3 to one or two matrices
 zpttrsv(l)  solve one of the triangular systems L * X = B, or L**H * X = B,
 zpttrsv(l)  solve one of the triangular systems L * X = B, or L**H * X = B,
 zsteqr2(l)  i a modified version of LAPACK routine ZSTEQR
 zsteqr2(l)  i a modified version of LAPACK routine ZSTEQR
 ztrmvt(l)  perform the matrixvector operations x := conjg
 ztrmvt(l)  perform the matrixvector operations x := conjg
