.TH "dorcsd2by1.f" 3 "Wed Oct 15 2014" "Version 3.4.2" "LAPACK" \" -*- nroff -*- .ad l .nh .SH NAME dorcsd2by1.f \- .SH SYNOPSIS .br .PP .SS "Functions/Subroutines" .in +1c .ti -1c .RI "subroutine \fBdorcsd2by1\fP (JOBU1, JOBU2, JOBV1T, M, P, Q, X11, LDX11, X21, LDX21, THETA, U1, LDU1, U2, LDU2, V1T, LDV1T, WORK, LWORK, IWORK, INFO)" .br .RI "\fI\fBDORCSD2BY1\fP \fP" .in -1c .SH "Function/Subroutine Documentation" .PP .SS "subroutine dorcsd2by1 (characterJOBU1, characterJOBU2, characterJOBV1T, integerM, integerP, integerQ, double precision, dimension(ldx11,*)X11, integerLDX11, double precision, dimension(ldx21,*)X21, integerLDX21, double precision, dimension(*)THETA, double precision, dimension(ldu1,*)U1, integerLDU1, double precision, dimension(ldu2,*)U2, integerLDU2, double precision, dimension(ldv1t,*)V1T, integerLDV1T, double precision, dimension(*)WORK, integerLWORK, integer, dimension(*)IWORK, integerINFO)" .PP \fBDORCSD2BY1\fP .SH "Purpose: " .PP .PP .PP .nf Purpose: ======== DORCSD2BY1 computes the CS decomposition of an M-by-Q matrix X with orthonormal columns that has been partitioned into a 2-by-1 block structure: [ I 0 0 ] [ 0 C 0 ] [ X11 ] [ U1 | ] [ 0 0 0 ] X = [-----] = [---------] [----------] V1**T . [ X21 ] [ | U2 ] [ 0 0 0 ] [ 0 S 0 ] [ 0 0 I ] X11 is P-by-Q. The orthogonal matrices U1, U2, V1, and V2 are P-by-P, (M-P)-by-(M-P), Q-by-Q, and (M-Q)-by-(M-Q), respectively. C and S are R-by-R nonnegative diagonal matrices satisfying C^2 + S^2 = I, in which R = MIN(P,M-P,Q,M-Q)..fi .PP .PP \fBParameters:\fP .RS 4 \fIJOBU1\fP .PP .nf JOBU1 is CHARACTER = 'Y': U1 is computed; otherwise: U1 is not computed. .fi .PP .br \fIJOBU2\fP .PP .nf JOBU2 is CHARACTER = 'Y': U2 is computed; otherwise: U2 is not computed. .fi .PP .br \fIJOBV1T\fP .PP .nf JOBV1T is CHARACTER = 'Y': V1T is computed; otherwise: V1T is not computed. .fi .PP .br \fIM\fP .PP .nf M is INTEGER The number of rows and columns in X. .fi .PP .br \fIP\fP .PP .nf P is INTEGER The number of rows in X11 and X12. 0 <= P <= M. .fi .PP .br \fIQ\fP .PP .nf Q is INTEGER The number of columns in X11 and X21. 0 <= Q <= M. .fi .PP .br \fIX11\fP .PP .nf X11 is DOUBLE PRECISION array, dimension (LDX11,Q) On entry, part of the orthogonal matrix whose CSD is desired. .fi .PP .br \fILDX11\fP .PP .nf LDX11 is INTEGER The leading dimension of X11. LDX11 >= MAX(1,P). .fi .PP .br \fIX21\fP .PP .nf X21 is DOUBLE PRECISION array, dimension (LDX21,Q) On entry, part of the orthogonal matrix whose CSD is desired. .fi .PP .br \fILDX21\fP .PP .nf LDX21 is INTEGER The leading dimension of X21. LDX21 >= MAX(1,M-P). .fi .PP .br \fITHETA\fP .PP .nf THETA is DOUBLE PRECISION array, dimension (R), in which R = MIN(P,M-P,Q,M-Q). C = DIAG( COS(THETA(1)), ... , COS(THETA(R)) ) and S = DIAG( SIN(THETA(1)), ... , SIN(THETA(R)) ). .fi .PP .br \fIU1\fP .PP .nf U1 is DOUBLE PRECISION array, dimension (P) If JOBU1 = 'Y', U1 contains the P-by-P orthogonal matrix U1. .fi .PP .br \fILDU1\fP .PP .nf LDU1 is INTEGER The leading dimension of U1. If JOBU1 = 'Y', LDU1 >= MAX(1,P). .fi .PP .br \fIU2\fP .PP .nf U2 is DOUBLE PRECISION array, dimension (M-P) If JOBU2 = 'Y', U2 contains the (M-P)-by-(M-P) orthogonal matrix U2. .fi .PP .br \fILDU2\fP .PP .nf LDU2 is INTEGER The leading dimension of U2. If JOBU2 = 'Y', LDU2 >= MAX(1,M-P). .fi .PP .br \fIV1T\fP .PP .nf V1T is DOUBLE PRECISION array, dimension (Q) If JOBV1T = 'Y', V1T contains the Q-by-Q matrix orthogonal matrix V1**T. .fi .PP .br \fILDV1T\fP .PP .nf LDV1T is INTEGER The leading dimension of V1T. If JOBV1T = 'Y', LDV1T >= MAX(1,Q). .fi .PP .br \fIWORK\fP .PP .nf WORK is DOUBLE PRECISION array, dimension (MAX(1,LWORK)) On exit, if INFO = 0, WORK(1) returns the optimal LWORK. If INFO > 0 on exit, WORK(2:R) contains the values PHI(1), ..., PHI(R-1) that, together with THETA(1), ..., THETA(R), define the matrix in intermediate bidiagonal-block form remaining after nonconvergence. INFO specifies the number of nonzero PHI's. .fi .PP .br \fILWORK\fP .PP .nf LWORK is INTEGER The dimension of the array WORK. .fi .PP .PP .nf If LWORK = -1, then a workspace query is assumed; the routine only calculates the optimal size of the WORK array, returns this value as the first entry of the work array, and no error message related to LWORK is issued by XERBLA. .fi .PP .br \fIIWORK\fP .PP .nf IWORK is INTEGER array, dimension (M-MIN(P,M-P,Q,M-Q)) .fi .PP .br \fIINFO\fP .PP .nf INFO is INTEGER = 0: successful exit. < 0: if INFO = -i, the i-th argument had an illegal value. > 0: DBBCSD did not converge. See the description of WORK above for details. .fi .PP .RE .PP \fBAuthor:\fP .RS 4 Univ\&. of Tennessee .PP Univ\&. of California Berkeley .PP Univ\&. of Colorado Denver .PP NAG Ltd\&. .RE .PP \fBDate:\fP .RS 4 July 2012 .RE .PP \fBReferences: \fP .RS 4 [1] Brian D\&. Sutton\&. Computing the complete CS decomposition\&. Numer\&. Algorithms, 50(1):33-65, 2009\&. .RE .PP .PP Definition at line 236 of file dorcsd2by1\&.f\&. .SH "Author" .PP Generated automatically by Doxygen for LAPACK from the source code\&.