1CUNGBR(1)                LAPACK routine (version 3.1)                CUNGBR(1)
2
3
4

NAME

6       CUNGBR  -  one  of the complex unitary matrices Q or P**H determined by
7       CGEBRD when reducing a complex matrix A to bidiagonal form
8

SYNOPSIS

10       SUBROUTINE CUNGBR( VECT, M, N, K, A, LDA, TAU, WORK, LWORK, INFO )
11
12           CHARACTER      VECT
13
14           INTEGER        INFO, K, LDA, LWORK, M, N
15
16           COMPLEX        A( LDA, * ), TAU( * ), WORK( * )
17

PURPOSE

19       CUNGBR generates one of the complex unitary matrices Q or  P**H  deter‐
20       mined  by CGEBRD when reducing a complex matrix A to bidiagonal form: A
21       = Q * B * P**H.  Q and P**H  are  defined  as  products  of  elementary
22       reflectors H(i) or G(i) respectively.
23
24       If  VECT = 'Q', A is assumed to have been an M-by-K matrix, and Q is of
25       order M:
26       if m >= k, Q = H(1) H(2) . . . H(k) and CUNGBR returns the first n col‐
27       umns of Q, where m >= n >= k;
28       if  m < k, Q = H(1) H(2) . . . H(m-1) and CUNGBR returns Q as an M-by-M
29       matrix.
30
31       If VECT = 'P', A is assumed to have been a K-by-N matrix, and  P**H  is
32       of order N:
33       if  k  <  n, P**H = G(k) . . . G(2) G(1) and CUNGBR returns the first m
34       rows of P**H, where n >= m >= k;
35       if k >= n, P**H = G(n-1) . . . G(2) G(1) and CUNGBR returns P**H as  an
36       N-by-N matrix.
37
38

ARGUMENTS

40       VECT    (input) CHARACTER*1
41               Specifies  whether the matrix Q or the matrix P**H is required,
42               as defined in the transformation applied by CGEBRD:
43               = 'Q':  generate Q;
44               = 'P':  generate P**H.
45
46       M       (input) INTEGER
47               The number of rows of the matrix Q or P**H to be  returned.   M
48               >= 0.
49
50       N       (input) INTEGER
51               The  number  of columns of the matrix Q or P**H to be returned.
52               N >= 0.  If VECT = 'Q', M >= N >= min(M,K); if VECT = 'P', N >=
53               M >= min(N,K).
54
55       K       (input) INTEGER
56               If  VECT  =  'Q',  the number of columns in the original M-by-K
57               matrix reduced by CGEBRD.  If VECT = 'P', the number of rows in
58               the original K-by-N matrix reduced by CGEBRD.  K >= 0.
59
60       A       (input/output) COMPLEX array, dimension (LDA,N)
61               On  entry,  the vectors which define the elementary reflectors,
62               as returned by CGEBRD.  On exit, the M-by-N matrix Q or P**H.
63
64       LDA     (input) INTEGER
65               The leading dimension of the array A. LDA >= M.
66
67       TAU     (input) COMPLEX array, dimension
68               (min(M,K)) if VECT = 'Q' (min(N,K)) if VECT = 'P'  TAU(i)  must
69               contain  the  scalar factor of the elementary reflector H(i) or
70               G(i), which determines Q or P**H, as returned by CGEBRD in  its
71               array argument TAUQ or TAUP.
72
73       WORK    (workspace/output) COMPLEX array, dimension (MAX(1,LWORK))
74               On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
75
76       LWORK   (input) INTEGER
77               The dimension of the array WORK. LWORK >= max(1,min(M,N)).  For
78               optimum performance LWORK >= min(M,N)*NB, where NB is the opti‐
79               mal blocksize.
80
81               If  LWORK  = -1, then a workspace query is assumed; the routine
82               only calculates the optimal size of  the  WORK  array,  returns
83               this  value  as the first entry of the WORK array, and no error
84               message related to LWORK is issued by XERBLA.
85
86       INFO    (output) INTEGER
87               = 0:  successful exit
88               < 0:  if INFO = -i, the i-th argument had an illegal value
89
90
91
92 LAPACK routine (version 3.1)    November 2006                       CUNGBR(1)
Impressum