Linux man pages: Z

zapping(1)
Gnome TV/Teletext viewer
zapping_remote(1)
sends commands to running instance of Zapping
zapping_setup_fb(1)
prepares V4L/V4L2 driver for overlay
zaxpy(l)
time vector plus vector
zbdsqr(l)
compute singular value decomposition of real N-by-N bidiagonal matrix B
zbuffer(3)
Stores 3d zbuffer info. Allegro game programming library
zcat(1)
compress/expand files
zcav(8)
test raw hard drive throughput
zcgesv(l)
solution to real system of linear equations * X = B
zcmp(1)
compare compressed files
zcopy(l)
vector, x, to vector, y
zdiff(1)
compare compressed files
zdotc(l)
dot product of vector
zdotu(l)
form dot product of two vectors
zdrot(l)
zdrscl(l)
multiplie n-element complex vector x by real scalar 1/
zdscal(l)
vector by constant
zdump(8)
time zone dumper
zebra(8)
routing manager for use with associated Quagga components
zeisstopnm(1)
convert Zeiss confocal file to PNM
zenity(1)
GTK+ dialogs
zenmap(1)
Graphical Nmap frontend/results viewer
zeppelin(8)
ATM LAN Emulation client demon Zeppelin
zero(4)
data sink
zforce(1)
force '.gz' extension on all gzip files
zftp(1)
transfer ZEBRA formatted files over network
zgbbrd(l)
reduce complex general m-by-n band matrix to real upper bidiagonal form B by unitary transformation
zgbcon(l)
estimate reciprocal of condition number of complex general band matrix , in either 1-norm or infinity-norm
zgbequ(l)
compute row/column scalings intended to equilibrate M-by-N band matrix/reduce its condition number
zgbmv(l)
perform one of matrix-vector operations y := alpha**x + beta*y, or y := alpha*'*x + beta*y, or y := alpha*conjg*x + beta*y
zgbrfs(l)
improve computed solution to system of linear equations when coefficient matrix is banded, and provides error bounds and backward error estimates for solution
zgbsv(l)
compute solution to complex system of linear equations * X = B, where is band matrix of order N with KL subdiagonals and KU superdiagonals, and X and B are ...
zgbsvx(l)
use LU factorization to compute solution to complex system of linear equations * X = B, **T * X = B, or **H * X = B
zgbtf2(l)
compute LU factorization of complex m-by-n band matrix using partial pivoting with row interchanges
zgbtrf(l)
compute LU factorization of complex m-by-n band matrix using partial pivoting with row interchanges
zgbtrs(l)
solve system of linear equations * X = B, **T * X = B, or **H * X = B with general band matrix using LU factorization computed by ZGBTRF
zgebak(l)
form right/left eigenvectors of complex general matrix by backward transformation on computed eigenvectors of balanced matrix output by ZGEBAL
zgebal(l)
balance general complex matrix
zgebd2(l)
reduce complex general m by n matrix to upper/lower real bidiagonal form B by unitary transformation
zgebrd(l)
reduce general complex M-by-N matrix to upper/lower bidiagonal form B by unitary transformation
zgecon(l)
estimate reciprocal of condition number of general complex matrix , in either 1-norm or infinity-norm, using LU factorization computed by ZGETRF
zgeequ(l)
compute row/column scalings intended to equilibrate M-by-N matrix/reduce its condition number
zgees(l)
compute for N-by-N complex nonsymmetric matrix , eigenvalues, Schur form T, and, , matrix of Schur vectors Z
zgeesx(l)
compute for N-by-N complex nonsymmetric matrix , eigenvalues, Schur form T, and, , matrix of Schur vectors Z
zgeev(l)
compute for N-by-N complex nonsymmetric matrix , eigenvalues and, , left/right eigenvectors
zgeevx(l)
compute for N-by-N complex nonsymmetric matrix , eigenvalues and, , left/right eigenvectors
zgegs(l)
routine is deprecated/has been replaced by routine ZGGES
zgegv(l)
routine is deprecated/has been replaced by routine ZGGEV
zgehd2(l)
reduce complex general matrix to upper Hessenberg form H by unitary similarity transformation
zgehrd(l)
reduce complex general matrix to upper Hessenberg form H by unitary similarity transformation
zgelq2(l)
compute LQ factorization of complex m by n matrix
zgelqf(l)
compute LQ factorization of complex M-by-N matrix
zgels(l)
solve overdetermined or underdetermined complex linear systems involving M-by-N matrix , or its conjugate-transpose, using QR or LQ factorization of
zgelsd(l)
compute minimum-norm solution to real linear least squares problem
zgelss(l)
compute minimum norm solution to complex linear least squares problem
zgelsx(l)
routine is deprecated/has been replaced by routine ZGELSY
zgelsy(l)
compute minimum-norm solution to complex linear least squares problem
zgemm(l)
perform one of matrix-matrix operations C := alpha*op*op + beta*C
zgemv(l)
perform one of matrix-vector operations y := alpha**x + beta*y, or y := alpha*'*x + beta*y, or y := alpha*conjg*x + beta*y
zgeql2(l)
compute QL factorization of complex m by n matrix
zgeqlf(l)
compute QL factorization of complex M-by-N matrix
zgeqp3(l)
compute QR factorization with column pivoting of matrix
zgeqpf(l)
routine is deprecated/has been replaced by routine ZGEQP3
zgeqr2(l)
compute QR factorization of complex m by n matrix
zgeqrf(l)
compute QR factorization of complex M-by-N matrix
zgerc(l)
perform rank 1 operation := alpha*x*conjg +
zgerfs(l)
improve computed solution to system of linear equations/provides error bounds/backward error estimates for solution
zgerq2(l)
compute RQ factorization of complex m by n matrix
zgerqf(l)
compute RQ factorization of complex M-by-N matrix
zgeru(l)
perform rank 1 operation := alpha*x*y' +
zgesc2(l)
solve system of linear equations * X = scale* RHS with general N-by-N matrix using LU factorization with complete pivoting computed by ZGETC2
zgesdd(l)
compute singular value decomposition of complex M-by-N matrix , computing left/right singular vectors, by using divide-and-conquer method
zgesv(l)
compute solution to complex system of linear equations * X = B
zgesvd(l)
compute singular value decomposition of complex M-by-N matrix , computing left/right singular vectors
zgesvx(l)
use LU factorization to compute solution to complex system of linear equations * X = B
zgetc2(l)
compute LU factorization, using complete pivoting, of n-by-n matrix
zgetf2(l)
compute LU factorization of general m-by-n matrix using partial pivoting with row interchanges
zgetrf(l)
compute LU factorization of general M-by-N matrix using partial pivoting with row interchanges
zgetri(l)
compute inverse of matrix using LU factorization computed by ZGETRF
zgetrs(l)
solve system of linear equations * X = B, **T * X = B, or **H * X = B with general N-by-N matrix using LU factorization computed by ZGETRF
zggbak(l)
form right or left eigenvectors of complex generalized eigenvalue problem *x = lambda*B*x, by backward transformation on computed eigenvectors of balanced pair ...
zggbal(l)
balance pair of general complex matrices
zgges(l)
compute for pair of N-by-N complex nonsymmetric matrices , generalized eigenvalues, generalized complex Schur form , and left/right Schur vectors
zggesx(l)
compute for pair of N-by-N complex nonsymmetric matrices , generalized eigenvalues, complex Schur form
zggev(l)
compute for pair of N-by-N complex nonsymmetric matrices , generalized eigenvalues, and , left/right generalized eigenvectors
zggevx(l)
compute for pair of N-by-N complex nonsymmetric matrices generalized eigenvalues, and , left/right generalized eigenvectors
zggglm(l)
solve general Gauss-Markov linear model problem
zgghrd(l)
reduce pair of complex matrices to generalized upper Hessenberg form using unitary transformations, where is general matrix and B is upper triangular
zgglse(l)
solve linear equality-constrained least squares problem
zggqrf(l)
compute generalized QR factorization of N-by-M matrix/N-by-P matrix B
zggrqf(l)
compute generalized RQ factorization of M-by-N matrix/P-by-N matrix B
zggsvd(l)
compute generalized singular value decomposition of M-by-N complex matrix/P-by-N complex matrix B
zggsvp(l)
compute unitary matrices U, V and Q such that N-K-L K L U'**Q = K if M-K-L >= 0
zgrep(1)
search possibly compressed files for regex
zgtcon(l)
estimate reciprocal of condition number of complex tridiagonal matrix using LU factorization as computed by ZGTTRF
zgtrfs(l)
improve computed solution to system of linear equations when coefficient matrix is tridiagonal, and provides error bounds and backward error estimates for ...
zgtsv(l)
solve equation *X = B
zgtsvx(l)
use LU factorization to compute solution to complex system of linear equations * X = B, **T * X = B, or **H * X = B
zgttrf(l)
compute LU factorization of complex tridiagonal matrix using elimination with partial pivoting/row interchanges
zgttrs(l)
solve one of systems of equations * X = B, **T * X = B, or **H * X = B
zgtts2(l)
solve one of systems of equations * X = B, **T * X = B, or **H * X = B
zhbev(l)
compute all eigenvalues and, , eigenvectors of complex Hermitian band matrix
zhbevd(l)
compute all eigenvalues and, , eigenvectors of complex Hermitian band matrix
zhbevx(l)
compute selected eigenvalues and, , eigenvectors of complex Hermitian band matrix
zhbgst(l)
reduce complex Hermitian-definite banded generalized eigenproblem *x = lambda*B*x to standard form C*y = lambda*y
zhbgv(l)
compute all eigenvalues, and , eigenvectors of complex generalized Hermitian-definite banded eigenproblem, of form *x=*B*x
zhbgvd(l)
compute all eigenvalues, and , eigenvectors of complex generalized Hermitian-definite banded eigenproblem, of form *x=*B*x
zhbgvx(l)
compute all eigenvalues, and , eigenvectors of complex generalized Hermitian-definite banded eigenproblem, of form *x=*B*x
zhbmv(l)
perform matrix-vector operation y := alpha**x + beta*y
zhbtrd(l)
reduce complex Hermitian band matrix to real symmetric tridiagonal form T by unitary similarity transformation
zhcon(1)
fast CJK console environment for GNU//BSD
zhecon(l)
estimate reciprocal of condition number of complex Hermitian matrix using factorization = U*D*U**H/= L*D*L**H computed by ZHETRF
zheev(l)
compute all eigenvalues and, , eigenvectors of complex Hermitian matrix
zheevd(l)
compute all eigenvalues and, , eigenvectors of complex Hermitian matrix
zheevr(l)
compute selected eigenvalues and, , eigenvectors of complex Hermitian matrix T
zheevx(l)
compute selected eigenvalues and, , eigenvectors of complex Hermitian matrix
zhegs2(l)
reduce complex Hermitian-definite generalized eigenproblem to standard form
zhegst(l)
reduce complex Hermitian-definite generalized eigenproblem to standard form
zhegv(l)
compute all eigenvalues, and , eigenvectors of complex generalized Hermitian-definite eigenproblem, of form *x=*B*x, *Bx=*x, or B**x=*x
zhegvd(l)
compute all eigenvalues, and , eigenvectors of complex generalized Hermitian-definite eigenproblem, of form *x=*B*x, *Bx=*x, or B**x=*x
zhegvx(l)
compute selected eigenvalues, and , eigenvectors of complex generalized Hermitian-definite eigenproblem, of form *x=*B*x, *Bx=*x, or B**x=*x
zhemm(l)
perform one of matrix-matrix operations C := alpha**B + beta*C
zhemv(l)
perform matrix-vector operation y := alpha**x + beta*y
zher(l)
perform hermitian rank 1 operation := alpha*x*conjg +
zher2(l)
perform hermitian rank 2 operation := alpha*x*conjg + conjg*y*conjg +
zher2k(l)
perform one of hermitian rank 2k operations C := alpha**conjg + conjg*B*conjg + beta*C
zherfs(l)
improve computed solution to system of linear equations when coefficient matrix is Hermitian indefinite, and provides error bounds and backward error estimates ...
zherk(l)
perform one of hermitian rank k operations C := alpha**conjg + beta*C
zhesv(l)
compute solution to complex system of linear equations * X = B
zhesvx(l)
use diagonal pivoting factorization to compute solution to complex system of linear equations * X = B
zhetd2(l)
reduce complex Hermitian matrix to real symmetric tridiagonal form T by unitary similarity transformation
zhetf2(l)
compute factorization of complex Hermitian matrix using Bunch-Kaufman diagonal pivoting method
zhetrd(l)
reduce complex Hermitian matrix to real symmetric tridiagonal form T by unitary similarity transformation
zhetrf(l)
compute factorization of complex Hermitian matrix using Bunch-Kaufman diagonal pivoting method
zhetri(l)
compute inverse of complex Hermitian indefinite matrix using factorization = U*D*U**H/= L*D*L**H computed by ZHETRF
zhetrs(l)
solve system of linear equations *X = B with complex Hermitian matrix using factorization = U*D*U**H/= L*D*L**H computed by ZHETRF
zhgeqz(l)
implement single-shift version of QZ method for finding generalized eigenvalues w=ALPHA/BETA of equation det( - w B ) = 0 If JOB='S', then pair is ...
zhpcon(l)
estimate reciprocal of condition number of complex Hermitian packed matrix using factorization = U*D*U**H/= L*D*L**H computed by ZHPTRF
zhpev(l)
compute all eigenvalues and, , eigenvectors of complex Hermitian matrix in packed storage
zhpevd(l)
compute all eigenvalues and, , eigenvectors of complex Hermitian matrix in packed storage
zhpevx(l)
compute selected eigenvalues and, , eigenvectors of complex Hermitian matrix in packed storage
zhpgst(l)
reduce complex Hermitian-definite generalized eigenproblem to standard form, using packed storage
zhpgv(l)
compute all eigenvalues and, , eigenvectors of complex generalized Hermitian-definite eigenproblem, of form *x=*B*x, *Bx=*x, or B**x=*x
zhpgvd(l)
compute all eigenvalues and, , eigenvectors of complex generalized Hermitian-definite eigenproblem, of form *x=*B*x, *Bx=*x, or B**x=*x
zhpgvx(l)
compute selected eigenvalues and, , eigenvectors of complex generalized Hermitian-definite eigenproblem, of form *x=*B*x, *Bx=*x, or B**x=*x
zhpmv(l)
perform matrix-vector operation y := alpha**x + beta*y
zhpr(l)
perform hermitian rank 1 operation := alpha*x*conjg +
zhpr2(l)
perform hermitian rank 2 operation := alpha*x*conjg + conjg*y*conjg +
zhprfs(l)
improve computed solution to system of linear equations when coefficient matrix is Hermitian indefinite and packed, and provides error bounds and backward ...
zhpsv(l)
compute solution to complex system of linear equations * X = B
zhpsvx(l)
use diagonal pivoting factorization = U*D*U**H or = L*D*L**H to compute solution to complex system of linear equations * X = B, where is N-by-N Hermitian ...
zhptrd(l)
reduce complex Hermitian matrix stored in packed form to real symmetric tridiagonal form T by unitary similarity transformation
zhptrf(l)
compute factorization of complex Hermitian packed matrix using Bunch-Kaufman diagonal pivoting method
zhptri(l)
compute inverse of complex Hermitian indefinite matrix in packed storage using factorization = U*D*U**H/= L*D*L**H computed by ZHPTRF
zhptrs(l)
solve system of linear equations *X = B with complex Hermitian matrix stored in packed format using factorization = U*D*U**H/= L*D*L**H computed by ZHPTRF
zhsein(l)
use inverse iteration to find specified right/left eigenvectors of complex upper Hessenberg matrix H
zhseqr(l)
compute eigenvalues of complex upper Hessenberg matrix H, and, , matrices T and Z from Schur decomposition H = Z T Z**H, where T is upper triangular matrix ...
zic(8)
time zone compiler
zic2xpm(6)
convert ZIICS chess pieces into XBoard pieces
zidrav(1)
detect/repair corruption in transfered files
ziffy(1)
capture/display Z39.50 APDUs on live network
zile(1)
zim(1)
desktop wiki/outliner
zim(3)
Application object for zim desktop wiki
zip(1)
package/compress files
zip(3)
zip_add(3)
.Nm zip_replace add file to zip archive/replace file in zip archive
zip_add_dir(3)
add directory to zip archive
zip_close(3)
close zip archive
zip_delete(3)
delete file from zip archive
zip_error_clear(3)
.Nm zip_file_error_clear clear error state for archive/file
zip_error_get(3)
.Nm zip_file_error_get get error codes for archive/file
zip_error_get_sys_type(3)
system error code
zip_error_to_str(3)
string representation of zip error
zip_errors(3)
all libzip error codes
zip_fclose(3)
close file in zip archive
zip_file_error_clear(3)
.Nm zip_file_error_clear clear error state for archive/file
zip_file_error_get(3)
.Nm zip_file_error_get get error codes for archive/file
zip_file_strerror(3)
.Nm zip_strerror get string representation for zip error
zip_fopen(3)
.Nm zip_fopen_index open file in zip archive for reading
zip_fopen_index(3)
.Nm zip_fopen_index open file in zip archive for reading
zip_fread(3)
read from file
zip_get_archive_comment(3)
zip archive comment
zip_get_file_comment(3)
comment for file in zip
zip_get_name(3)
name of file by index
zip_get_num_files(3)
number of files in archive
zip_name_locate(3)
index of file by name
zip_open(3)
open zip archive
zip_rename(3)
rename file in zip archive
zip_replace(3)
.Nm zip_replace add file to zip archive/replace file in zip archive
zip_set_archive_comment(3)
set zip archive comment
zip_set_file_comment(3)
set comment for file in zip
zip_source_buffer(3)
create zip data source from buffer
zip_source_file(3)
create data source from file
zip_source_filep(3)
create data source from FILE *
zip_source_free(3)
free zip data source
zip_source_function(3)
create data source from function
zip_source_zip(3)
create data source from zip file
zip_stat(3)
.Nm zip_stat_index get info about file
zip_stat_index(3)
.Nm zip_stat_index get info about file
zip_stat_init(3)
initialize zip_stat structure
zip_strerror(3)
.Nm zip_strerror get string representation for zip error
zip_unchange(3)
undo changes to file in zip archive
zip_unchange_all(3)
undo all changes in zip archive
zip_unchange_archive(3)
undo global changes to zip archive
zipcmp(1)
compare contents of zip archives
zipgrep(1)
search files in ZIP archive for lines matching pattern
zipinfo(1)
ZIP archive
zipmerge(1)
merge zip archives
zisnan(l)
.TRUE
zlabrd(l)
reduce first NB rows and columns of complex general m by n matrix to upper or lower real bidiagonal form by unitary transformation Q' * * P, and returns ...
zlacgv(l)
conjugate complex vector of length N
zlacn2(l)
1-norm of square, complex matrix
zlacon(l)
estimate 1-norm of square, complex matrix
zlacp2(l)
copie all/part of real two-dimensional matrix to complex matrix B
zlacpy(l)
copie all/part of two-dimensional matrix to another matrix B
zlacrm(l)
perform very simple matrix-matrix multiplication
zlacrt(l)
perform operation ==> where c/s are complex/vectors x/y are complex
zladiv(l)
:= X/Y, where X and Y are complex
zlaed0(l)
divide and conquer method, ZLAED0 computes all eigenvalues of symmetric tridiagonal matrix which is one diagonal block of those from reducing dense or band ...
zlaed7(l)
compute updated eigensystem of diagonal matrix after modification by rank-one symmetric matrix
zlaed8(l)
merge two sets of eigenvalues together into single sorted set
zlaein(l)
use inverse iteration to find right/left eigenvector corresponding to eigenvalue W of complex upper Hessenberg matrix H
zlaesy(l)
compute eigendecomposition of 2-by-2 symmetric matrix ( ; ) provided norm of matrix of eigenvectors is larger than some threshold value
zlaev2(l)
compute eigendecomposition of 2-by-2 Hermitian matrix [ B ] [ CONJG C ]
zlag2c(l)
DOUBLE PRECISION COMPLEX matrix, SA, to SINGLE PRECISION COMPLEX matrix
zlags2(l)
compute 2-by-2 unitary matrices U, V and Q, such that if then U'**Q = U'**Q = and V'*B*Q = V'**Q = or if then U'**Q = U'**Q = and V'*B*Q = V'**Q = where U = ...
zlagtm(l)
perform matrix-vector product of form B := alpha * * X + beta * B where is tridiagonal matrix of order N, B and X are N by NRHS matrices, and alpha and beta ...
zlahef(l)
compute partial factorization of complex Hermitian matrix using Bunch-Kaufman diagonal pivoting method
zlahqr(l)
i auxiliary routine called by ZHSEQR to update eigenvalues and Schur decomposition already computed by ZHSEQR, by dealing with Hessenberg submatrix in rows and ...
zlahr2(l)
first NB columns of complex general n-BY- matrix so that elements below k-th subdiagonal are zero
zlahrd(l)
reduce first NB columns of complex general n-by- matrix so that elements below k-th subdiagonal are zero
zlaic1(l)
applie one step of incremental condition estimation in its simplest version
zlals0(l)
applie back multiplying factors of either left/right singular vector matrix of diagonal matrix appended by row to right hand side matrix B in solving least ...
zlalsa(l)
i itermediate step in solving least squares problem by computing SVD of coefficient matrix in compact form
zlalsd(l)
use singular value decomposition of to solve least squares problem of finding X to minimize Euclidean norm of each column of *X-B, where is N-by-N upper ...
zlangb(l)
return value of one norm, or Frobenius norm, or infinity norm, or element of largest absolute value of n by n band matrix , with kl sub-diagonals and ku ...
zlange(l)
return value of one norm, or Frobenius norm, or infinity norm, or element of largest absolute value of complex matrix
zlangt(l)
return value of one norm, or Frobenius norm, or infinity norm, or element of largest absolute value of complex tridiagonal matrix
zlanhb(l)
return value of one norm, or Frobenius norm, or infinity norm, or element of largest absolute value of n by n hermitian band matrix , with k super-diagonals
zlanhe(l)
return value of one norm, or Frobenius norm, or infinity norm, or element of largest absolute value of complex hermitian matrix
zlanhp(l)
return value of one norm, or Frobenius norm, or infinity norm, or element of largest absolute value of complex hermitian matrix , supplied in packed form
zlanhs(l)
return value of one norm, or Frobenius norm, or infinity norm, or element of largest absolute value of Hessenberg matrix
zlanht(l)
return value of one norm, or Frobenius norm, or infinity norm, or element of largest absolute value of complex Hermitian tridiagonal matrix
zlansb(l)
return value of one norm, or Frobenius norm, or infinity norm, or element of largest absolute value of n by n symmetric band matrix , with k super-diagonals
zlansp(l)
return value of one norm, or Frobenius norm, or infinity norm, or element of largest absolute value of complex symmetric matrix , supplied in packed form
zlansy(l)
return value of one norm, or Frobenius norm, or infinity norm, or element of largest absolute value of complex symmetric matrix
zlantb(l)
return value of one norm, or Frobenius norm, or infinity norm, or element of largest absolute value of n by n triangular band matrix , with diagonals
zlantp(l)
return value of one norm, or Frobenius norm, or infinity norm, or element of largest absolute value of triangular matrix , supplied in packed form
zlantr(l)
return value of one norm, or Frobenius norm, or infinity norm, or element of largest absolute value of trapezoidal or triangular matrix
zlapll(l)
two column vectors X and Y, let =
zlapmt(l)
rearrange columns of M by N matrix X as specified by permutation K,K,...,K of integers 1,...,N
zlaqgb(l)
equilibrate general M by N band matrix with KL subdiagonals/KU superdiagonals using row/scaling factors in vectors R/C
zlaqge(l)
equilibrate general M by N matrix using row/scaling factors in vectors R/C
zlaqhb(l)
equilibrate symmetric band matrix using scaling factors in vector S
zlaqhe(l)
equilibrate Hermitian matrix using scaling factors in vector S
zlaqhp(l)
equilibrate Hermitian matrix using scaling factors in vector S
zlaqp2(l)
compute QR factorization with column pivoting of block
zlaqps(l)
compute step of QR factorization with column pivoting of complex M-by-N matrix by using Blas-3
zlaqr0(l)
compute eigenvalues of Hessenberg matrix H and, , matrices T and Z from Schur decomposition H = Z T Z**H, where T is upper triangular matrix , and Z is unitary ...
zlaqr1(l)
zlaqr2(l)
zlaqr3(l)
zlaqr4(l)
compute eigenvalues of Hessenberg matrix H and, , matrices T and Z from Schur decomposition H = Z T Z**H, where T is upper triangular matrix , and Z is unitary ...
zlaqr5(l)
zlaqsb(l)
equilibrate symmetric band matrix using scaling factors in vector S
zlaqsp(l)
equilibrate symmetric matrix using scaling factors in vector S
zlaqsy(l)
equilibrate symmetric matrix using scaling factors in vector S
zlar1v(l)
compute r-th column of inverse of sumbmatrix in rows B1 through BN of tridiagonal matrix L D L^T - sigma I
zlar2v(l)
applie vector of complex plane rotations with real cosines from both sides to sequence of 2-by-2 complex Hermitian matrices
zlarcm(l)
perform very simple matrix-matrix multiplication
zlarf(l)
applie complex elementary reflector H to complex M-by-N matrix C, from either left or right
zlarfb(l)
applie complex block reflector H or its transpose H' to complex M-by-N matrix C, from either left or right
zlarfg(l)
make complex elementary reflector H of order n, such that H' * = , H' * H = I
zlarft(l)
form triangular factor T of complex block reflector H of order n, which is defined as product of k elementary reflectors
zlarfx(l)
applie complex elementary reflector H to complex m by n matrix C, from either left or right
zlargv(l)
make vector of complex plane rotations with real cosines, determined by elements of complex vectors x and y
zlarnv(l)
return vector of n random complex numbers from uniform/normal distribution
zlarrv(l)
compute eigenvectors of tridiagonal matrix T = L D L^T given L, D and eigenvalues of L D L^T
zlartg(l)
make plane rotation so that [ CS SN ] [ F ] [ R ] [ __ ]
zlartv(l)
applie vector of complex plane rotations with real cosines to elements of complex vectors x/y
zlarz(l)
applie complex elementary reflector H to complex M-by-N matrix C, from either left or right
zlarzb(l)
applie complex block reflector H/its transpose H**H to complex distributed M-by-N C from left/right
zlarzt(l)
form triangular factor T of complex block reflector H of order > n, which is defined as product of k elementary reflectors
zlascl(l)
multiplie M by N complex matrix by real scalar CTO/CFROM
zlaset(l)
initialize 2-D array to BETA on diagonal/ALPHA on offdiagonals
zlasr(l)
perform transformation := P*, when SIDE = 'L' or 'l' := *P', when SIDE = 'R' or 'r' where is m by n complex matrix and P is orthogonal matrix
zlassq(l)
return values scl and ssq such that *ssq = x**2 +...+ x**2 + *sumsq
zlaswp(l)
perform series of row interchanges on matrix
zlasyf(l)
compute partial factorization of complex symmetric matrix using Bunch-Kaufman diagonal pivoting method
zlatbs(l)
solve one of triangular systems * x = s*b, **T * x = s*b, or **H * x = s*b
zlatdf(l)
compute contribution to reciprocal Dif-estimate by solving for x in Z * x = b, where b is chosen such that norm of x is as large as possible
zlatps(l)
solve one of triangular systems * x = s*b, **T * x = s*b, or **H * x = s*b
zlatrd(l)
reduce NB rows and columns of complex Hermitian matrix to Hermitian tridiagonal form by unitary similarity transformation Q' * * Q, and returns matrices V and ...
zlatrs(l)
solve one of triangular systems * x = s*b, **T * x = s*b, or **H * x = s*b
zlatrz(l)
factor M-by- complex upper trapezoidal matrix [ A1 A2 ] = [ ] as * Z by means of unitary transformations, where Z is -by- unitary matrix and, R and A1 are ...
zlatzm(l)
routine is deprecated/has been replaced by routine ZUNMRZ
zlauu2(l)
compute product U * U' or L' * L, where triangular factor U or L is stored in upper or lower triangular part of array
zlauum(l)
compute product U * U' or L' * L, where triangular factor U or L is stored in upper or lower triangular part of array
zless(1)
file perusal filter for crt viewing of compressed text
zlib(3)
compression/decompression library
zmergelog(1)
merge gzipped http log files by date
zmore(1)
file perusal filter for crt viewing of compressed text
znew(1)
recompress .Z files to .gz files
zoid(1)
modular perl shell
zoidberg(3)
modular perl shell
zoidbuiltins(1)
Zoidberg's builtins
zoiddevel(1)
Development documentation for zoid
zoidfaq(1)
Frequently Asked Questions about Zoidberg
zoiduser(1)
Extended user documentation for zoid
zone2ldap(1)
zone2sql(8)
Convert ISC Bind zones to SQL
zonec(8)
zonecheck(1)
DNS zone checking tool
zoneminder(3)
Container module for common ZoneMinder modules
zonesigner(1)
Generates encryption keys/signs DNS zone
zoo(1)
change archives of files in compressed form
zoom(1)
wander around magified desktop
zoom(6)
wander around magnified desktop
zoomsh(1)
ZOOM shell
zopeedit(1)
helper application that handles interaction between
zos-remote.conf(5)
audisp-racf plugin config file
zpbcon(l)
estimate reciprocal of condition number of complex Hermitian positive definite band matrix using Cholesky factorization = U**H*U/= L*L**H computed by ZPBTRF
zpbequ(l)
compute row/column scalings intended to equilibrate Hermitian positive definite band matrix/reduce its condition number
zpbrfs(l)
improve computed solution to system of linear equations when coefficient matrix is Hermitian positive definite and banded, and provides error bounds and ...
zpbstf(l)
compute split Cholesky factorization of complex Hermitian positive definite band matrix
zpbsv(l)
compute solution to complex system of linear equations * X = B
zpbsvx(l)
use Cholesky factorization = U**H*U or = L*L**H to compute solution to complex system of linear equations * X = B
zpbtf2(l)
compute Cholesky factorization of complex Hermitian positive definite band matrix
zpbtrf(l)
compute Cholesky factorization of complex Hermitian positive definite band matrix
zpbtrs(l)
solve system of linear equations *X = B with Hermitian positive definite band matrix using Cholesky factorization = U**H*U/= L*L**H computed by ZPBTRF
zplay(1)
modem utility to record/play voice files
zpocon(l)
estimate reciprocal of condition number of complex Hermitian positive definite matrix using Cholesky factorization = U**H*U/= L*L**H computed by ZPOTRF
zpoequ(l)
compute row/column scalings intended to equilibrate Hermitian positive definite matrix/reduce its condition number
zporfs(l)
improve computed solution to system of linear equations when coefficient matrix is Hermitian positive definite
zposv(l)
compute solution to complex system of linear equations * X = B
zposvx(l)
use Cholesky factorization = U**H*U or = L*L**H to compute solution to complex system of linear equations * X = B
zpotf2(l)
compute Cholesky factorization of complex Hermitian positive definite matrix
zpotrf(l)
compute Cholesky factorization of complex Hermitian positive definite matrix
zpotri(l)
compute inverse of complex Hermitian positive definite matrix using Cholesky factorization = U**H*U/= L*L**H computed by ZPOTRF
zpotrs(l)
solve system of linear equations *X = B with Hermitian positive definite matrix using Cholesky factorization = U**H*U/= L*L**H computed by ZPOTRF
zppcon(l)
estimate reciprocal of condition number of complex Hermitian positive definite packed matrix using Cholesky factorization = U**H*U/= L*L**H computed by ZPPTRF
zppequ(l)
compute row/column scalings intended to equilibrate Hermitian positive definite matrix in packed storage/reduce its condition number
zpprfs(l)
improve computed solution to system of linear equations when coefficient matrix is Hermitian positive definite and packed, and provides error bounds and ...
zppsv(l)
compute solution to complex system of linear equations * X = B
zppsvx(l)
use Cholesky factorization = U**H*U or = L*L**H to compute solution to complex system of linear equations * X = B
zpptrf(l)
compute Cholesky factorization of complex Hermitian positive definite matrix stored in packed format
zpptri(l)
compute inverse of complex Hermitian positive definite matrix using Cholesky factorization = U**H*U/= L*L**H computed by ZPPTRF
zpptrs(l)
solve system of linear equations *X = B with Hermitian positive definite matrix in packed storage using Cholesky factorization = U**H*U/= L*L**H computed by ...
zptcon(l)
compute reciprocal of condition number of complex Hermitian positive definite tridiagonal matrix using factorization = L*D*L**H/= U**H*D*U computed by ZPTTRF
zpteqr(l)
compute all eigenvalues and, , eigenvectors of symmetric positive definite tridiagonal matrix by first factoring matrix using DPTTRF and then calling ZBDSQR to ...
zptrfs(l)
improve computed solution to system of linear equations when coefficient matrix is Hermitian positive definite and tridiagonal, and provides error bounds and ...
zptsv(l)
compute solution to complex system of linear equations *X = B, where is N-by-N Hermitian positive definite tridiagonal matrix, and X and B are N-by-NRHS ...
zptsvx(l)
use factorization = L*D*L**H to compute solution to complex system of linear equations *X = B, where is N-by-N Hermitian positive definite tridiagonal matrix ...
zpttrf(l)
compute L*D*L' factorization of complex Hermitian positive definite tridiagonal matrix
zpttrs(l)
solve tridiagonal system of form * X = B using factorization = U'*D*U/= L*D*L' computed by ZPTTRF
zptts2(l)
solve tridiagonal system of form * X = B using factorization = U'*D*U/= L*D*L' computed by ZPTTRF
zrot(l)
applie plane rotation, where cos is real and sin is complex, and vectors CX and CY are complex
zrotg(l)
zrun(1)
automatically uncompress arguments to command
zscal(l)
zserv(8)
CERNLIB server program for transferring ZEBRA formatted files
zsh(1)
Z shell
zshall(1)
Z shell meta-man page
zshbuiltins(1)
zsh built-in commands
zshcompctl(1)
zsh programmable completion
zshcompsys(1)
zsh completion system
zshcompwid(1)
zsh completion widgets
zshcontrib(1)
user contributions to zsh
zshexpn(1)
zsh expansion/substitution
zshmisc(1)
everything/then some
zshmodules(1)
zsh loadable modules
zshoptions(1)
zsh options
zshparam(1)
zsh parameters
zshroadmap(1)
informal introduction to zsh manual
zshtcpsys(1)
zsh tcp system
zshzftpsys(1)
zftp function front-end
zshzle(1)
zsh editor
zsoelim(1)
interpret .so requests in groff input
zspcon(l)
estimate reciprocal of condition number of complex symmetric packed matrix using factorization = U*D*U**T/= L*D*L**T computed by ZSPTRF
zsplit(8)
reads big devices/files/makes compressed splitted image chunks of it
zspmv(l)
perform matrix-vector operation y := alpha**x + beta*y
zspr(l)
perform symmetric rank 1 operation := alpha*x*conjg +
zsprfs(l)
improve computed solution to system of linear equations when coefficient matrix is symmetric indefinite and packed, and provides error bounds and backward ...
zspsv(l)
compute solution to complex system of linear equations * X = B
zspsvx(l)
use diagonal pivoting factorization = U*D*U**T or = L*D*L**T to compute solution to complex system of linear equations * X = B, where is N-by-N symmetric ...
zsptrf(l)
compute factorization of complex symmetric matrix stored in packed format using Bunch-Kaufman diagonal pivoting method
zsptri(l)
compute inverse of complex symmetric indefinite matrix in packed storage using factorization = U*D*U**T/= L*D*L**T computed by ZSPTRF
zsptrs(l)
solve system of linear equations *X = B with complex symmetric matrix stored in packed format using factorization = U*D*U**T/= L*D*L**T computed by ZSPTRF
zssh(1)
interactive file transfer wrapper for ssh
zstedc(l)
compute all eigenvalues and, , eigenvectors of symmetric tridiagonal matrix using divide and conquer method
zstegr(l)
compute selected eigenvalues and, , eigenvectors of real symmetric tridiagonal matrix T
zstein(l)
compute eigenvectors of real symmetric tridiagonal matrix T corresponding to specified eigenvalues, using inverse iteration
zstemr(l)
selected eigenvalues and, , eigenvectors of real symmetric tridiagonal matrix T
zsteqr(l)
compute all eigenvalues and, , eigenvectors of symmetric tridiagonal matrix using implicit QL or QR method
zswap(l)
two vectors
zsycon(l)
estimate reciprocal of condition number of complex symmetric matrix using factorization = U*D*U**T/= L*D*L**T computed by ZSYTRF
zsymm(l)
perform one of matrix-matrix operations C := alpha**B + beta*C
zsymv(l)
perform matrix-vector operation y := alpha**x + beta*y
zsync(1)
Partial/differential file download client over HTTP
zsyncmake(1)
Build control file for zsync
zsyr(l)
perform symmetric rank 1 operation := alpha*x* +
zsyr2k(l)
perform one of symmetric rank 2k operations C := alpha**B' + alpha*B*' + beta*C
zsyrfs(l)
improve computed solution to system of linear equations when coefficient matrix is symmetric indefinite, and provides error bounds and backward error estimates ...
zsyrk(l)
perform one of symmetric rank k operations C := alpha**' + beta*C
zsysv(l)
compute solution to complex system of linear equations * X = B
zsysvx(l)
use diagonal pivoting factorization to compute solution to complex system of linear equations * X = B
zsytf2(l)
compute factorization of complex symmetric matrix using Bunch-Kaufman diagonal pivoting method
zsytrf(l)
compute factorization of complex symmetric matrix using Bunch-Kaufman diagonal pivoting method
zsytri(l)
compute inverse of complex symmetric indefinite matrix using factorization = U*D*U**T/= L*D*L**T computed by ZSYTRF
zsytrs(l)
solve system of linear equations *X = B with complex symmetric matrix using factorization = U*D*U**T/= L*D*L**T computed by ZSYTRF
ztbcon(l)
estimate reciprocal of condition number of triangular band matrix , in either 1-norm or infinity-norm
ztbmv(l)
perform one of matrix-vector operations x := *x, or x := '*x, or x := conjg*x
ztbrfs(l)
provide error bounds/backward error estimates for solution to system of linear equations with triangular band coefficient matrix
ztbsv(l)
solve one of systems of equations *x = b, or '*x = b, or conjg*x = b
ztbtrs(l)
solve triangular system of form * X = B, **T * X = B, or **H * X = B
ztcfg(8)
reads/loads zaptel.conf
ztelnet(1)
interactive file transfer wrapper for ssh
ztgevc(l)
compute some/all of right/left generalized eigenvectors of pair of complex upper triangular matrices
ztgex2(l)
swap adjacent diagonal 1 by 1 blocks/
ztgexc(l)
reorder generalized Schur decomposition of complex matrix pair , using unitary equivalence transformation := Q * * Z', so that diagonal block of with row index ...
ztgsen(l)
reorder generalized Schur decomposition of complex matrix pair (in terms of unitary equivalence trans- formation Q' * * Z), so that selected cluster of ...
ztgsja(l)
compute generalized singular value decomposition of two complex upper triangular matrices/B
ztgsna(l)
estimate reciprocal condition numbers for specified eigenvalues/eigenvectors of matrix pair
ztgsy2(l)
solve generalized Sylvester equation * R - L * B = scale * C D * R - L * E = scale * F using Level 1 and 2 BLAS, where R and L are unknown M-by-N matrices
ztgsyl(l)
solve generalized Sylvester equation
ztmonitor(8)
checks rx/tx levels of zaptel inteface cards
ztpcon(l)
estimate reciprocal of condition number of packed triangular matrix , in either 1-norm or infinity-norm
ztpmv(l)
perform one of matrix-vector operations x := *x, or x := '*x, or x := conjg*x
ztprfs(l)
provide error bounds/backward error estimates for solution to system of linear equations with triangular packed coefficient matrix
ztpsv(l)
solve one of systems of equations *x = b, or '*x = b, or conjg*x = b
ztptri(l)
compute inverse of complex upper/lower triangular matrix stored in packed format
ztptrs(l)
solve triangular system of form * X = B, **T * X = B, or **H * X = B
ztrcon(l)
estimate reciprocal of condition number of triangular matrix , in either 1-norm or infinity-norm
ztrevc(l)
compute some/all of right/left eigenvectors of complex upper triangular matrix T
ztrexc(l)
reorder Schur factorization of complex matrix = Q*T*Q**H, so that diagonal element of T with row index IFST is moved to row ILST
ztrmm(l)
perform one of matrix-matrix operations B := alpha*op*B, or B := alpha*B*op where alpha is scalar, B is m by n matrix, is unit, or non-unit, upper or lower ...
ztrmv(l)
perform one of matrix-vector operations x := *x, or x := '*x, or x := conjg*x
ztrrfs(l)
provide error bounds/backward error estimates for solution to system of linear equations with triangular coefficient matrix
ztrsen(l)
reorder Schur factorization of complex matrix = Q*T*Q**H, so that selected cluster of eigenvalues appears in leading positions on diagonal of upper triangular ...
ztrsm(l)
solve one of matrix equations op*X = alpha*B, or X*op = alpha*B
ztrsna(l)
estimate reciprocal condition numbers for specified eigenvalues/right eigenvectors of complex upper triangular matrix T
ztrsv(l)
solve one of systems of equations *x = b, or '*x = b, or conjg*x = b
ztrsyl(l)
solve complex Sylvester matrix equation
ztrti2(l)
compute inverse of complex upper/lower triangular matrix
ztrtri(l)
compute inverse of complex upper/lower triangular matrix
ztrtrs(l)
solve triangular system of form * X = B, **T * X = B, or **H * X = B
ztspeed(8)
generic speed test
zttest(8)
Test if zaptel timer provides timely response
zttool(8)
Zaptel Tool shows status of Digium's interface cards
ztzrqf(l)
routine is deprecated/has been replaced by routine ZTZRZF
ztzrzf(l)
reduce M-by-N complex upper trapezoidal matrix to upper triangular form by means of unitary transformations
zung2l(l)
make m by n complex matrix Q with orthonormal columns
zung2r(l)
make m by n complex matrix Q with orthonormal columns
zungbr(l)
make one of complex unitary matrices Q/P**H determined by ZGEBRD when reducing complex matrix to bidiagonal form
zunghr(l)
make complex unitary matrix Q which is defined as product of IHI-ILO elementary reflectors of order N, as returned by ZGEHRD
zungl2(l)
make m-by-n complex matrix Q with orthonormal rows
zunglq(l)
make M-by-N complex matrix Q with orthonormal rows
zungql(l)
make M-by-N complex matrix Q with orthonormal columns
zungqr(l)
make M-by-N complex matrix Q with orthonormal columns
zungr2(l)
make m by n complex matrix Q with orthonormal rows
zungrq(l)
make M-by-N complex matrix Q with orthonormal rows
zungtr(l)
make complex unitary matrix Q which is defined as product of n-1 elementary reflectors of order N, as returned by ZHETRD
zunm2l(l)
overwrite 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 = ...
zunm2r(l)
overwrite 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 = ...
zunmbr(l)
VECT = 'Q', ZUNMBR overwrites general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N'
zunmhr(l)
overwrite general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N'
zunml2(l)
overwrite 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 = ...
zunmlq(l)
overwrite general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N'
zunmql(l)
overwrite general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N'
zunmqr(l)
overwrite general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N'
zunmr2(l)
overwrite 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 = ...
zunmr3(l)
overwrite 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 = ...
zunmrq(l)
overwrite general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N'
zunmrz(l)
overwrite general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N'
zunmtr(l)
overwrite general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N'
zupgtr(l)
make complex unitary matrix Q which is defined as product of n-1 elementary reflectors H of order n, as returned by ZHPTRD using packed storage
zupmtr(l)
overwrite general complex M-by-N matrix C with SIDE = 'L' SIDE = 'R' TRANS = 'N'
zvbi-chains(1)
VBI proxy wrapper
zvbi-ntsc-cc(1)
closed caption decoder
zvbid(1)
VBI proxy daemon
zzip_close(3)
zzip_closedir(3)
zzip_compr_str(3)
zzip_dir_alloc(3)
zzip_dir_alloc_ext_io(3)
zzip_dir_close(3)
zzip_dir_fdopen(3)
zzip_dir_fdopen_ext_io(3)
zzip_dir_free(3)
zzip_dir_open(3)
zzip_dir_open_ext_io(3)
zzip_dir_read(3)
zzip_dir_real(3)
zzip_dir_stat(3)
zzip_dirfd(3)
zzip_dirhandle(3)
zzip_disk_close(3)
turn filehandle into mmapped zip disk archive handle
zzip_disk_entry_fopen(3)
openening file part wrapped within zip archive
zzip_disk_entry_strdup_comment(3)
helper functions for zip access api
zzip_disk_entry_strdup_name(3)
helper functions for zip access api
zzip_disk_entry_to_data(3)
helper functions for zip access api
zzip_disk_entry_to_file_header(3)
helper functions for zip access api
zzip_disk_fclose(3)
openening file part wrapped within zip archive
zzip_disk_feof(3)
openening file part wrapped within zip archive
zzip_disk_findfile(3)
search for files in zip central directory
zzip_disk_findfirst(3)
search for files in zip central directory
zzip_disk_findmatch(3)
search for files in zip central directory
zzip_disk_findnext(3)
search for files in zip central directory
zzip_disk_fopen(3)
openening file part wrapped within zip archive
zzip_disk_fread(3)
openening file part wrapped within zip archive
zzip_disk_init(3)
turn filehandle into mmapped zip disk archive handle
zzip_disk_mmap(3)
turn filehandle into mmapped zip disk archive handle
zzip_disk_munmap(3)
turn filehandle into mmapped zip disk archive handle
zzip_disk_new(3)
turn filehandle into mmapped zip disk archive handle
zzip_disk_open(3)
turn filehandle into mmapped zip disk archive handle
zzip_entry_data_offset(3)
helper functions for zip access api
zzip_entry_fclose(3)
open file within zip disk for reading
zzip_entry_feof(3)
open file within zip disk for reading
zzip_entry_ffile(3)
open file within zip disk for reading
zzip_entry_findfile(3)
search for files in zip central directory
zzip_entry_findfirst(3)
search for files in zip central directory
zzip_entry_findmatch(3)
search for files in zip central directory
zzip_entry_findnext(3)
search for files in zip central directory
zzip_entry_fopen(3)
open file within zip disk for reading
zzip_entry_fread(3)
open file within zip disk for reading
zzip_entry_fread_file_header(3)
helper functions for zip access api
zzip_entry_free(3)
search for files in zip central directory
zzip_entry_strdup_name(3)
helper functions for zip access api
zzip_errno(3)
zzip_error(3)
zzip_fclose(3)
zzip_file_close(3)
zzip_file_open(3)
zzip_file_read(3)
zzip_file_real(3)
zzip_file_stat(3)
zzip_fopen(3)
zzip_fread(3)
zzip_freopen(3)
zzip_fstat(3)
zzip_get_default_io(3)
zzip_inflate_init(3)
zzip_init_io(3)
zzip_open(3)
zzip_open_ext_io(3)
zzip_open_shared_io(3)
zzip_opendir(3)
zzip_opendir_ext_io(3)
zzip_read(3)
zzip_readdir(3)
zzip_realdir(3)
zzip_realfd(3)
zzip_rewind(3)
zzip_rewinddir(3)
zzip_seek(3)
zzip_seekdir(3)
zzip_seterror(3)
zzip_strerror(3)
zzip_strerror_of(3)
zzip_tell(3)
zzip_telldir(3)
zzuf(1)
multiple purpose fuzzer