LAPACK  3.8.0 LAPACK: Linear Algebra PACKage
cqlt02.f
Go to the documentation of this file.
1 *> \brief \b CQLT02
2 *
3 * =========== DOCUMENTATION ===========
4 *
5 * Online html documentation available at
6 * http://www.netlib.org/lapack/explore-html/
7 *
8 * Definition:
9 * ===========
10 *
11 * SUBROUTINE CQLT02( M, N, K, A, AF, Q, L, LDA, TAU, WORK, LWORK,
12 * RWORK, RESULT )
13 *
14 * .. Scalar Arguments ..
15 * INTEGER K, LDA, LWORK, M, N
16 * ..
17 * .. Array Arguments ..
18 * REAL RESULT( * ), RWORK( * )
19 * COMPLEX A( LDA, * ), AF( LDA, * ), L( LDA, * ),
20 * \$ Q( LDA, * ), TAU( * ), WORK( LWORK )
21 * ..
22 *
23 *
24 *> \par Purpose:
25 * =============
26 *>
27 *> \verbatim
28 *>
29 *> CQLT02 tests CUNGQL, which generates an m-by-n matrix Q with
30 *> orthonornmal columns that is defined as the product of k elementary
31 *> reflectors.
32 *>
33 *> Given the QL factorization of an m-by-n matrix A, CQLT02 generates
34 *> the orthogonal matrix Q defined by the factorization of the last k
35 *> columns of A; it compares L(m-n+1:m,n-k+1:n) with
36 *> Q(1:m,m-n+1:m)'*A(1:m,n-k+1:n), and checks that the columns of Q are
37 *> orthonormal.
38 *> \endverbatim
39 *
40 * Arguments:
41 * ==========
42 *
43 *> \param[in] M
44 *> \verbatim
45 *> M is INTEGER
46 *> The number of rows of the matrix Q to be generated. M >= 0.
47 *> \endverbatim
48 *>
49 *> \param[in] N
50 *> \verbatim
51 *> N is INTEGER
52 *> The number of columns of the matrix Q to be generated.
53 *> M >= N >= 0.
54 *> \endverbatim
55 *>
56 *> \param[in] K
57 *> \verbatim
58 *> K is INTEGER
59 *> The number of elementary reflectors whose product defines the
60 *> matrix Q. N >= K >= 0.
61 *> \endverbatim
62 *>
63 *> \param[in] A
64 *> \verbatim
65 *> A is COMPLEX array, dimension (LDA,N)
66 *> The m-by-n matrix A which was factorized by CQLT01.
67 *> \endverbatim
68 *>
69 *> \param[in] AF
70 *> \verbatim
71 *> AF is COMPLEX array, dimension (LDA,N)
72 *> Details of the QL factorization of A, as returned by CGEQLF.
73 *> See CGEQLF for further details.
74 *> \endverbatim
75 *>
76 *> \param[out] Q
77 *> \verbatim
78 *> Q is COMPLEX array, dimension (LDA,N)
79 *> \endverbatim
80 *>
81 *> \param[out] L
82 *> \verbatim
83 *> L is COMPLEX array, dimension (LDA,N)
84 *> \endverbatim
85 *>
86 *> \param[in] LDA
87 *> \verbatim
88 *> LDA is INTEGER
89 *> The leading dimension of the arrays A, AF, Q and L. LDA >= M.
90 *> \endverbatim
91 *>
92 *> \param[in] TAU
93 *> \verbatim
94 *> TAU is COMPLEX array, dimension (N)
95 *> The scalar factors of the elementary reflectors corresponding
96 *> to the QL factorization in AF.
97 *> \endverbatim
98 *>
99 *> \param[out] WORK
100 *> \verbatim
101 *> WORK is COMPLEX array, dimension (LWORK)
102 *> \endverbatim
103 *>
104 *> \param[in] LWORK
105 *> \verbatim
106 *> LWORK is INTEGER
107 *> The dimension of the array WORK.
108 *> \endverbatim
109 *>
110 *> \param[out] RWORK
111 *> \verbatim
112 *> RWORK is REAL array, dimension (M)
113 *> \endverbatim
114 *>
115 *> \param[out] RESULT
116 *> \verbatim
117 *> RESULT is REAL array, dimension (2)
118 *> The test ratios:
119 *> RESULT(1) = norm( L - Q'*A ) / ( M * norm(A) * EPS )
120 *> RESULT(2) = norm( I - Q'*Q ) / ( M * EPS )
121 *> \endverbatim
122 *
123 * Authors:
124 * ========
125 *
126 *> \author Univ. of Tennessee
127 *> \author Univ. of California Berkeley
128 *> \author Univ. of Colorado Denver
129 *> \author NAG Ltd.
130 *
131 *> \date December 2016
132 *
133 *> \ingroup complex_lin
134 *
135 * =====================================================================
136  SUBROUTINE cqlt02( M, N, K, A, AF, Q, L, LDA, TAU, WORK, LWORK,
137  \$ RWORK, RESULT )
138 *
139 * -- LAPACK test routine (version 3.7.0) --
140 * -- LAPACK is a software package provided by Univ. of Tennessee, --
141 * -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
142 * December 2016
143 *
144 * .. Scalar Arguments ..
145  INTEGER K, LDA, LWORK, M, N
146 * ..
147 * .. Array Arguments ..
148  REAL RESULT( * ), RWORK( * )
149  COMPLEX A( lda, * ), AF( lda, * ), L( lda, * ),
150  \$ q( lda, * ), tau( * ), work( lwork )
151 * ..
152 *
153 * =====================================================================
154 *
155 * .. Parameters ..
156  REAL ZERO, ONE
157  parameter( zero = 0.0e+0, one = 1.0e+0 )
158  COMPLEX ROGUE
159  parameter( rogue = ( -1.0e+10, -1.0e+10 ) )
160 * ..
161 * .. Local Scalars ..
162  INTEGER INFO
163  REAL ANORM, EPS, RESID
164 * ..
165 * .. External Functions ..
166  REAL CLANGE, CLANSY, SLAMCH
167  EXTERNAL clange, clansy, slamch
168 * ..
169 * .. External Subroutines ..
170  EXTERNAL cgemm, cherk, clacpy, claset, cungql
171 * ..
172 * .. Intrinsic Functions ..
173  INTRINSIC cmplx, max, real
174 * ..
175 * .. Scalars in Common ..
176  CHARACTER*32 SRNAMT
177 * ..
178 * .. Common blocks ..
179  COMMON / srnamc / srnamt
180 * ..
181 * .. Executable Statements ..
182 *
183 * Quick return if possible
184 *
185  IF( m.EQ.0 .OR. n.EQ.0 .OR. k.EQ.0 ) THEN
186  result( 1 ) = zero
187  result( 2 ) = zero
188  RETURN
189  END IF
190 *
191  eps = slamch( 'Epsilon' )
192 *
193 * Copy the last k columns of the factorization to the array Q
194 *
195  CALL claset( 'Full', m, n, rogue, rogue, q, lda )
196  IF( k.LT.m )
197  \$ CALL clacpy( 'Full', m-k, k, af( 1, n-k+1 ), lda,
198  \$ q( 1, n-k+1 ), lda )
199  IF( k.GT.1 )
200  \$ CALL clacpy( 'Upper', k-1, k-1, af( m-k+1, n-k+2 ), lda,
201  \$ q( m-k+1, n-k+2 ), lda )
202 *
203 * Generate the last n columns of the matrix Q
204 *
205  srnamt = 'CUNGQL'
206  CALL cungql( m, n, k, q, lda, tau( n-k+1 ), work, lwork, info )
207 *
208 * Copy L(m-n+1:m,n-k+1:n)
209 *
210  CALL claset( 'Full', n, k, cmplx( zero ), cmplx( zero ),
211  \$ l( m-n+1, n-k+1 ), lda )
212  CALL clacpy( 'Lower', k, k, af( m-k+1, n-k+1 ), lda,
213  \$ l( m-k+1, n-k+1 ), lda )
214 *
215 * Compute L(m-n+1:m,n-k+1:n) - Q(1:m,m-n+1:m)' * A(1:m,n-k+1:n)
216 *
217  CALL cgemm( 'Conjugate transpose', 'No transpose', n, k, m,
218  \$ cmplx( -one ), q, lda, a( 1, n-k+1 ), lda,
219  \$ cmplx( one ), l( m-n+1, n-k+1 ), lda )
220 *
221 * Compute norm( L - Q'*A ) / ( M * norm(A) * EPS ) .
222 *
223  anorm = clange( '1', m, k, a( 1, n-k+1 ), lda, rwork )
224  resid = clange( '1', n, k, l( m-n+1, n-k+1 ), lda, rwork )
225  IF( anorm.GT.zero ) THEN
226  result( 1 ) = ( ( resid / REAL( MAX( 1, M ) ) ) / anorm ) / eps
227  ELSE
228  result( 1 ) = zero
229  END IF
230 *
231 * Compute I - Q'*Q
232 *
233  CALL claset( 'Full', n, n, cmplx( zero ), cmplx( one ), l, lda )
234  CALL cherk( 'Upper', 'Conjugate transpose', n, m, -one, q, lda,
235  \$ one, l, lda )
236 *
237 * Compute norm( I - Q'*Q ) / ( M * EPS ) .
238 *
239  resid = clansy( '1', 'Upper', n, l, lda, rwork )
240 *
241  result( 2 ) = ( resid / REAL( MAX( 1, M ) ) ) / eps
242 *
243  RETURN
244 *
245 * End of CQLT02
246 *
247  END
subroutine cungql(M, N, K, A, LDA, TAU, WORK, LWORK, INFO)
CUNGQL
Definition: cungql.f:130
subroutine claset(UPLO, M, N, ALPHA, BETA, A, LDA)
CLASET initializes the off-diagonal elements and the diagonal elements of a matrix to given values...
Definition: claset.f:108
subroutine cherk(UPLO, TRANS, N, K, ALPHA, A, LDA, BETA, C, LDC)
CHERK
Definition: cherk.f:175
subroutine clacpy(UPLO, M, N, A, LDA, B, LDB)
CLACPY copies all or part of one two-dimensional array to another.
Definition: clacpy.f:105
subroutine cgemm(TRANSA, TRANSB, M, N, K, ALPHA, A, LDA, B, LDB, BETA, C, LDC)
CGEMM
Definition: cgemm.f:189
subroutine cqlt02(M, N, K, A, AF, Q, L, LDA, TAU, WORK, LWORK, RWORK, RESULT)
CQLT02
Definition: cqlt02.f:138