LAPACK 3.12.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches
cunml2.f
Go to the documentation of this file.
1*> \brief \b CUNML2 multiplies a general matrix by the unitary matrix from a LQ factorization determined by cgelqf (unblocked algorithm).
2*
3* =========== DOCUMENTATION ===========
4*
5* Online html documentation available at
6* http://www.netlib.org/lapack/explore-html/
7*
8*> \htmlonly
9*> Download CUNML2 + dependencies
10*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/cunml2.f">
11*> [TGZ]</a>
12*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/cunml2.f">
13*> [ZIP]</a>
14*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/cunml2.f">
15*> [TXT]</a>
16*> \endhtmlonly
17*
18* Definition:
19* ===========
20*
21* SUBROUTINE CUNML2( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
22* WORK, INFO )
23*
24* .. Scalar Arguments ..
25* CHARACTER SIDE, TRANS
26* INTEGER INFO, K, LDA, LDC, M, N
27* ..
28* .. Array Arguments ..
29* COMPLEX A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
30* ..
31*
32*
33*> \par Purpose:
34* =============
35*>
36*> \verbatim
37*>
38*> CUNML2 overwrites the general complex m-by-n matrix C with
39*>
40*> Q * C if SIDE = 'L' and TRANS = 'N', or
41*>
42*> Q**H* C if SIDE = 'L' and TRANS = 'C', or
43*>
44*> C * Q if SIDE = 'R' and TRANS = 'N', or
45*>
46*> C * Q**H if SIDE = 'R' and TRANS = 'C',
47*>
48*> where Q is a complex unitary matrix defined as the product of k
49*> elementary reflectors
50*>
51*> Q = H(k)**H . . . H(2)**H H(1)**H
52*>
53*> as returned by CGELQF. Q is of order m if SIDE = 'L' and of order n
54*> if SIDE = 'R'.
55*> \endverbatim
56*
57* Arguments:
58* ==========
59*
60*> \param[in] SIDE
61*> \verbatim
62*> SIDE is CHARACTER*1
63*> = 'L': apply Q or Q**H from the Left
64*> = 'R': apply Q or Q**H from the Right
65*> \endverbatim
66*>
67*> \param[in] TRANS
68*> \verbatim
69*> TRANS is CHARACTER*1
70*> = 'N': apply Q (No transpose)
71*> = 'C': apply Q**H (Conjugate transpose)
72*> \endverbatim
73*>
74*> \param[in] M
75*> \verbatim
76*> M is INTEGER
77*> The number of rows of the matrix C. M >= 0.
78*> \endverbatim
79*>
80*> \param[in] N
81*> \verbatim
82*> N is INTEGER
83*> The number of columns of the matrix C. N >= 0.
84*> \endverbatim
85*>
86*> \param[in] K
87*> \verbatim
88*> K is INTEGER
89*> The number of elementary reflectors whose product defines
90*> the matrix Q.
91*> If SIDE = 'L', M >= K >= 0;
92*> if SIDE = 'R', N >= K >= 0.
93*> \endverbatim
94*>
95*> \param[in] A
96*> \verbatim
97*> A is COMPLEX array, dimension
98*> (LDA,M) if SIDE = 'L',
99*> (LDA,N) if SIDE = 'R'
100*> The i-th row must contain the vector which defines the
101*> elementary reflector H(i), for i = 1,2,...,k, as returned by
102*> CGELQF in the first k rows of its array argument A.
103*> A is modified by the routine but restored on exit.
104*> \endverbatim
105*>
106*> \param[in] LDA
107*> \verbatim
108*> LDA is INTEGER
109*> The leading dimension of the array A. LDA >= max(1,K).
110*> \endverbatim
111*>
112*> \param[in] TAU
113*> \verbatim
114*> TAU is COMPLEX array, dimension (K)
115*> TAU(i) must contain the scalar factor of the elementary
116*> reflector H(i), as returned by CGELQF.
117*> \endverbatim
118*>
119*> \param[in,out] C
120*> \verbatim
121*> C is COMPLEX array, dimension (LDC,N)
122*> On entry, the m-by-n matrix C.
123*> On exit, C is overwritten by Q*C or Q**H*C or C*Q**H or C*Q.
124*> \endverbatim
125*>
126*> \param[in] LDC
127*> \verbatim
128*> LDC is INTEGER
129*> The leading dimension of the array C. LDC >= max(1,M).
130*> \endverbatim
131*>
132*> \param[out] WORK
133*> \verbatim
134*> WORK is COMPLEX array, dimension
135*> (N) if SIDE = 'L',
136*> (M) if SIDE = 'R'
137*> \endverbatim
138*>
139*> \param[out] INFO
140*> \verbatim
141*> INFO is INTEGER
142*> = 0: successful exit
143*> < 0: if INFO = -i, the i-th argument had an illegal value
144*> \endverbatim
145*
146* Authors:
147* ========
148*
149*> \author Univ. of Tennessee
150*> \author Univ. of California Berkeley
151*> \author Univ. of Colorado Denver
152*> \author NAG Ltd.
153*
154*> \ingroup unml2
155*
156* =====================================================================
157 SUBROUTINE cunml2( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC,
158 $ WORK, INFO )
159*
160* -- LAPACK computational routine --
161* -- LAPACK is a software package provided by Univ. of Tennessee, --
162* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
163*
164* .. Scalar Arguments ..
165 CHARACTER SIDE, TRANS
166 INTEGER INFO, K, LDA, LDC, M, N
167* ..
168* .. Array Arguments ..
169 COMPLEX A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * )
170* ..
171*
172* =====================================================================
173*
174* .. Parameters ..
175 COMPLEX ONE
176 parameter( one = ( 1.0e+0, 0.0e+0 ) )
177* ..
178* .. Local Scalars ..
179 LOGICAL LEFT, NOTRAN
180 INTEGER I, I1, I2, I3, IC, JC, MI, NI, NQ
181 COMPLEX AII, TAUI
182* ..
183* .. External Functions ..
184 LOGICAL LSAME
185 EXTERNAL lsame
186* ..
187* .. External Subroutines ..
188 EXTERNAL clacgv, clarf, xerbla
189* ..
190* .. Intrinsic Functions ..
191 INTRINSIC conjg, max
192* ..
193* .. Executable Statements ..
194*
195* Test the input arguments
196*
197 info = 0
198 left = lsame( side, 'L' )
199 notran = lsame( trans, 'N' )
200*
201* NQ is the order of Q
202*
203 IF( left ) THEN
204 nq = m
205 ELSE
206 nq = n
207 END IF
208 IF( .NOT.left .AND. .NOT.lsame( side, 'R' ) ) THEN
209 info = -1
210 ELSE IF( .NOT.notran .AND. .NOT.lsame( trans, 'C' ) ) THEN
211 info = -2
212 ELSE IF( m.LT.0 ) THEN
213 info = -3
214 ELSE IF( n.LT.0 ) THEN
215 info = -4
216 ELSE IF( k.LT.0 .OR. k.GT.nq ) THEN
217 info = -5
218 ELSE IF( lda.LT.max( 1, k ) ) THEN
219 info = -7
220 ELSE IF( ldc.LT.max( 1, m ) ) THEN
221 info = -10
222 END IF
223 IF( info.NE.0 ) THEN
224 CALL xerbla( 'CUNML2', -info )
225 RETURN
226 END IF
227*
228* Quick return if possible
229*
230 IF( m.EQ.0 .OR. n.EQ.0 .OR. k.EQ.0 )
231 $ RETURN
232*
233 IF( ( left .AND. notran .OR. .NOT.left .AND. .NOT.notran ) ) THEN
234 i1 = 1
235 i2 = k
236 i3 = 1
237 ELSE
238 i1 = k
239 i2 = 1
240 i3 = -1
241 END IF
242*
243 IF( left ) THEN
244 ni = n
245 jc = 1
246 ELSE
247 mi = m
248 ic = 1
249 END IF
250*
251 DO 10 i = i1, i2, i3
252 IF( left ) THEN
253*
254* H(i) or H(i)**H is applied to C(i:m,1:n)
255*
256 mi = m - i + 1
257 ic = i
258 ELSE
259*
260* H(i) or H(i)**H is applied to C(1:m,i:n)
261*
262 ni = n - i + 1
263 jc = i
264 END IF
265*
266* Apply H(i) or H(i)**H
267*
268 IF( notran ) THEN
269 taui = conjg( tau( i ) )
270 ELSE
271 taui = tau( i )
272 END IF
273 IF( i.LT.nq )
274 $ CALL clacgv( nq-i, a( i, i+1 ), lda )
275 aii = a( i, i )
276 a( i, i ) = one
277 CALL clarf( side, mi, ni, a( i, i ), lda, taui, c( ic, jc ),
278 $ ldc, work )
279 a( i, i ) = aii
280 IF( i.LT.nq )
281 $ CALL clacgv( nq-i, a( i, i+1 ), lda )
282 10 CONTINUE
283 RETURN
284*
285* End of CUNML2
286*
287 END
subroutine xerbla(srname, info)
Definition cblat2.f:3285
subroutine clacgv(n, x, incx)
CLACGV conjugates a complex vector.
Definition clacgv.f:74
subroutine clarf(side, m, n, v, incv, tau, c, ldc, work)
CLARF applies an elementary reflector to a general rectangular matrix.
Definition clarf.f:128
subroutine cunml2(side, trans, m, n, k, a, lda, tau, c, ldc, work, info)
CUNML2 multiplies a general matrix by the unitary matrix from a LQ factorization determined by cgelqf...
Definition cunml2.f:159