|
|
|
complib/cscal1d(3) -- scales a 1D real sequence.
|
|
cscal1d and zscal1d scale a complex sequences of N samples. The Fourier Transforms are not normalized so the succession DirectInverse transform scales the input data by a factor equal to the size of the transform. cscal1d or zscal1d are used to scale back the result. |
|
complib/cscal2d(3) -- scales a 2D complex sequence.
|
|
cscal2d and zscal2d scale a 2D complex sequence of size N1xN2. The Fourier Transforms are not normalized so the succession DirectInverse transform scales the input data by a factor equal to the size of the transform. So cscal2d or zscal2d may be used to scale back the result. |
|
|
complib/cscal3d(3) -- scales a 3D complex sequence.
|
|
cscal3d and zscal3d scale a 3D complex sequence of size N1xN2xN3. The Fourier Transforms are not normalized so the succession DirectInverse transform scales the input data by a factor equal to the size of the transform. So cscal3d or zscal3d may be used to scale back the result. |
|
complib/cscalm1d(3) -- scales Multiple 1D complex sequences.
|
|
cscalm1d and zscalm1d scale the P complex sequences of N samples each. The Fourier Transforms are not normalized so the succession DirectInverse transform scales the input data by a factor equal to the size of the transform. cscalm1d or zscalm1d are used to scale back the result. |
|
complib/csfft1du(3) -- 1D, Complex to Real, Inverse Fast Fourier Transforms.
|
|
csfft1du and zdfft1du compute the real sequence of N samples, from its Fourier transform. The i-th index f(i) of a sequence with Fourier transform F(k) is equal to: f(i) = Sum ( W^(i*k) * F(k) ), for k =0, ..., (N-1) W = exp( (Sign*2*sqrt(-1)*PI) / N ) The Inverse Fourier transform is performed in-place, so the input Fourier transform is overwritten by the final sequence output. As the output sequence has real values, only the first half of the transform is needed. The (N-k)-th sample of the tra... |
|
complib/csfft2du(3) -- 2D, Complex-to-Real, Inverse Fast Fourier Transforms.
|
|
csfft2du and zdfft2du compute in place the inverse Fourier transform of real 2D sequence of size N1 x N2. The value F{k,l} of the transform of the 2D sequence f{i,j} is equal to: F{k,l} = Sum ( W1^(i*k) * W2^(j*l) * f{i,j} ), for i =0,...,(N1-1), j=0,...,(n2-1) W1 = exp( (Sign*2*sqrt(-1)*PI) / N1 ) W2 = exp( (Sign*2*sqrt(-1)*PI) / N2 ) |
|
complib/csfft3du(3) -- 3D, Complex to Real, Inverse Fast Fourier Transforms.
|
|
csfft3du and zdfft3du compute in place the real 3D sequence of size N1 x N2 x N3 from its complex Fourier transform. The value F{j1,j2,j3} of the transform of the 3D sequence f{i1,i2,i3} is equal to: F{j1,j2,j3} = Sum( W1^(i1*j1)*W2^(i2*j2)*W3^(i3*j3)*f{i1,i2,i3} ), for i[123] =0,...,(N[123]-1) W[123] = exp( (Sign*2*sqrt(-1)*PI) / N[123] ) |
|
complib/csfftm1du(3) -- Multiple 1D, Complex to Real, Inverse Fast Fourier Transforms.
|
|
csfftm1du and zdfftm1du compute the P real sequences of N samples each, from their Fourier transform. The i-th index f(i) of a sequence of N samples, with Fourier transform F(k) is equal to: f(i) = Sum ( W^(i*k) * F(k) ), for k =0, ..., (N-1) W = exp( (Sign*2*sqrt(-1)*PI) / N ) The Inverse Fourier transforms are performed in-place, so the input Fourier transform is overwritten by the final sequence output. As the output sequences have real values, only the first half of the transform is needed. ... |
|
f90/cshift(3) -- Performs a circular shift on an array expression
|
|
UNICOS, UNICOS/mk, and IRIX systems |
|
complib/CSICO(3) -- CSICO factors a complex symmetric matrix by elimination with symmetric pivoting and estimates the condition of
|
|
On Entry A COMPLEX(LDA, N) the symmetric matrix to be factored. Only the diagonal and upper triangle are used. LDA INTEGER the leading dimension of the array A . N INTEGER the order of the matrix A . On Return A a block diagonal matrix and the multipliers which were used to obtain it. The factorization can be written A = U*D*TRANS(U) where U is a product of permutation and unit upper triangular matrices , TRANS(U) is the transpose of U , and D is block diagonal with 1 by 1 and 2 by 2 blocks. KVP... |
|
complib/CSIDI(3) -- CSIDI computes the determinant and inverse of a complex symmetric matrix using the factors from CSIFA.
|
|
On Entry A COMPLEX(LDA,N) the output from CSIFA. LDA INTEGER the leading dimension of the array A . N INTEGER the order of the matrix A . KVPT INTEGER(N) the pivot vector from CSIFA. WORK COMPLEX(N) work vector. Contents destroyed. JOB INTEGER JOB has the decimal expansion AB where If B .NE. 0, the inverse is computed, If A .NE. 0, the determinant is computed, For example, JOB = 11 gives both. On Return Variables not requested by JOB are not used. A contains the upper triangle of the inverse of ... |
|
complib/CSIFA(3) -- CSIFA factors a complex symmetric matrix by elimination with symmetric pivoting. To solve A*X = B , follow CSI
|
|
On Entry A COMPLEX(LDA,N) the symmetric matrix to be factored. Only the diagonal and upper triangle are used. LDA INTEGER the leading dimension of the array A . N INTEGER the order of the matrix A . On Return A a block diagonal matrix and the multipliers which were used to obtain it. The factorization can be written A = U*D*TRANS(U) where U is a product of permutation and unit upper triangular matrices , TRANS(U) is the transpose of U , and D is block diagonal with 1 by 1 and 2 by 2 blocks. KVPT... |
|
complib/CSISL(3) -- CSISL solves the complex symmetric system A * X = B using the factors computed by CSIFA.
|
|
On Entry A COMPLEX(LDA,N) the output from CSIFA. LDA INTEGER the leading dimension of the array A . N INTEGER the order of the matrix A . KVPT INTEGER(N) the pivot vector from CSIFA. B COMPLEX(N) the right hand side vector. On Return B the solution vector X . Error Condition A division by zero may occur if CSICO has set RCOND .EQ. 0.0 or CSIFA has set INFO .NE. 0 . To compute INVERSE(A) * C where C is a matrix with P columns CALL CSIFA(A,LDA,N,KVPT,INFO) If (INFO .NE. 0) GO TO ... DO 10 J = 1, P... |
|
f90/csmg(3) -- Performs a conditional scalar merge
|
|
UNICOS, UNICOS/mk, and IRIX systems |
|
complib/CSPCO(3) -- CSPCO factors a complex symmetric matrix stored in packed form by elimination with symmetric pivoting and esti
|
|
On Entry AP COMPLEX (N*(N+1)/2) the packed form of a symmetric matrix A . The columns of the upper triangle are stored sequentially in a one-dimensional array of length N*(N+1)/2 . See comments below for details. N INTEGER the order of the matrix A . On Return AP a block diagonal matrix and the multipliers which were used to obtain it stored in packed form. The factorization can be written A = U*D*TRANS(U) where U is a product of permutation and unit upper triangular matrices , TRANS(U) is the t... |
