Skip site navigation (1)Skip section navigation (2)

FreeBSD Man Pages

Man Page or Keyword Search:
Man Architecture
Apropos Keyword Search (all sections) Output format
home | help
pfind(9), zpfind(9)
locate a process by number
zpool(8)
configures ZFS storage pools
XmListSetHorizPos(3)
A List function that scrolls to the specified position in the list "XmListSetHorizPos" "List functions" "XmListSetHorizPos"
fzputtygen(1)
SFTP private key converter of FileZilla
libzpaq(3)
ZPAQ compression API
mozplugger(7)
a streaming multimedia plugin for UNIX mozilla
pzpbsv(l), PZPBSV(l)
solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pzpbtrf(l), PZPBTRF(l)
compute a Cholesky factorization of an N-by-N complex banded symmetric positive definite distributed matrix with bandwidth BW
pzpbtrs(l), PZPBTRS(l)
solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pzpbtrsv(l), PZPBTRSV(l)
solve a banded triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pzpocon(l), PZPOCON(l)
estimate the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite distributed matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by PZPOTRF
pzpoequ(l), PZPOEQU(l)
compute row and column scalings intended to equilibrate a distributed Hermitian positive definite matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) and reduce its condition number (with respect to the two-norm)
pzporfs(l), PZPORFS(l)
improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and provides error bounds and backward error estimates for the solutions
pzposv(l), PZPOSV(l)
compute the solution to a complex system of linear equations sub( A ) * X = sub( B ),
pzposvx(l), PZPOSVX(l)
use the Cholesky factorization A = U**H*U or A = L*L**H to compute the solution to a complex system of linear equations A(IA:IA+N-1,JA:JA+N-1) * X = B(IB:IB+N-1,JB:JB+NRHS-1),
pzpotf2(l), PZPOTF2(l)
compute the Cholesky factorization of a complex hermitian positive definite distributed matrix sub( A )=A(IA:IA+N-1,JA:JA+N-1)
pzpotrf(l), PZPOTRF(l)
compute the Cholesky factorization of an N-by-N complex hermitian positive definite distributed matrix sub( A ) denoting A(IA:IA+N-1, JA:JA+N-1)
pzpotri(l), PZPOTRI(l)
compute the inverse of a complex Hermitian positive definite distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) using the Cholesky factorization sub( A ) = U**H*U or L*L**H computed by PZPOTRF
pzpotrs(l), PZPOTRS(l)
solve a system of linear equations sub( A ) * X = sub( B ) A(IA:IA+N-1,JA:JA+N-1)*X = B(IB:IB+N-1,JB:JB+NRHS-1)
pzptsv(l), PZPTSV(l)
solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pzpttrf(l), PZPTTRF(l)
compute a Cholesky factorization of an N-by-N complex tridiagonal symmetric positive definite distributed matrix A(1:N, JA:JA+N-1)
pzpttrs(l), PZPTTRS(l)
solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pzpttrsv(l), PZPTTRSV(l)
solve a tridiagonal triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
uszprintf(3)
Writes formatted data into a buffer, specifying size. Allegro game programming library
uvszprintf(3)
Writes formatted data into a buffer, using size and variable arguments. Allegro game programming library
yazpp-config(1)
Script to get information about YAZ++
yazproxy(8)
The YAZ toolkits transparent Z39.50/SRU proxy
zpaq(1)
Archiver and compression algorithm development tool
zpbcon(l), ZPBCON(l)
estimates 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
zpbequ(l), ZPBEQU(l)
computes 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)
zpbrfs(l), ZPBRFS(l)
improves 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
zpbstf(l), ZPBSTF(l)
computes a split Cholesky factorization of a complex Hermitian positive definite band matrix A
zpbsv(l), ZPBSV(l)
computes the solution to a complex system of linear equations A * X = B,
zpbsvx(l), ZPBSVX(l)
uses 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(l), ZPBTF2(l)
computes the Cholesky factorization of a complex Hermitian positive definite band matrix A
zpbtrf(l), ZPBTRF(l)
computes the Cholesky factorization of a complex Hermitian positive definite band matrix A
zpbtrs(l), ZPBTRS(l)
solves 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
zpftrf(l), ZPFTRF(l)
computes the Cholesky factorization of a complex Hermitian positive definite matrix A
zpftri(l), ZPFTRI(l)
computes 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 ZPFTRF
zpftrs(l), ZPFTRS(l)
solves 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 ZPFTRF
zplay(1)
modem utility to record and play voice files
zpocon(l), ZPOCON(l)
estimates 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
zpoequ(l), ZPOEQU(l)
computes row and column scalings intended to equilibrate a Hermitian positive definite matrix A and reduce its condition number (with respect to the two-norm)
zpoequb(l), ZPOEQUB(l)
computes row and column scalings intended to equilibrate a symmetric positive definite matrix A and reduce its condition number (with respect to the two-norm)
zporfs(l), ZPORFS(l)
improves the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite,
zporfsx(l), ZPORFSX(l)
ZPORFSX improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite, and provides error bounds and backward error estimates for the solution
zposv(l), ZPOSV(l)
computes the solution to a complex system of linear equations A * X = B,
zposvx(l), ZPOSVX(l)
uses 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,
zposvxx(l), ZPOSVXX(l)
ZPOSVXX use the Cholesky factorization A = U**T*U or A = L*L**T to compute the solution to a complex*16 system of linear equations A * X = B, where A is an N-by-N symmetric positive definite matrix and X and B are N-by-NRHS matrices
zpotf2(l), ZPOTF2(l)
computes the Cholesky factorization of a complex Hermitian positive definite matrix A
zpotrf(l), ZPOTRF(l)
computes the Cholesky factorization of a complex Hermitian positive definite matrix A
zpotri(l), ZPOTRI(l)
computes 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(l), ZPOTRS(l)
solves 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
zppcon(l), ZPPCON(l)
estimates 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
zppequ(l), ZPPEQU(l)
computes 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)
zpprfs(l), ZPPRFS(l)
improves 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
zppsv(l), ZPPSV(l)
computes the solution to a complex system of linear equations A * X = B,
zppsvx(l), ZPPSVX(l)
uses 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(l), ZPPTRF(l)
computes the Cholesky factorization of a complex Hermitian positive definite matrix A stored in packed format
zpptri(l), ZPPTRI(l)
computes 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(l), ZPPTRS(l)
solves 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
zpstf2(l), ZPSTF2(l)
computes the Cholesky factorization with complete pivoting of a complex Hermitian positive semidefinite matrix A
zpstrf(l), ZPSTRF(l)
computes the Cholesky factorization with complete pivoting of a complex Hermitian positive semidefinite matrix A
zptcon(l), ZPTCON(l)
computes 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(l), ZPTEQR(l)
computes 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(l), ZPTRFS(l)
improves 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
zptsv(l), ZPTSV(l)
computes 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(l), ZPTSVX(l)
uses 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(l), ZPTTRF(l)
computes the L*D*L(aq factorization of a complex Hermitian positive definite tridiagonal matrix A
zpttrs(l), ZPTTRS(l)
solves a tridiagonal system of the form A * X = B using the factorization A = U(aq*D*U or A = L*D*L(aq computed by ZPTTRF
zpttrsv(l), ZPTTRSV(l)
solve one of the triangular systems L * X = B, or L**H * X = B,
zptts2(l), ZPTTS2(l)
solves a tridiagonal system of the form A * X = B using the factorization A = U(aq*D*U or A = L*D*L(aq computed by ZPTTRF
Config::Model::models::LCDd::CFontzPacket(3)
Configuration class LCDd::CFontzPacket
Devel::GraphVizProf(3)
per-line Perl profiler (with graph output)
Finance::Quote::Finanzpartner(3)
Obtain quotes from Finanzpartner.de
Petal::I18N(3)
Attempt at implementing ZPT I18N for Petal
home | help