|
|
|
Tk/destroy(3) -- Destroy one or more windows
|
|
This command deletes the windows given by the window arguments, plus all of their descendants. If a window ``.'' is deleted then the entire application will be destroyed. The windows are destroyed in order, and if an error occurs in destroying a window the command aborts without destroying the remaining windows. |
|
Tcl/detachpids(3) -- manage child processes in background
|
|
int numPids (in) Number of process ids contained in the array pointed to by pidPtr. int *pidPtr (in) Address of array containing numPids process ids. |
|
|
perl5/Devel::SelfStubber(3) -- generate stubs for a SelfLoading module
|
|
Devel::SelfStubber prints the stubs you need to put in the module before the __DATA__ token (or you can get it to print the entire module with stubs correctly placed). The stubs ensure that if a method is called, it will get loaded. They are needed specifically for inherited autoloaded methods. This is best explained using the following example: Assume four classes, A,B,C & D. A is the root class, B is a subclass of A, C is a subclass of B, and D is another subclass of A. A / \ B D / C If D cal... |
|
complib/dgbbrd(3) -- reduce a real general m-by-n band matrix A to upper bidiagonal form B by an orthogonal transformation
|
|
DGBBRD reduces a real general m-by-n band matrix A to upper bidiagonal form B by an orthogonal transformation: Q' * A * P = B. The routine computes B, and optionally forms Q or P', or computes Q'*C for a given matrix C. |
|
complib/DGBCO(3) -- DGBCO factors a double precision band matrix by Gaussian elimination and estimates the condition of the matrix
|
|
On Entry ABD DOUBLE PRECISION(LDA, N) contains the matrix in band storage. The columns of the matrix are stored in the columns of ABD and the diagonals of the matrix are stored in rows ML+1 through 2*ML+MU+1 of ABD . See the comments below for details. LDA INTEGER the leading dimension of the array ABD . LDA must be .GE. 2*ML + MU + 1 . N INTEGER the order of the original matrix. ML INTEGER number of diagonals below the main diagonal. 0 .LE. ML .LT. N . MU INTEGER number of diagonals above the m... |
|
complib/dgbcon(3) -- general band matrix A, in either the 1-norm or the infinity-norm,
|
|
DGBCON estimates the reciprocal of the condition number of a real general band matrix A, in either the 1-norm or the infinity-norm, using the LU factorization computed by DGBTRF. An estimate is obtained for norm(inv(A)), and the reciprocal of the condition number is computed as RCOND = 1 / ( norm(A) * norm(inv(A)) ). |
|
complib/DGBDI(3) -- DGBDI computes the determinant of a band matrix using the factors computed by DGBCO or DGBFA. If the inverse i
|
|
On Entry ABD DOUBLE PRECISION(LDA, N) the output from DGBCO or DGBFA. LDA INTEGER the leading dimension of the array ABD . N INTEGER the order of the original matrix. ML INTEGER number of diagonals below the main diagonal. MU INTEGER number of diagonals above the main diagonal. IPVT INTEGER(N) the pivot vector from DGBCO or DGBFA. On Return DET DOUBLE PRECISION(2) determinant of original matrix. Determinant = DET(1) * 10.0**DET(2) with 1.0 .LE. DABS(DET(1)) .LT. 10.0 or DET(1) = 0.0 . LINPACK. T... |
|
complib/dgbequ(3) -- compute row and column scalings intended to equilibrate an Mby-N band matrix A and reduce its condition number
|
|
DGBEQU computes row and column scalings intended to equilibrate an M-by-N band matrix A and reduce its condition number. R returns the row scale factors and C the column scale factors, chosen to try to make the largest element in each row and column of the matrix B with elements B(i,j)=R(i)*A(i,j)*C(j) have absolute value 1. R(i) and C(j) are restricted to be between SMLNUM = smallest safe number and BIGNUM = largest safe number. Use of these scaling factors is not guaranteed to reduce the condi... |
|
complib/DGBFA(3) -- DGBFA factors a double precision band matrix by elimination. DGBFA is usually called by DGBCO, but it can be c
|
|
On Entry ABD DOUBLE PRECISION(LDA, N) contains the matrix in band storage. The columns of the matrix are stored in the columns of ABD and the diagonals of the matrix are stored in rows ML+1 through 2*ML+MU+1 of ABD . See the comments below for details. LDA INTEGER the leading dimension of the array ABD . LDA must be .GE. 2*ML + MU + 1 . N INTEGER the order of the original matrix. ML INTEGER number of diagonals below the main diagonal. 0 .LE. ML .LT. N . MU INTEGER number of diagonals above the m... |
|
complib/dgbrfs(3) -- improve the computed solution to a system of linear equations when the coefficient matrix is banded, and provi
|
|
DGBRFS improves 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. |
|
complib/DGBSL(3) -- DGBSL solves the double precision band system A * X = B or TRANS(A) * X = B using the factors computed by DGBC
|
|
On Entry ABD DOUBLE PRECISION(LDA, N) the output from DGBCO or DGBFA. LDA INTEGER the leading dimension of the array ABD . N INTEGER the order of the original matrix. ML INTEGER number of diagonals below the main diagonal. MU INTEGER number of diagonals above the main diagonal. IPVT INTEGER(N) the pivot vector from DGBCO or DGBFA. B DOUBLE PRECISION(N) the right hand side vector. JOB INTEGER = 0 to solve A*X = B , = nonzero to solve TRANS(A)*X = B , where TRANS(A) is the transpose. On Return B t... |
|
complib/dgbsv(3) -- compute the solution to a real system of linear equations A * X = B, where A is a band matrix of order N with
|
|
DGBSV computes 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. The LU decomposition with partial pivoting and row interchanges is used to factor A as A = L * U, where L is a product of permutation and unit lower triangular matrices with KL subdiagonals, and U is upper triangular with KL+KU superdiagonals. The factored form of A is then used to solve the system of equat... |
|
complib/dgbsvx(3) -- system of linear equations A * X = B, A**T * X = B, or A**H * X = B,
|
|
DGBSVX uses 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, where A is a band matrix of order N with KL subdiagonals and KU superdiagonals, and X and B are N-by-NRHS matrices. Error bounds on the solution and a condition estimate are also provided. |
|
complib/dgbtf2(3) -- compute an LU factorization of a real m-by-n band matrix A using partial pivoting with row interchanges
|
|
DGBTF2 computes an LU factorization of a real m-by-n band matrix A using partial pivoting with row interchanges. This is the unblocked version of the algorithm, calling Level 2 BLAS. |
|
complib/dgbtrf(3) -- compute an LU factorization of a real m-by-n band matrix A using partial pivoting with row interchanges
|
|
DGBTRF computes an LU factorization of a real m-by-n band matrix A using partial pivoting with row interchanges. This is the blocked version of the algorithm, calling Level 3 BLAS. |
