|
|
complib/DQRDC(3) -- DQRDC uses Householder transformations to compute the QR
|
|
On Entry X DOUBLE PRECISION(LDX,P), where LDX .GE. N. X contains the matrix whose decomposition is to be computed. LDX INTEGER. LDX is the leading dimension of the array X. N INTEGER. N is the number of rows of the matrix X. P INTEGER. P is the number of columns of the matrix X. JPVT INTEGER(P). JPVT contains integers that control the selection of the pivot columns. The K-th column X(K) of X is placed in one of three classes according to the value of JPVT(K). If JPVT(K) .GT. 0, then X(K) is an i... |
|
complib/DQRSL(3) -- DQRSL applies the output of DQRDC to compute coordinate transformations, projections, and least squares soluti
|
|
On Entry X DOUBLE PRECISION(LDX,P). X contains the output of DQRDC. LDX INTEGER. LDX is the leading dimension of the array X. N INTEGER. N is the number of rows of the matrix XK. It must have the same value as N in DQRDC. K INTEGER. K is the number of columns of the matrix XK. K must not be greater than MIN(N,P), where P is the same as in the calling sequence to DQRDC. QRAUX DOUBLE PRECISION(P). QRAUX contains the auxiliary output from DQRDC. Y DOUBLE PRECISION(N) Y contains an N-vector that is ... |
|
drand48(3c) -- generate uniformly distributed pseudo-random numbers
|
|
This family of functions generates pseudo-random numbers using the wellknown linear congruential algorithm and 48-bit integer arithmetic. Functions drand48 and erand48 return non-negative double-precision floating-point values uniformly distributed over the interval [0.0,~1.0) . Functions lrand48 and nrand48 return non-negative long integers uniformly distributed over the 31 interval [0,~2 ). Functions mr |
|
standard/draw(3) -- draws a line
|
|
x expects the x coordinate of the point to which you want to draw a line segment. y expects the y coordinate of the point to which you want to draw a line segment. z expects the z coordinate of the point to which you want to draw a line segment. (Not used by 2-D subroutines.) |
|
Tk/drawfochlt(3) -- draw the traversal highlight ring for a widget
|
|
Tk_Window tkwin (in) Window for which the highlight is being drawn. Used to retrieve the window's dimensions, among other things. GC gc (in) Graphics context to use for drawing the highlight. int width (in) Width of the highlight ring, in pixels. Drawable drawable (in) Drawable in which to draw the highlight; usually an offscreen pixmap for double buffering. |
|
standard/drawmode(3) -- selects which GL framebuffer is drawable
|
|
mode expects the identifier of the framebuffer to which GL drawing commands are to be directed: NORMALDRAW, which sets operations for the normal color and z buffer bitplanes. OVERDRAW, which sets operations for the overlay bitplanes. UNDERDRAW, which sets operations for the underlay bitplanes. PUPDRAW, which sets operations for the pop-up bitplanes. CURSORDRAW, which sets operations for the cursor.... |
|
complib/drscl(3) -- multiplie an n-element real vector x by the real scalar 1/a
|
|
DRSCL multiplies an n-element real vector x by the real scalar 1/a. This is done without overflow or underflow as long as the final result x/a does not overflow or underflow. |
|
complib/dsbev(3) -- compute all the eigenvalues and, optionally, eigenvectors of a real symmetric band matrix A
|
|
DSBEV computes all the eigenvalues and, optionally, eigenvectors of a real symmetric band matrix A. |
|
complib/dsbevd(3) -- compute all the eigenvalues and, optionally, eigenvectors of a real symmetric band matrix A
|
|
DSBEVD computes all the eigenvalues and, optionally, eigenvectors of a real symmetric band matrix A. If eigenvectors are desired, it uses a divide and conquer algorithm. The divide and conquer algorithm makes very mild assumptions about floating point arithmetic. It will work on machines with a guard digit in add/subtract, or on those binary machines without guard digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or Cray-2. It could conceivably fail on hexadecimal or decimal machin... |
|
complib/dsbevx(3) -- compute selected eigenvalues and, optionally, eigenvectors of a real symmetric band matrix A
|
|
DSBEVX computes selected eigenvalues and, optionally, eigenvectors of a real symmetric band matrix A. Eigenvalues and eigenvectors can be selected by specifying either a range of values or a range of indices for the desired eigenvalues. |
|
complib/dsbgst(3) -- A*x = lambda*B*x to standard form C*y = lambda*y,
|
|
DSBGST reduces a real symmetric-definite banded generalized eigenproblem A*x = lambda*B*x to standard form C*y = lambda*y, such that C has the same bandwidth as A. B must have been previously factorized as S**T*S by DPBSTF, using a split Cholesky factorization. A is overwritten by C = X**T*A*X, where X = S**(-1)*Q and Q is an orthogonal matrix chosen to preserve the bandwidth of A. |
|
complib/dsbgv(3) -- a real generalized symmetric-definite banded eigenproblem, of the form A*x=(lambda)*B*x
|
|
DSBGV computes all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite banded eigenproblem, of the form A*x=(lambda)*B*x. Here A and B are assumed to be symmetric and banded, and B is also positive definite. |
|
complib/dsbtrd(3) -- reduce a real symmetric band matrix A to symmetric tridiagonal form T by an orthogonal similarity transformati
|
|
DSBTRD reduces a real symmetric band matrix A to symmetric tridiagonal form T by an orthogonal similarity transformation: Q**T * A * Q = T. |
