		twversion (1)	- twversion is a graphical user interface (GUI) tool for the Source Code Control System (SCCS). twversion is available as part of the Sun WorkShop TeamWare product.
.dbxinit	dbxinit (4)	- commands to dbx
.dbxrc		dbxrc (4)	- commands to dbx
.sbinit 	sbinit (4)	- directives to SourceBrowser and compilers
CC		CC (1)		- C++ compilation system
Interrupt_handler		interrupt (3)	- signal handling for the task library
Intro		Intro (3m)	- introduction to mathematical library functions and constants
_rtc_check_free _rtc_check_free (3x)	- Runtime Checking (RTC) API for the use of private memory allocators.
_rtc_check_malloc		_rtc_check_free (3x)	- Runtime Checking (RTC) API for the use of private memory allocators.
_rtc_check_malloc_result	_rtc_check_free (3x)	- Runtime Checking (RTC) API for the use of private memory allocators.
_rtc_check_realloc		_rtc_check_free (3x)	- Runtime Checking (RTC) API for the use of private memory allocators.
_rtc_check_realloc_result	_rtc_check_free (3x)	- Runtime Checking (RTC) API for the use of private memory allocators.
_rtc_hide_region		_rtc_check_free (3x)	- Runtime Checking (RTC) API for the use of private memory allocators.
_rtc_off	_rtc_check_free (3x)	- Runtime Checking (RTC) API for the use of private memory allocators.
_rtc_on 	_rtc_check_free (3x)	- Runtime Checking (RTC) API for the use of private memory allocators.
_rtc_record_free		_rtc_check_free (3x)	- Runtime Checking (RTC) API for the use of private memory allocators.
_rtc_record_malloc		_rtc_check_free (3x)	- Runtime Checking (RTC) API for the use of private memory allocators.
_rtc_record_realloc		_rtc_check_free (3x)	- Runtime Checking (RTC) API for the use of private memory allocators.
_rtc_report_error		_rtc_check_free (3x)	- Runtime Checking (RTC) API for the use of private memory allocators.
access_control	access_control (4)  - TeamWare access control file
acosd		trig_sun (3m)	- more trigonometric functions
acosp		trig_sun (3m)	- more trigonometric functions
acospi		trig_sun (3m)	- more trigonometric functions
addrans 	addrans (3m)	- additive pseudo-random number generators
aint		aint (3m)	- round to integral value in floating-point or integer format
analyzer	analyzer (1)	- Motif interface for analyzing an experiment that is generated by using the Collector from the WorkShop Debugging window.
anint		aint (3m)	- round to integral value in floating-point or integer format
annuity 	exp2 (3m)	- exponential, logarithm, financial
args		args (4)	- TeamWare argument caching file
asind		trig_sun (3m)	- more trigonometric functions
asinp		trig_sun (3m)	- more trigonometric functions
asinpi		trig_sun (3m)	- more trigonometric functions
atan2d		trig_sun (3m)	- more trigonometric functions
atan2pi 	trig_sun (3m)	- more trigonometric functions
atand		trig_sun (3m)	- more trigonometric functions
atanp		trig_sun (3m)	- more trigonometric functions
atanpi		trig_sun (3m)	- more trigonometric functions
bcheck		bcheck (1)	- batch utility for Runtime Checking (RTC)
bringover	bringover (1)	- copy files from a parent workspace to a child workspace
c++filt 	c++filt (1)	- c++ name demangler
cartpol 	cartpol (3)	- cartesian/polar functions in the C++ complex number math library
caxpy		caxpy (3p)	- Compute y := alpha * x + y
cb		cb (1)		- C program beautifier
cbdsqr		cbdsqr (3p)	- compute the singular value decomposition (SVD) of a real N-by-N (upper or lower) bidiagonal matrix B
cc		cc (1)		- C compiler
cchdc		cchdc (3p)	- compute the Cholesky decomposition of a symmetric positive definite matrix A.
cchdd		cchdd (3p)	- downdate an augmented Cholesky decomposition of the triangular part of an augmented QR decomposition.
cchex		cchex (3p)	- compute the Cholesky decomposition of a symmetric positive definite matrix A.
cchud		cchud (3p)	- update an augmented Cholesky decomposition of the triangular part of an augmented QR decomposition.
ccopy		ccopy (3p)	- Copy x to y
cdotc		cdotc (3p)	- Compute the dot product of two vectors x and conjg(y).
cdotu		cdotu (3p)	- Compute the dot product of two vectors x and y.
cfftb		cfftb (3p)	- compute a perodic sequence from its Fourier coefficients. The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the input sequence by N.  The VxFFT operations are normalized, so a call of VxFFTF followed by a call of VxFFTB will return the original sequence.
cfftf		cfftf (3p)	- compute the Fourier coefficients of a perodic sequence.  The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the  input sequence by N.  The VxFFT operations are normalized, so a call of VxFFTF followed by a call of  VxFFTB will return the original sequence.
cffti		cffti (3p)	- initialize the array xWSAVE, which is used in both xFFTF and xFFTB.
cflow		cflow (1)	- generate C flowgraph
cgbbrd		cgbbrd (3p)	- reduce a complex general m-by-n band matrix A to real upper bidiagonal form B by a unitary transformation
cgbco		cgbco (3p)	- compute the LU factorization and condition number of a general matrix A in banded storage.  If the condition number is not needed then xGBFA is slightly faster.  It is typical to follow a call to xGBCO with a call to xGBSL to solve Ax = b or to xGBDI to compute the determinant of A.
cgbcon		cgbcon (3p)	- estimate the reciprocal of the condition number of a complex general band matrix A, in either the 1-norm or the infinity-norm,
cgbdi		cgbdi (3p)	- compute the determinant of a general matrix A in banded storage, which has been LU-factored by xGBCO or xGBFA.
cgbequ		cgbequ (3p)	- compute row and column scalings intended to equilibrate an M-by-N band matrix A and reduce its condition number
cgbfa		cgbfa (3p)	- compute the LU factorization of a matrix A in banded storage.  It is typical to follow a call to xGBFA with a call to xGBSL to solve Ax = b or to xGBDI to compute the determinant of A.
cgbmv		cgbmv (3p)	- perform one of the matrix-vector operations	y := alpha*A*x + beta*y, or y := alpha*A'*x + beta*y, or   y := alpha*conjg( A' )*x + beta*y
cgbrfs		cgbrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is banded, and provides error bounds and backward error estimates for the solution
cgbsl		cgbsl (3p)	- solve the linear system Ax = b for a matrix A in banded storage, which has been LU-factored by xGBCO or xGBFA, and vectors b and x.
cgbsv		cgbsv (3p)	- compute the solution to a complex system of linear equations A * X = B, where A is a band matrix of order N with KL subdiagonals and KU superdiagonals, and X and B are N-by-NRHS matrices
cgbsvx		cgbsvx (3p)	- use the LU factorization to compute the solution to a complex system of linear equations A * X = B, A**T * X = B, or A**H * X = B,
cgbtf2		cgbtf2 (3p)	- compute an LU factorization of a complex m-by-n band matrix A using partial pivoting with row interchanges
cgbtrf		cgbtrf (3p)	- compute an LU factorization of a complex m-by-n band matrix A using partial pivoting with row interchanges
cgbtrs		cgbtrs (3p)	- solve a system of linear equations  A * X = B, A**T * X = B, or A**H * X = B with a general band matrix A using the LU factorization computed by CGBTRF
cgebak		cgebak (3p)	- form the right or left eigenvectors of a complex general matrix by backward transformation on the computed eigenvectors of the balanced matrix output by CGEBAL
cgebal		cgebal (3p)	- balance a general complex matrix A
cgebd2		cgebd2 (3p)	- reduce a complex general m by n matrix A to upper or lower real bidiagonal form B by a unitary transformation
cgebrd		cgebrd (3p)	- reduce a general complex M-by-N matrix A to upper or lower bidiagonal form B by a unitary transformation
cgeco		cgeco (3p)	- compute the LU factorization and estimate the condition number of a general matrix A.  If the condition number is not needed then xGEFA is slightly faster.  It is typical to follow a call to xGECO with a call to xGESL to solve Ax = b or to xGEDI to compute the determinant and inverse of A.
cgecon		cgecon (3p)	- estimate the reciprocal of the condition number of a general complex matrix A, in either the 1-norm or the infinity-norm, using the LU factorization computed by CGETRF
cgedi		cgedi (3p)	- compute the determinant and inverse of a general matrix A, which has been LU-factored by xGECO or xGEFA.
cgeequ		cgeequ (3p)	- compute row and column scalings intended to equilibrate an M-by-N matrix A and reduce its condition number
cgees		cgees (3p)	- compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues, the Schur form T, and, optionally, the matrix of Schur vectors Z
cgeesx		cgeesx (3p)	- compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues, the Schur form T, and, optionally, the matrix of Schur vectors Z
cgeev		cgeev (3p)	- compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors
cgeevx		cgeevx (3p)	- compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors
cgefa		cgefa (3p)	- compute the LU factorization of a general matrix A.  It is typical to follow a call to xGEFA with a call to xGESL to solve Ax = b or to xGEDI to compute the determinant of A.
cgegs		cgegs (3p)	- compute for a pair of N-by-N complex nonsymmetric matrices A,
cgegv		cgegv (3p)	- compute for a pair of N-by-N complex nonsymmetric matrices A and B, the generalized eigenvalues (alpha, beta), and optionally,
cgehd2		cgehd2 (3p)	- reduce a complex general matrix A to upper Hessenberg form H by a unitary similarity transformation
cgehrd		cgehrd (3p)	- reduce a complex general matrix A to upper Hessenberg form H by a unitary similarity transformation
cgelq2		cgelq2 (3p)	- compute an LQ factorization of a complex m by n matrix A
cgelqf		cgelqf (3p)	- compute an LQ factorization of a complex M-by-N matrix A
cgels		cgels (3p)	- solve overdetermined or underdetermined complex linear systems involving an M-by-N matrix A, or its conjugate-transpose, using a QR or LQ factorization of A
cgelss		cgelss (3p)	- compute the minimum norm solution to a complex linear least squares problem
cgelsx		cgelsx (3p)	- compute the minimum-norm solution to a complex linear least squares problem
cgemm		cgemm (3p)	- perform one of the matrix-matrix operations C := alpha*op( A )*op( B ) + beta*C
cgemv		cgemv (3p)	- perform one of the matrix-vector operations	y := alpha*A*x + beta*y, or y := alpha*A'*x + beta*y, or   y := alpha*conjg( A' )*x + beta*y
cgeql2		cgeql2 (3p)	- compute a QL factorization of a complex m by n matrix A
cgeqlf		cgeqlf (3p)	- compute a QL factorization of a complex M-by-N matrix A
cgeqpf		cgeqpf (3p)	- compute a QR factorization with column pivoting of a complex M-by-N matrix A
cgeqr2		cgeqr2 (3p)	- compute a QR factorization of a complex m by n matrix A
cgeqrf		cgeqrf (3p)	- compute a QR factorization of a complex M-by-N matrix A
cgerc		cgerc (3p)	- perform the rank 1 operation	 A := alpha*x*conjg( y' ) + A
cgerfs		cgerfs (3p)	- improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solution
cgerq2		cgerq2 (3p)	- compute an RQ factorization of a complex m by n matrix A
cgerqf		cgerqf (3p)	- compute an RQ factorization of a complex M-by-N matrix A
cgeru		cgeru (3p)	- perform the rank 1 operation	 A := alpha*x*y' + A
cgesl		cgesl (3p)	- solve the linear system Ax = b for a general matrix A, which has been LU- factored by xGECO or xGEFA, and vectors b and x.
cgesv		cgesv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
cgesvd		cgesvd (3p)	- compute the singular value decomposition (SVD) of a complex M-by-N matrix A, optionally computing the left and/or right singular vectors
cgesvx		cgesvx (3p)	- use the LU factorization to compute the solution to a complex system of linear equations  A * X = B,
cgetf2		cgetf2 (3p)	- compute an LU factorization of a general m-by-n matrix A using partial pivoting with row interchanges
cgetrf		cgetrf (3p)	- compute an LU factorization of a general M-by-N matrix A using partial pivoting with row interchanges
cgetri		cgetri (3p)	- compute the inverse of a matrix using the LU factorization computed by CGETRF
cgetrs		cgetrs (3p)	- solve a system of linear equations  A * X = B, A**T * X = B, or A**H * X = B with a general N-by-N matrix A using the LU factorization computed by CGETRF
cggbak		cggbak (3p)	- form the right or left eigenvectors of a complex generalized eigenvalue problem A*x = lambda*B*x, by backward transformation on the computed eigenvectors of the balanced pair of matrices output by CGGBAL
cggbal		cggbal (3p)	- balance a pair of general complex matrices (A,B)
cggglm		cggglm (3p)	- solve a general Gauss-Markov linear model (GLM) problem
cgghrd		cgghrd (3p)	- reduce a pair of complex matrices (A,B) to generalized upper Hessenberg form using unitary transformations, where A is a general matrix and B is upper triangular
cgglse		cgglse (3p)	- solve the linear equality-constrained least squares (LSE) problem
cggqrf		cggqrf (3p)	- compute a generalized QR factorization of an N-by-M matrix A and an N-by-P matrix B
cggrqf		cggrqf (3p)	- compute a generalized RQ factorization of an M-by-N matrix A and a P-by-N matrix B
cggsvd		cggsvd (3p)	- compute the generalized singular value decomposition (GSVD) of an M-by-N complex matrix A and P-by-N complex matrix B
cggsvp		cggsvp (3p)	- compute unitary matrices U, V and Q such that   N-K-L K L  U'*A*Q = K ( 0 A12 A13 ) if M-K-L >= 0
cgtcon		cgtcon (3p)	- estimate the reciprocal of the condition number of a complex tridiagonal matrix A using the LU factorization as computed by CGTTRF
cgtrfs		cgtrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is tridiagonal, and provides error bounds and backward error estimates for the solution
cgtsl		cgtsl (3p)	- solve the linear system Ax = b for a tridiagonal matrix A and vectors b and x.
cgtsv		cgtsv (3p)	- solve the equation   A*X = B,
cgtsvx		cgtsvx (3p)	- use the LU factorization to compute the solution to a complex system of linear equations A * X = B, A**T * X = B, or A**H * X = B,
cgttrf		cgttrf (3p)	- compute an LU factorization of a complex tridiagonal matrix A using elimination with partial pivoting and row interchanges
cgttrs		cgttrs (3p)	- solve one of the systems of equations  A * X = B, A**T * X = B, or A**H * X = B,
chbev		chbev (3p)	- compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix A
chbevd		chbevd (3p)	- compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix A
chbevx		chbevx (3p)	- compute selected eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix A
chbgst		chbgst (3p)	- reduce a complex Hermitian-definite banded generalized eigenproblem A*x = lambda*B*x to standard form C*y = lambda*y,
chbgv		chbgv (3p)	- compute all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite banded eigenproblem, of the form A*x=(lambda)*B*x
chbmv		chbmv (3p)	- perform the matrix-vector operation	y := alpha*A*x + beta*y
chbtrd		chbtrd (3p)	- reduce a complex Hermitian band matrix A to real symmetric tridiagonal form T by a unitary similarity transformation
checon		checon (3p)	- estimate the reciprocal of the condition number of a complex Hermitian matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by CHETRF
cheev		cheev (3p)	- compute all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A
cheevd		cheevd (3p)	- compute all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A
cheevx		cheevx (3p)	- compute selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A
chegs2		chegs2 (3p)	- reduce a complex Hermitian-definite generalized eigenproblem to standard form
chegst		chegst (3p)	- reduce a complex Hermitian-definite generalized eigenproblem to standard form
chegv		chegv (3p)	- compute all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x
chemm		chemm (3p)	- perform one of the matrix-matrix operations C := alpha*A*B + beta*C or C := alpha*B*A + beta*C
chemv		chemv (3p)	- perform the matrix-vector operation	y := alpha*A*x + beta*y
cher		cher (3p)	- perform the hermitian rank 1 operation   A := alpha*x*conjg( x' ) + A
cher2		cher2 (3p)	- perform the hermitian rank 2 operation   A := alpha*x*conjg( y' ) + conjg( alpha )*y*conjg( x' ) + A
cher2k		cher2k (3p)	- perform one of the Hermitian rank 2k operations   C := alpha*A*conjg( B' ) + conjg( alpha )*B*conjg( A' ) + beta*C or C := alpha*conjg( A' )*B + conjg( alpha )*conjg( B' )*A + beta*C
cherfs		cherfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian indefinite, and provides error bounds and backward error estimates for the solution
cherk		cherk (3p)	- perform one of the Hermitian rank k operations   C := alpha*A*conjg( A' ) + beta*C or C := alpha*conjg( A' )*A + beta*C
chesv		chesv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
chesvx		chesvx (3p)	- use the diagonal pivoting factorization to compute the solution to a complex system of linear equations A * X = B,
chetd2		chetd2 (3p)	- reduce a complex Hermitian matrix A to real symmetric tridiagonal form T by a unitary similarity transformation
chetf2		chetf2 (3p)	- compute the factorization of a complex Hermitian matrix A using the Bunch-Kaufman diagonal pivoting method
chetrd		chetrd (3p)	- reduce a complex Hermitian matrix A to real symmetric tridiagonal form T by a unitary similarity transformation
chetrf		chetrf (3p)	- compute the factorization of a complex Hermitian matrix A using the Bunch-Kaufman diagonal pivoting method
chetri		chetri (3p)	- compute the inverse of a complex Hermitian indefinite matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by CHETRF
chetrs		chetrs (3p)	- solve a system of linear equations A*X = B with a complex Hermitian matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by CHETRF
chico		chico (3p)	- compute the UDU factorization and condition number of a Hermitian matrix A.  If the condition number is not needed then xHIFA is slightly faster.  It is typical to follow a call to xHICO with a call to xHISL to solve Ax = b or to xHIDI to compute the determinant, inverse, and inertia of A.
chidi		chidi (3p)	- compute the determinant, inertia, and inverse of a Hermitian matrix A, which has been UDU-factored by xHICO or xHIFA.
chifa		chifa (3p)	- compute the UDU factorization of a Hermitian matrix A.  It is typical to follow a call to xHIFA with a call to xHISL to solve Ax = b or to xHIDI to compute the determinant, inverse, and inertia of A.
children	children (4)	- List of a workspace's child workspaces
chisl		chisl (3p)	- solve the linear system Ax = b for a Hermitian matrix A, which has been UDU-factored by xHICO or xHIFA, and vectors b and x.
chpco		chpco (3p)	- compute the UDU factorization and condition number of a Hermitian matrix A in packed storage.  If the condition number is not needed then xHPFA is slightly faster.  It is typical to follow a call to xHPCO with a call to xHPSL to solve Ax = b or to xHPDI to compute the determinant, inverse, and inertia of A.
chpcon		chpcon (3p)	- estimate the reciprocal of the condition number of a complex Hermitian packed matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by CHPTRF
chpdi		chpdi (3p)	- compute the determinant, inertia, and inverse of a Hermitian matrix A in packed storage, which has been UDU-factored by xHPCO or xHPFA.
chpev		chpev (3p)	- compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix in packed storage
chpevd		chpevd (3p)	- compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A in packed storage
chpevx		chpevx (3p)	- compute selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A in packed storage
chpfa		chpfa (3p)	- compute the UDU factorization of a Hermitian matrix A in packed storage. It is typical to follow a call to xHPFA with a call to xHPSL to solve Ax = b or to xHPDI to compute the determinant, inverse, and inertia of A.
chpgst		chpgst (3p)	- reduce a complex Hermitian-definite generalized eigenproblem to standard form, using packed storage
chpgv		chpgv (3p)	- compute all the eigenvalues and, optionally, the eigenvectors of a complex generalized Hermitian-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x
chpmv		chpmv (3p)	- perform the matrix-vector operation	y := alpha*A*x + beta*y
chpr		chpr (3p)	- perform the hermitian rank 1 operation   A := alpha*x*conjg( x' ) + A
chpr2		chpr2 (3p)	- perform the Hermitian rank 2 operation   A := alpha*x*conjg( y' ) + conjg( alpha )*y*conjg( x' ) + A
chprfs		chprfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian indefinite and packed, and provides error bounds and backward error estimates for the solution
chpsl		chpsl (3p)	- solve the linear system Ax = b for a Hermitian matrix A in packed storage, which has been UDU-factored by xHPCO or xHPFA, and vectors b and x.
chpsv		chpsv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
chpsvx		chpsvx (3p)	- use the diagonal pivoting factorization A = U*D*U**H or A = L*D*L**H to compute the solution to a complex system of linear equations A * X = B, where A is an N-by-N Hermitian matrix stored in packed format and X and B are N-by-NRHS matrices
chptrd		chptrd (3p)	- reduce a complex Hermitian matrix A stored in packed form to real symmetric tridiagonal form T by a unitary similarity transformation
chptrf		chptrf (3p)	- compute the factorization of a complex Hermitian packed matrix A using the Bunch-Kaufman diagonal pivoting method
chptri		chptri (3p)	- compute the inverse of a complex Hermitian indefinite matrix A in packed storage using the factorization A = U*D*U**H or A = L*D*L**H computed by CHPTRF
chptrs		chptrs (3p)	- solve a system of linear equations A*X = B with a complex Hermitian matrix A stored in packed format using the factorization A = U*D*U**H or A = L*D*L**H computed by CHPTRF
chsein		chsein (3p)	- use inverse iteration to find specified right and/or left eigenvectors of a complex upper Hessenberg matrix H
chseqr		chseqr (3p)	- compute the eigenvalues of a complex upper Hessenberg matrix H, and, optionally, the matrices T and Z from the Schur decomposition H = Z T Z**H, where T is an upper triangular matrix (the Schur form), and Z is the unitary matrix of Schur vectors
clabrd		clabrd (3p)	- reduce the first NB rows and columns of a complex general m by n matrix A to upper or lower real bidiagonal form by a unitary transformation Q' * A * P, and returns the matrices X and Y which are needed to apply the transformation to the unreduced part of A
clacgv		clacgv (3p)	- conjugate a complex vector of length N
clacon		clacon (3p)	- estimate the 1-norm of a square, complex matrix A
clacpy		clacpy (3p)	- copie all or part of a two-dimensional matrix A to another matrix B
clacrm		clacrm (3p)	- perform a very simple matrix-matrix multiplication
clacrt		clacrt (3p)	- applie a plane rotation, where the cos and sin (C and S) are complex and the vectors CX and CY are complex
cladiv		cladiv (3p)	- := X / Y, where X and Y are complex
claed0		claed0 (3p)	- the divide and conquer method, CLAED0 computes all eigenvalues of a symmetric tridiagonal matrix which is one diagonal block of those from reducing a dense or band Hermitian matrix and corresponding eigenvectors of the dense or band matrix
claed7		claed7 (3p)	- compute the updated eigensystem of a diagonal matrix after modification by a rank-one symmetric matrix
claed8		claed8 (3p)	- merge the two sets of eigenvalues together into a single sorted set
claein		claein (3p)	- use inverse iteration to find a right or left eigenvector corresponding to the eigenvalue W of a complex upper Hessenberg matrix H
claesy		claesy (3p)	- compute the eigendecomposition of a 2-by-2 symmetric matrix  ( ( A, B );( B, C ) ) provided the norm of the matrix of eigenvectors is larger than some threshold value
claev2		claev2 (3p)	- compute the eigendecomposition of a 2-by-2 Hermitian matrix  [ A B ]	[ CONJG(B) C ]
clags2		clags2 (3p)	- compute 2-by-2 unitary matrices U, V and Q, such that if ( UPPER ) then   U'*A*Q = U'*( A1 A2 )*Q = ( x 0 )  ( 0 A3 ) ( x x ) and  V'*B*Q = V'*( B1 B2 )*Q = ( x 0 )	( 0 B3 ) ( x x )  or if ( .NOT.UPPER ) then   U'*A*Q = U'*( A1 0 )*Q = ( x x )	( A2 A3 ) ( 0 x ) and  V'*B*Q = V'*( B1 0 )*Q = ( x x )  ( B2 B3 ) ( 0 x ) where   U = ( CSU SNU ), V = ( CSV SNV ),
clahef		clahef (3p)	- compute a partial factorization of a complex Hermitian matrix A using the Bunch-Kaufman diagonal pivoting method
clahqr		clahqr (3p)	- 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
clahrd		clahrd (3p)	- reduce the first NB columns of a complex general n-by-(n-k+1) matrix A so that elements below the k-th subdiagonal are zero
claic1		claic1 (3p)	- applie one step of incremental condition estimation in its simplest version
clangb		clangb (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n band matrix A, with kl sub-diagonals and ku super-diagonals
clange		clange (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex matrix A
clangt		clangt (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex tridiagonal matrix A
clanhb		clanhb (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n hermitian band matrix A, with k super-diagonals
clanhe		clanhe (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex hermitian matrix A
clanhp		clanhp (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex hermitian matrix A, supplied in packed form
clanhs		clanhs (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a Hessenberg matrix A
clanht		clanht (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex Hermitian tridiagonal matrix A
clansb		clansb (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n symmetric band matrix A, with k super-diagonals
clansp		clansp (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex symmetric matrix A, supplied in packed form
clansy		clansy (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex symmetric matrix A
clantb		clantb (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n triangular band matrix A, with ( k + 1 ) diagonals
clantp		clantp (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a triangular matrix A, supplied in packed form
clantr		clantr (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a trapezoidal or triangular matrix A
clapll		clapll (3p)	- two column vectors X and Y, let   A = ( X Y )
clapmt		clapmt (3p)	- rearrange the columns of the M by N matrix X as specified by the permutation K(1),K(2),...,K(N) of the integers 1,...,N
claqgb		claqgb (3p)	- equilibrate a general M by N band matrix A with KL subdiagonals and KU superdiagonals using the row and scaling factors in the vectors R and C
claqge		claqge (3p)	- equilibrate a general M by N matrix A using the row and scaling factors in the vectors R and C
claqhb		claqhb (3p)	- equilibrate a symmetric band matrix A using the scaling factors in the vector S
claqhe		claqhe (3p)	- equilibrate a Hermitian matrix A using the scaling factors in the vector S
claqhp		claqhp (3p)	- equilibrate a Hermitian matrix A using the scaling factors in the vector S
claqsb		claqsb (3p)	- equilibrate a symmetric band matrix A using the scaling factors in the vector S
claqsp		claqsp (3p)	- equilibrate a symmetric matrix A using the scaling factors in the vector S
claqsy		claqsy (3p)	- equilibrate a symmetric matrix A using the scaling factors in the vector S
clar2v		clar2v (3p)	- applie a vector of complex plane rotations with real cosines from both sides to a sequence of 2-by-2 complex Hermitian matrices,
clarf		clarf (3p)	- applie a complex elementary reflector H to a complex M-by-N matrix C, from either the left or the right
clarfb		clarfb (3p)	- applie a complex block reflector H or its transpose H' to a complex M-by-N matrix C, from either the left or the right
clarfg		clarfg (3p)	- generate a complex elementary reflector H of order n, such that   H' * ( alpha ) = ( beta ), H' * H = I
clarft		clarft (3p)	- form the triangular factor T of a complex block reflector H of order n, which is defined as a product of k elementary reflectors
clarfx		clarfx (3p)	- applie a complex elementary reflector H to a complex m by n matrix C, from either the left or the right
clargv		clargv (3p)	- generate a vector of complex plane rotations with real cosines, determined by elements of the complex vectors x and y
clarnv		clarnv (3p)	- return a vector of n random complex numbers from a uniform or normal distribution
clartg		clartg (3p)	- generate a plane rotation so that   [ CS SN ] [ F ] [ R ]  [ __ ] 
clartv		clartv (3p)	- applie a vector of complex plane rotations with real cosines to elements of the complex vectors x and y
clascl		clascl (3p)	- multiply the M by N complex matrix A by the real scalar CTO/CFROM
claset		claset (3p)	- initialize a 2-D array A to BETA on the diagonal and ALPHA on the offdiagonals
clasr		clasr (3p)	- perform the transformation   A := P*A, when SIDE = 'L' or 'l' ( Left-hand side )   A := A*P', when SIDE = 'R' or 'r' ( Right-hand side )  where A is an m by n complex matrix and P is an orthogonal matrix,
classq		classq (3p)	- return the values scl and ssq such that   ( scl**2 )*ssq = x( 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq,
claswp		claswp (3p)	- perform a series of row interchanges on the matrix A
clasyf		clasyf (3p)	- compute a partial factorization of a complex symmetric matrix A using the Bunch-Kaufman diagonal pivoting method
clatbs		clatbs (3p)	- solve one of the triangular systems	A * x = s*b, A**T * x = s*b, or A**H * x = s*b,
clatps		clatps (3p)	- solve one of the triangular systems	A * x = s*b, A**T * x = s*b, or A**H * x = s*b,
clatrd		clatrd (3p)	- reduce NB rows and columns of a complex Hermitian matrix A to Hermitian tridiagonal form by a unitary similarity transformation Q' * A * Q, and returns the matrices V and W which are needed to apply the transformation to the unreduced part of A
clatrs		clatrs (3p)	- solve one of the triangular systems	A * x = s*b, A**T * x = s*b, or A**H * x = s*b,
clatzm		clatzm (3p)	- applie a Householder matrix generated by CTZRQF to a matrix
clauu2		clauu2 (3p)	- 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 array A
clauum		clauum (3p)	- 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 array A
codemgr 	codemgr (1)	- The TeamWare "umbrella" command.
codemgrtool	teamware (1)	- teamware is a graphical user interface (GUI) tool for CodeManager commands.
complex 	cplx.intro (3)	- introduction to C++ complex number math library
complex 	cplxerr (3)	- error-handling functions in the C++ complex number math library
compound	exp2 (3m)	- exponential, logarithm, financial
conflicts	conflicts (4)	- List of files in conflict in a workspace
convert_external		convert_external (3m)	- convert external binary data formats
cosd		trig_sun (3m)	- more trigonometric functions
cosp		trig_sun (3m)	- more trigonometric functions
cospi		trig_sun (3m)	- more trigonometric functions
cosqb		cosqb (3p)	- synthesize a Fourier sequence from its representation in terms of a cosine  series with odd wave numbers. The xCOSQ operations are unnormalized inverses of themselves, so a call to xCOSQF followed by a call  to xCOSQB will multiply the input sequence by 4 * N.	The VxCOSQ operations are normalized, so a call  of VxCOSQF followed by a call of VxCOSQB will return the original sequence.
cosqf		cosqf (3p)	- compute the Fourier coefficients in a cosine series representation with only	odd wave numbers. The xCOSQ operations are unnormalized inverses of themselves, so a call to xCOSQF followed by a call	to xCOSQB will multiply the input sequence by 4 * N.  The VxCOSQ operations are normalized, so a call  of VxCOSQF followed by a call of VxCOSQB will return the original sequence.
cosqi		cosqi (3p)	- initialize the array xWSAVE, which is used in both xCOSQF and  xCOSQB.
costi		costi (3p)	- initialize the array xWSAVE, which is used in xCOST.
cpbco		cpbco (3p)	- compute a Cholesky factorization and condition number of a symmetric positive definite matrix A in banded storage.  If the condition number is not needed then xPBFA is slightly faster.  It is typical to follow a call to xPBCO with a call to xPBSL to solve Ax = b or to xPBDI to compute the determinant of A.
cpbcon		cpbcon (3p)	- estimate the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite band matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPBTRF
cpbdi		cpbdi (3p)	- compute the determinant of a symmetric positive definite matrix A in banded storage, which has been Cholesky-factored by xPBCO or xPBFA.
cpbequ		cpbequ (3p)	- compute row and column scalings intended to equilibrate a Hermitian positive definite band matrix A and reduce its condition number (with respect to the two-norm)
cpbfa		cpbfa (3p)	- compute a Cholesky factorization of a symmetric positive definite matrix A in banded storage.  It is typical to follow a call to xPBFA with a call to xPBSL to solve Ax = b or to xPBDI to compute the determinant of A.
cpbrfs		cpbrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and banded, and provides error bounds and backward error estimates for the solution
cpbsl		cpbsl (3p)	- section solve the linear system Ax = b for a symmetric positive definite matrix A in banded storage, which has been Cholesky-factored by xPBCO or xPBFA, and vectors b and x.
cpbstf		cpbstf (3p)	- compute a split Cholesky factorization of a complex Hermitian positive definite band matrix A
cpbsv		cpbsv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
cpbsvx		cpbsvx (3p)	- 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 * X = B,
cpbtf2		cpbtf2 (3p)	- compute the Cholesky factorization of a complex Hermitian positive definite band matrix A
cpbtrf		cpbtrf (3p)	- compute the Cholesky factorization of a complex Hermitian positive definite band matrix A
cpbtrs		cpbtrs (3p)	- solve a system of linear equations A*X = B with a Hermitian positive definite band matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPBTRF
cplx.intro	cplx.intro (3)	- introduction to C++ complex number math library
cplxerr 	cplxerr (3)	- error-handling functions in the C++ complex number math library
cplxexp 	cplxexp (3)	- functions in the C++ complex number math library
cplxops 	cplxops (3)	- arithmetic operator functions in the C++ complex number math library
cplxtrig	cplxtrig (3)	- trigonometric functions in the C++ complex number math library
cpoco		cpoco (3p)	- compute a Cholesky factorization and condition number of a symmetric positive definite matrix A.  If the condition number is not needed then xPOFA is slightly faster.  It is typical to follow a call to xPOCO with a call to xPOSL to solve Ax = b or to xPODI to compute the determinant and inverse of A.
cpocon		cpocon (3p)	- estimate the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPOTRF
cpodi		cpodi (3p)	- compute the determinant and inverse of a symmetric positive definite matrix A, which has been Cholesky-factored by xPOCO, xPOFA, or xQRDC.
cpoequ		cpoequ (3p)	- compute row and column scalings intended to equilibrate a Hermitian positive definite matrix A and reduce its condition number (with respect to the two-norm)
cpofa		cpofa (3p)	- compute a Cholesky factorization of a symmetric positive definite matrix A.  It is typical to follow a call to xPOFA with a call to xPOSL to solve Ax = b or to xPODI to compute the determinant and inverse of A.
cporfs		cporfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite,
cposl		cposl (3p)	- solve the linear system Ax = b for a symmetric positive definite matrix A, which has been Cholesky-factored by xPOCO or xPOFA, and vectors b and x.
cposv		cposv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
cposvx		cposvx (3p)	- 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 * X = B,
cpotf2		cpotf2 (3p)	- compute the Cholesky factorization of a complex Hermitian positive definite matrix A
cpotrf		cpotrf (3p)	- compute the Cholesky factorization of a complex Hermitian positive definite matrix A
cpotri		cpotri (3p)	- compute the inverse of a complex Hermitian positive definite matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPOTRF
cpotrs		cpotrs (3p)	- solve a system of linear equations A*X = B with a Hermitian positive definite matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPOTRF
cppco		cppco (3p)	- compute a Cholesky factorization and condition number of a symmetric positive definite matrix A in packed storage.  If the condition number is not needed then xPPFA is slightly faster.  It is typical to follow a call to xPPCO with a call to xPPSL to solve Ax = b or to xPPDI to compute the determinant and inverse of A.
cppcon		cppcon (3p)	- estimate the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite packed matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPPTRF
cppdi		cppdi (3p)	- compute the determinant and inverse of a symmetric positive definite matrix A in packed storage, which has been Cholesky-factored by xPPCO or xPPFA.
cppequ		cppequ (3p)	- compute row and column scalings intended to equilibrate a Hermitian positive definite matrix A in packed storage and reduce its condition number (with respect to the two-norm)
cppfa		cppfa (3p)	- compute a Cholesky factorization of a symmetric positive definite matrix A in packed storage.  It is typical to follow a call to xPPFA with a call to xPPSL to solve Ax = b or to xPPDI to compute the determinant and inverse of A.
cpprfs		cpprfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and packed, and provides error bounds and backward error estimates for the solution
cppsl		cppsl (3p)	- solve the linear system Ax = b for a symmetric positive definite matrix A in packed storage, which has been Cholesky-factored by xPPCO or xPPFA, and vectors b and x.
cppsv		cppsv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
cppsvx		cppsvx (3p)	- 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 * X = B,
cpptrf		cpptrf (3p)	- compute the Cholesky factorization of a complex Hermitian positive definite matrix A stored in packed format
cpptri		cpptri (3p)	- compute the inverse of a complex Hermitian positive definite matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPPTRF
cpptrs		cpptrs (3p)	- solve a system of linear equations A*X = B with a Hermitian positive definite matrix A in packed storage using the Cholesky factorization A = U**H*U or A = L*L**H computed by CPPTRF
cptcon		cptcon (3p)	- compute the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite tridiagonal matrix using the factorization A = L*D*L**H or A = U**H*D*U computed by CPTTRF
cpteqr		cpteqr (3p)	- compute all eigenvalues and, optionally, eigenvectors of a symmetric positive definite tridiagonal matrix by first factoring the matrix using SPTTRF and then calling CBDSQR to compute the singular values of the bidiagonal factor
cptrfs		cptrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and tridiagonal, and provides error bounds and backward error estimates for the solution
cptsl		cptsl (3p)	- solve the linear system Ax = b for a symmetric positive definite tridiagonal matrix A and vectors b and x.
cptsv		cptsv (3p)	- compute the solution to a complex system of linear equations A*X = B, where A is an N-by-N Hermitian positive definite tridiagonal matrix, and X and B are N-by-NRHS matrices
cptsvx		cptsvx (3p)	- use the factorization A = L*D*L**H to compute the solution to a complex system of linear equations A*X = B, where A is an N-by-N Hermitian positive definite tridiagonal matrix and X and B are N-by-NRHS matrices
cpttrf		cpttrf (3p)	- compute the factorization of a complex Hermitian positive definite tridiagonal matrix A
cpttrs		cpttrs (3p)	- solve a system of linear equations A * X = B with a Hermitian positive definite tridiagonal matrix A using the factorization A = U**H*D*U or A = L*D*L**H computed by CPTTRF
cqrdc		cqrdc (3p)	- compute the QR factorization of a general matrix A.  It is typical to follow a  call to xQRDC with a call to xQRSL to solve Ax = b or to xPODI to compute the determinant of A.
cqrsl		cqrsl (3p)	- solve the linear system Ax = b for a general matrix A, which has been QR- factored by xQRDC, and vectors b and x.
crot		crot (3p)	- apply a plane rotation, where the cos (C) is real and the sin (S) is complex, and the vectors CX and CY are complex
crotg		crotg (3p)	- Construct a Given's plane rotation
cscal		cscal (3p)	- Compute y := alpha * y
cscope		cscope (1)	- interactively examine a C program
csico		csico (3p)	- compute the UDU factorization and condition number of a symmetric matrix A.  If the condition number is not needed then xSIFA is slightly faster.  It is typical to follow a call to xSICO with a call to xSISL to solve Ax = b or to xSIDI to compute the determinant, inverse, and inertia of A.
csidi		csidi (3p)	- compute the determinant, inertia, and inverse of a symmetric matrix A, which has been UDU-factored by xSICO or xSIFA.
csifa		csifa (3p)	- compute the UDU factorization of a symmetric matrix A.  It is typical to follow a call to xSIFA with a call to xSISL to solve Ax = b or to xSIDI to compute the determinant, inverse, and inertia of A.
csisl		csisl (3p)	- solve the linear system Ax = b for a symmetric matrix A, which has been UDU-factored by xSICO or xSIFA, and vectors b and x.
cspco		cspco (3p)	- compute the UDU factorization and condition number of a symmetric matrix A in packed storage.  If the condition number is not needed then xSPFA is slightly faster.  It is typical to follow a call to xSPCO with a call to xSPSL to solve Ax = b or to xSPDI to compute the determinant, inverse, and inertia of A.
cspcon		cspcon (3p)	- estimate the reciprocal of the condition number (in the 1-norm) of a complex symmetric packed matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by CSPTRF
cspdi		cspdi (3p)	- compute the determinant, inertia, and inverse of a symmetric matrix A in packed storage, which has been UDU-factored by xSPCO or xSPFA.
cspfa		cspfa (3p)	- compute the UDU factorization of a symmetric matrix A in packed storage.  It is typical to follow a call to xSPFA with a call to xSPSL to solve Ax = b or to xSPDI to compute the determinant, inverse, and inertia of A.
cspmv		cspmv (3p)	- perform the matrix-vector operation	y := alpha*A*x + beta*y,
cspr		cspr (3p)	- perform the symmetric rank 1 operation   A := alpha*x*conjg( x' ) + A,
csprfs		csprfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite and packed, and provides error bounds and backward error estimates for the solution
cspsl		cspsl (3p)	- solve the linear system Ax = b for a symmetric matrix A in packed storage, which has been UDU-factored by xSPCO or xSPFA, and vectors b and x.
cspsv		cspsv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
cspsvx		cspsvx (3p)	- use the diagonal pivoting factorization A = U*D*U**T or A = L*D*L**T to compute the solution to a complex system of linear equations A * X = B, where A is an N-by-N symmetric matrix stored in packed format and X and B are N-by-NRHS matrices
csptrf		csptrf (3p)	- compute the factorization of a complex symmetric matrix A stored in packed format using the Bunch-Kaufman diagonal pivoting method
csptri		csptri (3p)	- compute the inverse of a complex symmetric indefinite matrix A in packed storage using the factorization A = U*D*U**T or A = L*D*L**T computed by CSPTRF
csptrs		csptrs (3p)	- solve a system of linear equations A*X = B with a complex symmetric matrix A stored in packed format using the factorization A = U*D*U**T or A = L*D*L**T computed by CSPTRF
csrot		csrot (3p)	- Apply a Given's rotation constructed by SROTG.
csrscl		csrscl (3p)	- multiply an n-element complex vector x by the real scalar 1/a
csscal		csscal (3p)	- Compute y := alpha * y
cstedc		cstedc (3p)	- compute all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the divide and conquer method
cstein		cstein (3p)	- compute the eigenvectors of a real symmetric tridiagonal matrix T corresponding to specified eigenvalues, using inverse iteration
csteqr		csteqr (3p)	- compute all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the implicit QL or QR method
csvdc		csvdc (3p)	- compute the singular value decomposition of a general matrix A.
cswap		cswap (3p)	- Exchange vectors x and y.
csycon		csycon (3p)	- estimate the reciprocal of the condition number (in the 1-norm) of a complex symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by CSYTRF
csymm		csymm (3p)	- perform one of the matrix-matrix operations	C := alpha*A*B + beta*C or C := alpha*B*A + beta*C
csymv		csymv (3p)	- perform the matrix-vector operation	y := alpha*A*x + beta*y,
csyr		csyr (3p)	- perform the symmetric rank 1 operation   A := alpha*x*( x' ) + A,
csyr2k		csyr2k (3p)	- perform one of the symmetric rank 2k operations   C := alpha*A*B' + alpha*B*A' + beta*C or C := alpha*A'*B + alpha*B'*A + beta*C
csyrfs		csyrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite, and provides error bounds and backward error estimates for the solution
csyrk		csyrk (3p)	- perform one of the symmetric rank k operations   C := alpha*A*A' + beta*C or C := alpha*A'*A + beta*C
csysv		csysv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
csysvx		csysvx (3p)	- use the diagonal pivoting factorization to compute the solution to a complex system of linear equations A * X = B,
csytf2		csytf2 (3p)	- compute the factorization of a complex symmetric matrix A using the Bunch-Kaufman diagonal pivoting method
csytrf		csytrf (3p)	- compute the factorization of a complex symmetric matrix A using the Bunch-Kaufman diagonal pivoting method
csytri		csytri (3p)	- compute the inverse of a complex symmetric indefinite matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by CSYTRF
csytrs		csytrs (3p)	- solve a system of linear equations A*X = B with a complex symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by CSYTRF
ctbcon		ctbcon (3p)	- estimate the reciprocal of the condition number of a triangular band matrix A, in either the 1-norm or the infinity-norm
ctbmv		ctbmv (3p)	- perform one of the matrix-vector operations	x := A*x, or x := A'*x, or x := conjg( A' )*x
ctbrfs		ctbrfs (3p)	- provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular band coefficient matrix
ctbsv		ctbsv (3p)	- solve one of the systems of equations   A*x = b, or A'*x = b, or conjg( A' )*x = b
ctbtrs		ctbtrs (3p)	- solve a triangular system of the form   A * X = B, A**T * X = B, or A**H * X = B,
ctgevc		ctgevc (3p)	- compute some or all of the right and/or left generalized eigenvectors of a pair of complex upper triangular matrices (A,B)
ctgsja		ctgsja (3p)	- compute the generalized singular value decomposition (GSVD) of two complex upper triangular (or trapezoidal) matrices A and B
ctpcon		ctpcon (3p)	- estimate the reciprocal of the condition number of a packed triangular matrix A, in either the 1-norm or the infinity-norm
ctpmv		ctpmv (3p)	- perform one of the matrix-vector operations	x := A*x, or x := A'*x, or x := conjg( A' )*x
ctprfs		ctprfs (3p)	- provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular packed coefficient matrix
ctpsv		ctpsv (3p)	- solve one of the systems of equations   A*x = b, or A'*x = b, or conjg( A' )*x = b
ctptri		ctptri (3p)	- compute the inverse of a complex upper or lower triangular matrix A stored in packed format
ctptrs		ctptrs (3p)	- solve a triangular system of the form   A * X = B, A**T * X = B, or A**H * X = B,
ctrace		ctrace (1)	- C program debugger
ctrco		ctrco (3p)	- estimate the condition number of a triangular matrix A.  It is typical to follow a call to xTRCO with a call to xTRSL to solve Ax = b or to xTRDI to compute the determinant and inverse of A.
ctrcon		ctrcon (3p)	- estimate the reciprocal of the condition number of a triangular matrix A, in either the 1-norm or the infinity-norm
ctrdi		ctrdi (3p)	- compute the determinant and inverse of a triangular matrix A.
ctrevc		ctrevc (3p)	- compute some or all of the right and/or left eigenvectors of a complex upper triangular matrix T
ctrexc		ctrexc (3p)	- reorder the Schur factorization of a complex matrix A = Q*T*Q**H, so that the diagonal element of T with row index IFST is moved to row ILST
ctrmm		ctrmm (3p)	- perform one of the matrix-matrix operations	B := alpha*op( A )*B, or B := alpha*B*op( A )  where alpha is a scalar, B is an m by n matrix, A is a unit, or non-unit, upper or lower triangular matrix and op( A ) is one of   op( A ) = A or op( A ) = A' or op( A ) = conjg( A' )
ctrmv		ctrmv (3p)	- perform one of the matrix-vector operations	x := A*x, or x := A'*x, or x := conjg( A' )*x
ctrrfs		ctrrfs (3p)	- provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix
ctrsen		ctrsen (3p)	- reorder the Schur factorization of a complex matrix A = Q*T*Q**H, so that a selected cluster of eigenvalues appears in the leading positions on the diagonal of the upper triangular matrix T, and the leading columns of Q form an orthonormal basis of the corresponding right invariant subspace
ctrsl		ctrsl (3p)	- solve the linear system Ax = b for a triangular matrix A and vectors b and x.
ctrsm		ctrsm (3p)	- solve one of the matrix equations op( A )*X = alpha*B, or X*op( A ) = alpha*B
ctrsna		ctrsna (3p)	- estimate reciprocal condition numbers for specified eigenvalues and/or right eigenvectors of a complex upper triangular matrix T (or of any matrix Q*T*Q**H with Q unitary)
ctrsv		ctrsv (3p)	- solve one of the systems of equations   A*x = b, or A'*x = b, or conjg( A' )*x = b
ctrsyl		ctrsyl (3p)	- solve the complex Sylvester matrix equation
ctrti2		ctrti2 (3p)	- compute the inverse of a complex upper or lower triangular matrix
ctrtri		ctrtri (3p)	- compute the inverse of a complex upper or lower triangular matrix A
ctrtrs		ctrtrs (3p)	- solve a triangular system of the form   A * X = B, A**T * X = B, or A**H * X = B,
ctzrqf		ctzrqf (3p)	- reduce the M-by-N ( M<=N ) complex upper trapezoidal matrix A to upper triangular form by means of unitary transformations
cung2l		cung2l (3p)	- generate an m by n complex matrix Q with orthonormal columns,
cung2r		cung2r (3p)	- generate an m by n complex matrix Q with orthonormal columns,
cungbr		cungbr (3p)	- generate one of the complex unitary matrices Q or P**H determined by CGEBRD when reducing a complex matrix A to bidiagonal form
cunghr		cunghr (3p)	- generate a complex unitary matrix Q which is defined as the product of IHI-ILO elementary reflectors of order N, as returned by CGEHRD
cungl2		cungl2 (3p)	- generate an m-by-n complex matrix Q with orthonormal rows,
cunglq		cunglq (3p)	- generate an M-by-N complex matrix Q with orthonormal rows,
cungql		cungql (3p)	- generate an M-by-N complex matrix Q with orthonormal columns,
cungqr		cungqr (3p)	- generate an M-by-N complex matrix Q with orthonormal columns,
cungr2		cungr2 (3p)	- generate an m by n complex matrix Q with orthonormal rows,
cungrq		cungrq (3p)	- generate an M-by-N complex matrix Q with orthonormal rows,
cungtr		cungtr (3p)	- generate a complex unitary matrix Q which is defined as the product of n-1 elementary reflectors of order N, as returned by CHETRD
cunm2l		cunm2l (3p)	- overwrite the general complex m-by-n matrix C with   Q * C if SIDE = 'L' and TRANS = 'N', or	 Q'* C if SIDE = 'L' and TRANS = 'C', or   C * Q if SIDE = 'R' and TRANS = 'N', or   C * Q' if SIDE = 'R' and TRANS = 'C',
cunm2r		cunm2r (3p)	- overwrite the general complex m-by-n matrix C with   Q * C if SIDE = 'L' and TRANS = 'N', or	 Q'* C if SIDE = 'L' and TRANS = 'C', or   C * Q if SIDE = 'R' and TRANS = 'N', or   C * Q' if SIDE = 'R' and TRANS = 'C',
cunmbr		cunmbr (3p)	- VECT = 'Q', CUNMBR overwrites the general complex M-by-N matrix C with  SIDE = 'L' SIDE = 'R' TRANS = 'N'
cunmhr		cunmhr (3p)	- overwrite the general complex M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
cunml2		cunml2 (3p)	- overwrite the general complex m-by-n matrix C with   Q * C if SIDE = 'L' and TRANS = 'N', or	 Q'* C if SIDE = 'L' and TRANS = 'C', or   C * Q if SIDE = 'R' and TRANS = 'N', or   C * Q' if SIDE = 'R' and TRANS = 'C',
cunmlq		cunmlq (3p)	- overwrite the general complex M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
cunmql		cunmql (3p)	- overwrite the general complex M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
cunmqr		cunmqr (3p)	- overwrite the general complex M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
cunmr2		cunmr2 (3p)	- overwrite the general complex m-by-n matrix C with   Q * C if SIDE = 'L' and TRANS = 'N', or	 Q'* C if SIDE = 'L' and TRANS = 'C', or   C * Q if SIDE = 'R' and TRANS = 'N', or   C * Q' if SIDE = 'R' and TRANS = 'C',
cunmrq		cunmrq (3p)	- overwrite the general complex M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
cunmtr		cunmtr (3p)	- overwrite the general complex M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
cupgtr		cupgtr (3p)	- generate a complex unitary matrix Q which is defined as the product of n-1 elementary reflectors H(i) of order n, as returned by CHPTRD using packed storage
cupmtr		cupmtr (3p)	- overwrite the general complex M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
cxref		cxref (1)	- generate C program cross-reference
dasum		dasum (3p)	- Return the sum of the absolute values of a vector x.
daxpy		daxpy (3p)	- Compute y := alpha * x + y
dbdsqr		dbdsqr (3p)	- compute the singular value decomposition (SVD) of a real N-by-N (upper or lower) bidiagonal matrix B
dbx		dbx (1) 	- source-level debugging tool
dbxinit 	dbxinit (4)	- commands to dbx
dbxrc		dbxrc (4)	- commands to dbx
dchdc		dchdc (3p)	- compute the Cholesky decomposition of a symmetric positive definite matrix A.
dchdd		dchdd (3p)	- downdate an augmented Cholesky decomposition of the triangular part of an augmented QR decomposition.
dchex		dchex (3p)	- compute the Cholesky decomposition of a symmetric positive definite matrix A.
dchud		dchud (3p)	- update an augmented Cholesky decomposition of the triangular part of an augmented QR decomposition.
dcopy		dcopy (3p)	- Copy x to y
dcosqb		dcosqb (3p)	- synthesize a Fourier sequence from its representation in terms of a cosine  series with odd wave numbers. The xCOSQ operations are unnormalized inverses of themselves, so a call to xCOSQF followed by a call  to xCOSQB will multiply the input sequence by 4 * N.	The VxCOSQ operations are normalized, so a call  of VxCOSQF followed by a call of VxCOSQB will return the original sequence.
dcosqf		dcosqf (3p)	- compute the Fourier coefficients in a cosine series representation with only	odd wave numbers. The xCOSQ operations are unnormalized inverses of themselves, so a call to xCOSQF followed by a call	to xCOSQB will multiply the input sequence by 4 * N.  The VxCOSQ operations are normalized, so a call  of VxCOSQF followed by a call of VxCOSQB will return the original sequence.
dcosqi		dcosqi (3p)	- initialize the array xWSAVE, which is used in both xCOSQF and  xCOSQB.
dcosti		dcosti (3p)	- initialize the array xWSAVE, which is used in xCOST.
ddisna		ddisna (3p)	- compute the reciprocal condition numbers for the eigenvectors of a real symmetric or complex Hermitian matrix or for the left or right singular vectors of a general m-by-n matrix
ddot		ddot (3p)	- Compute the dot product of two vectors x and y.
def.dir.flp	def.dir.flp (1) - default directory file list program
dem		dem (1) 	- demangle a C++ name
demangle	demangle (3)	- decode a C++ encoded symbol name
dfftb		dfftb (3p)	- compute a perodic sequence from its Fourier coefficients.  The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the  input sequence by N.  The VxFFT operations are normalized, so a call of VxFFTF followed by a call of  VxFFTB will return the original sequence.
dfftf		dfftf (3p)	- compute the Fourier coefficients of a perodic sequence.  The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the  input sequence by N.  The VxFFT operations are normalized, so a call of VxFFTF followed by a call of  VxFFTB will return the original sequence.
dffti		dffti (3p)	- initialize the array xWSAVE, which is used in both xFFTF and xFFTB.
dgbbrd		dgbbrd (3p)	- reduce a real general m-by-n band matrix A to upper bidiagonal form B by an orthogonal transformation
dgbco		dgbco (3p)	- compute the LU factorization and condition number of a general matrix A in banded storage.  If the condition number is not needed then xGBFA is slightly faster.  It is typical to follow a call to xGBCO with a call to xGBSL to solve Ax = b or to xGBDI to compute the determinant of A.
dgbcon		dgbcon (3p)	- estimate the reciprocal of the condition number of a real general band matrix A, in either the 1-norm or the infinity-norm,
dgbdi		dgbdi (3p)	- compute the determinant of a general matrix A in banded storage, which has been LU-factored by xGBCO or xGBFA.
dgbequ		dgbequ (3p)	- compute row and column scalings intended to equilibrate an M-by-N band matrix A and reduce its condition number
dgbfa		dgbfa (3p)	- compute the LU factorization of a matrix A in banded storage.  It is typical to follow a call to xGBFA with a call to xGBSL to solve Ax = b or to xGBDI to compute the determinant of A.
dgbmv		dgbmv (3p)	- perform one of the matrix-vector operations	y := alpha*A*x + beta*y or y := alpha*A'*x + beta*y
dgbrfs		dgbrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is banded, and provides error bounds and backward error estimates for the solution
dgbsl		dgbsl (3p)	- solve the linear system Ax = b for a matrix A in banded storage, which has been LU-factored by xGBCO or xGBFA, and vectors b and x.
dgbsv		dgbsv (3p)	- compute the solution to a real system of linear equations A * X = B, where A is a band matrix of order N with KL subdiagonals and KU superdiagonals, and X and B are N-by-NRHS matrices
dgbsvx		dgbsvx (3p)	- use the LU factorization to compute the solution to a real system of linear equations A * X = B, A**T * X = B, or A**H * X = B,
dgbtf2		dgbtf2 (3p)	- compute an LU factorization of a real m-by-n band matrix A using partial pivoting with row interchanges
dgbtrf		dgbtrf (3p)	- compute an LU factorization of a real m-by-n band matrix A using partial pivoting with row interchanges
dgbtrs		dgbtrs (3p)	- solve a system of linear equations  A * X = B or A' * X = B with a general band matrix A using the LU factorization computed by DGBTRF
dgebak		dgebak (3p)	- form the right or left eigenvectors of a real general matrix by backward transformation on the computed eigenvectors of the balanced matrix output by DGEBAL
dgebal		dgebal (3p)	- balance a general real matrix A
dgebd2		dgebd2 (3p)	- reduce a real general m by n matrix A to upper or lower bidiagonal form B by an orthogonal transformation
dgebrd		dgebrd (3p)	- reduce a general real M-by-N matrix A to upper or lower bidiagonal form B by an orthogonal transformation
dgeco		dgeco (3p)	- compute the LU factorization and estimate the condition number of a general matrix A.  If the condition number is not needed then xGEFA is slightly faster.  It is typical to follow a call to xGECO with a call to xGESL to solve Ax = b or to xGEDI to compute the determinant and inverse of A.
dgecon		dgecon (3p)	- estimate the reciprocal of the condition number of a general real matrix A, in either the 1-norm or the infinity-norm, using the LU factorization computed by DGETRF
dgedi		dgedi (3p)	- compute the determinant and inverse of a general matrix A, which has been LU-factored by xGECO or xGEFA.
dgeequ		dgeequ (3p)	- compute row and column scalings intended to equilibrate an M-by-N matrix A and reduce its condition number
dgees		dgees (3p)	- compute for an N-by-N real nonsymmetric matrix A, the eigenvalues, the real Schur form T, and, optionally, the matrix of Schur vectors Z
dgeesx		dgeesx (3p)	- compute for an N-by-N real nonsymmetric matrix A, the eigenvalues, the real Schur form T, and, optionally, the matrix of Schur vectors Z
dgeev		dgeev (3p)	- compute for an N-by-N real nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors
dgeevx		dgeevx (3p)	- compute for an N-by-N real nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors
dgefa		dgefa (3p)	- compute the LU factorization of a general matrix A.  It is typical to follow a call to xGEFA with a call to xGESL to solve Ax = b or to xGEDI to compute the determinant of A.
dgegs		dgegs (3p)	- compute for a pair of N-by-N real nonsymmetric matrices A, B
dgegv		dgegv (3p)	- compute for a pair of n-by-n real nonsymmetric matrices A and B, the generalized eigenvalues (alphar +/- alphai*i, beta), and optionally, the left and/or right generalized eigenvectors (VL and VR)
dgehd2		dgehd2 (3p)	- reduce a real general matrix A to upper Hessenberg form H by an orthogonal similarity transformation
dgehrd		dgehrd (3p)	- reduce a real general matrix A to upper Hessenberg form H by an orthogonal similarity transformation
dgelq2		dgelq2 (3p)	- compute an LQ factorization of a real m by n matrix A
dgelqf		dgelqf (3p)	- compute an LQ factorization of a real M-by-N matrix A
dgels		dgels (3p)	- solve overdetermined or underdetermined real linear systems involving an M-by-N matrix A, or its transpose, using a QR or LQ factorization of A
dgelss		dgelss (3p)	- compute the minimum norm solution to a real linear least squares problem
dgelsx		dgelsx (3p)	- compute the minimum-norm solution to a real linear least squares problem
dgemm		dgemm (3p)	- perform one of the matrix-matrix operations	C := alpha*op( A )*op( B ) + beta*C
dgemv		dgemv (3p)	- perform one of the matrix-vector operations y := alpha*A*x + beta*y or y := alpha*A'*x + beta*y
dgeql2		dgeql2 (3p)	- compute a QL factorization of a real m by n matrix A
dgeqlf		dgeqlf (3p)	- compute a QL factorization of a real M-by-N matrix A
dgeqpf		dgeqpf (3p)	- compute a QR factorization with column pivoting of a real M-by-N matrix A
dgeqr2		dgeqr2 (3p)	- compute a QR factorization of a real m by n matrix A
dgeqrf		dgeqrf (3p)	- compute a QR factorization of a real M-by-N matrix A
dger		dger (3p)	- perform the rank 1 operation	 A := alpha*x*y' + A
dgerfs		dgerfs (3p)	- improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solution
dgerq2		dgerq2 (3p)	- compute an RQ factorization of a real m by n matrix A
dgerqf		dgerqf (3p)	- compute an RQ factorization of a real M-by-N matrix A
dgesl		dgesl (3p)	- solve the linear system Ax = b for a general matrix A, which has been LU- factored by xGECO or xGEFA, and vectors b and x.
dgesv		dgesv (3p)	- compute the solution to a real system of linear equations  A * X = B,
dgesvd		dgesvd (3p)	- compute the singular value decomposition (SVD) of a real M-by-N matrix A, optionally computing the left and/or right singular vectors
dgesvx		dgesvx (3p)	- use the LU factorization to compute the solution to a real system of linear equations  A * X = B,
dgetf2		dgetf2 (3p)	- compute an LU factorization of a general m-by-n matrix A using partial pivoting with row interchanges
dgetrf		dgetrf (3p)	- compute an LU factorization of a general M-by-N matrix A using partial pivoting with row interchanges
dgetri		dgetri (3p)	- compute the inverse of a matrix using the LU factorization computed by DGETRF
dgetrs		dgetrs (3p)	- solve a system of linear equations  A * X = B or A' * X = B with a general N-by-N matrix A using the LU factorization computed by DGETRF
dggbak		dggbak (3p)	- form the right or left eigenvectors of a real generalized eigenvalue problem A*x = lambda*B*x, by backward transformation on the computed eigenvectors of the balanced pair of matrices output by DGGBAL
dggbal		dggbal (3p)	- balance a pair of general real matrices (A,B)
dggglm		dggglm (3p)	- solve a general Gauss-Markov linear model (GLM) problem
dgghrd		dgghrd (3p)	- reduce a pair of real matrices (A,B) to generalized upper Hessenberg form using orthogonal transformations, where A is a general matrix and B is upper triangular
dgglse		dgglse (3p)	- solve the linear equality-constrained least squares (LSE) problem
dggqrf		dggqrf (3p)	- compute a generalized QR factorization of an N-by-M matrix A and an N-by-P matrix B
dggrqf		dggrqf (3p)	- compute a generalized RQ factorization of an M-by-N matrix A and a P-by-N matrix B
dggsvd		dggsvd (3p)	- compute the generalized singular value decomposition (GSVD) of an M-by-N real matrix A and P-by-N real matrix B
dggsvp		dggsvp (3p)	- compute orthogonal matrices U, V and Q such that   N-K-L K L	U'*A*Q = K ( 0 A12 A13 ) if M-K-L >= 0
dgtcon		dgtcon (3p)	- estimate the reciprocal of the condition number of a real tridiagonal matrix A using the LU factorization as computed by DGTTRF
dgtrfs		dgtrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is tridiagonal, and provides error bounds and backward error estimates for the solution
dgtsl		dgtsl (3p)	- solve the linear system Ax = b for a tridiagonal matrix A and vectors b and x.
dgtsv		dgtsv (3p)	- solve the equation   A*X = B,
dgtsvx		dgtsvx (3p)	- use the LU factorization to compute the solution to a real system of linear equations A * X = B or A**T * X = B,
dgttrf		dgttrf (3p)	- compute an LU factorization of a real tridiagonal matrix A using elimination with partial pivoting and row interchanges
dgttrs		dgttrs (3p)	- solve one of the systems of equations  A*X = B or A'*X = B,
dhsein		dhsein (3p)	- use inverse iteration to find specified right and/or left eigenvectors of a real upper Hessenberg matrix H
dhseqr		dhseqr (3p)	- compute the eigenvalues of a real upper Hessenberg matrix H and, optionally, the matrices T and Z from the Schur decomposition H = Z T Z**T, where T is an upper quasi-triangular matrix (the Schur form), and Z is the orthogonal matrix of Schur vectors
dlabad		dlabad (3p)	- take as input the values computed by SLAMCH for underflow and overflow, and returns the square root of each of these values if the log of LARGE is sufficiently large
dlabrd		dlabrd (3p)	- reduce the first NB rows and columns of a real general m by n matrix A to upper or lower bidiagonal form by an orthogonal transformation Q' * A * P, and returns the matrices X and Y which are needed to apply the transformation to the unreduced part of A
dlacon		dlacon (3p)	- estimate the 1-norm of a square, real matrix A
dlacpy		dlacpy (3p)	- copie all or part of a two-dimensional matrix A to another matrix B
dlae2		dlae2 (3p)	- compute the eigenvalues of a 2-by-2 symmetric matrix	[ A B ]  [ B C ]
dlaebz		dlaebz (3p)	- contain the iteration loops which compute and use the function N(w), which is the count of eigenvalues of a symmetric tridiagonal matrix T less than or equal to its argument w
dlaed0		dlaed0 (3p)	- compute all eigenvalues and corresponding eigenvectors of a symmetric tridiagonal matrix using the divide and conquer method
dlaed1		dlaed1 (3p)	- compute the updated eigensystem of a diagonal matrix after modification by a rank-one symmetric matrix
dlaed2		dlaed2 (3p)	- merge the two sets of eigenvalues together into a single sorted set
dlaed3		dlaed3 (3p)	- find the roots of the secular equation, as defined by the values in D, W, and RHO, between KSTART and KSTOP
dlaed4		dlaed4 (3p)	- subroutine computes the I-th updated eigenvalue of a symmetric rank-one modification to a diagonal matrix whose elements are given in the array d, and that	D(i) < D(j) for i < j  and that RHO > 0
dlaed5		dlaed5 (3p)	- subroutine computes the I-th eigenvalue of a symmetric rank-one modification of a 2-by-2 diagonal matrix   diag( D ) + RHO  The diagonal elements in the array D are assumed to satisfy   D(i) < D(j) for i < j 
dlaed7		dlaed7 (3p)	- compute the updated eigensystem of a diagonal matrix after modification by a rank-one symmetric matrix
dlaed8		dlaed8 (3p)	- merge the two sets of eigenvalues together into a single sorted set
dlaed9		dlaed9 (3p)	- find the roots of the secular equation, as defined by the values in D, Z, and RHO, between KSTART and KSTOP
dlaeda		dlaeda (3p)	- compute the Z vector corresponding to the merge step in the CURLVLth step of the merge process with TLVLS steps for the CURPBMth problem
dlaein		dlaein (3p)	- use inverse iteration to find a right or left eigenvector corresponding to the eigenvalue (WR,WI) of a real upper Hessenberg matrix H
dlaev2		dlaev2 (3p)	- compute the eigendecomposition of a 2-by-2 symmetric matrix  [ A B ]	[ B C ]
dlaexc		dlaexc (3p)	- swap adjacent diagonal blocks T11 and T22 of order 1 or 2 in an upper quasi-triangular matrix T by an orthogonal similarity transformation
dlahqr		dlahqr (3p)	- i an auxiliary routine called by DHSEQR to update the eigenvalues and Schur decomposition already computed by DHSEQR, by dealing with the Hessenberg submatrix in rows and columns ILO to IHI
dlahrd		dlahrd (3p)	- reduce the first NB columns of a real general n-by-(n-k+1) matrix A so that elements below the k-th subdiagonal are zero
dlaic1		dlaic1 (3p)	- applie one step of incremental condition estimation in its simplest version
dlamch		dlamch (3p)	- determine double precision machine parameters
dlamrg		dlamrg (3p)	- will create a permutation list which will merge the elements of A (which is composed of two independently sorted sets) into a single set which is sorted in ascending order
dlangb		dlangb (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n band matrix A, with kl sub-diagonals and ku super-diagonals
dlange		dlange (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real matrix A
dlangt		dlangt (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real tridiagonal matrix A
dlanhs		dlanhs (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a Hessenberg matrix A
dlansb		dlansb (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n symmetric band matrix A, with k super-diagonals
dlansp		dlansp (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real symmetric matrix A, supplied in packed form
dlanst		dlanst (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real symmetric tridiagonal matrix A
dlansy		dlansy (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real symmetric matrix A
dlantb		dlantb (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n triangular band matrix A, with ( k + 1 ) diagonals
dlantp		dlantp (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a triangular matrix A, supplied in packed form
dlantr		dlantr (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a trapezoidal or triangular matrix A
dlanv2		dlanv2 (3p)	- compute the Schur factorization of a real 2-by-2 nonsymmetric matrix in standard form
dlapll		dlapll (3p)	- two column vectors X and Y, let   A = ( X Y )
dlapmt		dlapmt (3p)	- rearrange the columns of the M by N matrix X as specified by the permutation K(1),K(2),...,K(N) of the integers 1,...,N
dlapy2		dlapy2 (3p)	- return sqrt(x**2+y**2), taking care not to cause unnecessary overflow
dlapy3		dlapy3 (3p)	- return sqrt(x**2+y**2+z**2), taking care not to cause unnecessary overflow
dlaqgb		dlaqgb (3p)	- equilibrate a general M by N band matrix A with KL subdiagonals and KU superdiagonals using the row and scaling factors in the vectors R and C
dlaqge		dlaqge (3p)	- equilibrate a general M by N matrix A using the row and scaling factors in the vectors R and C
dlaqsb		dlaqsb (3p)	- equilibrate a symmetric band matrix A using the scaling factors in the vector S
dlaqsp		dlaqsp (3p)	- equilibrate a symmetric matrix A using the scaling factors in the vector S
dlaqsy		dlaqsy (3p)	- equilibrate a symmetric matrix A using the scaling factors in the vector S
dlaqtr		dlaqtr (3p)	- solve the real quasi-triangular system   op(T)*p = scale*c, if LREAL = .TRUE
dlar2v		dlar2v (3p)	- applie a vector of real plane rotations from both sides to a sequence of 2-by-2 real symmetric matrices, defined by the elements of the vectors x, y and z
dlarf		dlarf (3p)	- applie a real elementary reflector H to a real m by n matrix C, from either the left or the right
dlarfb		dlarfb (3p)	- applie a real block reflector H or its transpose H' to a real m by n matrix C, from either the left or the right
dlarfg		dlarfg (3p)	- generate a real elementary reflector H of order n, such that	 H * ( alpha ) = ( beta ), H' * H = I
dlarft		dlarft (3p)	- form the triangular factor T of a real block reflector H of order n, which is defined as a product of k elementary reflectors
dlarfx		dlarfx (3p)	- applie a real elementary reflector H to a real m by n matrix C, from either the left or the right
dlargv		dlargv (3p)	- generate a vector of real plane rotations, determined by elements of the real vectors x and y
dlarnv		dlarnv (3p)	- return a vector of n random real numbers from a uniform or normal distribution
dlartg		dlartg (3p)	- generate a plane rotation so that   [ CS SN ] 
dlartv		dlartv (3p)	- applie a vector of real plane rotations to elements of the real vectors x and y
dlaruv		dlaruv (3p)	- return a vector of n random real numbers from a uniform (0,1)
dlas2		dlas2 (3p)	- compute the singular values of the 2-by-2 matrix  [ F G ]  [ 0 H ]
dlascl		dlascl (3p)	- multiply the M by N real matrix A by the real scalar CTO/CFROM
dlaset		dlaset (3p)	- initialize an m-by-n matrix A to BETA on the diagonal and ALPHA on the offdiagonals
dlasq1		dlasq1 (3p)	- DLASQ1 computes the singular values of a real N-by-N bidiagonal  matrix with diagonal D and off-diagonal E
dlasq2		dlasq2 (3p)	- DLASQ2 computes the singular values of a real N-by-N unreduced  bidiagonal matrix with squared diagonal elements in Q and  squared off-diagonal elements in E
dlasq3		dlasq3 (3p)	- DLASQ3 is the workhorse of the whole bidiagonal SVD algorithm
dlasq4		dlasq4 (3p)	- DLASQ4 estimates TAU, the smallest eigenvalue of a matrix
dlasr		dlasr (3p)	- perform the transformation   A := P*A, when SIDE = 'L' or 'l' ( Left-hand side )   A := A*P', when SIDE = 'R' or 'r' ( Right-hand side )  where A is an m by n real matrix and P is an orthogonal matrix,
dlasrt		dlasrt (3p)	- the numbers in D in increasing order (if ID = 'I') or in decreasing order (if ID = 'D' )
dlassq		dlassq (3p)	- return the values scl and smsq such that   ( scl**2 )*smsq = x( 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq,
dlasv2		dlasv2 (3p)	- compute the singular value decomposition of a 2-by-2 triangular matrix  [ F G ]  [ 0 H ]
dlaswp		dlaswp (3p)	- perform a series of row interchanges on the matrix A
dlasy2		dlasy2 (3p)	- solve for the N1 by N2 matrix X, 1 <= N1,N2 <= 2, in	 op(TL)*X + ISGN*X*op(TR) = SCALE*B,
dlasyf		dlasyf (3p)	- compute a partial factorization of a real symmetric matrix A using the Bunch-Kaufman diagonal pivoting method
dlatbs		dlatbs (3p)	- solve one of the triangular systems	A *x = s*b or A'*x = s*b  with scaling to prevent overflow, where A is an upper or lower triangular band matrix
dlatps		dlatps (3p)	- solve one of the triangular systems	A *x = s*b or A'*x = s*b  with scaling to prevent overflow, where A is an upper or lower triangular matrix stored in packed form
dlatrd		dlatrd (3p)	- reduce NB rows and columns of a real symmetric matrix A to symmetric tridiagonal form by an orthogonal similarity transformation Q' * A * Q, and returns the matrices V and W which are needed to apply the transformation to the unreduced part of A
dlatrs		dlatrs (3p)	- solve one of the triangular systems	A *x = s*b or A'*x = s*b  with scaling to prevent overflow
dlatzm		dlatzm (3p)	- applie a Householder matrix generated by DTZRQF to a matrix
dlauu2		dlauu2 (3p)	- 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 array A
dlauum		dlauum (3p)	- 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 array A
dmake		dmake (1)	- DistributedMake
dnrm2		dnrm2 (3p)	- Return the Euclidian norm of a vector.
dopgtr		dopgtr (3p)	- generate a real orthogonal matrix Q which is defined as the product of n-1 elementary reflectors H(i) of order n, as returned by DSPTRD using packed storage
dopmtr		dopmtr (3p)	- overwrite the general real M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
dorg2l		dorg2l (3p)	- generate an m by n real matrix Q with orthonormal columns,
dorg2r		dorg2r (3p)	- generate an m by n real matrix Q with orthonormal columns,
dorgbr		dorgbr (3p)	- generate one of the real orthogonal matrices Q or P**T determined by DGEBRD when reducing a real matrix A to bidiagonal form
dorghr		dorghr (3p)	- generate a real orthogonal matrix Q which is defined as the product of IHI-ILO elementary reflectors of order N, as returned by DGEHRD
dorgl2		dorgl2 (3p)	- generate an m by n real matrix Q with orthonormal rows,
dorglq		dorglq (3p)	- generate an M-by-N real matrix Q with orthonormal rows,
dorgql		dorgql (3p)	- generate an M-by-N real matrix Q with orthonormal columns,
dorgqr		dorgqr (3p)	- generate an M-by-N real matrix Q with orthonormal columns,
dorgr2		dorgr2 (3p)	- generate an m by n real matrix Q with orthonormal rows,
dorgrq		dorgrq (3p)	- generate an M-by-N real matrix Q with orthonormal rows,
dorgtr		dorgtr (3p)	- generate a real orthogonal matrix Q which is defined as the product of n-1 elementary reflectors of order N, as returned by DSYTRD
dorm2l		dorm2l (3p)	- overwrite the general real m by n matrix C with   Q * C if SIDE = 'L' and TRANS = 'N', or   Q'* C if SIDE = 'L' and TRANS = 'T', or	C * Q if SIDE = 'R' and TRANS = 'N', or   C * Q' if SIDE = 'R' and TRANS = 'T',
dorm2r		dorm2r (3p)	- overwrite the general real m by n matrix C with   Q * C if SIDE = 'L' and TRANS = 'N', or   Q'* C if SIDE = 'L' and TRANS = 'T', or	C * Q if SIDE = 'R' and TRANS = 'N', or   C * Q' if SIDE = 'R' and TRANS = 'T',
dormbr		dormbr (3p)	- VECT = 'Q', DORMBR overwrites the general real M-by-N matrix C with  SIDE = 'L' SIDE = 'R' TRANS = 'N'
dormhr		dormhr (3p)	- overwrite the general real M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
dorml2		dorml2 (3p)	- overwrite the general real m by n matrix C with   Q * C if SIDE = 'L' and TRANS = 'N', or   Q'* C if SIDE = 'L' and TRANS = 'T', or	C * Q if SIDE = 'R' and TRANS = 'N', or   C * Q' if SIDE = 'R' and TRANS = 'T',
dormlq		dormlq (3p)	- overwrite the general real M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
dormql		dormql (3p)	- overwrite the general real M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
dormqr		dormqr (3p)	- overwrite the general real M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
dormr2		dormr2 (3p)	- overwrite the general real m by n matrix C with   Q * C if SIDE = 'L' and TRANS = 'N', or   Q'* C if SIDE = 'L' and TRANS = 'T', or	C * Q if SIDE = 'R' and TRANS = 'N', or   C * Q' if SIDE = 'R' and TRANS = 'T',
dormrq		dormrq (3p)	- overwrite the general real M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
dormtr		dormtr (3p)	- overwrite the general real M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
dpbco		dpbco (3p)	- compute a Cholesky factorization and condition number of a symmetric positive definite matrix A in banded storage.  If the condition number is not needed then xPBFA is slightly faster.  It is typical to follow a call to xPBCO with a call to xPBSL to solve Ax = b or to xPBDI to compute the determinant of A.
dpbcon		dpbcon (3p)	- estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite band matrix using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPBTRF
dpbdi		dpbdi (3p)	- compute the determinant of a symmetric positive definite matrix A in banded storage, which has been Cholesky-factored by xPBCO or xPBFA.
dpbequ		dpbequ (3p)	- compute row and column scalings intended to equilibrate a symmetric positive definite band matrix A and reduce its condition number (with respect to the two-norm)
dpbfa		dpbfa (3p)	- compute a Cholesky factorization of a symmetric positive definite matrix A in banded storage.  It is typical to follow a call to xPBFA with a call to xPBSL to solve Ax = b or to xPBDI to compute the determinant of A.
dpbrfs		dpbrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and banded, and provides error bounds and backward error estimates for the solution
dpbsl		dpbsl (3p)	- section solve the linear system Ax = b for a symmetric positive definite matrix A in banded storage, which has been Cholesky-factored by xPBCO or xPBFA, and vectors b and x.
dpbstf		dpbstf (3p)	- compute a split Cholesky factorization of a real symmetric positive definite band matrix A
dpbsv		dpbsv (3p)	- compute the solution to a real system of linear equations  A * X = B,
dpbsvx		dpbsvx (3p)	- 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 * X = B,
dpbtf2		dpbtf2 (3p)	- compute the Cholesky factorization of a real symmetric positive definite band matrix A
dpbtrf		dpbtrf (3p)	- compute the Cholesky factorization of a real symmetric positive definite band matrix A
dpbtrs		dpbtrs (3p)	- solve a system of linear equations A*X = B with a symmetric positive definite band matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPBTRF
dpoco		dpoco (3p)	- compute a Cholesky factorization and condition number of a symmetric positive definite matrix A.  If the condition number is not needed then xPOFA is slightly faster.  It is typical to follow a call to xPOCO with a call to xPOSL to solve Ax = b or to xPODI to compute the determinant and inverse of A.
dpocon		dpocon (3p)	- estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite matrix using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPOTRF
dpodi		dpodi (3p)	- compute the determinant and inverse of a symmetric positive definite matrix A, which has been Cholesky-factored by xPOCO, xPOFA, or xQRDC.
dpoequ		dpoequ (3p)	- compute row and column scalings intended to equilibrate a symmetric positive definite matrix A and reduce its condition number (with respect to the two-norm)
dpofa		dpofa (3p)	- compute a Cholesky factorization of a symmetric positive definite matrix A.  It is typical to follow a call to xPOFA with a call to xPOSL to solve Ax = b or to xPODI to compute the determinant and inverse of A.
dporfs		dporfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite,
dposl		dposl (3p)	- solve the linear system Ax = b for a symmetric positive definite matrix A, which has been Cholesky-factored by xPOCO or xPOFA, and vectors b and x.
dposv		dposv (3p)	- compute the solution to a real system of linear equations  A * X = B,
dposvx		dposvx (3p)	- 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 * X = B,
dpotf2		dpotf2 (3p)	- compute the Cholesky factorization of a real symmetric positive definite matrix A
dpotrf		dpotrf (3p)	- compute the Cholesky factorization of a real symmetric positive definite matrix A
dpotri		dpotri (3p)	- compute the inverse of a real symmetric positive definite matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPOTRF
dpotrs		dpotrs (3p)	- solve a system of linear equations A*X = B with a symmetric positive definite matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPOTRF
dppco		dppco (3p)	- compute a Cholesky factorization and condition number of a symmetric positive definite matrix A in packed storage.  If the condition number is not needed then xPPFA is slightly faster.  It is typical to follow a call to xPPCO with a call to xPPSL to solve Ax = b or to xPPDI to compute the determinant and inverse of A.
dppcon		dppcon (3p)	- estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite packed matrix using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPPTRF
dppdi		dppdi (3p)	- compute the determinant and inverse of a symmetric positive definite matrix A in packed storage, which has been Cholesky-factored by xPPCO or xPPFA.
dppequ		dppequ (3p)	- compute row and column scalings intended to equilibrate a symmetric positive definite matrix A in packed storage and reduce its condition number (with respect to the two-norm)
dppfa		dppfa (3p)	- compute a Cholesky factorization of a symmetric positive definite matrix A in packed storage.  It is typical to follow a call to xPPFA with a call to xPPSL to solve Ax = b or to xPPDI to compute the determinant and inverse of A.
dpprfs		dpprfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and packed, and provides error bounds and backward error estimates for the solution
dppsl		dppsl (3p)	- solve the linear system Ax = b for a symmetric positive definite matrix A in packed storage, which has been Cholesky-factored by xPPCO or xPPFA, and vectors b and x.
dppsv		dppsv (3p)	- compute the solution to a real system of linear equations  A * X = B,
dppsvx		dppsvx (3p)	- 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 * X = B,
dpptrf		dpptrf (3p)	- compute the Cholesky factorization of a real symmetric positive definite matrix A stored in packed format
dpptri		dpptri (3p)	- compute the inverse of a real symmetric positive definite matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPPTRF
dpptrs		dpptrs (3p)	- solve a system of linear equations A*X = B with a symmetric positive definite matrix A in packed storage using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPPTRF
dptcon		dptcon (3p)	- compute the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite tridiagonal matrix using the factorization A = L*D*L**T or A = U**T*D*U computed by DPTTRF
dpteqr		dpteqr (3p)	- compute all eigenvalues and, optionally, eigenvectors of a symmetric positive definite tridiagonal matrix by first factoring the matrix using DPTTRF, and then calling DBDSQR to compute the singular values of the bidiagonal factor
dptrfs		dptrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and tridiagonal, and provides error bounds and backward error estimates for the solution
dptsl		dptsl (3p)	- solve the linear system Ax = b for a symmetric positive definite tridiagonal matrix A and vectors b and x.
dptsv		dptsv (3p)	- compute the solution to a real system of linear equations A*X = B, where A is an N-by-N symmetric positive definite tridiagonal matrix, and X and B are N-by-NRHS matrices
dptsvx		dptsvx (3p)	- use the factorization A = L*D*L**T to compute the solution to a real system of linear equations A*X = B, where A is an N-by-N symmetric positive definite tridiagonal matrix and X and B are N-by-NRHS matrices
dpttrf		dpttrf (3p)	- compute the factorization of a real symmetric positive definite tridiagonal matrix A
dpttrs		dpttrs (3p)	- solve a system of linear equations A * X = B with a symmetric positive definite tridiagonal matrix A using the factorization A = L*D*L**T or A = U**T*D*U computed by DPTTRF
dqdota		dqdota (3p)	- Compute a double precision constant plus an extended precision constant plus the extended precision dot product of two double precision vectors x and y.
dqdoti		dqdoti (3p)	- Compute a constant plus the extended precision dot product of two double precision vectors x and y.
dqrdc		dqrdc (3p)	- compute the QR factorization of a general matrix A.  It is typical to follow a  call to xQRDC with a call to xQRSL to solve Ax = b or to xPODI to compute the determinant of A.
dqrsl		dqrsl (3p)	- solve the linear system Ax = b for a general matrix A, which has been QR- factored by xQRDC, and vectors b and x.
drot		drot (3p)	- Apply a Given's rotation constructed by DROTG.
drotg		drotg (3p)	- Construct a Given's plane rotation
drotm		drotm (3p)	- Apply a Gentleman's modified Given's rotation constructed by DROTMG.
drotmg		drotmg (3p)	- Construct a Gentleman's modified Given's plane rotation
drscl		drscl (3p)	- multiply an n-element real vector x by the real scalar 1/a
dsbev		dsbev (3p)	- compute all the eigenvalues and, optionally, eigenvectors of a real symmetric band matrix A
dsbevd		dsbevd (3p)	- compute all the eigenvalues and, optionally, eigenvectors of a real symmetric band matrix A
dsbevx		dsbevx (3p)	- compute selected eigenvalues and, optionally, eigenvectors of a real symmetric band matrix A
dsbgst		dsbgst (3p)	- reduce a real symmetric-definite banded generalized eigenproblem A*x = lambda*B*x to standard form C*y = lambda*y,
dsbgv		dsbgv (3p)	- compute all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite banded eigenproblem, of the form A*x=(lambda)*B*x
dsbmv		dsbmv (3p)	- perform the matrix-vector operation	y := alpha*A*x + beta*y
dsbtrd		dsbtrd (3p)	- reduce a real symmetric band matrix A to symmetric tridiagonal form T by an orthogonal similarity transformation
dscal		dscal (3p)	- Compute y := alpha * y
dsdot		dsdot (3p)	- Compute the double precision dot product of two single precision vectors x and y.
dsecnd		dsecnd (3p)	- return the user time for a process in seconds.
dsico		dsico (3p)	- compute the UDU factorization and condition number of a symmetric matrix A.  If the condition number is not needed then xSIFA is slightly faster.  It is typical to follow a call to xSICO with a call to xSISL to solve Ax = b or to xSIDI to compute the determinant, inverse, and inertia of A.
dsidi		dsidi (3p)	- compute the determinant, inertia, and inverse of a symmetric matrix A, which has been UDU-factored by xSICO or xSIFA.
dsifa		dsifa (3p)	- compute the UDU factorization of a symmetric matrix A.  It is typical to follow a call to xSIFA with a call to xSISL to solve Ax = b or to xSIDI to compute the determinant, inverse, and inertia of A.
dsinqb		dsinqb (3p)	- synthesize a Fourier sequence from its representation in terms of a sine series with odd wave numbers.  The xSINQ operations are unnormalized inverses of themselves, so a call to xSINQF followed by a call to  xSINQB will multiply the input sequence by 4 * N.  The VxSINQ operations are normalized, so a call of  VxSINQF followed by a call of VxSINQB will return the original sequence.
dsinqf		dsinqf (3p)	- compute the Fourier coefficients in a sine series representation with only odd wave numbers.	The xSINQ operations are unnormalized inverses of themselves, so a call to xSINQF followed by a call to  xSINQB will multiply the input sequence by 4 * N.  The VxSINQ operations are normalized, so a call of	VxSINQF followed by a call of VxSINQB will return the original sequence.
dsinqi		dsinqi (3p)	- initialize the array xWSAVE, which is used in both xSINQF and xSINQB.
dsint		dsint (3p)	- compute the discrete Fourier sine transform of an odd sequence. The xSINT transforms are unnormalized inverses of themselves, so a call of xSINT followed by another call of xSINT will multiply the input sequence by 2 * (N+1).  The VxSINT transforms are normalized, so a call of VxSINT followed by a call of VxSINT will return the original sequence.
dsinti		dsinti (3p)	- initialize the array xWSAVE, which is used in subroutine xSINT.
dsisl		dsisl (3p)	- solve the linear system Ax = b for a symmetric matrix A, which has been UDU-factored by xSICO or xSIFA, and vectors b and x.
dspco		dspco (3p)	- compute the UDU factorization and condition number of a symmetric matrix A in packed storage.  If the condition number is not needed then xSPFA is slightly faster.  It is typical to follow a call to xSPCO with a call to xSPSL to solve Ax = b or to xSPDI to compute the determinant, inverse, and inertia of A.
dspcon		dspcon (3p)	- estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric packed matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by DSPTRF
dspdi		dspdi (3p)	- compute the determinant, inertia, and inverse of a symmetric matrix A in packed storage, which has been UDU-factored by xSPCO or xSPFA.
dspev		dspev (3p)	- compute all the eigenvalues and, optionally, eigenvectors of a real symmetric matrix A in packed storage
dspevd		dspevd (3p)	- compute all the eigenvalues and, optionally, eigenvectors of a real symmetric matrix A in packed storage
dspevx		dspevx (3p)	- compute selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix A in packed storage
dspfa		dspfa (3p)	- compute the UDU factorization of a symmetric matrix A in packed storage.  It is typical to follow a call to xSPFA with a call to xSPSL to solve Ax = b or to xSPDI to compute the determinant, inverse, and inertia of A.
dspgst		dspgst (3p)	- reduce a real symmetric-definite generalized eigenproblem to standard form, using packed storage
dspgv		dspgv (3p)	- compute all the eigenvalues and, optionally, the eigenvectors of a real generalized symmetric-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x
dspmv		dspmv (3p)	- perform the matrix-vector operation	y := alpha*A*x + beta*y
dspr		dspr (3p)	- perform the symmetric rank 1 operation   A := alpha*x*x' + A
dspr2		dspr2 (3p)	- perform the symmetric rank 2 operation   A := alpha*x*y' + alpha*y*x' + A
dsprfs		dsprfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite and packed, and provides error bounds and backward error estimates for the solution
dspsl		dspsl (3p)	- solve the linear system Ax = b for a symmetric matrix A in packed storage, which has been UDU-factored by xSPCO or xSPFA, and vectors b and x.
dspsv		dspsv (3p)	- compute the solution to a real system of linear equations  A * X = B,
dspsvx		dspsvx (3p)	- use the diagonal pivoting factorization A = U*D*U**T or A = L*D*L**T to compute the solution to a real system of linear equations A * X = B, where A is an N-by-N symmetric matrix stored in packed format and X and B are N-by-NRHS matrices
dsptrd		dsptrd (3p)	- reduce a real symmetric matrix A stored in packed form to symmetric tridiagonal form T by an orthogonal similarity transformation
dsptrf		dsptrf (3p)	- compute the factorization of a real symmetric matrix A stored in packed format using the Bunch-Kaufman diagonal pivoting method
dsptri		dsptri (3p)	- compute the inverse of a real symmetric indefinite matrix A in packed storage using the factorization A = U*D*U**T or A = L*D*L**T computed by DSPTRF
dsptrs		dsptrs (3p)	- solve a system of linear equations A*X = B with a real symmetric matrix A stored in packed format using the factorization A = U*D*U**T or A = L*D*L**T computed by DSPTRF
dstebz		dstebz (3p)	- compute the eigenvalues of a symmetric tridiagonal matrix T
dstedc		dstedc (3p)	- compute all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the divide and conquer method
dstein		dstein (3p)	- compute the eigenvectors of a real symmetric tridiagonal matrix T corresponding to specified eigenvalues, using inverse iteration
dsteqr		dsteqr (3p)	- compute all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the implicit QL or QR method
dsterf		dsterf (3p)	- compute all eigenvalues of a symmetric tridiagonal matrix using the Pal-Walker-Kahan variant of the QL or QR algorithm
dstev		dstev (3p)	- compute all eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix A
dstevd		dstevd (3p)	- compute all eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix
dstevx		dstevx (3p)	- compute selected eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix A
dsvdc		dsvdc (3p)	- compute the singular value decomposition of a general matrix A.
dswap		dswap (3p)	- Exchange vectors x and y.
dsycon		dsycon (3p)	- estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by DSYTRF
dsyev		dsyev (3p)	- compute all eigenvalues and, optionally, eigenvectors of a real symmetric matrix A
dsyevd		dsyevd (3p)	- compute all eigenvalues and, optionally, eigenvectors of a real symmetric matrix A
dsyevx		dsyevx (3p)	- compute selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix A
dsygs2		dsygs2 (3p)	- reduce a real symmetric-definite generalized eigenproblem to standard form
dsygst		dsygst (3p)	- reduce a real symmetric-definite generalized eigenproblem to standard form
dsygv		dsygv (3p)	- compute all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x
dsymm		dsymm (3p)	- perform one of the matrix-matrix operations	C := alpha*A*B + beta*C or C := alpha*B*A + beta*C
dsymv		dsymv (3p)	- perform the matrix-vector operation	y := alpha*A*x + beta*y
dsyr		dsyr (3p)	- perform the symmetric rank 1 operation   A := alpha*x*x' + A
dsyr2		dsyr2 (3p)	- perform the symmetric rank 2 operation   A := alpha*x*y' + alpha*y*x' + A
dsyr2k		dsyr2k (3p)	- perform one of the symmetric rank 2k operations   C := alpha*A*B' + alpha*B*A' + beta*C or C := alpha*A'*B + alpha*B'*A + beta*C
dsyrfs		dsyrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite, and provides error bounds and backward error estimates for the solution
dsyrk		dsyrk (3p)	- perform one of the symmetric rank k operations   C := alpha*A*A' + beta*C or C := alpha*A'*A + beta*C
dsysv		dsysv (3p)	- compute the solution to a real system of linear equations  A * X = B,
dsysvx		dsysvx (3p)	- use the diagonal pivoting factorization to compute the solution to a real system of linear equations A * X = B,
dsytd2		dsytd2 (3p)	- reduce a real symmetric matrix A to symmetric tridiagonal form T by an orthogonal similarity transformation
dsytf2		dsytf2 (3p)	- compute the factorization of a real symmetric matrix A using the Bunch-Kaufman diagonal pivoting method
dsytrd		dsytrd (3p)	- reduce a real symmetric matrix A to real symmetric tridiagonal form T by an orthogonal similarity transformation
dsytrf		dsytrf (3p)	- compute the factorization of a real symmetric matrix A using the Bunch-Kaufman diagonal pivoting method
dsytri		dsytri (3p)	- compute the inverse of a real symmetric indefinite matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by DSYTRF
dsytrs		dsytrs (3p)	- solve a system of linear equations A*X = B with a real symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by DSYTRF
dtbcon		dtbcon (3p)	- estimate the reciprocal of the condition number of a triangular band matrix A, in either the 1-norm or the infinity-norm
dtbmv		dtbmv (3p)	- perform one of the matrix-vector operations	x := A*x or x := A'*x
dtbrfs		dtbrfs (3p)	- provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular band coefficient matrix
dtbsv		dtbsv (3p)	- solve one of the systems of equations   A*x = b or A'*x = b
dtbtrs		dtbtrs (3p)	- solve a triangular system of the form   A * X = B or A**T * X = B,
dtgevc		dtgevc (3p)	- compute some or all of the right and/or left generalized eigenvectors of a pair of real upper triangular matrices (A,B)
dtgsja		dtgsja (3p)	- compute the generalized singular value decomposition (GSVD) of two real upper triangular (or trapezoidal) matrices A and B
dtpcon		dtpcon (3p)	- estimate the reciprocal of the condition number of a packed triangular matrix A, in either the 1-norm or the infinity-norm
dtpmv		dtpmv (3p)	- perform one of the matrix-vector operations	x := A*x or x := A'*x
dtprfs		dtprfs (3p)	- provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular packed coefficient matrix
dtpsv		dtpsv (3p)	- solve one of the systems of equations   A*x = b or A'*x = b
dtptri		dtptri (3p)	- compute the inverse of a real upper or lower triangular matrix A stored in packed format
dtptrs		dtptrs (3p)	- solve a triangular system of the form   A * X = B or A**T * X = B,
dtrco		dtrco (3p)	- estimate the condition number of a triangular matrix A.  It is typical to follow a call to xTRCO with a call to xTRSL to solve Ax = b or to xTRDI to compute the determinant and inverse of A.
dtrcon		dtrcon (3p)	- estimate the reciprocal of the condition number of a triangular matrix A, in either the 1-norm or the infinity-norm
dtrdi		dtrdi (3p)	- compute the determinant and inverse of a triangular matrix A.
dtrevc		dtrevc (3p)	- compute some or all of the right and/or left eigenvectors of a real upper quasi-triangular matrix T
dtrexc		dtrexc (3p)	- reorder the real Schur factorization of a real matrix A = Q*T*Q**T, so that the diagonal block of T with row index IFST is moved to row ILST
dtrmm		dtrmm (3p)	- perform one of the matrix-matrix operations	B := alpha*op( A )*B, or B := alpha*B*op( A )
dtrmv		dtrmv (3p)	- perform one of the matrix-vector operations	x := A*x or x := A'*x
dtrrfs		dtrrfs (3p)	- provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix
dtrsen		dtrsen (3p)	- reorder the real Schur factorization of a real matrix A = Q*T*Q**T, so that a selected cluster of eigenvalues appears in the leading diagonal blocks of the upper quasi-triangular matrix T,
dtrsl		dtrsl (3p)	- solve the linear system Ax = b for a triangular matrix A and vectors b and x.
dtrsm		dtrsm (3p)	- solve one of the matrix equations op( A )*X = alpha*B, or X*op( A ) = alpha*B
dtrsna		dtrsna (3p)	- estimate reciprocal condition numbers for specified eigenvalues and/or right eigenvectors of a real upper quasi-triangular matrix T (or of any matrix Q*T*Q**T with Q orthogonal)
dtrsv		dtrsv (3p)	- solve one of the systems of equations   A*x = b or A'*x = b
dtrsyl		dtrsyl (3p)	- solve the real Sylvester matrix equation
dtrti2		dtrti2 (3p)	- compute the inverse of a real upper or lower triangular matrix
dtrtri		dtrtri (3p)	- compute the inverse of a real upper or lower triangular matrix A
dtrtrs		dtrtrs (3p)	- solve a triangular system of the form   A * X = B or A**T * X = B,
dtzrqf		dtzrqf (3p)	- reduce the M-by-N ( M<=N ) real upper trapezoidal matrix A to upper triangular form by means of orthogonal transformations
dumpstabs	dumpstabs (1)	- batch utility for dumping out debug information
dzasum		dzasum (3p)	- Return the sum of the absolute values of a vector x.
dznrm2		dznrm2 (3p)	- Return the Euclidian norm of a vector.
dzsum1		dzsum1 (3p)	- take the sum of the absolute values of a complex vector and returns a double precision result
er_export	er_export (1)	- export experiment data to a file.
er_mapgen	er_mapgen (1)	- generates a mapfile using an experiment that has been generated by the	   .B Behavior Data Collector in the  .B WorkShop Debugging window.
er_mv		er_mv (1)	- move experiment
er_print	er_print (1)	- print an ASCII version of the various displays supported by the Analyzer
er_rm		er_rm (1)	- remove (unlink) experiments.
error		cplxerr (3)	- error-handling functions in the C++ complex number math library
exp		cplxexp (3)	- functions in the C++ complex number math library
exp10		exp2 (3m)	- exponential, logarithm, financial
exp2		exp2 (3m)	- exponential, logarithm, financial
ezfftb		ezfftb (3p)	- computes a perodic sequence from its Fourier coefficients. EZFFTB is a simplified but slower version of RFFTB.
ezfftf		ezfftf (3p)	- computes the Fourier coefficients of a perodic sequence. EZFFTF is a simplified but slower version of RFFTF.
ezffti		ezffti (3p)	- initializes the array WSAVE, which is used in both EZFFTF and EZFFTB.
fbe		fbe (1) 	- assembler
filebuf 	filebuf (3)	- buffer class for file I/O
filemerge	twmerge (1)	- twmerge is a window-based file comparison and merging program
fp_class	ieee_sun (3m)	- miscellaneous functions for IEEE arithmetic
freezepointfile freezepointfile (4) - format of a freezepoint file .LP
freezept	freezept (1)	- generate or translate SCCS Mergeable delta IDs for lists of files
freezepttool	twfreeze (1)	- generate or translate SCCS Mergeable delta IDs for lists of files
fstream 	fstream (3)	- stream class for file I/O
gil2xd		gil2xd (1)	- Converts GIL source to WorkShop Visual save files
gnuattach	gnuserv (1)	- Server and Clients for XEmacs
gnuclient	gnuserv (1)	- Server and Clients for XEmacs
gnudoit 	gnuserv (1)	- Server and Clients for XEmacs
gnuserv 	gnuserv (1)	- Server and Clients for XEmacs
history 	history (4)	- Workspace command and file-change log
icamax		icamax (3p)	- Return the index of the element with largest absolute value.
icmax1		icmax1 (3p)	- find the index of the element whose real part has maximum absolute value
idamax		idamax (3p)	- Return the index of the element with largest absolute value.
ieee_flags	ieee_flags (3m) - mode and status function for IEEE standard arithmetic
ieee_handler	ieee_handler (3m)   - IEEE exception trap handler function
ieee_retrospective		ieee_sun (3m)	- miscellaneous functions for IEEE arithmetic
ieee_sun	ieee_sun (3m)	- miscellaneous functions for IEEE arithmetic
ieee_values	ieee_values (3m)    - functions that return extreme values of IEEE arithmetic
ilaenv		ilaenv (3p)	- choose problem-dependent parameters
ild		ild (1) 	- incremental link editor (ild) for object files
indent		indent (1)	- indent and format a C program source file
infinity	ieee_values (3m)    - functions that return extreme values of IEEE arithmetic
interrupt	interrupt (3)	- signal handling for the task library
intro		Intro (3m)	- introduction to mathematical library functions and constants
ios		ios (3) 	- basic iostreams formatting
ios.intro	ios.intro (3)	- introduction to iostreams and the man pages .\"
irint		aint (3m)	- round to integral value in floating-point or integer format
isamax		isamax (3p)	- Return the index of the element with largest absolute value.
isinf		ieee_sun (3m)	- miscellaneous functions for IEEE arithmetic
isnormal	ieee_sun (3m)	- miscellaneous functions for IEEE arithmetic
issubnormal	ieee_sun (3m)	- miscellaneous functions for IEEE arithmetic
istream 	istream (3)	- formatted and unformatted input
iszero		ieee_sun (3m)	- miscellaneous functions for IEEE arithmetic
izamax		izamax (3p)	- Return the index of the element with largest absolute value.
izmax1		izmax1 (3p)	- find the index of the element whose real part has maximum absolute value
lapack		lapack (3p)	- introduction to LAPACK
lcrans		lcrans (3m)	- linear congruential pseudo-random number generators
lint		lint (1)	- a C program checker 
locks		locks (4)	- TeamWare locks file
log		cplxexp (3)	- functions in the C++ complex number math library
log10		cplxexp (3)	- functions in the C++ complex number math library
log2		exp2 (3m)	- exponential, logarithm, financial
lsame		lsame (3p)	- case-insensitive comparison of two characters
lsamen		lsamen (3p)	- test if the first N letters of CA are the same as the first N letters of CB, regardless of case
maketool	twbuild (1)	- twbuild is a graphical user interface (GUI) tool for Sun WorkShop TeamWare Building commands.
manip		manip (3)	- iostream manipulators
max_normal	ieee_values (3m)    - functions that return extreme values of IEEE arithmetic
max_subnormal	ieee_values (3m)    - functions that return extreme values of IEEE arithmetic
min_normal	ieee_values (3m)    - functions that return extreme values of IEEE arithmetic
min_subnormal	ieee_values (3m)    - functions that return extreme values of IEEE arithmetic
nametable	nametable (4)	- CodeManager file name table
nint		aint (3m)	- round to integral value in floating-point or integer format
nonstandard_arithmetic		ieee_sun (3m)	- miscellaneous functions for IEEE arithmetic
notification	notification (4)    - TeamWare notification file
ostream 	ostream (3)	- formatted and unformatted output
parent		parent (4)	- Path name of a workspace's parent
pow		cplxexp (3)	- functions in the C++ complex number math library
ptclean 	ptclean (1)	- clean up the parameterized types database
putback 	putback (1)	- copy files from a child workspace to its parent workspace
putback.cmt	putback.cmt (4) - Putback transaction comment log file
quad_precision	quad_precision (3m) - Quadruple-precision access to libm and libsunmath functions
queue		queue (3)	- list management for the task library
quiet_nan	ieee_values (3m)    - functions that return extreme values of IEEE arithmetic
rcs2ws		rcs2ws (1)	- produce a TeamWare workspace from an .SM RCS	source hiearchy
resolve 	resolve (1)	- merge files in conflict using interactive commands and/or Filemerge
rfftb		rfftb (3p)	- compute a perodic sequence from its Fourier coefficients.  The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the  input sequence by N.  The VxFFT operations are normalized, so a call of VxFFTF followed by a call of  VxFFTB will return the original sequence.
rfftf		rfftf (3p)	- compute the Fourier coefficients of a perodic sequence.  The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the  input sequence by N.  The VxFFT operations are normalized, so a call of VxFFTF followed by a call of  VxFFTB will return the original sequence.
rffti		rffti (3p)	- initialize the array xWSAVE, which is used in both xFFTF and xFFTB.
rtc_api 	_rtc_check_free (3x)	- Runtime Checking (RTC) API for the use of private memory allocators.
rtc_patch_area	rtc_patch_area (1)  - patch area utility for Runtime Checking (SPARC only)
sasum		sasum (3p)	- Return the sum of the absolute values of a vector x.
saxpy		saxpy (3p)	- Compute y := alpha * x + y
sbcleanup	sbcleanup (1)	- deletes old Source Browsing database files
sbdsqr		sbdsqr (3p)	- compute the singular value decomposition (SVD) of a real N-by-N (upper or lower) bidiagonal matrix B
sbenter 	sbenter (1)	- generate SourceBrowser database with more general information
sbfocus 	sbfocus (1)	- generate SourceBrowser data file for focus units
sbinit		sbinit (4)	- directives to SourceBrowser and compilers
sbquery 	sbquery (1)	- command-line interface to the Source Browsing mode of WorkShop
sbtags		sbtags (1)	- create database files for the Source Browsing mode of WorkShop
sbufprot	sbufprot (3)	- protected interface of the stream buffer base class
sbufpub 	sbufpub (3)	- public interface of the stream buffer base class
scasum		scasum (3p)	- Return the sum of the absolute values of a vector x.
schdc		schdc (3p)	- compute the Cholesky decomposition of a symmetric positive definite matrix A.
schdd		schdd (3p)	- downdate an augmented Cholesky decomposition of the triangular part of an augmented QR decomposition.
schex		schex (3p)	- compute the Cholesky decomposition of a symmetric positive definite matrix A.
schud		schud (3p)	- update an augmented Cholesky decomposition of the triangular part of an augmented QR decomposition.
scnrm2		scnrm2 (3p)	- Return the Euclidian norm of a vector.
scopy		scopy (3p)	- Copy x to y
scsum1		scsum1 (3p)	- take the sum of the absolute values of a complex vector and returns a single precision result
sdisna		sdisna (3p)	- compute the reciprocal condition numbers for the eigenvectors of a real symmetric or complex Hermitian matrix or for the left or right singular vectors of a general m-by-n matrix
sdot		sdot (3p)	- Compute the dot product of two vectors x and y.
sdsdot		sdsdot (3p)	- Compute a constant plus the double precision dot product of two single precision vectors x and y.
second		second (3p)	- return the user time for a process in seconds.
sgbbrd		sgbbrd (3p)	- reduce a real general m-by-n band matrix A to upper bidiagonal form B by an orthogonal transformation
sgbco		sgbco (3p)	- compute the LU factorization and condition number of a general matrix A in banded storage.  If the condition number is not needed then xGBFA is slightly faster.  It is typical to follow a call to xGBCO with a call to xGBSL to solve Ax = b or to xGBDI to compute the determinant of A.
sgbcon		sgbcon (3p)	- estimate the reciprocal of the condition number of a real general band matrix A, in either the 1-norm or the infinity-norm,
sgbdi		sgbdi (3p)	- compute the determinant of a general matrix A in banded storage, which has been LU-factored by xGBCO or xGBFA.
sgbequ		sgbequ (3p)	- compute row and column scalings intended to equilibrate an M-by-N band matrix A and reduce its condition number
sgbfa		sgbfa (3p)	- compute the LU factorization of a matrix A in banded storage.  It is typical to follow a call to xGBFA with a call to xGBSL to solve Ax = b or to xGBDI to compute the determinant of A.
sgbmv		sgbmv (3p)	- perform one of the matrix-vector operations	y := alpha*A*x + beta*y or y := alpha*A'*x + beta*y
sgbrfs		sgbrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is banded, and provides error bounds and backward error estimates for the solution
sgbsl		sgbsl (3p)	- solve the linear system Ax = b for a matrix A in banded storage, which has been LU-factored by xGBCO or xGBFA, and vectors b and x.
sgbsv		sgbsv (3p)	- compute the solution to a real system of linear equations A * X = B, where A is a band matrix of order N with KL subdiagonals and KU superdiagonals, and X and B are N-by-NRHS matrices
sgbsvx		sgbsvx (3p)	- use the LU factorization to compute the solution to a real system of linear equations A * X = B, A**T * X = B, or A**H * X = B,
sgbtf2		sgbtf2 (3p)	- compute an LU factorization of a real m-by-n band matrix A using partial pivoting with row interchanges
sgbtrf		sgbtrf (3p)	- compute an LU factorization of a real m-by-n band matrix A using partial pivoting with row interchanges
sgbtrs		sgbtrs (3p)	- solve a system of linear equations  A * X = B or A' * X = B with a general band matrix A using the LU factorization computed by SGBTRF
sgebak		sgebak (3p)	- form the right or left eigenvectors of a real general matrix by backward transformation on the computed eigenvectors of the balanced matrix output by SGEBAL
sgebal		sgebal (3p)	- balance a general real matrix A
sgebd2		sgebd2 (3p)	- reduce a real general m by n matrix A to upper or lower bidiagonal form B by an orthogonal transformation
sgebrd		sgebrd (3p)	- reduce a general real M-by-N matrix A to upper or lower bidiagonal form B by an orthogonal transformation
sgeco		sgeco (3p)	- compute the LU factorization and estimate the condition number of a general matrix A.  If the condition number is not needed then xGEFA is slightly faster.  It is typical to follow a call to xGECO with a call to xGESL to solve Ax = b or to xGEDI to compute the determinant and inverse of A.
sgecon		sgecon (3p)	- estimate the reciprocal of the condition number of a general real matrix A, in either the 1-norm or the infinity-norm, using the LU factorization computed by SGETRF
sgedi		sgedi (3p)	- compute the determinant and inverse of a general matrix A, which has been LU-factored by xGECO or xGEFA.
sgeequ		sgeequ (3p)	- compute row and column scalings intended to equilibrate an M-by-N matrix A and reduce its condition number
sgees		sgees (3p)	- compute for an N-by-N real nonsymmetric matrix A, the eigenvalues, the real Schur form T, and, optionally, the matrix of Schur vectors Z
sgeesx		sgeesx (3p)	- compute for an N-by-N real nonsymmetric matrix A, the eigenvalues, the real Schur form T, and, optionally, the matrix of Schur vectors Z
sgeev		sgeev (3p)	- compute for an N-by-N real nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors
sgeevx		sgeevx (3p)	- compute for an N-by-N real nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors
sgefa		sgefa (3p)	- compute the LU factorization of a general matrix A.  It is typical to follow a call to xGEFA with a call to xGESL to solve Ax = b or to xGEDI to compute the determinant of A.
sgegs		sgegs (3p)	- compute for a pair of N-by-N real nonsymmetric matrices A, B
sgegv		sgegv (3p)	- compute for a pair of n-by-n real nonsymmetric matrices A and B, the generalized eigenvalues (alphar +/- alphai*i, beta), and optionally, the left and/or right generalized eigenvectors (VL and VR)
sgehd2		sgehd2 (3p)	- reduce a real general matrix A to upper Hessenberg form H by an orthogonal similarity transformation
sgehrd		sgehrd (3p)	- reduce a real general matrix A to upper Hessenberg form H by an orthogonal similarity transformation
sgelq2		sgelq2 (3p)	- compute an LQ factorization of a real m by n matrix A
sgelqf		sgelqf (3p)	- compute an LQ factorization of a real M-by-N matrix A
sgels		sgels (3p)	- solve overdetermined or underdetermined real linear systems involving an M-by-N matrix A, or its transpose, using a QR or LQ factorization of A
sgelss		sgelss (3p)	- compute the minimum norm solution to a real linear least squares problem
sgelsx		sgelsx (3p)	- compute the minimum-norm solution to a real linear least squares problem
sgemm		sgemm (3p)	- perform one of the matrix-matrix operations	C := alpha*op( A )*op( B ) + beta*C
sgemv		sgemv (3p)	- perform one of the matrix-vector operations	y := alpha*A*x + beta*y or y := alpha*A'*x + beta*y
sgeql2		sgeql2 (3p)	- compute a QL factorization of a real m by n matrix A
sgeqlf		sgeqlf (3p)	- compute a QL factorization of a real M-by-N matrix A
sgeqpf		sgeqpf (3p)	- compute a QR factorization with column pivoting of a real M-by-N matrix A
sgeqr2		sgeqr2 (3p)	- compute a QR factorization of a real m by n matrix A
sgeqrf		sgeqrf (3p)	- compute a QR factorization of a real M-by-N matrix A
sger		sger (3p)	- perform the rank 1 operation	 A := alpha*x*y' + A
sgerfs		sgerfs (3p)	- improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solution
sgerq2		sgerq2 (3p)	- compute an RQ factorization of a real m by n matrix A
sgerqf		sgerqf (3p)	- compute an RQ factorization of a real M-by-N matrix A
sgesl		sgesl (3p)	- solve the linear system Ax = b for a general matrix A, which has been LU- factored by xGECO or xGEFA, and vectors b and x.
sgesv		sgesv (3p)	- compute the solution to a real system of linear equations  A * X = B,
sgesvd		sgesvd (3p)	- compute the singular value decomposition (SVD) of a real M-by-N matrix A, optionally computing the left and/or right singular vectors
sgesvx		sgesvx (3p)	- use the LU factorization to compute the solution to a real system of linear equations  A * X = B,
sgetf2		sgetf2 (3p)	- compute an LU factorization of a general m-by-n matrix A using partial pivoting with row interchanges
sgetrf		sgetrf (3p)	- compute an LU factorization of a general M-by-N matrix A using partial pivoting with row interchanges
sgetri		sgetri (3p)	- compute the inverse of a matrix using the LU factorization computed by SGETRF
sgetrs		sgetrs (3p)	- solve a system of linear equations  A * X = B or A' * X = B with a general N-by-N matrix A using the LU factorization computed by SGETRF
sggbak		sggbak (3p)	- form the right or left eigenvectors of a real generalized eigenvalue problem A*x = lambda*B*x, by backward transformation on the computed eigenvectors of the balanced pair of matrices output by SGGBAL
sggbal		sggbal (3p)	- balance a pair of general real matrices (A,B)
sggglm		sggglm (3p)	- solve a general Gauss-Markov linear model (GLM) problem
sgghrd		sgghrd (3p)	- reduce a pair of real matrices (A,B) to generalized upper Hessenberg form using orthogonal transformations, where A is a general matrix and B is upper triangular
sgglse		sgglse (3p)	- solve the linear equality-constrained least squares (LSE) problem
sggqrf		sggqrf (3p)	- compute a generalized QR factorization of an N-by-M matrix A and an N-by-P matrix B
sggrqf		sggrqf (3p)	- compute a generalized RQ factorization of an M-by-N matrix A and a P-by-N matrix B
sggsvd		sggsvd (3p)	- compute the generalized singular value decomposition (GSVD) of an M-by-N real matrix A and P-by-N real matrix B
sggsvp		sggsvp (3p)	- compute orthogonal matrices U, V and Q such that   N-K-L K L	U'*A*Q = K ( 0 A12 A13 ) if M-K-L >= 0
sgtcon		sgtcon (3p)	- estimate the reciprocal of the condition number of a real tridiagonal matrix A using the LU factorization as computed by SGTTRF
sgtrfs		sgtrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is tridiagonal, and provides error bounds and backward error estimates for the solution
sgtsl		sgtsl (3p)	- solve the linear system Ax = b for a tridiagonal matrix A and vectors b and x.
sgtsv		sgtsv (3p)	- solve the equation   A*X = B,
sgtsvx		sgtsvx (3p)	- use the LU factorization to compute the solution to a real system of linear equations A * X = B or A**T * X = B,
sgttrf		sgttrf (3p)	- compute an LU factorization of a real tridiagonal matrix A using elimination with partial pivoting and row interchanges
sgttrs		sgttrs (3p)	- solve one of the systems of equations  A*X = B or A'*X = B,
shsein		shsein (3p)	- use inverse iteration to find specified right and/or left eigenvectors of a real upper Hessenberg matrix H
shseqr		shseqr (3p)	- compute the eigenvalues of a real upper Hessenberg matrix H and, optionally, the matrices T and Z from the Schur decomposition H = Z T Z**T, where T is an upper quasi-triangular matrix (the Schur form), and Z is the orthogonal matrix of Schur vectors
shufrans	shufrans (3m)	- random number shufflers
signaling_nan	ieee_values (3m)    - functions that return extreme values of IEEE arithmetic
signbit 	ieee_sun (3m)	- miscellaneous functions for IEEE arithmetic
sincos		trig_sun (3m)	- more trigonometric functions
sincosd 	trig_sun (3m)	- more trigonometric functions
sincosp 	trig_sun (3m)	- more trigonometric functions
sincospi	trig_sun (3m)	- more trigonometric functions
sind		trig_sun (3m)	- more trigonometric functions
single_precision		single_precision (3m)	- Single-precision access to libm and libsunmath functions
sinp		trig_sun (3m)	- more trigonometric functions
sinpi		trig_sun (3m)	- more trigonometric functions
sinqb		sinqb (3p)	- synthesize a Fourier sequence from its representation in terms of a sine series with odd wave numbers.  The xSINQ operations are unnormalized inverses of themselves, so a call to xSINQF followed by a call to  xSINQB will multiply the input sequence by 4 * N.  The VxSINQ operations are normalized, so a call of  VxSINQF followed by a call of VxSINQB will return the original sequence.
sinqf		sinqf (3p)	- compute the Fourier coefficients in a sine series representation with only odd wave numbers.	The xSINQ operations are unnormalized inverses of themselves, so a call to xSINQF followed by a call to  xSINQB will multiply the input sequence by 4 * N.  The VxSINQ operations are normalized, so a call of	VxSINQF followed by a call of VxSINQB will return the original sequence.
sinqi		sinqi (3p)	- initialize the array xWSAVE, which is used in both xSINQF and xSINQB.
sint		sint (3p)	- compute the discrete Fourier sine transform of an odd sequence. The xSINT transforms are unnormalized inverses of themselves, so a call of xSINT followed by another call of xSINT will multiply the input sequence by 2 * (N+1).  The VxSINT transforms are normalized, so a call of VxSINT followed by a call of VxSINT will return the original sequence.
sinti		sinti (3p)	- initialize the array xWSAVE, which is used in subroutine xSINT.
slabad		slabad (3p)	- take as input the values computed by SLAMCH for underflow and overflow, and returns the square root of each of these values if the log of LARGE is sufficiently large
slabrd		slabrd (3p)	- reduce the first NB rows and columns of a real general m by n matrix A to upper or lower bidiagonal form by an orthogonal transformation Q' * A * P, and returns the matrices X and Y which are needed to apply the transformation to the unreduced part of A
slacon		slacon (3p)	- estimate the 1-norm of a square, real matrix A
slacpy		slacpy (3p)	- copie all or part of a two-dimensional matrix A to another matrix B
slae2		slae2 (3p)	- compute the eigenvalues of a 2-by-2 symmetric matrix	[ A B ]  [ B C ]
slaebz		slaebz (3p)	- contain the iteration loops which compute and use the function N(w), which is the count of eigenvalues of a symmetric tridiagonal matrix T less than or equal to its argument w
slaed0		slaed0 (3p)	- compute all eigenvalues and corresponding eigenvectors of a symmetric tridiagonal matrix using the divide and conquer method
slaed1		slaed1 (3p)	- compute the updated eigensystem of a diagonal matrix after modification by a rank-one symmetric matrix
slaed2		slaed2 (3p)	- merge the two sets of eigenvalues together into a single sorted set
slaed3		slaed3 (3p)	- find the roots of the secular equation, as defined by the values in D, W, and RHO, between KSTART and KSTOP
slaed4		slaed4 (3p)	- subroutine computes the I-th updated eigenvalue of a symmetric rank-one modification to a diagonal matrix whose elements are given in the array d, and that	D(i) < D(j) for i < j  and that RHO > 0
slaed5		slaed5 (3p)	- subroutine computes the I-th eigenvalue of a symmetric rank-one modification of a 2-by-2 diagonal matrix   diag( D ) + RHO  The diagonal elements in the array D are assumed to satisfy   D(i) < D(j) for i < j 
slaed7		slaed7 (3p)	- compute the updated eigensystem of a diagonal matrix after modification by a rank-one symmetric matrix
slaed8		slaed8 (3p)	- merge the two sets of eigenvalues together into a single sorted set
slaed9		slaed9 (3p)	- find the roots of the secular equation, as defined by the values in D, Z, and RHO, between KSTART and KSTOP
slaeda		slaeda (3p)	- compute the Z vector corresponding to the merge step in the CURLVLth step of the merge process with TLVLS steps for the CURPBMth problem
slaein		slaein (3p)	- use inverse iteration to find a right or left eigenvector corresponding to the eigenvalue (WR,WI) of a real upper Hessenberg matrix H
slaev2		slaev2 (3p)	- compute the eigendecomposition of a 2-by-2 symmetric matrix  [ A B ]	[ B C ]
slaexc		slaexc (3p)	- swap adjacent diagonal blocks T11 and T22 of order 1 or 2 in an upper quasi-triangular matrix T by an orthogonal similarity transformation
slahqr		slahqr (3p)	- i an auxiliary routine called by SHSEQR to update the eigenvalues and Schur decomposition already computed by SHSEQR, by dealing with the Hessenberg submatrix in rows and columns ILO to IHI
slahrd		slahrd (3p)	- reduce the first NB columns of a real general n-by-(n-k+1) matrix A so that elements below the k-th subdiagonal are zero
slaic1		slaic1 (3p)	- applie one step of incremental condition estimation in its simplest version
slamch		slamch (3p)	- determine single precision machine parameters
slamrg		slamrg (3p)	- will create a permutation list which will merge the elements of A (which is composed of two independently sorted sets) into a single set which is sorted in ascending order
slangb		slangb (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n band matrix A, with kl sub-diagonals and ku super-diagonals
slange		slange (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real matrix A
slangt		slangt (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real tridiagonal matrix A
slanhs		slanhs (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a Hessenberg matrix A
slansb		slansb (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n symmetric band matrix A, with k super-diagonals
slansp		slansp (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real symmetric matrix A, supplied in packed form
slanst		slanst (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real symmetric tridiagonal matrix A
slansy		slansy (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a real symmetric matrix A
slantb		slantb (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n triangular band matrix A, with ( k + 1 ) diagonals
slantp		slantp (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a triangular matrix A, supplied in packed form
slantr		slantr (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a trapezoidal or triangular matrix A
slanv2		slanv2 (3p)	- compute the Schur factorization of a real 2-by-2 nonsymmetric matrix in standard form
slapll		slapll (3p)	- two column vectors X and Y, let   A = ( X Y )
slapmt		slapmt (3p)	- rearrange the columns of the M by N matrix X as specified by the permutation K(1),K(2),...,K(N) of the integers 1,...,N
slapy2		slapy2 (3p)	- return sqrt(x**2+y**2), taking care not to cause unnecessary overflow
slapy3		slapy3 (3p)	- return sqrt(x**2+y**2+z**2), taking care not to cause unnecessary overflow
slaqgb		slaqgb (3p)	- equilibrate a general M by N band matrix A with KL subdiagonals and KU superdiagonals using the row and scaling factors in the vectors R and C
slaqge		slaqge (3p)	- equilibrate a general M by N matrix A using the row and scaling factors in the vectors R and C
slaqsb		slaqsb (3p)	- equilibrate a symmetric band matrix A using the scaling factors in the vector S
slaqsp		slaqsp (3p)	- equilibrate a symmetric matrix A using the scaling factors in the vector S
slaqsy		slaqsy (3p)	- equilibrate a symmetric matrix A using the scaling factors in the vector S
slaqtr		slaqtr (3p)	- solve the real quasi-triangular system   op(T)*p = scale*c, if LREAL = .TRUE
slar2v		slar2v (3p)	- applie a vector of real plane rotations from both sides to a sequence of 2-by-2 real symmetric matrices, defined by the elements of the vectors x, y and z
slarf		slarf (3p)	- applie a real elementary reflector H to a real m by n matrix C, from either the left or the right
slarfb		slarfb (3p)	- applie a real block reflector H or its transpose H' to a real m by n matrix C, from either the left or the right
slarfg		slarfg (3p)	- generate a real elementary reflector H of order n, such that	 H * ( alpha ) = ( beta ), H' * H = I
slarft		slarft (3p)	- form the triangular factor T of a real block reflector H of order n, which is defined as a product of k elementary reflectors
slarfx		slarfx (3p)	- applie a real elementary reflector H to a real m by n matrix C, from either the left or the right
slargv		slargv (3p)	- generate a vector of real plane rotations, determined by elements of the real vectors x and y
slarnv		slarnv (3p)	- return a vector of n random real numbers from a uniform or normal distribution
slartg		slartg (3p)	- generate a plane rotation so that   [ CS SN ] 
slartv		slartv (3p)	- applie a vector of real plane rotations to elements of the real vectors x and y
slaruv		slaruv (3p)	- return a vector of n random real numbers from a uniform (0,1)
slas2		slas2 (3p)	- compute the singular values of the 2-by-2 matrix  [ F G ]  [ 0 H ]
slascl		slascl (3p)	- multiply the M by N real matrix A by the real scalar CTO/CFROM
slaset		slaset (3p)	- initialize an m-by-n matrix A to BETA on the diagonal and ALPHA on the offdiagonals
slasq1		slasq1 (3p)	- SLASQ1 computes the singular values of a real N-by-N bidiagonal  matrix with diagonal D and off-diagonal E
slasq2		slasq2 (3p)	- SLASQ2 computes the singular values of a real N-by-N unreduced  bidiagonal matrix with squared diagonal elements in Q and  squared off-diagonal elements in E
slasq3		slasq3 (3p)	- SLASQ3 is the workhorse of the whole bidiagonal SVD algorithm
slasq4		slasq4 (3p)	- SLASQ4 estimates TAU, the smallest eigenvalue of a matrix
slasr		slasr (3p)	- perform the transformation   A := P*A, when SIDE = 'L' or 'l' ( Left-hand side )   A := A*P', when SIDE = 'R' or 'r' ( Right-hand side )  where A is an m by n real matrix and P is an orthogonal matrix,
slasrt		slasrt (3p)	- the numbers in D in increasing order (if ID = 'I') or in decreasing order (if ID = 'D' )
slassq		slassq (3p)	- return the values scl and smsq such that   ( scl**2 )*smsq = x( 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq,
slasv2		slasv2 (3p)	- compute the singular value decomposition of a 2-by-2 triangular matrix  [ F G ]  [ 0 H ]
slaswp		slaswp (3p)	- perform a series of row interchanges on the matrix A
slasy2		slasy2 (3p)	- solve for the N1 by N2 matrix X, 1 <= N1,N2 <= 2, in	 op(TL)*X + ISGN*X*op(TR) = SCALE*B,
slasyf		slasyf (3p)	- compute a partial factorization of a real symmetric matrix A using the Bunch-Kaufman diagonal pivoting method
slatbs		slatbs (3p)	- solve one of the triangular systems	A *x = s*b or A'*x = s*b  with scaling to prevent overflow, where A is an upper or lower triangular band matrix
slatps		slatps (3p)	- solve one of the triangular systems	A *x = s*b or A'*x = s*b  with scaling to prevent overflow, where A is an upper or lower triangular matrix stored in packed form
slatrd		slatrd (3p)	- reduce NB rows and columns of a real symmetric matrix A to symmetric tridiagonal form by an orthogonal similarity transformation Q' * A * Q, and returns the matrices V and W which are needed to apply the transformation to the unreduced part of A
slatrs		slatrs (3p)	- solve one of the triangular systems	A *x = s*b or A'*x = s*b  with scaling to prevent overflow
slatzm		slatzm (3p)	- applie a Householder matrix generated by STZRQF to a matrix
slauu2		slauu2 (3p)	- 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 array A
slauum		slauum (3p)	- 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 array A
snrm2		snrm2 (3p)	- Return the Euclidian norm of a vector.
sopgtr		sopgtr (3p)	- generate a real orthogonal matrix Q which is defined as the product of n-1 elementary reflectors H(i) of order n, as returned by SSPTRD using packed storage
sopmtr		sopmtr (3p)	- overwrite the general real M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
sorg2l		sorg2l (3p)	- generate an m by n real matrix Q with orthonormal columns,
sorg2r		sorg2r (3p)	- generate an m by n real matrix Q with orthonormal columns,
sorgbr		sorgbr (3p)	- generate one of the real orthogonal matrices Q or P**T determined by SGEBRD when reducing a real matrix A to bidiagonal form
sorghr		sorghr (3p)	- generate a real orthogonal matrix Q which is defined as the product of IHI-ILO elementary reflectors of order N, as returned by SGEHRD
sorgl2		sorgl2 (3p)	- generate an m by n real matrix Q with orthonormal rows,
sorglq		sorglq (3p)	- generate an M-by-N real matrix Q with orthonormal rows,
sorgql		sorgql (3p)	- generate an M-by-N real matrix Q with orthonormal columns,
sorgqr		sorgqr (3p)	- generate an M-by-N real matrix Q with orthonormal columns,
sorgr2		sorgr2 (3p)	- generate an m by n real matrix Q with orthonormal rows,
sorgrq		sorgrq (3p)	- generate an M-by-N real matrix Q with orthonormal rows,
sorgtr		sorgtr (3p)	- generate a real orthogonal matrix Q which is defined as the product of n-1 elementary reflectors of order N, as returned by SSYTRD
sorm2l		sorm2l (3p)	- overwrite the general real m by n matrix C with   Q * C if SIDE = 'L' and TRANS = 'N', or   Q'* C if SIDE = 'L' and TRANS = 'T', or	C * Q if SIDE = 'R' and TRANS = 'N', or   C * Q' if SIDE = 'R' and TRANS = 'T',
sorm2r		sorm2r (3p)	- overwrite the general real m by n matrix C with   Q * C if SIDE = 'L' and TRANS = 'N', or   Q'* C if SIDE = 'L' and TRANS = 'T', or	C * Q if SIDE = 'R' and TRANS = 'N', or   C * Q' if SIDE = 'R' and TRANS = 'T',
sormbr		sormbr (3p)	- VECT = 'Q', SORMBR overwrites the general real M-by-N matrix C with  SIDE = 'L' SIDE = 'R' TRANS = 'N'
sormhr		sormhr (3p)	- overwrite the general real M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
sorml2		sorml2 (3p)	- overwrite the general real m by n matrix C with   Q * C if SIDE = 'L' and TRANS = 'N', or   Q'* C if SIDE = 'L' and TRANS = 'T', or	C * Q if SIDE = 'R' and TRANS = 'N', or   C * Q' if SIDE = 'R' and TRANS = 'T',
sormlq		sormlq (3p)	- overwrite the general real M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
sormql		sormql (3p)	- overwrite the general real M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
sormqr		sormqr (3p)	- overwrite the general real M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
sormr2		sormr2 (3p)	- overwrite the general real m by n matrix C with   Q * C if SIDE = 'L' and TRANS = 'N', or   Q'* C if SIDE = 'L' and TRANS = 'T', or	C * Q if SIDE = 'R' and TRANS = 'N', or   C * Q' if SIDE = 'R' and TRANS = 'T',
sormrq		sormrq (3p)	- overwrite the general real M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
sormtr		sormtr (3p)	- overwrite the general real M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
spbco		spbco (3p)	- compute a Cholesky factorization and condition number of a symmetric positive definite matrix A in banded storage.  If the condition number is not needed then xPBFA is slightly faster.  It is typical to follow a call to xPBCO with a call to xPBSL to solve Ax = b or to xPBDI to compute the determinant of A.
spbcon		spbcon (3p)	- estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite band matrix using the Cholesky factorization A = U**T*U or A = L*L**T computed by SPBTRF
spbdi		spbdi (3p)	- compute the determinant of a symmetric positive definite matrix A in banded storage, which has been Cholesky-factored by xPBCO or xPBFA.
spbequ		spbequ (3p)	- compute row and column scalings intended to equilibrate a symmetric positive definite band matrix A and reduce its condition number (with respect to the two-norm)
spbfa		spbfa (3p)	- compute a Cholesky factorization of a symmetric positive definite matrix A in banded storage.  It is typical to follow a call to xPBFA with a call to xPBSL to solve Ax = b or to xPBDI to compute the determinant of A.
spbrfs		spbrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and banded, and provides error bounds and backward error estimates for the solution
spbsl		spbsl (3p)	- section solve the linear system Ax = b for a symmetric positive definite matrix A in banded storage, which has been Cholesky-factored by xPBCO or xPBFA, and vectors b and x.
spbstf		spbstf (3p)	- compute a split Cholesky factorization of a real symmetric positive definite band matrix A
spbsv		spbsv (3p)	- compute the solution to a real system of linear equations  A * X = B,
spbsvx		spbsvx (3p)	- 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 * X = B,
spbtf2		spbtf2 (3p)	- compute the Cholesky factorization of a real symmetric positive definite band matrix A
spbtrf		spbtrf (3p)	- compute the Cholesky factorization of a real symmetric positive definite band matrix A
spbtrs		spbtrs (3p)	- solve a system of linear equations A*X = B with a symmetric positive definite band matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by SPBTRF
spoco		spoco (3p)	- compute a Cholesky factorization and condition number of a symmetric positive definite matrix A.  If the condition number is not needed then xPOFA is slightly faster.  It is typical to follow a call to xPOCO with a call to xPOSL to solve Ax = b or to xPODI to compute the determinant and inverse of A.
spocon		spocon (3p)	- estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite matrix using the Cholesky factorization A = U**T*U or A = L*L**T computed by SPOTRF
spodi		spodi (3p)	- compute the determinant and inverse of a symmetric positive definite matrix A, which has been Cholesky-factored by xPOCO, xPOFA, or xQRDC.
spoequ		spoequ (3p)	- compute row and column scalings intended to equilibrate a symmetric positive definite matrix A and reduce its condition number (with respect to the two-norm)
spofa		spofa (3p)	- compute a Cholesky factorization of a symmetric positive definite matrix A.  It is typical to follow a call to xPOFA with a call to xPOSL to solve Ax = b or to xPODI to compute the determinant and inverse of A.
sporfs		sporfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite,
sposl		sposl (3p)	- solve the linear system Ax = b for a symmetric positive definite matrix A, which has been Cholesky-factored by xPOCO or xPOFA, and vectors b and x.
sposv		sposv (3p)	- compute the solution to a real system of linear equations  A * X = B,
sposvx		sposvx (3p)	- 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 * X = B,
spotf2		spotf2 (3p)	- compute the Cholesky factorization of a real symmetric positive definite matrix A
spotrf		spotrf (3p)	- compute the Cholesky factorization of a real symmetric positive definite matrix A
spotri		spotri (3p)	- compute the inverse of a real symmetric positive definite matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by SPOTRF
spotrs		spotrs (3p)	- solve a system of linear equations A*X = B with a symmetric positive definite matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by SPOTRF
sppco		sppco (3p)	- compute a Cholesky factorization and condition number of a symmetric positive definite matrix A in packed storage.  If the condition number is not needed then xPPFA is slightly faster.  It is typical to follow a call to xPPCO with a call to xPPSL to solve Ax = b or to xPPDI to compute the determinant and inverse of A.
sppcon		sppcon (3p)	- estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite packed matrix using the Cholesky factorization A = U**T*U or A = L*L**T computed by SPPTRF
sppdi		sppdi (3p)	- compute the determinant and inverse of a symmetric positive definite matrix A in packed storage, which has been Cholesky-factored by xPPCO or xPPFA.
sppequ		sppequ (3p)	- compute row and column scalings intended to equilibrate a symmetric positive definite matrix A in packed storage and reduce its condition number (with respect to the two-norm)
sppfa		sppfa (3p)	- compute a Cholesky factorization of a symmetric positive definite matrix A in packed storage.  It is typical to follow a call to xPPFA with a call to xPPSL to solve Ax = b or to xPPDI to compute the determinant and inverse of A.
spprfs		spprfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and packed, and provides error bounds and backward error estimates for the solution
sppsl		sppsl (3p)	- solve the linear system Ax = b for a symmetric positive definite matrix A in packed storage, which has been Cholesky-factored by xPPCO or xPPFA, and vectors b and x.
sppsv		sppsv (3p)	- compute the solution to a real system of linear equations  A * X = B,
sppsvx		sppsvx (3p)	- 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 * X = B,
spptrf		spptrf (3p)	- compute the Cholesky factorization of a real symmetric positive definite matrix A stored in packed format
spptri		spptri (3p)	- compute the inverse of a real symmetric positive definite matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by SPPTRF
spptrs		spptrs (3p)	- solve a system of linear equations A*X = B with a symmetric positive definite matrix A in packed storage using the Cholesky factorization A = U**T*U or A = L*L**T computed by SPPTRF
sptcon		sptcon (3p)	- compute the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite tridiagonal matrix using the factorization A = L*D*L**T or A = U**T*D*U computed by SPTTRF
spteqr		spteqr (3p)	- compute all eigenvalues and, optionally, eigenvectors of a symmetric positive definite tridiagonal matrix by first factoring the matrix using SPTTRF, and then calling SBDSQR to compute the singular values of the bidiagonal factor
sptrfs		sptrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and tridiagonal, and provides error bounds and backward error estimates for the solution
sptsl		sptsl (3p)	- solve the linear system Ax = b for a symmetric positive definite tridiagonal matrix A and vectors b and x.
sptsv		sptsv (3p)	- compute the solution to a real system of linear equations A*X = B, where A is an N-by-N symmetric positive definite tridiagonal matrix, and X and B are N-by-NRHS matrices
sptsvx		sptsvx (3p)	- use the factorization A = L*D*L**T to compute the solution to a real system of linear equations A*X = B, where A is an N-by-N symmetric positive definite tridiagonal matrix and X and B are N-by-NRHS matrices
spttrf		spttrf (3p)	- compute the factorization of a real symmetric positive definite tridiagonal matrix A
spttrs		spttrs (3p)	- solve a system of linear equations A * X = B with a symmetric positive definite tridiagonal matrix A using the factorization A = L*D*L**T or A = U**T*D*U computed by SPTTRF
sqrdc		sqrdc (3p)	- compute the QR factorization of a general matrix A.  It is typical to follow a  call to xQRDC with a call to xQRSL to solve Ax = b or to xPODI to compute the determinant of A.
sqrsl		sqrsl (3p)	- solve the linear system Ax = b for a general matrix A, which has been QR- factored by xQRDC, and vectors b and x.
sqrt		cplxexp (3)	- functions in the C++ complex number math library
srot		srot (3p)	- Apply a Given's rotation constructed by SROTG.
srotg		srotg (3p)	- Construct a Given's plane rotation
srotm		srotm (3p)	- Apply a Gentleman's modified Given's rotation constructed by SROTMG.
srotmg		srotmg (3p)	- Construct a Gentleman's modified Given's plane rotation
srscl		srscl (3p)	- multiply an n-element real vector x by the real scalar 1/a
ssbev		ssbev (3p)	- compute all the eigenvalues and, optionally, eigenvectors of a real symmetric band matrix A
ssbevd		ssbevd (3p)	- compute all the eigenvalues and, optionally, eigenvectors of a real symmetric band matrix A
ssbevx		ssbevx (3p)	- compute selected eigenvalues and, optionally, eigenvectors of a real symmetric band matrix A
ssbgst		ssbgst (3p)	- reduce a real symmetric-definite banded generalized eigenproblem A*x = lambda*B*x to standard form C*y = lambda*y,
ssbgv		ssbgv (3p)	- compute all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite banded eigenproblem, of the form A*x=(lambda)*B*x
ssbmv		ssbmv (3p)	- perform the matrix-vector operation	y := alpha*A*x + beta*y
ssbtrd		ssbtrd (3p)	- reduce a real symmetric band matrix A to symmetric tridiagonal form T by an orthogonal similarity transformation
ssbuf		ssbuf (3)	- buffer class for for character arrays
sscal		sscal (3p)	- Compute y := alpha * y
ssico		ssico (3p)	- compute the UDU factorization and condition number of a symmetric matrix A.  If the condition number is not needed then xSIFA is slightly faster.  It is typical to follow a call to xSICO with a call to xSISL to solve Ax = b or to xSIDI to compute the determinant, inverse, and inertia of A.
ssidi		ssidi (3p)	- compute the determinant, inertia, and inverse of a symmetric matrix A, which has been UDU-factored by xSICO or xSIFA.
ssifa		ssifa (3p)	- compute the UDU factorization of a symmetric matrix A.  It is typical to follow a call to xSIFA with a call to xSISL to solve Ax = b or to xSIDI to compute the determinant, inverse, and inertia of A.
ssisl		ssisl (3p)	- solve the linear system Ax = b for a symmetric matrix A, which has been UDU-factored by xSICO or xSIFA, and vectors b and x.
sspco		sspco (3p)	- compute the UDU factorization and condition number of a symmetric matrix A in packed storage.  If the condition number is not needed then xSPFA is slightly faster.  It is typical to follow a call to xSPCO with a call to xSPSL to solve Ax = b or to xSPDI to compute the determinant, inverse, and inertia of A.
sspcon		sspcon (3p)	- estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric packed matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by SSPTRF
sspdi		sspdi (3p)	- compute the determinant, inertia, and inverse of a symmetric matrix A in packed storage, which has been UDU-factored by xSPCO or xSPFA.
sspev		sspev (3p)	- compute all the eigenvalues and, optionally, eigenvectors of a real symmetric matrix A in packed storage
sspevd		sspevd (3p)	- compute all the eigenvalues and, optionally, eigenvectors of a real symmetric matrix A in packed storage
sspevx		sspevx (3p)	- compute selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix A in packed storage
sspfa		sspfa (3p)	- compute the UDU factorization of a symmetric matrix A in packed storage.  It is typical to follow a call to xSPFA with a call to xSPSL to solve Ax = b or to xSPDI to compute the determinant, inverse, and inertia of A.
sspgst		sspgst (3p)	- reduce a real symmetric-definite generalized eigenproblem to standard form, using packed storage
sspgv		sspgv (3p)	- compute all the eigenvalues and, optionally, the eigenvectors of a real generalized symmetric-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x
sspmv		sspmv (3p)	- perform the matrix-vector operation	y := alpha*A*x + beta*y
sspr		sspr (3p)	- perform the symmetric rank 1 operation   A := alpha*x*x' + A
sspr2		sspr2 (3p)	- perform the symmetric rank 2 operation   A := alpha*x*y' + alpha*y*x' + A
ssprfs		ssprfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite and packed, and provides error bounds and backward error estimates for the solution
sspsl		sspsl (3p)	- solve the linear system Ax = b for a symmetric matrix A in packed storage, which has been UDU-factored by xSPCO or xSPFA, and vectors b and x.
sspsv		sspsv (3p)	- compute the solution to a real system of linear equations  A * X = B,
sspsvx		sspsvx (3p)	- use the diagonal pivoting factorization A = U*D*U**T or A = L*D*L**T to compute the solution to a real system of linear equations A * X = B, where A is an N-by-N symmetric matrix stored in packed format and X and B are N-by-NRHS matrices
ssptrd		ssptrd (3p)	- reduce a real symmetric matrix A stored in packed form to symmetric tridiagonal form T by an orthogonal similarity transformation
ssptrf		ssptrf (3p)	- compute the factorization of a real symmetric matrix A stored in packed format using the Bunch-Kaufman diagonal pivoting method
ssptri		ssptri (3p)	- compute the inverse of a real symmetric indefinite matrix A in packed storage using the factorization A = U*D*U**T or A = L*D*L**T computed by SSPTRF
ssptrs		ssptrs (3p)	- solve a system of linear equations A*X = B with a real symmetric matrix A stored in packed format using the factorization A = U*D*U**T or A = L*D*L**T computed by SSPTRF
sstebz		sstebz (3p)	- compute the eigenvalues of a symmetric tridiagonal matrix T
sstedc		sstedc (3p)	- compute all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the divide and conquer method
sstein		sstein (3p)	- compute the eigenvectors of a real symmetric tridiagonal matrix T corresponding to specified eigenvalues, using inverse iteration
ssteqr		ssteqr (3p)	- compute all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the implicit QL or QR method
ssterf		ssterf (3p)	- compute all eigenvalues of a symmetric tridiagonal matrix using the Pal-Walker-Kahan variant of the QL or QR algorithm
sstev		sstev (3p)	- compute all eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix A
sstevd		sstevd (3p)	- compute all eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix
sstevx		sstevx (3p)	- compute selected eigenvalues and, optionally, eigenvectors of a real symmetric tridiagonal matrix A
ssvdc		ssvdc (3p)	- compute the singular value decomposition of a general matrix A.
sswap		sswap (3p)	- Exchange vectors x and y.
ssycon		ssycon (3p)	- estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by SSYTRF
ssyev		ssyev (3p)	- compute all eigenvalues and, optionally, eigenvectors of a real symmetric matrix A
ssyevd		ssyevd (3p)	- compute all eigenvalues and, optionally, eigenvectors of a real symmetric matrix A
ssyevx		ssyevx (3p)	- compute selected eigenvalues and, optionally, eigenvectors of a real symmetric matrix A
ssygs2		ssygs2 (3p)	- reduce a real symmetric-definite generalized eigenproblem to standard form
ssygst		ssygst (3p)	- reduce a real symmetric-definite generalized eigenproblem to standard form
ssygv		ssygv (3p)	- compute all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x
ssymm		ssymm (3p)	- perform one of the matrix-matrix operations	C := alpha*A*B + beta*C or C := alpha*B*A + beta*C
ssymv		ssymv (3p)	- perform the matrix-vector operation	y := alpha*A*x + beta*y
ssyr		ssyr (3p)	- perform the symmetric rank 1 operation   A := alpha*x*x' + A
ssyr2		ssyr2 (3p)	- perform the symmetric rank 2 operation   A := alpha*x*y' + alpha*y*x' + A
ssyr2k		ssyr2k (3p)	- perform one of the symmetric rank 2k operations   C := alpha*A*B' + alpha*B*A' + beta*C or C := alpha*A'*B + alpha*B'*A + beta*C
ssyrfs		ssyrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite, and provides error bounds and backward error estimates for the solution
ssyrk		ssyrk (3p)	- perform one of the symmetric rank k operations   C := alpha*A*A' + beta*C or C := alpha*A'*A + beta*C
ssysv		ssysv (3p)	- compute the solution to a real system of linear equations  A * X = B,
ssysvx		ssysvx (3p)	- use the diagonal pivoting factorization to compute the solution to a real system of linear equations A * X = B,
ssytd2		ssytd2 (3p)	- reduce a real symmetric matrix A to symmetric tridiagonal form T by an orthogonal similarity transformation
ssytf2		ssytf2 (3p)	- compute the factorization of a real symmetric matrix A using the Bunch-Kaufman diagonal pivoting method
ssytrd		ssytrd (3p)	- reduce a real symmetric matrix A to real symmetric tridiagonal form T by an orthogonal similarity transformation
ssytrf		ssytrf (3p)	- compute the factorization of a real symmetric matrix A using the Bunch-Kaufman diagonal pivoting method
ssytri		ssytri (3p)	- compute the inverse of a real symmetric indefinite matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by SSYTRF
ssytrs		ssytrs (3p)	- solve a system of linear equations A*X = B with a real symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by SSYTRF
standard_arithmetic		ieee_sun (3m)	- miscellaneous functions for IEEE arithmetic
stbcon		stbcon (3p)	- estimate the reciprocal of the condition number of a triangular band matrix A, in either the 1-norm or the infinity-norm
stbmv		stbmv (3p)	- perform one of the matrix-vector operations	x := A*x, or x := A'*x
stbrfs		stbrfs (3p)	- provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular band coefficient matrix
stbsv		stbsv (3p)	- solve one of the systems of equations A*x = b, or A'*x = b
stbtrs		stbtrs (3p)	- solve a triangular system of the form   A * X = B or A**T * X = B,
stdiobuf	stdiobuf (3)	- buffer and stream classes for use with C stdio
stgevc		stgevc (3p)	- compute some or all of the right and/or left generalized eigenvectors of a pair of real upper triangular matrices (A,B)
stgsja		stgsja (3p)	- compute the generalized singular value decomposition (GSVD) of two real upper triangular (or trapezoidal) matrices A and B
stpcon		stpcon (3p)	- estimate the reciprocal of the condition number of a packed triangular matrix A, in either the 1-norm or the infinity-norm
stpmv		stpmv (3p)	- perform one of the matrix-vector operations x := A*x, or x := A'*x
stprfs		stprfs (3p)	- provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular packed coefficient matrix
stpsv		stpsv (3p)	- solve one of the systems of equations A*x = b, or A'*x = b
stptri		stptri (3p)	- compute the inverse of a real upper or lower triangular matrix A stored in packed format
stptrs		stptrs (3p)	- solve a triangular system of the form   A * X = B or A**T * X = B,
strco		strco (3p)	- estimate the condition number of a triangular matrix A.  It is typical to follow a call to xTRCO with a call to xTRSL to solve Ax = b or to xTRDI to compute the determinant and inverse of A.
strcon		strcon (3p)	- estimate the reciprocal of the condition number of a triangular matrix A, in either the 1-norm or the infinity-norm
strdi		strdi (3p)	- compute the determinant and inverse of a triangular matrix A.
stream_MT	stream_MT (3)	- base class to provide dynamic changing of iostream class objects to and from MT safety.
stream_locker	stream_locker (3)   - class used for application level locking of iostream class objects.
strevc		strevc (3p)	- compute some or all of the right and/or left eigenvectors of a real upper quasi-triangular matrix T
strexc		strexc (3p)	- reorder the real Schur factorization of a real matrix A = Q*T*Q**T, so that the diagonal block of T with row index IFST is moved to row ILST
strmm		strmm (3p)	- perform one of the matrix-matrix operations	B := alpha*op( A )*B, or B := alpha*B*op( A )
strmv		strmv (3p)	- perform one of the matrix-vector operations x := A*x, or x := A'*x
strrfs		strrfs (3p)	- provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix
strsen		strsen (3p)	- reorder the real Schur factorization of a real matrix A = Q*T*Q**T, so that a selected cluster of eigenvalues appears in the leading diagonal blocks of the upper quasi-triangular matrix T,
strsl		strsl (3p)	- solve the linear system Ax = b for a triangular matrix A and vectors b and x.
strsm		strsm (3p)	- solve one of the matrix equations   op( A )*X = alpha*B, or X*op( A ) = alpha*B
strsna		strsna (3p)	- estimate reciprocal condition numbers for specified eigenvalues and/or right eigenvectors of a real upper quasi-triangular matrix T (or of any matrix Q*T*Q**T with Q orthogonal)
strstream	strstream (3)	- stream class for ``I/O'' using character arrays
strsv		strsv (3p)	- solve one of the systems of equations A*x = b, or A'*x = b
strsyl		strsyl (3p)	- solve the real Sylvester matrix equation
strti2		strti2 (3p)	- compute the inverse of a real upper or lower triangular matrix
strtri		strtri (3p)	- compute the inverse of a real upper or lower triangular matrix A
strtrs		strtrs (3p)	- solve a triangular system of the form   A * X = B or A**T * X = B,
stzrqf		stzrqf (3p)	- reduce the M-by-N ( M<=N ) real upper trapezoidal matrix A to upper triangular form by means of orthogonal transformations
tand		trig_sun (3m)	- more trigonometric functions
tanp		trig_sun (3m)	- more trigonometric functions
tanpi		trig_sun (3m)	- more trigonometric functions
task		task (3)	- coroutines in the C++ task library
task.intro	task.intro (3)	- introduction to the coroutine library and man pages
tasksim 	tasksim (3)	- histogram and random numbers for the task library
tcov		tcov (1)	- construct test coverage analysis and statement-by-statement profile
teamware	teamware (1)	- teamware is a graphical user interface (GUI) tool for CodeManager commands.
trig_sun	trig_sun (3m)	- more trigonometric functions
twbuild 	twbuild (1)	- twbuild is a graphical user interface (GUI) tool for Sun WorkShop TeamWare Building commands.
twconfig	teamware (1)	- teamware is a graphical user interface (GUI) tool for CodeManager commands.
twfreeze	twfreeze (1)	- generate or translate SCCS Mergeable delta IDs for lists of files
twmerge 	twmerge (1)	- twmerge is a window-based file comparison and merging program
twversion	twversion (1)	- twversion is a graphical user interface (GUI) tool for the Source Code Control System (SCCS). twversion is available as part of the Sun WorkShop TeamWare product.
uil2xd		uil2xd (1)	- Converts UIL source to WorkShop Visual save files
vcosqb		vcosqb (3p)	- synthesize a Fourier sequence from its representation in terms of a cosine  series with odd wave numbers. The xCOSQ operations are unnormalized inverses of themselves, so a call to xCOSQF followed by a call  to xCOSQB will multiply the input sequence by 4 * N.	The VxCOSQ operations are normalized, so a call  of VxCOSQF followed by a call of VxCOSQB will return the original sequence.
vcosqf		vcosqf (3p)	- compute the Fourier coefficients in a cosine series representation with only	odd wave numbers. The xCOSQ operations are unnormalized inverses of themselves, so a call to xCOSQF followed by a call	to xCOSQB will multiply the input sequence by 4 * N.  The VxCOSQ operations are normalized, so a call  of VxCOSQF followed by a call of VxCOSQB will return the original sequence.
vcosqi		vcosqi (3p)	- initialize the array xWSAVE, which is used in both xCOSQF and  xCOSQB.
vcosti		vcosti (3p)	- initialize the array xWSAVE, which is used in xCOST.
vdcosqb 	vdcosqb (3p)	- synthesize a Fourier sequence from its representation in terms of a cosine  series with odd wave numbers. The xCOSQ operations are unnormalized inverses of themselves, so a call to xCOSQF followed by a call  to xCOSQB will multiply the input sequence by 4 * N.	The VxCOSQ operations are normalized, so a call  of VxCOSQF followed by a call of VxCOSQB will return the original sequence.
vdcosqf 	vdcosqf (3p)	- compute the Fourier coefficients in a cosine series representation with only	odd wave numbers. The xCOSQ operations are unnormalized inverses of themselves, so a call to xCOSQF followed by a call	to xCOSQB will multiply the input sequence by 4 * N.  The VxCOSQ operations are normalized, so a call  of VxCOSQF followed by a call of VxCOSQB will return the original sequence.
vdcosqi 	vdcosqi (3p)	- initialize the array xWSAVE, which is used in both xCOSQF and  xCOSQB.
vdcosti 	vdcosti (3p)	- initialize the array xWSAVE, which is used in xCOST.
vdfftb		vdfftb (3p)	- compute a perodic sequence from its Fourier coefficients.  The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the  input sequence by N.  The VxFFT operations are normalized, so a call of VxFFTF followed by a call of  VxFFTB will return the original sequence.
vdfftf		vdfftf (3p)	- compute the Fourier coefficients of a perodic sequence.  The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the  input sequence by N.  The VxFFT operations are normalized, so a call of VxFFTF followed by a call of  VxFFTB will return the original sequence.
vdffti		vdffti (3p)	- initialize the array xWSAVE, which is used in both xFFTF and xFFTB.
vdsinqb 	vdsinqb (3p)	- synthesize a Fourier sequence from its representation in terms of a sine  series with odd wave numbers.  The xSINQ operations are unnormalized inverses of themselves, so a call to xSINQF followed by a call to xSINQB will multiply the input sequence by 4 * N.  The VxSINQ operations are normalized, so a call of  VxSINQF followed by a call of VxSINQB will return the original sequence.
vdsinqf 	vdsinqf (3p)	- compute the Fourier coefficients in a sine series representation with only odd wave numbers.	The xSINQ operations are unnormalized inverses of themselves, so a call to xSINQF followed by a call to  xSINQB will multiply the input sequence by 4 * N.  The VxSINQ operations are normalized, so a call of	VxSINQF followed by a call of VxSINQB will return the original sequence.
vdsinqi 	vdsinqi (3p)	- initialize the array xWSAVE, which is used in both xSINQF and xSINQB.
vdsinti 	vdsinti (3p)	- initialize the array xWSAVE, which is used in subroutine xSINT.
vdsinti 	vdsinti (3p)	- initialize the array xWSAVE, which is used in subroutine xSINT.
version 	version (1)	- display version identification of object file or binary
vertool 	twversion (1)	- twversion is a graphical user interface (GUI) tool for the Source Code Control System (SCCS). twversion is available as part of the Sun WorkShop TeamWare product.
visu		visu (1)	- OSF/Motif user interface builder
visutosj	visutosj (1)	- convert visu MFC code before transfer to PC
vrfftb		vrfftb (3p)	- compute a perodic sequence from its Fourier coefficients.  The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the  input sequence by N.  The VxFFT operations are normalized, so a call of VxFFTF followed by a call of  VxFFTB will return the original sequence.
vrfftf		vrfftf (3p)	- compute the Fourier coefficients of a perodic sequence.  The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the  input sequence by N.  The VxFFT operations are normalized, so a call of VxFFTF followed by a call of  VxFFTB will return the original sequence.
vrffti		vrffti (3p)	- initialize the array xWSAVE, which is used in both xFFTF and xFFTB.
vsinqb		vsinqb (3p)	- synthesize a Fourier sequence from its representation in terms of a sine series with odd wave numbers.  The xSINQ operations are unnormalized inverses of themselves, so a call to xSINQF followed by a call to  xSINQB will multiply the input sequence by 4 * N.  The VxSINQ operations are normalized, so a call of  VxSINQF followed by a call of VxSINQB will return the original sequence.
vsinqf		vsinqf (3p)	- compute the Fourier coefficients in a sine series representation with only odd wave numbers.	The xSINQ operations are unnormalized inverses of themselves, so a call to xSINQF followed by a call to  xSINQB will multiply the input sequence by 4 * N.  The VxSINQ operations are normalized, so a call of	VxSINQF followed by a call of VxSINQB will return the original sequence.
vsinqi		vsinqi (3p)	- initialize the array xWSAVE, which is used in both xSINQF and xSINQB.
vsint		vsint (3p)	- compute the discrete Fourier sine transform of an odd sequence. The xSINT transforms are unnormalized inverses of themselves, so a call of xSINT followed by another call of xSINT will multiply the input sequence by 2 * (N+1).  The VxSINT transforms are normalized, so a call of VxSINT followed by a call of VxSINT will return the original sequence.
vsinti		vsinti (3p)	- initialize the array xWSAVE, which is used in subroutine xSINT.
workshop	workshop (1)	- An Integrated Programming Environment
workspace	workspace (1)	- manipulate TeamWare workspaces
ws_undo 	ws_undo (1)	- undo the effects of the last bringover or putback command
xemacs		xemacs (1)	- Emacs: The Next Generation
xerbla		xerbla (3p)	- error handler for the LAPACK routines
zaxpy		zaxpy (3p)	- Compute y := alpha * x + y
zbdsqr		zbdsqr (3p)	- compute the singular value decomposition (SVD) of a real N-by-N (upper or lower) bidiagonal matrix B
zchdc		zchdc (3p)	- compute the Cholesky decomposition of a symmetric positive definite matrix A.
zchdd		zchdd (3p)	- downdate an augmented Cholesky decomposition of the triangular part of an augmented QR decomposition.
zchex		zchex (3p)	- compute the Cholesky decomposition of a symmetric positive definite matrix A.
zchud		zchud (3p)	- update an augmented Cholesky decomposition of the triangular part of an augmented QR decomposition.
zcopy		zcopy (3p)	- Copy x to y
zdotc		zdotc (3p)	- Compute the dot product of two vectors x and conjg(y).
zdotu		zdotu (3p)	- Compute the dot product of two vectors x and y.
zdrscl		zdrscl (3p)	- multiply an n-element complex vector x by the real scalar 1/a
zdscal		zdscal (3p)	- Compute y := alpha * y
zfftb		zfftb (3p)	- compute a perodic sequence from its Fourier coefficients.  The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the  input sequence by N.  The VxFFT operations are normalized, so a call of VxFFTF followed by a call of  VxFFTB will return the original sequence.
zfftf		zfftf (3p)	- compute the Fourier coefficients of a perodic sequence.  The xFFT operations are unnormalized, so a call of xFFTF followed by a call of xFFTB will multiply the  input sequence by N.  The VxFFT operations are normalized, so a call of VxFFTF followed by a call of  VxFFTB will return the original sequence.
zffti		zffti (3p)	- initialize the array xWSAVE, which is used in both xFFTF and xFFTB.
zgbbrd		zgbbrd (3p)	- reduce a complex general m-by-n band matrix A to real upper bidiagonal form B by a unitary transformation
zgbcon		zgbcon (3p)	- estimate the reciprocal of the condition number of a complex general band matrix A, in either the 1-norm or the infinity-norm,
zgbdi		zgbdi (3p)	- compute the determinant of a general matrix A in banded storage, which has been LU-factored by xGBCO or xGBFA.
zgbequ		zgbequ (3p)	- compute row and column scalings intended to equilibrate an M-by-N band matrix A and reduce its condition number
zgbfa		zgbfa (3p)	- compute the LU factorization of a matrix A in banded storage.  It is typical to follow a call to xGBFA with a call to xGBSL to solve Ax = b or to xGBDI to compute the determinant of A.
zgbmv		zgbmv (3p)	- perform one of the matrix-vector operations y := alpha*A*x + beta*y, or y := alpha*A'*x + beta*y, or	 y := alpha*conjg( A' )*x + beta*y
zgbrfs		zgbrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is banded, and provides error bounds and backward error estimates for the solution
zgbsl		zgbsl (3p)	- solve the linear system Ax = b for a matrix A in banded storage, which has been LU-factored by xGBCO or xGBFA, and vectors b and x.
zgbsv		zgbsv (3p)	- compute the solution to a complex system of linear equations A * X = B, where A is a band matrix of order N with KL subdiagonals and KU superdiagonals, and X and B are N-by-NRHS matrices
zgbsvx		zgbsvx (3p)	- use the LU factorization to compute the solution to a complex system of linear equations A * X = B, A**T * X = B, or A**H * X = B,
zgbtf2		zgbtf2 (3p)	- compute an LU factorization of a complex m-by-n band matrix A using partial pivoting with row interchanges
zgbtrf		zgbtrf (3p)	- compute an LU factorization of a complex m-by-n band matrix A using partial pivoting with row interchanges
zgbtrs		zgbtrs (3p)	- solve a system of linear equations  A * X = B, A**T * X = B, or A**H * X = B with a general band matrix A using the LU factorization computed by ZGBTRF
zgebak		zgebak (3p)	- form the right or left eigenvectors of a complex general matrix by backward transformation on the computed eigenvectors of the balanced matrix output by ZGEBAL
zgebal		zgebal (3p)	- balance a general complex matrix A
zgebd2		zgebd2 (3p)	- reduce a complex general m by n matrix A to upper or lower real bidiagonal form B by a unitary transformation
zgebrd		zgebrd (3p)	- reduce a general complex M-by-N matrix A to upper or lower bidiagonal form B by a unitary transformation
zgeco		zgeco (3p)	- compute the LU factorization and estimate the condition number of a general matrix A.  If the condition number is not needed then xGEFA is slightly faster.  It is typical to follow a call to xGECO with a call to xGESL to solve Ax = b or to xGEDI to compute the determinant and inverse of A.
zgecon		zgecon (3p)	- estimate the reciprocal of the condition number of a general complex matrix A, in either the 1-norm or the infinity-norm, using the LU factorization computed by ZGETRF
zgedi		zgedi (3p)	- compute the determinant and inverse of a general matrix A, which has been LU-factored by xGECO or xGEFA.
zgeequ		zgeequ (3p)	- compute row and column scalings intended to equilibrate an M-by-N matrix A and reduce its condition number
zgees		zgees (3p)	- compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues, the Schur form T, and, optionally, the matrix of Schur vectors Z
zgeesx		zgeesx (3p)	- compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues, the Schur form T, and, optionally, the matrix of Schur vectors Z
zgeev		zgeev (3p)	- compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors
zgeevx		zgeevx (3p)	- compute for an N-by-N complex nonsymmetric matrix A, the eigenvalues and, optionally, the left and/or right eigenvectors
zgefa		zgefa (3p)	- compute the LU factorization of a general matrix A.  It is typical to follow a call to xGEFA with a call to xGESL to solve Ax = b or to xGEDI to compute the determinant of A.
zgegs		zgegs (3p)	- compute for a pair of N-by-N complex nonsymmetric matrices A,
zgegv		zgegv (3p)	- compute for a pair of N-by-N complex nonsymmetric matrices A and B, the generalized eigenvalues (alpha, beta), and optionally,
zgehd2		zgehd2 (3p)	- reduce a complex general matrix A to upper Hessenberg form H by a unitary similarity transformation
zgehrd		zgehrd (3p)	- reduce a complex general matrix A to upper Hessenberg form H by a unitary similarity transformation
zgelq2		zgelq2 (3p)	- compute an LQ factorization of a complex m by n matrix A
zgelqf		zgelqf (3p)	- compute an LQ factorization of a complex M-by-N matrix A
zgels		zgels (3p)	- solve overdetermined or underdetermined complex linear systems involving an M-by-N matrix A, or its conjugate-transpose, using a QR or LQ factorization of A
zgelss		zgelss (3p)	- compute the minimum norm solution to a complex linear least squares problem
zgelsx		zgelsx (3p)	- compute the minimum-norm solution to a complex linear least squares problem
zgemm		zgemm (3p)	- perform one of the matrix-matrix operations	C := alpha*op( A )*op( B ) + beta*C
zgemv		zgemv (3p)	- perform one of the matrix-vector operations y := alpha*A*x + beta*y, or y := alpha*A'*x + beta*y, or	 y := alpha*conjg( A' )*x + beta*y
zgeql2		zgeql2 (3p)	- compute a QL factorization of a complex m by n matrix A
zgeqlf		zgeqlf (3p)	- compute a QL factorization of a complex M-by-N matrix A
zgeqpf		zgeqpf (3p)	- compute a QR factorization with column pivoting of a complex M-by-N matrix A
zgeqr2		zgeqr2 (3p)	- compute a QR factorization of a complex m by n matrix A
zgeqrf		zgeqrf (3p)	- compute a QR factorization of a complex M-by-N matrix A
zgerc		zgerc (3p)	- perform the rank 1 operation A := alpha*x*conjg( y' ) + A
zgerfs		zgerfs (3p)	- improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solution
zgerq2		zgerq2 (3p)	- compute an RQ factorization of a complex m by n matrix A
zgerqf		zgerqf (3p)	- compute an RQ factorization of a complex M-by-N matrix A
zgeru		zgeru (3p)	- perform the rank 1 operation A := alpha*x*y' + A
zgesl		zgesl (3p)	- solve the linear system Ax = b for a general matrix A, which has been LU- factored by xGECO or xGEFA, and vectors b and x.
zgesv		zgesv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
zgesvd		zgesvd (3p)	- compute the singular value decomposition (SVD) of a complex M-by-N matrix A, optionally computing the left and/or right singular vectors
zgesvx		zgesvx (3p)	- use the LU factorization to compute the solution to a complex system of linear equations  A * X = B,
zgetf2		zgetf2 (3p)	- compute an LU factorization of a general m-by-n matrix A using partial pivoting with row interchanges
zgetrf		zgetrf (3p)	- compute an LU factorization of a general M-by-N matrix A using partial pivoting with row interchanges
zgetri		zgetri (3p)	- compute the inverse of a matrix using the LU factorization computed by ZGETRF
zgetrs		zgetrs (3p)	- solve a system of linear equations  A * X = B, A**T * X = B, or A**H * X = B with a general N-by-N matrix A using the LU factorization computed by ZGETRF
zggbak		zggbak (3p)	- form the right or left eigenvectors of a complex generalized eigenvalue problem A*x = lambda*B*x, by backward transformation on the computed eigenvectors of the balanced pair of matrices output by ZGGBAL
zggbal		zggbal (3p)	- balance a pair of general complex matrices (A,B)
zggglm		zggglm (3p)	- solve a general Gauss-Markov linear model (GLM) problem
zgghrd		zgghrd (3p)	- reduce a pair of complex matrices (A,B) to generalized upper Hessenberg form using unitary transformations, where A is a general matrix and B is upper triangular
zgglse		zgglse (3p)	- solve the linear equality-constrained least squares (LSE) problem
zggqrf		zggqrf (3p)	- compute a generalized QR factorization of an N-by-M matrix A and an N-by-P matrix B
zggrqf		zggrqf (3p)	- compute a generalized RQ factorization of an M-by-N matrix A and a P-by-N matrix B
zggsvd		zggsvd (3p)	- compute the generalized singular value decomposition (GSVD) of an M-by-N complex matrix A and P-by-N complex matrix B
zggsvp		zggsvp (3p)	- compute unitary matrices U, V and Q such that   N-K-L K L  U'*A*Q = K ( 0 A12 A13 ) if M-K-L >= 0
zgtcon		zgtcon (3p)	- estimate the reciprocal of the condition number of a complex tridiagonal matrix A using the LU factorization as computed by ZGTTRF
zgtrfs		zgtrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is tridiagonal, and provides error bounds and backward error estimates for the solution
zgtsl		zgtsl (3p)	- solve the linear system Ax = b for a tridiagonal matrix A and vectors b and x.
zgtsv		zgtsv (3p)	- solve the equation   A*X = B,
zgtsvx		zgtsvx (3p)	- use the LU factorization to compute the solution to a complex system of linear equations A * X = B, A**T * X = B, or A**H * X = B,
zgttrf		zgttrf (3p)	- compute an LU factorization of a complex tridiagonal matrix A using elimination with partial pivoting and row interchanges
zgttrs		zgttrs (3p)	- solve one of the systems of equations  A * X = B, A**T * X = B, or A**H * X = B,
zhbev		zhbev (3p)	- compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix A
zhbevd		zhbevd (3p)	- compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix A
zhbevx		zhbevx (3p)	- compute selected eigenvalues and, optionally, eigenvectors of a complex Hermitian band matrix A
zhbgst		zhbgst (3p)	- reduce a complex Hermitian-definite banded generalized eigenproblem A*x = lambda*B*x to standard form C*y = lambda*y,
zhbgv		zhbgv (3p)	- compute all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite banded eigenproblem, of the form A*x=(lambda)*B*x
zhbmv		zhbmv (3p)	- perform the matrix-vector operation y := alpha*A*x + beta*y
zhbtrd		zhbtrd (3p)	- reduce a complex Hermitian band matrix A to real symmetric tridiagonal form T by a unitary similarity transformation
zhecon		zhecon (3p)	- estimate the reciprocal of the condition number of a complex Hermitian matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by ZHETRF
zheev		zheev (3p)	- compute all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A
zheevd		zheevd (3p)	- compute all eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A
zheevx		zheevx (3p)	- compute selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A
zhegs2		zhegs2 (3p)	- reduce a complex Hermitian-definite generalized eigenproblem to standard form
zhegst		zhegst (3p)	- reduce a complex Hermitian-definite generalized eigenproblem to standard form
zhegv		zhegv (3p)	- compute all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x
zhemm		zhemm (3p)	- perform one of the matrix-matrix operations	C := alpha*A*B + beta*C or C := alpha*B*A + beta*C
zhemv		zhemv (3p)	- perform the matrix-vector operation y := alpha*A*x + beta*y
zher		zher (3p)	- perform the hermitian rank 1 operation A := alpha*x*conjg( x' ) + A
zher2		zher2 (3p)	- perform the hermitian rank 2 operation A := alpha*x*conjg( y' ) + conjg( alpha )*y*conjg( x' ) + A
zher2k		zher2k (3p)	- perform one of the hermitian rank 2k operations   C := alpha*A*conjg( B' ) + conjg( alpha )*B*conjg( A' ) + beta*C or C := alpha*conjg( A' )*B + conjg( alpha )*conjg( B' )*A + beta*C
zherfs		zherfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian indefinite, and provides error bounds and backward error estimates for the solution
zherk		zherk (3p)	- perform one of the hermitian rank k operations C := alpha*A*conjg( A' ) + beta*C or C := alpha*conjg( A' )*A + beta*C
zhesv		zhesv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
zhesvx		zhesvx (3p)	- use the diagonal pivoting factorization to compute the solution to a complex system of linear equations A * X = B,
zhetd2		zhetd2 (3p)	- reduce a complex Hermitian matrix A to real symmetric tridiagonal form T by a unitary similarity transformation
zhetf2		zhetf2 (3p)	- compute the factorization of a complex Hermitian matrix A using the Bunch-Kaufman diagonal pivoting method
zhetrd		zhetrd (3p)	- reduce a complex Hermitian matrix A to real symmetric tridiagonal form T by a unitary similarity transformation
zhetrf		zhetrf (3p)	- compute the factorization of a complex Hermitian matrix A using the Bunch-Kaufman diagonal pivoting method
zhetri		zhetri (3p)	- compute the inverse of a complex Hermitian indefinite matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by ZHETRF
zhetrs		zhetrs (3p)	- solve a system of linear equations A*X = B with a complex Hermitian matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by ZHETRF
zhico		zhico (3p)	- compute the UDU factorization and condition number of a Hermitian matrix A.  If the condition number is not needed then xHIFA is slightly faster.  It is typical to follow a call to xHICO with a call to xHISL to solve Ax = b or to xHIDI to compute the determinant, inverse, and inertia of A.
zhidi		zhidi (3p)	- compute the determinant, inertia, and inverse of a Hermitian matrix A, which has been UDU-factored by xHICO or xHIFA.
zhifa		zhifa (3p)	- compute the UDU factorization of a Hermitian matrix A.  It is typical to follow a call to xHIFA with a call to xHISL to solve Ax = b or to xHIDI to compute the determinant, inverse, and inertia of A.
zhisl		zhisl (3p)	- solve the linear system Ax = b for a Hermitian matrix A, which has been UDU-factored by xHICO or xHIFA, and vectors b and x.
zhpco		zhpco (3p)	- compute the UDU factorization and condition number of a Hermitian matrix A in packed storage.  If the condition number is not needed then xHPFA is slightly faster.  It is typical to follow a call to xHPCO with a call to xHPSL to solve Ax = b or to xHPDI to compute the determinant, inverse, and inertia of A.
zhpcon		zhpcon (3p)	- estimate the reciprocal of the condition number of a complex Hermitian packed matrix A using the factorization A = U*D*U**H or A = L*D*L**H computed by ZHPTRF
zhpdi		zhpdi (3p)	- compute the determinant, inertia, and inverse of a Hermitian matrix A in packed storage, which has been UDU-factored by xHPCO or xHPFA.
zhpev		zhpev (3p)	- compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix in packed storage
zhpevd		zhpevd (3p)	- compute all the eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A in packed storage
zhpevx		zhpevx (3p)	- compute selected eigenvalues and, optionally, eigenvectors of a complex Hermitian matrix A in packed storage
zhpfa		zhpfa (3p)	- compute the UDU factorization of a Hermitian matrix A in packed storage. It is typical to follow a call to xHPFA with a call to xHPSL to solve Ax = b or to xHPDI to compute the determinant, inverse, and inertia of A.
zhpgst		zhpgst (3p)	- reduce a complex Hermitian-definite generalized eigenproblem to standard form, using packed storage
zhpgv		zhpgv (3p)	- compute all the eigenvalues and, optionally, the eigenvectors of a complex generalized Hermitian-definite eigenproblem, of the form A*x=(lambda)*B*x, A*Bx=(lambda)*x, or B*A*x=(lambda)*x
zhpmv		zhpmv (3p)	- perform the matrix-vector operation y := alpha*A*x + beta*y
zhpr		zhpr (3p)	- perform the hermitian rank 1 operation A := alpha*x*conjg( x' ) + A
zhpr2		zhpr2 (3p)	- perform the hermitian rank 2 operation A := alpha*x*conjg( y' ) + conjg( alpha )*y*conjg( x' ) + A
zhprfs		zhprfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian indefinite and packed, and provides error bounds and backward error estimates for the solution
zhpsl		zhpsl (3p)	- solve the linear system Ax = b for a Hermitian matrix A in packed storage, which has been UDU-factored by xHPCO or xHPFA, and vectors b and x.
zhpsv		zhpsv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
zhpsvx		zhpsvx (3p)	- use the diagonal pivoting factorization A = U*D*U**H or A = L*D*L**H to compute the solution to a complex system of linear equations A * X = B, where A is an N-by-N Hermitian matrix stored in packed format and X and B are N-by-NRHS matrices
zhptrd		zhptrd (3p)	- reduce a complex Hermitian matrix A stored in packed form to real symmetric tridiagonal form T by a unitary similarity transformation
zhptrf		zhptrf (3p)	- compute the factorization of a complex Hermitian packed matrix A using the Bunch-Kaufman diagonal pivoting method
zhptri		zhptri (3p)	- compute the inverse of a complex Hermitian indefinite matrix A in packed storage using the factorization A = U*D*U**H or A = L*D*L**H computed by ZHPTRF
zhptrs		zhptrs (3p)	- solve a system of linear equations A*X = B with a complex Hermitian matrix A stored in packed format using the factorization A = U*D*U**H or A = L*D*L**H computed by ZHPTRF
zhsein		zhsein (3p)	- use inverse iteration to find specified right and/or left eigenvectors of a complex upper Hessenberg matrix H
zhseqr		zhseqr (3p)	- compute the eigenvalues of a complex upper Hessenberg matrix H, and, optionally, the matrices T and Z from the Schur decomposition H = Z T Z**H, where T is an upper triangular matrix (the Schur form), and Z is the unitary matrix of Schur vectors
zlabrd		zlabrd (3p)	- reduce the first NB rows and columns of a complex general m by n matrix A to upper or lower real bidiagonal form by a unitary transformation Q' * A * P, and returns the matrices X and Y which are needed to apply the transformation to the unreduced part of A
zlacgv		zlacgv (3p)	- conjugate a complex vector of length N
zlacon		zlacon (3p)	- estimate the 1-norm of a square, complex matrix A
zlacpy		zlacpy (3p)	- copie all or part of a two-dimensional matrix A to another matrix B
zlacrm		zlacrm (3p)	- perform a very simple matrix-matrix multiplication
zlacrt		zlacrt (3p)	- applie a plane rotation, where the cos and sin (C and S) are complex and the vectors CX and CY are complex
zladiv		zladiv (3p)	- := X / Y, where X and Y are complex
zlaed0		zlaed0 (3p)	- the divide and conquer method, ZLAED0 computes all eigenvalues of a symmetric tridiagonal matrix which is one diagonal block of those from reducing a dense or band Hermitian matrix and corresponding eigenvectors of the dense or band matrix
zlaed7		zlaed7 (3p)	- compute the updated eigensystem of a diagonal matrix after modification by a rank-one symmetric matrix
zlaed8		zlaed8 (3p)	- merge the two sets of eigenvalues together into a single sorted set
zlaein		zlaein (3p)	- use inverse iteration to find a right or left eigenvector corresponding to the eigenvalue W of a complex upper Hessenberg matrix H
zlaesy		zlaesy (3p)	- compute the eigendecomposition of a 2-by-2 symmetric matrix  ( ( A, B );( B, C ) ) provided the norm of the matrix of eigenvectors is larger than some threshold value
zlaev2		zlaev2 (3p)	- compute the eigendecomposition of a 2-by-2 Hermitian matrix  [ A B ]	[ CONJG(B) C ]
zlags2		zlags2 (3p)	- compute 2-by-2 unitary matrices U, V and Q, such that if ( UPPER ) then   U'*A*Q = U'*( A1 A2 )*Q = ( x 0 )  ( 0 A3 ) ( x x ) and  V'*B*Q = V'*( B1 B2 )*Q = ( x 0 )	( 0 B3 ) ( x x )  or if ( .NOT.UPPER ) then   U'*A*Q = U'*( A1 0 )*Q = ( x x )	( A2 A3 ) ( 0 x ) and  V'*B*Q = V'*( B1 0 )*Q = ( x x )  ( B2 B3 ) ( 0 x ) where   U = ( CSU SNU ), V = ( CSV SNV ),
zlahef		zlahef (3p)	- compute a partial factorization of a complex Hermitian matrix A using the Bunch-Kaufman diagonal pivoting method
zlahqr		zlahqr (3p)	- 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
zlahrd		zlahrd (3p)	- reduce the first NB columns of a complex general n-by-(n-k+1) matrix A so that elements below the k-th subdiagonal are zero
zlaic1		zlaic1 (3p)	- applie one step of incremental condition estimation in its simplest version
zlangb		zlangb (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n band matrix A, with kl sub-diagonals and ku super-diagonals
zlange		zlange (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex matrix A
zlangt		zlangt (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex tridiagonal matrix A
zlanhb		zlanhb (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n hermitian band matrix A, with k super-diagonals
zlanhe		zlanhe (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex hermitian matrix A
zlanhp		zlanhp (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex hermitian matrix A, supplied in packed form
zlanhs		zlanhs (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a Hessenberg matrix A
zlanht		zlanht (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex Hermitian tridiagonal matrix A
zlansb		zlansb (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n symmetric band matrix A, with k super-diagonals
zlansp		zlansp (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex symmetric matrix A, supplied in packed form
zlansy		zlansy (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a complex symmetric matrix A
zlantb		zlantb (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of an n by n triangular band matrix A, with ( k + 1 ) diagonals
zlantp		zlantp (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a triangular matrix A, supplied in packed form
zlantr		zlantr (3p)	- return the value of the one norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a trapezoidal or triangular matrix A
zlapll		zlapll (3p)	- two column vectors X and Y, let   A = ( X Y )
zlapmt		zlapmt (3p)	- rearrange the columns of the M by N matrix X as specified by the permutation K(1),K(2),...,K(N) of the integers 1,...,N
zlaqgb		zlaqgb (3p)	- equilibrate a general M by N band matrix A with KL subdiagonals and KU superdiagonals using the row and scaling factors in the vectors R and C
zlaqge		zlaqge (3p)	- equilibrate a general M by N matrix A using the row and scaling factors in the vectors R and C
zlaqhb		zlaqhb (3p)	- equilibrate a symmetric band matrix A using the scaling factors in the vector S
zlaqhe		zlaqhe (3p)	- equilibrate a Hermitian matrix A using the scaling factors in the vector S
zlaqhp		zlaqhp (3p)	- equilibrate a Hermitian matrix A using the scaling factors in the vector S
zlaqsb		zlaqsb (3p)	- equilibrate a symmetric band matrix A using the scaling factors in the vector S
zlaqsp		zlaqsp (3p)	- equilibrate a symmetric matrix A using the scaling factors in the vector S
zlaqsy		zlaqsy (3p)	- equilibrate a symmetric matrix A using the scaling factors in the vector S
zlar2v		zlar2v (3p)	- applie a vector of complex plane rotations with real cosines from both sides to a sequence of 2-by-2 complex Hermitian matrices,
zlarf		zlarf (3p)	- applie a complex elementary reflector H to a complex M-by-N matrix C, from either the left or the right
zlarfb		zlarfb (3p)	- applie a complex block reflector H or its transpose H' to a complex M-by-N matrix C, from either the left or the right
zlarfg		zlarfg (3p)	- generate a complex elementary reflector H of order n, such that   H' * ( alpha ) = ( beta ), H' * H = I
zlarft		zlarft (3p)	- form the triangular factor T of a complex block reflector H of order n, which is defined as a product of k elementary reflectors
zlarfx		zlarfx (3p)	- applie a complex elementary reflector H to a complex m by n matrix C, from either the left or the right
zlargv		zlargv (3p)	- generate a vector of complex plane rotations with real cosines, determined by elements of the complex vectors x and y
zlarnv		zlarnv (3p)	- return a vector of n random complex numbers from a uniform or normal distribution
zlartg		zlartg (3p)	- generate a plane rotation so that   [ CS SN ] [ F ] [ R ]  [ __ ] 
zlartv		zlartv (3p)	- applie a vector of complex plane rotations with real cosines to elements of the complex vectors x and y
zlascl		zlascl (3p)	- multiply the M by N complex matrix A by the real scalar CTO/CFROM
zlaset		zlaset (3p)	- initialize a 2-D array A to BETA on the diagonal and ALPHA on the offdiagonals
zlasr		zlasr (3p)	- perform the transformation   A := P*A, when SIDE = 'L' or 'l' ( Left-hand side )   A := A*P', when SIDE = 'R' or 'r' ( Right-hand side )  where A is an m by n complex matrix and P is an orthogonal matrix,
zlassq		zlassq (3p)	- return the values scl and ssq such that   ( scl**2 )*ssq = x( 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq,
zlaswp		zlaswp (3p)	- perform a series of row interchanges on the matrix A
zlasyf		zlasyf (3p)	- compute a partial factorization of a complex symmetric matrix A using the Bunch-Kaufman diagonal pivoting method
zlatbs		zlatbs (3p)	- solve one of the triangular systems	A * x = s*b, A**T * x = s*b, or A**H * x = s*b,
zlatps		zlatps (3p)	- solve one of the triangular systems	A * x = s*b, A**T * x = s*b, or A**H * x = s*b,
zlatrd		zlatrd (3p)	- reduce NB rows and columns of a complex Hermitian matrix A to Hermitian tridiagonal form by a unitary similarity transformation Q' * A * Q, and returns the matrices V and W which are needed to apply the transformation to the unreduced part of A
zlatrs		zlatrs (3p)	- solve one of the triangular systems	A * x = s*b, A**T * x = s*b, or A**H * x = s*b,
zlatzm		zlatzm (3p)	- applie a Householder matrix generated by ZTZRQF to a matrix
zlauu2		zlauu2 (3p)	- 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 array A
zlauum		zlauum (3p)	- 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 array A
zpbco		zpbco (3p)	- compute a Cholesky factorization and condition number of a symmetric positive definite matrix A in banded storage.  If the condition number is not needed then xPBFA is slightly faster.  It is typical to follow a call to xPBCO with a call to xPBSL to solve Ax = b or to xPBDI to compute the determinant of A.
zpbcon		zpbcon (3p)	- estimate the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite band matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPBTRF
zpbdi		zpbdi (3p)	- compute the determinant of a symmetric positive definite matrix A in banded storage, which has been Cholesky-factored by xPBCO or xPBFA.
zpbequ		zpbequ (3p)	- compute row and column scalings intended to equilibrate a Hermitian positive definite band matrix A and reduce its condition number (with respect to the two-norm)
zpbfa		zpbfa (3p)	- compute a Cholesky factorization of a symmetric positive definite matrix A in banded storage.  It is typical to follow a call to xPBFA with a call to xPBSL to solve Ax = b or to xPBDI to compute the determinant of A.
zpbrfs		zpbrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and banded, and provides error bounds and backward error estimates for the solution
zpbsl		zpbsl (3p)	- section solve the linear system Ax = b for a symmetric positive definite matrix A in banded storage, which has been Cholesky-factored by xPBCO or xPBFA, and vectors b and x.
zpbstf		zpbstf (3p)	- compute a split Cholesky factorization of a complex Hermitian positive definite band matrix A
zpbsv		zpbsv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
zpbsvx		zpbsvx (3p)	- 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 * X = B,
zpbtf2		zpbtf2 (3p)	- compute the Cholesky factorization of a complex Hermitian positive definite band matrix A
zpbtrf		zpbtrf (3p)	- compute the Cholesky factorization of a complex Hermitian positive definite band matrix A
zpbtrs		zpbtrs (3p)	- solve a system of linear equations A*X = B with a Hermitian positive definite band matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPBTRF
zpoco		zpoco (3p)	- compute a Cholesky factorization and condition number of a symmetric positive definite matrix A.  If the condition number is not needed then xPOFA is slightly faster.  It is typical to follow a call to xPOCO with a call to xPOSL to solve Ax = b or to xPODI to compute the determinant and inverse of A.
zpocon		zpocon (3p)	- estimate the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPOTRF
zpodi		zpodi (3p)	- compute the determinant and inverse of a symmetric positive definite matrix A, which has been Cholesky-factored by xPOCO, xPOFA, or xQRDC.
zpoequ		zpoequ (3p)	- compute row and column scalings intended to equilibrate a Hermitian positive definite matrix A and reduce its condition number (with respect to the two-norm)
zpofa		zpofa (3p)	- compute a Cholesky factorization of a symmetric positive definite matrix A.  It is typical to follow a call to xPOFA with a call to xPOSL to solve Ax = b or to xPODI to compute the determinant and inverse of A.
zporfs		zporfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite,
zposl		zposl (3p)	- solve the linear system Ax = b for a symmetric positive definite matrix A, which has been Cholesky-factored by xPOCO or xPOFA, and vectors b and x.
zposv		zposv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
zposvx		zposvx (3p)	- 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 * X = B,
zpotf2		zpotf2 (3p)	- compute the Cholesky factorization of a complex Hermitian positive definite matrix A
zpotrf		zpotrf (3p)	- compute the Cholesky factorization of a complex Hermitian positive definite matrix A
zpotri		zpotri (3p)	- compute the inverse of a complex Hermitian positive definite matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPOTRF
zpotrs		zpotrs (3p)	- solve a system of linear equations A*X = B with a Hermitian positive definite matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPOTRF
zppco		zppco (3p)	- compute a Cholesky factorization and condition number of a symmetric positive definite matrix A in packed storage.  If the condition number is not needed then xPPFA is slightly faster.  It is typical to follow a call to xPPCO with a call to xPPSL to solve Ax = b or to xPPDI to compute the determinant and inverse of A.
zppcon		zppcon (3p)	- estimate the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite packed matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPPTRF
zppdi		zppdi (3p)	- compute the determinant and inverse of a symmetric positive definite matrix A in packed storage, which has been Cholesky-factored by xPPCO or xPPFA.
zppequ		zppequ (3p)	- compute row and column scalings intended to equilibrate a Hermitian positive definite matrix A in packed storage and reduce its condition number (with respect to the two-norm)
zppfa		zppfa (3p)	- compute a Cholesky factorization of a symmetric positive definite matrix A in packed storage.  It is typical to follow a call to xPPFA with a call to xPPSL to solve Ax = b or to xPPDI to compute the determinant and inverse of A.
zpprfs		zpprfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and packed, and provides error bounds and backward error estimates for the solution
zppsl		zppsl (3p)	- solve the linear system Ax = b for a symmetric positive definite matrix A in packed storage, which has been Cholesky-factored by xPPCO or xPPFA, and vectors b and x.
zppsv		zppsv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
zppsvx		zppsvx (3p)	- 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 * X = B,
zpptrf		zpptrf (3p)	- compute the Cholesky factorization of a complex Hermitian positive definite matrix A stored in packed format
zpptri		zpptri (3p)	- compute the inverse of a complex Hermitian positive definite matrix A using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPPTRF
zpptrs		zpptrs (3p)	- solve a system of linear equations A*X = B with a Hermitian positive definite matrix A in packed storage using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPPTRF
zptcon		zptcon (3p)	- compute the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite tridiagonal matrix using the factorization A = L*D*L**H or A = U**H*D*U computed by ZPTTRF
zpteqr		zpteqr (3p)	- compute all eigenvalues and, optionally, eigenvectors of a symmetric positive definite tridiagonal matrix by first factoring the matrix using DPTTRF and then calling ZBDSQR to compute the singular values of the bidiagonal factor
zptrfs		zptrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and tridiagonal, and provides error bounds and backward error estimates for the solution
zptsl		zptsl (3p)	- solve the linear system Ax = b for a symmetric positive definite tridiagonal matrix A and vectors b and x.
zptsv		zptsv (3p)	- compute the solution to a complex system of linear equations A*X = B, where A is an N-by-N Hermitian positive definite tridiagonal matrix, and X and B are N-by-NRHS matrices
zptsvx		zptsvx (3p)	- use the factorization A = L*D*L**H to compute the solution to a complex system of linear equations A*X = B, where A is an N-by-N Hermitian positive definite tridiagonal matrix and X and B are N-by-NRHS matrices
zpttrf		zpttrf (3p)	- compute the factorization of a complex Hermitian positive definite tridiagonal matrix A
zpttrs		zpttrs (3p)	- solve a system of linear equations A * X = B with a Hermitian positive definite tridiagonal matrix A using the factorization A = U**H*D*U or A = L*D*L**H computed by ZPTTRF
zqrdc		zqrdc (3p)	- compute the QR factorization of a general matrix A.  It is typical to follow a  call to xQRDC with a call to xQRSL to solve Ax = b or to xPODI to compute the determinant of A.
zqrsl		zqrsl (3p)	- solve the linear system Ax = b for a general matrix A, which has been QR- factored by xQRDC, and vectors b and x.
zrot		zrot (3p)	- apply a plane rotation, where the cos (C) is real and the sin (S) is complex, and the vectors CX and CY are complex
zrotg		zrotg (3p)	- Construct a Given's plane rotation
zscal		zscal (3p)	- Compute y := alpha * y
zsico		zsico (3p)	- compute the UDU factorization and condition number of a symmetric matrix A.  If the condition number is not needed then xSIFA is slightly faster.  It is typical to follow a call to xSICO with a call to xSISL to solve Ax = b or to xSIDI to compute the determinant, inverse, and inertia of A.
zsidi		zsidi (3p)	- compute the determinant, inertia, and inverse of a symmetric matrix A, which has been UDU-factored by xSICO or xSIFA.
zsifa		zsifa (3p)	- compute the UDU factorization of a symmetric matrix A.  It is typical to follow a call to xSIFA with a call to xSISL to solve Ax = b or to xSIDI to compute the determinant, inverse, and inertia of A.
zsisl		zsisl (3p)	- solve the linear system Ax = b for a symmetric matrix A, which has been UDU-factored by xSICO or xSIFA, and vectors b and x.
zspco		zspco (3p)	- compute the UDU factorization and condition number of a symmetric matrix A in packed storage.  If the condition number is not needed then xSPFA is slightly faster.  It is typical to follow a call to xSPCO with a call to xSPSL to solve Ax = b or to xSPDI to compute the determinant, inverse, and inertia of A.
zspcon		zspcon (3p)	- estimate the reciprocal of the condition number (in the 1-norm) of a complex symmetric packed matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by ZSPTRF
zspdi		zspdi (3p)	- compute the determinant, inertia, and inverse of a symmetric matrix A in packed storage, which has been UDU-factored by xSPCO or xSPFA.
zspfa		zspfa (3p)	- compute the UDU factorization of a symmetric matrix A in packed storage.  It is typical to follow a call to xSPFA with a call to xSPSL to solve Ax = b or to xSPDI to compute the determinant, inverse, and inertia of A.
zspmv		zspmv (3p)	- perform the matrix-vector operation	y := alpha*A*x + beta*y,
zspr		zspr (3p)	- perform the symmetric rank 1 operation   A := alpha*x*conjg( x' ) + A,
zsprfs		zsprfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite and packed, and provides error bounds and backward error estimates for the solution
zspsl		zspsl (3p)	- solve the linear system Ax = b for a symmetric matrix A in packed storage, which has been UDU-factored by xSPCO or xSPFA, and vectors b and x.
zspsv		zspsv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
zspsvx		zspsvx (3p)	- use the diagonal pivoting factorization A = U*D*U**T or A = L*D*L**T to compute the solution to a complex system of linear equations A * X = B, where A is an N-by-N symmetric matrix stored in packed format and X and B are N-by-NRHS matrices
zsptrf		zsptrf (3p)	- compute the factorization of a complex symmetric matrix A stored in packed format using the Bunch-Kaufman diagonal pivoting method
zsptri		zsptri (3p)	- compute the inverse of a complex symmetric indefinite matrix A in packed storage using the factorization A = U*D*U**T or A = L*D*L**T computed by ZSPTRF
zsptrs		zsptrs (3p)	- solve a system of linear equations A*X = B with a complex symmetric matrix A stored in packed format using the factorization A = U*D*U**T or A = L*D*L**T computed by ZSPTRF
zstedc		zstedc (3p)	- compute all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the divide and conquer method
zstein		zstein (3p)	- compute the eigenvectors of a real symmetric tridiagonal matrix T corresponding to specified eigenvalues, using inverse iteration
zsteqr		zsteqr (3p)	- compute all eigenvalues and, optionally, eigenvectors of a symmetric tridiagonal matrix using the implicit QL or QR method
zsvdc		zsvdc (3p)	- compute the singular value decomposition of a general matrix A.
zswap		zswap (3p)	- Exchange vectors x and y.
zsycon		zsycon (3p)	- estimate the reciprocal of the condition number (in the 1-norm) of a complex symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by ZSYTRF
zsymm		zsymm (3p)	- perform one of the matrix-matrix operations	C := alpha*A*B + beta*C or C := alpha*B*A + beta*C
zsymv		zsymv (3p)	- perform the matrix-vector operation	y := alpha*A*x + beta*y,
zsyr		zsyr (3p)	- perform the symmetric rank 1 operation   A := alpha*x*( x' ) + A,
zsyr2k		zsyr2k (3p)	- perform one of the symmetric rank 2k operations   C := alpha*A*B' + alpha*B*A' + beta*C or C := alpha*A'*B + alpha*B'*A + beta*C
zsyrfs		zsyrfs (3p)	- improve the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite, and provides error bounds and backward error estimates for the solution
zsyrk		zsyrk (3p)	- perform one of the symmetric rank k operations   C := alpha*A*A' + beta*C or C := alpha*A'*A + beta*C
zsysv		zsysv (3p)	- compute the solution to a complex system of linear equations	A * X = B,
zsysvx		zsysvx (3p)	- use the diagonal pivoting factorization to compute the solution to a complex system of linear equations A * X = B,
zsytf2		zsytf2 (3p)	- compute the factorization of a complex symmetric matrix A using the Bunch-Kaufman diagonal pivoting method
zsytrf		zsytrf (3p)	- compute the factorization of a complex symmetric matrix A using the Bunch-Kaufman diagonal pivoting method
zsytri		zsytri (3p)	- compute the inverse of a complex symmetric indefinite matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by ZSYTRF
zsytrs		zsytrs (3p)	- solve a system of linear equations A*X = B with a complex symmetric matrix A using the factorization A = U*D*U**T or A = L*D*L**T computed by ZSYTRF
ztbcon		ztbcon (3p)	- estimate the reciprocal of the condition number of a triangular band matrix A, in either the 1-norm or the infinity-norm
ztbmv		ztbmv (3p)	- perform one of the matrix-vector operations x := A*x, or x := A'*x, or x := conjg( A' )*x
ztbrfs		ztbrfs (3p)	- provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular band coefficient matrix
ztbsv		ztbsv (3p)	- solve one of the systems of equations A*x = b, or A'*x = b, or conjg( A' )*x = b
ztbtrs		ztbtrs (3p)	- solve a triangular system of the form   A * X = B, A**T * X = B, or A**H * X = B,
ztgevc		ztgevc (3p)	- compute some or all of the right and/or left generalized eigenvectors of a pair of complex upper triangular matrices (A,B)
ztgsja		ztgsja (3p)	- compute the generalized singular value decomposition (GSVD) of two complex upper triangular (or trapezoidal) matrices A and B
ztpcon		ztpcon (3p)	- estimate the reciprocal of the condition number of a packed triangular matrix A, in either the 1-norm or the infinity-norm
ztpmv		ztpmv (3p)	- perform one of the matrix-vector operations x := A*x, or x := A'*x, or x := conjg( A' )*x
ztprfs		ztprfs (3p)	- provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular packed coefficient matrix
ztpsv		ztpsv (3p)	- solve one of the systems of equations A*x = b, or A'*x = b, or conjg( A' )*x = b
ztptri		ztptri (3p)	- compute the inverse of a complex upper or lower triangular matrix A stored in packed format
ztptrs		ztptrs (3p)	- solve a triangular system of the form   A * X = B, A**T * X = B, or A**H * X = B,
ztrco		ztrco (3p)	- estimate the condition number of a triangular matrix A.  It is typical to follow a call to xTRCO with a call to xTRSL to solve Ax = b or to xTRDI to compute the determinant and inverse of A.
ztrcon		ztrcon (3p)	- estimate the reciprocal of the condition number of a triangular matrix A, in either the 1-norm or the infinity-norm
ztrdi		ztrdi (3p)	- compute the determinant and inverse of a triangular matrix A.
ztrevc		ztrevc (3p)	- compute some or all of the right and/or left eigenvectors of a complex upper triangular matrix T
ztrexc		ztrexc (3p)	- reorder the Schur factorization of a complex matrix A = Q*T*Q**H, so that the diagonal element of T with row index IFST is moved to row ILST
ztrmm		ztrmm (3p)	- perform one of the matrix-matrix operations	B := alpha*op( A )*B or B := alpha*B*op( A )  where alpha is a scalar, B is an m by n matrix, A is a unit, or non-unit, upper or lower triangular matrix and op( A ) is one of	 op( A ) = A or op( A ) = A' or op( A ) = conjg( A' )
ztrmv		ztrmv (3p)	- perform one of the matrix-vector operations x := A*x, or x := A'*x, or x := conjg( A' )*x
ztrrfs		ztrrfs (3p)	- provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix
ztrsen		ztrsen (3p)	- reorder the Schur factorization of a complex matrix A = Q*T*Q**H, so that a selected cluster of eigenvalues appears in the leading positions on the diagonal of the upper triangular matrix T, and the leading columns of Q form an orthonormal basis of the corresponding right invariant subspace
ztrsl		ztrsl (3p)	- solve the linear system Ax = b for a triangular matrix A and vectors b and x.
ztrsm		ztrsm (3p)	- solve one of the matrix equations   op( A )*X = alpha*B, or X*op( A ) = alpha*B
ztrsna		ztrsna (3p)	- estimate reciprocal condition numbers for specified eigenvalues and/or right eigenvectors of a complex upper triangular matrix T (or of any matrix Q*T*Q**H with Q unitary)
ztrsv		ztrsv (3p)	- solve one of the systems of equations A*x = b, or A'*x = b, or conjg( A' )*x = b
ztrsyl		ztrsyl (3p)	- solve the complex Sylvester matrix equation
ztrti2		ztrti2 (3p)	- compute the inverse of a complex upper or lower triangular matrix
ztrtri		ztrtri (3p)	- compute the inverse of a complex upper or lower triangular matrix A
ztrtrs		ztrtrs (3p)	- solve a triangular system of the form   A * X = B, A**T * X = B, or A**H * X = B,
ztzrqf		ztzrqf (3p)	- reduce the M-by-N ( M<=N ) complex upper trapezoidal matrix A to upper triangular form by means of unitary transformations
zung2l		zung2l (3p)	- generate an m by n complex matrix Q with orthonormal columns,
zung2r		zung2r (3p)	- generate an m by n complex matrix Q with orthonormal columns,
zungbr		zungbr (3p)	- generate one of the complex unitary matrices Q or P**H determined by ZGEBRD when reducing a complex matrix A to bidiagonal form
zunghr		zunghr (3p)	- generate a complex unitary matrix Q which is defined as the product of IHI-ILO elementary reflectors of order N, as returned by ZGEHRD
zungl2		zungl2 (3p)	- generate an m-by-n complex matrix Q with orthonormal rows,
zunglq		zunglq (3p)	- generate an M-by-N complex matrix Q with orthonormal rows,
zungql		zungql (3p)	- generate an M-by-N complex matrix Q with orthonormal columns,
zungqr		zungqr (3p)	- generate an M-by-N complex matrix Q with orthonormal columns,
zungr2		zungr2 (3p)	- generate an m by n complex matrix Q with orthonormal rows,
zungrq		zungrq (3p)	- generate an M-by-N complex matrix Q with orthonormal rows,
zungtr		zungtr (3p)	- generate a complex unitary matrix Q which is defined as the product of n-1 elementary reflectors of order N, as returned by ZHETRD
zunm2l		zunm2l (3p)	- overwrite the general complex m-by-n matrix C with   Q * C if SIDE = 'L' and TRANS = 'N', or	 Q'* C if SIDE = 'L' and TRANS = 'C', or   C * Q if SIDE = 'R' and TRANS = 'N', or   C * Q' if SIDE = 'R' and TRANS = 'C',
zunm2r		zunm2r (3p)	- overwrite the general complex m-by-n matrix C with   Q * C if SIDE = 'L' and TRANS = 'N', or	 Q'* C if SIDE = 'L' and TRANS = 'C', or   C * Q if SIDE = 'R' and TRANS = 'N', or   C * Q' if SIDE = 'R' and TRANS = 'C',
zunmbr		zunmbr (3p)	- VECT = 'Q', ZUNMBR overwrites the general complex M-by-N matrix C with  SIDE = 'L' SIDE = 'R' TRANS = 'N'
zunmhr		zunmhr (3p)	- overwrite the general complex M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
zunml2		zunml2 (3p)	- overwrite the general complex m-by-n matrix C with   Q * C if SIDE = 'L' and TRANS = 'N', or	 Q'* C if SIDE = 'L' and TRANS = 'C', or   C * Q if SIDE = 'R' and TRANS = 'N', or   C * Q' if SIDE = 'R' and TRANS = 'C',
zunmlq		zunmlq (3p)	- overwrite the general complex M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
zunmql		zunmql (3p)	- overwrite the general complex M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
zunmqr		zunmqr (3p)	- overwrite the general complex M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
zunmr2		zunmr2 (3p)	- overwrite the general complex m-by-n matrix C with   Q * C if SIDE = 'L' and TRANS = 'N', or	 Q'* C if SIDE = 'L' and TRANS = 'C', or   C * Q if SIDE = 'R' and TRANS = 'N', or   C * Q' if SIDE = 'R' and TRANS = 'C',
zunmrq		zunmrq (3p)	- overwrite the general complex M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
zunmtr		zunmtr (3p)	- overwrite the general complex M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
zupgtr		zupgtr (3p)	- generate a complex unitary matrix Q which is defined as the product of n-1 elementary reflectors H(i) of order n, as returned by ZHPTRD using packed storage
zupmtr		zupmtr (3p)	- overwrite the general complex M-by-N matrix C with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
