·  Home
+   man pages
 -> Linux -> FreeBSD -> OpenBSD -> NetBSD -> Tru64 Unix -> HP-UX 11i -> IRIX
·  Linux HOWTOs
·  FreeBSD Tips
·  *niX Forums

man pages->IRIX man pages
 Title
 Content
 Arch
 Section All Sections 1 - General Commands 2 - System Calls 3 - Subroutines 4 - Special Files 5 - File Formats 6 - Games 7 - Macros and Conventions 8 - Maintenance Commands 9 - Kernel Interface n - New Commands
 complib/dlassq(3) -- 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq, DLASSQ returns the values scl and smsq such that where x( i ) = X( 1 + ( i - 1 )*INCX ). The value of sumsq is assumed to be non-negative and scl returns the value scl = max( scale, abs( x( i ) ) ). scale and sumsq must be supplied in SCALE and SUMSQ and scl and smsq are overwritten on SCALE and SUMSQ respectively. The routine makes only one pass through the vector x. complib/dlasv2(3) -- compute the singular value decomposition of a 2-by-2 triangular matrix [ F G ] [ 0 H ] DLASV2 computes the singular value decomposition of a 2-by-2 triangular matrix [ F G ] [ 0 H ]. On return, abs(SSMAX) is the larger singular value, abs(SSMIN) is the smaller singular value, and (CSL,SNL) and (CSR,SNR) are the left and right singular vectors for abs(SSMAX), giving the decomposition [ CSL SNL ] [ F G ] [ CSR -SNR ] = [ SSMAX 0 ] [-SNL CSL ] [ 0 H ] [ SNR CSR ] [ 0 SSMIN ].
complib/dlaswp(3) -- perform a series of row interchanges on the matrix A
DLASWP performs a series of row interchanges on the matrix A. One row interchange is initiated for each of rows K1 through K2 of A.
complib/dlasy2(3) -- + ISGN*X*op(TR) = SCALE*B,
DLASY2 solves for the N1 by N2 matrix X, 1 <= N1,N2 <= 2, in where TL is N1 by N1, TR is N2 by N2, B is N1 by N2, and ISGN = 1 or -1. op(T) = T or T', where T' denotes the transpose of T.
complib/dlasyf(3) -- using the Bunch-Kaufman diagonal pivoting method
DLASYF computes a partial factorization of a real symmetric matrix A using the Bunch-Kaufman diagonal pivoting method. The partial factorization has the form: A = ( I U12 ) ( A11 0 ) ( I 0 ) if UPLO = 'U', or: ( 0 U22 ) ( 0 D ) ( U12' U22' ) A = ( L11 0 ) ( D 0 ) ( L11' L21' ) if UPLO = 'L' ( L21 I ) ( 0 A22 ) ( 0 I ) where the order of D is at most NB. The actual order is returned in the argument KB, and is either NB or NB-1, or N if N <= NB. DLASYF is an auxiliary routine called by DSY...
complib/dlatbs(3) -- solve one of the triangular systems A *x = s*b or A'*x = s*b with scaling to prevent overflow, where A is an u
DLATBS solves one of the triangular systems are n-element vectors, and s is a scaling factor, usually less than or equal to 1, chosen so that the components of x will be less than the overflow threshold. If the unscaled problem will not cause overflow, the Level 2 BLAS routine DTBSV is called. If the matrix A is singular (A(j,j) = 0 for some j), then s is set to 0 and a non-trivial solution to A*x = 0 is returned....
complib/dlatps(3) -- solve one of the triangular systems A *x = s*b or A'*x = s*b with scaling to prevent overflow, where A is an u
DLATPS solves one of the triangular systems transpose of A, x and b are n-element vectors, and s is a scaling factor, usually less than or equal to 1, chosen so that the components of x will be less than the overflow threshold. If the unscaled problem will not cause overflow, the Level 2 BLAS routine DTPSV is called. If the matrix A is singular (A(j,j) = 0 for some j), then s is set to 0 and a non-trivial solution to A*x = 0 is returned....
complib/dlatrd(3) -- reduce NB rows and columns of a real symmetric matrix A to symmetric tridiagonal form by an orthogonal similar
DLATRD reduces 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. If UPLO = 'U', DLATRD reduces the last NB rows and columns of a matrix, of which the upper triangle is supplied; if UPLO = 'L', DLATRD reduces the first NB rows and columns of a matrix, of which the lower triangle is supplied. This is an au...
complib/dlatrs(3) -- solve one of the triangular systems A *x = s*b or A'*x = s*b with scaling to prevent overflow
DLATRS solves one of the triangular systems triangular matrix, A' denotes the transpose of A, x and b are n-element vectors, and s is a scaling factor, usually less than or equal to 1, chosen so that the components of x will be less than the overflow threshold. If the unscaled problem will not cause overflow, the Level 2 BLAS routine DTRSV is called. If the matrix A is singular (A(j,j) = 0 for some j), then s is set to 0 and a non-trivial solution to A*x = 0 is returned....
complib/dlatzm(3) -- applie a Householder matrix generated by DTZRQF to a matrix
DLATZM applies a Householder matrix generated by DTZRQF to a matrix. Let P = I - tau*u*u', u = ( 1 ), ( v ) where v is an (m-1) vector if SIDE = 'L', or a (n-1) vector if SIDE = 'R'. If SIDE equals 'L', let C = [ C1 ] 1 [ C2 ] m-1 n Then C is overwritten by P*C. If SIDE equals 'R', let C = [ C1, C2 ] m 1 n-1 Then C is overwritten by C*P.
complib/dlauu2(3) -- compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower trian
DLAUU2 computes 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. If UPLO = 'U' or 'u' then the upper triangle of the result is stored, overwriting the factor U in A. If UPLO = 'L' or 'l' then the lower triangle of the result is stored, overwriting the factor L in A. This is the unblocked form of the algorithm, calling Level 2 BLAS....
complib/dlauum(3) -- compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower trian
DLAUUM computes 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. If UPLO = 'U' or 'u' then the upper triangle of the result is stored, overwriting the factor U in A. If UPLO = 'L' or 'l' then the lower triangle of the result is stored, overwriting the factor L in A. This is the blocked form of the algorithm, calling Level 3 BLAS....
libdl/dlclose(3) -- close a shared object
dlclose disassociates a shared object previously opened by dlopen, sgidladd, or sgidlopen_version from the current process. Once an object has been closed using dlclose, its symbols are no longer available to dlsym or to the program. All objects loaded automatically as a result of invoking dlopen, on the referenced object [see dlopen(3) sgidladd, or sgidlopen_version] are also closed (however no object still open via any dlopen, sgidladd, or sgidlopen_version is closed till the last open handle ...
libdl/dlerror(3) -- get diagnostic information
dlerror returns a null-terminated character string (with no trailing newline) that describes the last error that occurred during dynamic linking processing. If no dynamic linking errors have occurred since the last invocation of dlerror, dlerror returns NULL. Thus, invoking dlerror a second time, immediately following a prior invocation, results in NULL being returned.
libdl/dlopen(3) -- open a shared object
dlopen is one of a family of routines that give the user direct access to the dynamic linking facilities. These routines are available in a library which is loaded if the option -lc is used with cc , f77 or ld. dlopen makes a shared object available to a running process. dlopen returns to the process a handle which the process may use on subsequent calls to dlsym and dlclose. This handle should not be interpreted in any way by the process. pathname is the path name of the object to be opened; it...
<<  [Prev]  52  53  54  55  56  57  58  59  60  61  62  63  64  65  66  67  68  69  70  71  72
73  74  75  76  77  78  79  80  81  82  83  84  85  86  87  88  89  90  91  92  [Next]  >>