LAPACK  3.5.0
LAPACK: Linear Algebra PACKage
clahrd.f File Reference

Go to the source code of this file.

Functions/Subroutines

subroutine clahrd (N, K, NB, A, LDA, TAU, T, LDT, Y, LDY)
 CLAHRD reduces the first nb columns of a general rectangular matrix A so that elements below the k-th subdiagonal are zero, and returns auxiliary matrices which are needed to apply the transformation to the unreduced part of A. More...
 

Function/Subroutine Documentation

subroutine clahrd ( integer  N,
integer  K,
integer  NB,
complex, dimension( lda, * )  A,
integer  LDA,
complex, dimension( nb )  TAU,
complex, dimension( ldt, nb )  T,
integer  LDT,
complex, dimension( ldy, nb )  Y,
integer  LDY 
)

CLAHRD reduces the first nb columns of a general rectangular matrix A so that elements below the k-th subdiagonal are zero, and returns auxiliary matrices which are needed to apply the transformation to the unreduced part of A.

Download CLAHRD + dependencies [TGZ] [ZIP] [TXT]

Purpose:
 CLAHRD reduces the first NB columns of a complex general n-by-(n-k+1)
 matrix A so that elements below the k-th subdiagonal are zero. The
 reduction is performed by a unitary similarity transformation
 Q**H * A * Q. The routine returns the matrices V and T which determine
 Q as a block reflector I - V*T*V**H, and also the matrix Y = A * V * T.

 This is an OBSOLETE auxiliary routine. 
 This routine will be 'deprecated' in a  future release.
 Please use the new routine CLAHR2 instead.
Parameters
[in]N
          N is INTEGER
          The order of the matrix A.
[in]K
          K is INTEGER
          The offset for the reduction. Elements below the k-th
          subdiagonal in the first NB columns are reduced to zero.
[in]NB
          NB is INTEGER
          The number of columns to be reduced.
[in,out]A
          A is COMPLEX array, dimension (LDA,N-K+1)
          On entry, the n-by-(n-k+1) general matrix A.
          On exit, the elements on and above the k-th subdiagonal in
          the first NB columns are overwritten with the corresponding
          elements of the reduced matrix; the elements below the k-th
          subdiagonal, with the array TAU, represent the matrix Q as a
          product of elementary reflectors. The other columns of A are
          unchanged. See Further Details.
[in]LDA
          LDA is INTEGER
          The leading dimension of the array A.  LDA >= max(1,N).
[out]TAU
          TAU is COMPLEX array, dimension (NB)
          The scalar factors of the elementary reflectors. See Further
          Details.
[out]T
          T is COMPLEX array, dimension (LDT,NB)
          The upper triangular matrix T.
[in]LDT
          LDT is INTEGER
          The leading dimension of the array T.  LDT >= NB.
[out]Y
          Y is COMPLEX array, dimension (LDY,NB)
          The n-by-nb matrix Y.
[in]LDY
          LDY is INTEGER
          The leading dimension of the array Y. LDY >= max(1,N).
Author
Univ. of Tennessee
Univ. of California Berkeley
Univ. of Colorado Denver
NAG Ltd.
Date
September 2012
Further Details:
  The matrix Q is represented as a product of nb elementary reflectors

     Q = H(1) H(2) . . . H(nb).

  Each H(i) has the form

     H(i) = I - tau * v * v**H

  where tau is a complex scalar, and v is a complex vector with
  v(1:i+k-1) = 0, v(i+k) = 1; v(i+k+1:n) is stored on exit in
  A(i+k+1:n,i), and tau in TAU(i).

  The elements of the vectors v together form the (n-k+1)-by-nb matrix
  V which is needed, with T and Y, to apply the transformation to the
  unreduced part of the matrix, using an update of the form:
  A := (I - V*T*V**H) * (A - Y*V**H).

  The contents of A on exit are illustrated by the following example
  with n = 7, k = 3 and nb = 2:

     ( a   h   a   a   a )
     ( a   h   a   a   a )
     ( a   h   a   a   a )
     ( h   h   a   a   a )
     ( v1  h   a   a   a )
     ( v1  v2  a   a   a )
     ( v1  v2  a   a   a )

  where a denotes an element of the original matrix A, h denotes a
  modified element of the upper Hessenberg matrix H, and vi denotes an
  element of the vector defining H(i).

Definition at line 171 of file clahrd.f.

