version 1.5, 2010/08/07 13:22:41
|
version 1.11, 2012/08/22 09:48:37
|
Line 1
|
Line 1
|
|
*> \brief \b ZLARZB |
|
* |
|
* =========== DOCUMENTATION =========== |
|
* |
|
* Online html documentation available at |
|
* http://www.netlib.org/lapack/explore-html/ |
|
* |
|
*> \htmlonly |
|
*> Download ZLARZB + dependencies |
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zlarzb.f"> |
|
*> [TGZ]</a> |
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zlarzb.f"> |
|
*> [ZIP]</a> |
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zlarzb.f"> |
|
*> [TXT]</a> |
|
*> \endhtmlonly |
|
* |
|
* Definition: |
|
* =========== |
|
* |
|
* SUBROUTINE ZLARZB( SIDE, TRANS, DIRECT, STOREV, M, N, K, L, V, |
|
* LDV, T, LDT, C, LDC, WORK, LDWORK ) |
|
* |
|
* .. Scalar Arguments .. |
|
* CHARACTER DIRECT, SIDE, STOREV, TRANS |
|
* INTEGER K, L, LDC, LDT, LDV, LDWORK, M, N |
|
* .. |
|
* .. Array Arguments .. |
|
* COMPLEX*16 C( LDC, * ), T( LDT, * ), V( LDV, * ), |
|
* $ WORK( LDWORK, * ) |
|
* .. |
|
* |
|
* |
|
*> \par Purpose: |
|
* ============= |
|
*> |
|
*> \verbatim |
|
*> |
|
*> ZLARZB applies a complex block reflector H or its transpose H**H |
|
*> to a complex distributed M-by-N C from the left or the right. |
|
*> |
|
*> Currently, only STOREV = 'R' and DIRECT = 'B' are supported. |
|
*> \endverbatim |
|
* |
|
* Arguments: |
|
* ========== |
|
* |
|
*> \param[in] SIDE |
|
*> \verbatim |
|
*> SIDE is CHARACTER*1 |
|
*> = 'L': apply H or H**H from the Left |
|
*> = 'R': apply H or H**H from the Right |
|
*> \endverbatim |
|
*> |
|
*> \param[in] TRANS |
|
*> \verbatim |
|
*> TRANS is CHARACTER*1 |
|
*> = 'N': apply H (No transpose) |
|
*> = 'C': apply H**H (Conjugate transpose) |
|
*> \endverbatim |
|
*> |
|
*> \param[in] DIRECT |
|
*> \verbatim |
|
*> DIRECT is CHARACTER*1 |
|
*> Indicates how H is formed from a product of elementary |
|
*> reflectors |
|
*> = 'F': H = H(1) H(2) . . . H(k) (Forward, not supported yet) |
|
*> = 'B': H = H(k) . . . H(2) H(1) (Backward) |
|
*> \endverbatim |
|
*> |
|
*> \param[in] STOREV |
|
*> \verbatim |
|
*> STOREV is CHARACTER*1 |
|
*> Indicates how the vectors which define the elementary |
|
*> reflectors are stored: |
|
*> = 'C': Columnwise (not supported yet) |
|
*> = 'R': Rowwise |
|
*> \endverbatim |
|
*> |
|
*> \param[in] M |
|
*> \verbatim |
|
*> M is INTEGER |
|
*> The number of rows of the matrix C. |
|
*> \endverbatim |
|
*> |
|
*> \param[in] N |
|
*> \verbatim |
|
*> N is INTEGER |
|
*> The number of columns of the matrix C. |
|
*> \endverbatim |
|
*> |
|
*> \param[in] K |
|
*> \verbatim |
|
*> K is INTEGER |
|
*> The order of the matrix T (= the number of elementary |
|
*> reflectors whose product defines the block reflector). |
|
*> \endverbatim |
|
*> |
|
*> \param[in] L |
|
*> \verbatim |
|
*> L is INTEGER |
|
*> The number of columns of the matrix V containing the |
|
*> meaningful part of the Householder reflectors. |
|
*> If SIDE = 'L', M >= L >= 0, if SIDE = 'R', N >= L >= 0. |
|
*> \endverbatim |
|
*> |
|
*> \param[in] V |
|
*> \verbatim |
|
*> V is COMPLEX*16 array, dimension (LDV,NV). |
|
*> If STOREV = 'C', NV = K; if STOREV = 'R', NV = L. |
|
*> \endverbatim |
|
*> |
|
*> \param[in] LDV |
|
*> \verbatim |
|
*> LDV is INTEGER |
|
*> The leading dimension of the array V. |
|
*> If STOREV = 'C', LDV >= L; if STOREV = 'R', LDV >= K. |
|
*> \endverbatim |
|
*> |
|
*> \param[in] T |
|
*> \verbatim |
|
*> T is COMPLEX*16 array, dimension (LDT,K) |
|
*> The triangular K-by-K matrix T in the representation of the |
|
*> block reflector. |
|
*> \endverbatim |
|
*> |
|
*> \param[in] LDT |
|
*> \verbatim |
|
*> LDT is INTEGER |
|
*> The leading dimension of the array T. LDT >= K. |
|
*> \endverbatim |
|
*> |
|
*> \param[in,out] C |
|
*> \verbatim |
|
*> C is COMPLEX*16 array, dimension (LDC,N) |
|
*> On entry, the M-by-N matrix C. |
|
*> On exit, C is overwritten by H*C or H**H*C or C*H or C*H**H. |
|
*> \endverbatim |
|
*> |
|
*> \param[in] LDC |
|
*> \verbatim |
|
*> LDC is INTEGER |
|
*> The leading dimension of the array C. LDC >= max(1,M). |
|
*> \endverbatim |
|
*> |
|
*> \param[out] WORK |
|
*> \verbatim |
|
*> WORK is COMPLEX*16 array, dimension (LDWORK,K) |
|
*> \endverbatim |
|
*> |
|
*> \param[in] LDWORK |
|
*> \verbatim |
|
*> LDWORK is INTEGER |
|
*> The leading dimension of the array WORK. |
|
*> If SIDE = 'L', LDWORK >= max(1,N); |
|
*> if SIDE = 'R', LDWORK >= max(1,M). |
|
*> \endverbatim |
|
* |
|
* Authors: |
|
* ======== |
|
* |
|
*> \author Univ. of Tennessee |
|
*> \author Univ. of California Berkeley |
|
*> \author Univ. of Colorado Denver |
|
*> \author NAG Ltd. |
|
* |
|
*> \date November 2011 |
|
* |
|
*> \ingroup complex16OTHERcomputational |
|
* |
|
*> \par Contributors: |
|
* ================== |
|
*> |
|
*> A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA |
|
* |
|
*> \par Further Details: |
|
* ===================== |
|
*> |
|
*> \verbatim |
|
*> \endverbatim |
|
*> |
|
* ===================================================================== |
SUBROUTINE ZLARZB( SIDE, TRANS, DIRECT, STOREV, M, N, K, L, V, |
SUBROUTINE ZLARZB( SIDE, TRANS, DIRECT, STOREV, M, N, K, L, V, |
$ LDV, T, LDT, C, LDC, WORK, LDWORK ) |
$ LDV, T, LDT, C, LDC, WORK, LDWORK ) |
* |
* |
* -- LAPACK routine (version 3.2) -- |
* -- LAPACK computational routine (version 3.4.0) -- |
* -- LAPACK is a software package provided by Univ. of Tennessee, -- |
* -- LAPACK is a software package provided by Univ. of Tennessee, -- |
* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- |
* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- |
* November 2006 |
* November 2011 |
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
CHARACTER DIRECT, SIDE, STOREV, TRANS |
CHARACTER DIRECT, SIDE, STOREV, TRANS |
Line 15
|
Line 197
|
$ WORK( LDWORK, * ) |
$ WORK( LDWORK, * ) |
* .. |
* .. |
* |
* |
* Purpose |
|
* ======= |
|
* |
|
* ZLARZB applies a complex block reflector H or its transpose H**H |
|
* to a complex distributed M-by-N C from the left or the right. |
|
* |
|
* Currently, only STOREV = 'R' and DIRECT = 'B' are supported. |
|
* |
|
* Arguments |
|
* ========= |
|
* |
|
* SIDE (input) CHARACTER*1 |
|
* = 'L': apply H or H' from the Left |
|
* = 'R': apply H or H' from the Right |
|
* |
|
* TRANS (input) CHARACTER*1 |
|
* = 'N': apply H (No transpose) |
|
* = 'C': apply H' (Conjugate transpose) |
|
* |
|
* DIRECT (input) CHARACTER*1 |
|
* Indicates how H is formed from a product of elementary |
|
* reflectors |
|
* = 'F': H = H(1) H(2) . . . H(k) (Forward, not supported yet) |
|
* = 'B': H = H(k) . . . H(2) H(1) (Backward) |
|
* |
|
* STOREV (input) CHARACTER*1 |
|
* Indicates how the vectors which define the elementary |
|
* reflectors are stored: |
|
* = 'C': Columnwise (not supported yet) |
|
* = 'R': Rowwise |
|
* |
|
* M (input) INTEGER |
|
* The number of rows of the matrix C. |
|
* |
|
* N (input) INTEGER |
|
* The number of columns of the matrix C. |
|
* |
|
* K (input) INTEGER |
|
* The order of the matrix T (= the number of elementary |
|
* reflectors whose product defines the block reflector). |
|
* |
|
* L (input) INTEGER |
|
* The number of columns of the matrix V containing the |
|
* meaningful part of the Householder reflectors. |
|
* If SIDE = 'L', M >= L >= 0, if SIDE = 'R', N >= L >= 0. |
|
* |
|
* V (input) COMPLEX*16 array, dimension (LDV,NV). |
|
* If STOREV = 'C', NV = K; if STOREV = 'R', NV = L. |
|
* |
|
* LDV (input) INTEGER |
|
* The leading dimension of the array V. |
|
* If STOREV = 'C', LDV >= L; if STOREV = 'R', LDV >= K. |
|
* |
|
* T (input) COMPLEX*16 array, dimension (LDT,K) |
|
* The triangular K-by-K matrix T in the representation of the |
|
* block reflector. |
|
* |
|
* LDT (input) INTEGER |
|
* The leading dimension of the array T. LDT >= K. |
|
* |
|
* C (input/output) COMPLEX*16 array, dimension (LDC,N) |
|
* On entry, the M-by-N matrix C. |
|
* On exit, C is overwritten by H*C or H'*C or C*H or C*H'. |
|
* |
|
* LDC (input) INTEGER |
|
* The leading dimension of the array C. LDC >= max(1,M). |
|
* |
|
* WORK (workspace) COMPLEX*16 array, dimension (LDWORK,K) |
|
* |
|
* LDWORK (input) INTEGER |
|
* The leading dimension of the array WORK. |
|
* If SIDE = 'L', LDWORK >= max(1,N); |
|
* if SIDE = 'R', LDWORK >= max(1,M). |
|
* |
|
* Further Details |
|
* =============== |
|
* |
|
* Based on contributions by |
|
* A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA |
|
* |
|
* ===================================================================== |
* ===================================================================== |
* |
* |
* .. Parameters .. |
* .. Parameters .. |
Line 140
|
Line 242
|
* |
* |
IF( LSAME( SIDE, 'L' ) ) THEN |
IF( LSAME( SIDE, 'L' ) ) THEN |
* |
* |
* Form H * C or H' * C |
* Form H * C or H**H * C |
* |
* |
* W( 1:n, 1:k ) = conjg( C( 1:k, 1:n )' ) |
* W( 1:n, 1:k ) = C( 1:k, 1:n )**H |
* |
* |
DO 10 J = 1, K |
DO 10 J = 1, K |
CALL ZCOPY( N, C( J, 1 ), LDC, WORK( 1, J ), 1 ) |
CALL ZCOPY( N, C( J, 1 ), LDC, WORK( 1, J ), 1 ) |
10 CONTINUE |
10 CONTINUE |
* |
* |
* W( 1:n, 1:k ) = W( 1:n, 1:k ) + ... |
* W( 1:n, 1:k ) = W( 1:n, 1:k ) + ... |
* conjg( C( m-l+1:m, 1:n )' ) * V( 1:k, 1:l )' |
* C( m-l+1:m, 1:n )**H * V( 1:k, 1:l )**T |
* |
* |
IF( L.GT.0 ) |
IF( L.GT.0 ) |
$ CALL ZGEMM( 'Transpose', 'Conjugate transpose', N, K, L, |
$ CALL ZGEMM( 'Transpose', 'Conjugate transpose', N, K, L, |
$ ONE, C( M-L+1, 1 ), LDC, V, LDV, ONE, WORK, |
$ ONE, C( M-L+1, 1 ), LDC, V, LDV, ONE, WORK, |
$ LDWORK ) |
$ LDWORK ) |
* |
* |
* W( 1:n, 1:k ) = W( 1:n, 1:k ) * T' or W( 1:m, 1:k ) * T |
* W( 1:n, 1:k ) = W( 1:n, 1:k ) * T**T or W( 1:m, 1:k ) * T |
* |
* |
CALL ZTRMM( 'Right', 'Lower', TRANST, 'Non-unit', N, K, ONE, T, |
CALL ZTRMM( 'Right', 'Lower', TRANST, 'Non-unit', N, K, ONE, T, |
$ LDT, WORK, LDWORK ) |
$ LDT, WORK, LDWORK ) |
* |
* |
* C( 1:k, 1:n ) = C( 1:k, 1:n ) - conjg( W( 1:n, 1:k )' ) |
* C( 1:k, 1:n ) = C( 1:k, 1:n ) - W( 1:n, 1:k )**H |
* |
* |
DO 30 J = 1, N |
DO 30 J = 1, N |
DO 20 I = 1, K |
DO 20 I = 1, K |
Line 170
|
Line 272
|
30 CONTINUE |
30 CONTINUE |
* |
* |
* C( m-l+1:m, 1:n ) = C( m-l+1:m, 1:n ) - ... |
* C( m-l+1:m, 1:n ) = C( m-l+1:m, 1:n ) - ... |
* conjg( V( 1:k, 1:l )' ) * conjg( W( 1:n, 1:k )' ) |
* V( 1:k, 1:l )**H * W( 1:n, 1:k )**H |
* |
* |
IF( L.GT.0 ) |
IF( L.GT.0 ) |
$ CALL ZGEMM( 'Transpose', 'Transpose', L, N, K, -ONE, V, LDV, |
$ CALL ZGEMM( 'Transpose', 'Transpose', L, N, K, -ONE, V, LDV, |
Line 178
|
Line 280
|
* |
* |
ELSE IF( LSAME( SIDE, 'R' ) ) THEN |
ELSE IF( LSAME( SIDE, 'R' ) ) THEN |
* |
* |
* Form C * H or C * H' |
* Form C * H or C * H**H |
* |
* |
* W( 1:m, 1:k ) = C( 1:m, 1:k ) |
* W( 1:m, 1:k ) = C( 1:m, 1:k ) |
* |
* |
Line 187
|
Line 289
|
40 CONTINUE |
40 CONTINUE |
* |
* |
* W( 1:m, 1:k ) = W( 1:m, 1:k ) + ... |
* W( 1:m, 1:k ) = W( 1:m, 1:k ) + ... |
* C( 1:m, n-l+1:n ) * conjg( V( 1:k, 1:l )' ) |
* C( 1:m, n-l+1:n ) * V( 1:k, 1:l )**H |
* |
* |
IF( L.GT.0 ) |
IF( L.GT.0 ) |
$ CALL ZGEMM( 'No transpose', 'Transpose', M, K, L, ONE, |
$ CALL ZGEMM( 'No transpose', 'Transpose', M, K, L, ONE, |
$ C( 1, N-L+1 ), LDC, V, LDV, ONE, WORK, LDWORK ) |
$ C( 1, N-L+1 ), LDC, V, LDV, ONE, WORK, LDWORK ) |
* |
* |
* W( 1:m, 1:k ) = W( 1:m, 1:k ) * conjg( T ) or |
* W( 1:m, 1:k ) = W( 1:m, 1:k ) * conjg( T ) or |
* W( 1:m, 1:k ) * conjg( T' ) |
* W( 1:m, 1:k ) * T**H |
* |
* |
DO 50 J = 1, K |
DO 50 J = 1, K |
CALL ZLACGV( K-J+1, T( J, J ), 1 ) |
CALL ZLACGV( K-J+1, T( J, J ), 1 ) |