171 *
172 * -- LAPACK auxiliary routine (version 3.4.2) --
173 * -- LAPACK is a software package provided by Univ. of Tennessee, --
174 * -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
175 * September 2012
176 *
177 * .. Scalar Arguments ..
178  INTEGER k, lda, ldt, ldy, n, nb
179 * ..
180 * .. Array Arguments ..
181  COMPLEX a( lda, * ), t( ldt, nb ), tau( nb ),
182  $ y( ldy, nb )
183 * ..
184 *
185 * =====================================================================
186 *
187 * .. Parameters ..
188  COMPLEX zero, one
189  parameter( zero = ( 0.0e+0, 0.0e+0 ),
190  $ one = ( 1.0e+0, 0.0e+0 ) )
191 * ..
192 * .. Local Scalars ..
193  INTEGER i
194  COMPLEX ei
195 * ..
196 * .. External Subroutines ..
197  EXTERNAL caxpy, ccopy, cgemv, clacgv, clarfg, cscal,
198  $ ctrmv
199 * ..
200 * .. Intrinsic Functions ..
201  INTRINSIC min
202 * ..
203 * .. Executable Statements ..
204 *
205 * Quick return if possible
206 *
207  IF( n.LE.1 )
208  $ RETURN
209 *
210  DO 10 i = 1, nb
211  IF( i.GT.1 ) THEN
212 *
213 * Update A(1:n,i)
214 *
215 * Compute i-th column of A - Y * V**H
216 *
217  CALL clacgv( i-1, a( k+i-1, 1 ), lda )
218  CALL cgemv( 'No transpose', n, i-1, -one, y, ldy,
219  $ a( k+i-1, 1 ), lda, one, a( 1, i ), 1 )
220  CALL clacgv( i-1, a( k+i-1, 1 ), lda )
221 *
222 * Apply I - V * T**H * V**H to this column (call it b) from the
223 * left, using the last column of T as workspace
224 *
225 * Let V = ( V1 ) and b = ( b1 ) (first I-1 rows)
226 * ( V2 ) ( b2 )
227 *
228 * where V1 is unit lower triangular
229 *
230 * w := V1**H * b1
231 *
232  CALL ccopy( i-1, a( k+1, i ), 1, t( 1, nb ), 1 )
233  CALL ctrmv( 'Lower', 'Conjugate transpose', 'Unit', i-1,
234  $ a( k+1, 1 ), lda, t( 1, nb ), 1 )
235 *
236 * w := w + V2**H *b2
237 *
238  CALL cgemv( 'Conjugate transpose', n-k-i+1, i-1, one,
239  $ a( k+i, 1 ), lda, a( k+i, i ), 1, one,
240  $ t( 1, nb ), 1 )
241 *
242 * w := T**H *w
243 *
244  CALL ctrmv( 'Upper', 'Conjugate transpose', 'Non-unit', i-1,
245  $ t, ldt, t( 1, nb ), 1 )
246 *
247 * b2 := b2 - V2*w
248 *
249  CALL cgemv( 'No transpose', n-k-i+1, i-1, -one, a( k+i, 1 ),
250  $ lda, t( 1, nb ), 1, one, a( k+i, i ), 1 )
251 *
252 * b1 := b1 - V1*w
253 *
254  CALL ctrmv( 'Lower', 'No transpose', 'Unit', i-1,
255  $ a( k+1, 1 ), lda, t( 1, nb ), 1 )
256  CALL caxpy( i-1, -one, t( 1, nb ), 1, a( k+1, i ), 1 )
257 *
258  a( k+i-1, i-1 ) = ei
259  END IF
260 *
261 * Generate the elementary reflector H(i) to annihilate
262 * A(k+i+1:n,i)
263 *
264  ei = a( k+i, i )
265  CALL clarfg( n-k-i+1, ei, a( min( k+i+1, n ), i ), 1,
266  $ tau( i ) )
267  a( k+i, i ) = one
268 *
269 * Compute Y(1:n,i)
270 *
271  CALL cgemv( 'No transpose', n, n-k-i+1, one, a( 1, i+1 ), lda,
272  $ a( k+i, i ), 1, zero, y( 1, i ), 1 )
273  CALL cgemv( 'Conjugate transpose', n-k-i+1, i-1, one,
274  $ a( k+i, 1 ), lda, a( k+i, i ), 1, zero, t( 1, i ),
275  $ 1 )
276  CALL cgemv( 'No transpose', n, i-1, -one, y, ldy, t( 1, i ), 1,
277  $ one, y( 1, i ), 1 )
278  CALL cscal( n, tau( i ), y( 1, i ), 1 )
279 *
280 * Compute T(1:i,i)
281 *
282  CALL cscal( i-1, -tau( i ), t( 1, i ), 1 )
283  CALL ctrmv( 'Upper', 'No transpose', 'Non-unit', i-1, t, ldt,
284  $ t( 1, i ), 1 )
285  t( i, i ) = tau( i )
286 *
287  10 CONTINUE
288  a( k+nb, nb ) = ei
289 *
290  RETURN
291 *
292 * End of CLAHRD
293 *
subroutine cscal(N, CA, CX, INCX)
CSCAL
Definition: cscal.f:54
subroutine caxpy(N, CA, CX, INCX, CY, INCY)
CAXPY
Definition: caxpy.f:53
subroutine clacgv(N, X, INCX)
CLACGV conjugates a complex vector.
Definition: clacgv.f:76
subroutine cgemv(TRANS, M, N, ALPHA, A, LDA, X, INCX, BETA, Y, INCY)
CGEMV
Definition: cgemv.f:160
subroutine clarfg(N, ALPHA, X, INCX, TAU)
CLARFG generates an elementary reflector (Householder matrix).
Definition: clarfg.f:108
subroutine ccopy(N, CX, INCX, CY, INCY)
CCOPY
Definition: ccopy.f:52
subroutine ctrmv(UPLO, TRANS, DIAG, N, A, LDA, X, INCX)
CTRMV
Definition: ctrmv.f:149

Here is the call graph for this function: