1 SUBROUTINE CGRQTS( M, P, N, A, AF, Q, R, LDA, TAUA, B, BF, Z, T,
2 $ BWK, LDB, TAUB, WORK, LWORK, RWORK, RESULT )
3 *
4 * -- LAPACK test routine (version 3.1) --
5 * Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd..
6 * November 2006
7 *
8 * .. Scalar Arguments ..
9 INTEGER LDA, LDB, LWORK, M, P, N
10 * ..
11 * .. Array Arguments ..
12 REAL RESULT( 4 ), RWORK( * )
13 COMPLEX A( LDA, * ), AF( LDA, * ), R( LDA, * ),
14 $ Q( LDA, * ), B( LDB, * ), BF( LDB, * ),
15 $ T( LDB, * ), Z( LDB, * ), BWK( LDB, * ),
16 $ TAUA( * ), TAUB( * ), WORK( LWORK )
17 * ..
18 *
19 * Purpose
20 * =======
21 *
22 * CGRQTS tests CGGRQF, which computes the GRQ factorization of an
23 * M-by-N matrix A and a P-by-N matrix B: A = R*Q and B = Z*T*Q.
24 *
25 * Arguments
26 * =========
27 *
28 * M (input) INTEGER
29 * The number of rows of the matrix A. M >= 0.
30 *
31 * P (input) INTEGER
32 * The number of rows of the matrix B. P >= 0.
33 *
34 * N (input) INTEGER
35 * The number of columns of the matrices A and B. N >= 0.
36 *
37 * A (input) COMPLEX array, dimension (LDA,N)
38 * The M-by-N matrix A.
39 *
40 * AF (output) COMPLEX array, dimension (LDA,N)
41 * Details of the GRQ factorization of A and B, as returned
42 * by CGGRQF, see CGGRQF for further details.
43 *
44 * Q (output) COMPLEX array, dimension (LDA,N)
45 * The N-by-N unitary matrix Q.
46 *
47 * R (workspace) COMPLEX array, dimension (LDA,MAX(M,N))
48 *
49 * LDA (input) INTEGER
50 * The leading dimension of the arrays A, AF, R and Q.
51 * LDA >= max(M,N).
52 *
53 * TAUA (output) COMPLEX array, dimension (min(M,N))
54 * The scalar factors of the elementary reflectors, as returned
55 * by SGGQRC.
56 *
57 * B (input) COMPLEX array, dimension (LDB,N)
58 * On entry, the P-by-N matrix A.
59 *
60 * BF (output) COMPLEX array, dimension (LDB,N)
61 * Details of the GQR factorization of A and B, as returned
62 * by CGGRQF, see CGGRQF for further details.
63 *
64 * Z (output) REAL array, dimension (LDB,P)
65 * The P-by-P unitary matrix Z.
66 *
67 * T (workspace) COMPLEX array, dimension (LDB,max(P,N))
68 *
69 * BWK (workspace) COMPLEX array, dimension (LDB,N)
70 *
71 * LDB (input) INTEGER
72 * The leading dimension of the arrays B, BF, Z and T.
73 * LDB >= max(P,N).
74 *
75 * TAUB (output) COMPLEX array, dimension (min(P,N))
76 * The scalar factors of the elementary reflectors, as returned
77 * by SGGRQF.
78 *
79 * WORK (workspace) COMPLEX array, dimension (LWORK)
80 *
81 * LWORK (input) INTEGER
82 * The dimension of the array WORK, LWORK >= max(M,P,N)**2.
83 *
84 * RWORK (workspace) REAL array, dimension (M)
85 *
86 * RESULT (output) REAL array, dimension (4)
87 * The test ratios:
88 * RESULT(1) = norm( R - A*Q' ) / ( MAX(M,N)*norm(A)*ULP)
89 * RESULT(2) = norm( T*Q - Z'*B ) / (MAX(P,N)*norm(B)*ULP)
90 * RESULT(3) = norm( I - Q'*Q ) / ( N*ULP )
91 * RESULT(4) = norm( I - Z'*Z ) / ( P*ULP )
92 *
93 * =====================================================================
94 *
95 * .. Parameters ..
96 REAL ZERO, ONE
97 PARAMETER ( ZERO = 0.0E+0, ONE = 1.0E+0 )
98 COMPLEX CZERO, CONE
99 PARAMETER ( CZERO = ( 0.0E+0, 0.0E+0 ),
100 $ CONE = ( 1.0E+0, 0.0E+0 ) )
101 COMPLEX CROGUE
102 PARAMETER ( CROGUE = ( -1.0E+10, 0.0E+0 ) )
103 * ..
104 * .. Local Scalars ..
105 INTEGER INFO
106 REAL ANORM, BNORM, ULP, UNFL, RESID
107 * ..
108 * .. External Functions ..
109 REAL SLAMCH, CLANGE, CLANHE
110 EXTERNAL SLAMCH, CLANGE, CLANHE
111 * ..
112 * .. External Subroutines ..
113 EXTERNAL CGEMM, CGGRQF, CLACPY, CLASET, CUNGQR,
114 $ CUNGRQ, CHERK
115 * ..
116 * .. Intrinsic Functions ..
117 INTRINSIC MAX, MIN, REAL
118 * ..
119 * .. Executable Statements ..
120 *
121 ULP = SLAMCH( 'Precision' )
122 UNFL = SLAMCH( 'Safe minimum' )
123 *
124 * Copy the matrix A to the array AF.
125 *
126 CALL CLACPY( 'Full', M, N, A, LDA, AF, LDA )
127 CALL CLACPY( 'Full', P, N, B, LDB, BF, LDB )
128 *
129 ANORM = MAX( CLANGE( '1', M, N, A, LDA, RWORK ), UNFL )
130 BNORM = MAX( CLANGE( '1', P, N, B, LDB, RWORK ), UNFL )
131 *
132 * Factorize the matrices A and B in the arrays AF and BF.
133 *
134 CALL CGGRQF( M, P, N, AF, LDA, TAUA, BF, LDB, TAUB, WORK,
135 $ LWORK, INFO )
136 *
137 * Generate the N-by-N matrix Q
138 *
139 CALL CLASET( 'Full', N, N, CROGUE, CROGUE, Q, LDA )
140 IF( M.LE.N ) THEN
141 IF( M.GT.0 .AND. M.LT.N )
142 $ CALL CLACPY( 'Full', M, N-M, AF, LDA, Q( N-M+1, 1 ), LDA )
143 IF( M.GT.1 )
144 $ CALL CLACPY( 'Lower', M-1, M-1, AF( 2, N-M+1 ), LDA,
145 $ Q( N-M+2, N-M+1 ), LDA )
146 ELSE
147 IF( N.GT.1 )
148 $ CALL CLACPY( 'Lower', N-1, N-1, AF( M-N+2, 1 ), LDA,
149 $ Q( 2, 1 ), LDA )
150 END IF
151 CALL CUNGRQ( N, N, MIN( M, N ), Q, LDA, TAUA, WORK, LWORK, INFO )
152 *
153 * Generate the P-by-P matrix Z
154 *
155 CALL CLASET( 'Full', P, P, CROGUE, CROGUE, Z, LDB )
156 IF( P.GT.1 )
157 $ CALL CLACPY( 'Lower', P-1, N, BF( 2,1 ), LDB, Z( 2,1 ), LDB )
158 CALL CUNGQR( P, P, MIN( P,N ), Z, LDB, TAUB, WORK, LWORK, INFO )
159 *
160 * Copy R
161 *
162 CALL CLASET( 'Full', M, N, CZERO, CZERO, R, LDA )
163 IF( M.LE.N )THEN
164 CALL CLACPY( 'Upper', M, M, AF( 1, N-M+1 ), LDA, R( 1, N-M+1 ),
165 $ LDA )
166 ELSE
167 CALL CLACPY( 'Full', M-N, N, AF, LDA, R, LDA )
168 CALL CLACPY( 'Upper', N, N, AF( M-N+1, 1 ), LDA, R( M-N+1, 1 ),
169 $ LDA )
170 END IF
171 *
172 * Copy T
173 *
174 CALL CLASET( 'Full', P, N, CZERO, CZERO, T, LDB )
175 CALL CLACPY( 'Upper', P, N, BF, LDB, T, LDB )
176 *
177 * Compute R - A*Q'
178 *
179 CALL CGEMM( 'No transpose', 'Conjugate transpose', M, N, N, -CONE,
180 $ A, LDA, Q, LDA, CONE, R, LDA )
181 *
182 * Compute norm( R - A*Q' ) / ( MAX(M,N)*norm(A)*ULP ) .
183 *
184 RESID = CLANGE( '1', M, N, R, LDA, RWORK )
185 IF( ANORM.GT.ZERO ) THEN
186 RESULT( 1 ) = ( ( RESID / REAL(MAX(1,M,N) ) ) / ANORM ) / ULP
187 ELSE
188 RESULT( 1 ) = ZERO
189 END IF
190 *
191 * Compute T*Q - Z'*B
192 *
193 CALL CGEMM( 'Conjugate transpose', 'No transpose', P, N, P, CONE,
194 $ Z, LDB, B, LDB, CZERO, BWK, LDB )
195 CALL CGEMM( 'No transpose', 'No transpose', P, N, N, CONE, T, LDB,
196 $ Q, LDA, -CONE, BWK, LDB )
197 *
198 * Compute norm( T*Q - Z'*B ) / ( MAX(P,N)*norm(A)*ULP ) .
199 *
200 RESID = CLANGE( '1', P, N, BWK, LDB, RWORK )
201 IF( BNORM.GT.ZERO ) THEN
202 RESULT( 2 ) = ( ( RESID / REAL( MAX( 1,P,M ) ) )/BNORM ) / ULP
203 ELSE
204 RESULT( 2 ) = ZERO
205 END IF
206 *
207 * Compute I - Q*Q'
208 *
209 CALL CLASET( 'Full', N, N, CZERO, CONE, R, LDA )
210 CALL CHERK( 'Upper', 'No Transpose', N, N, -ONE, Q, LDA, ONE, R,
211 $ LDA )
212 *
213 * Compute norm( I - Q'*Q ) / ( N * ULP ) .
214 *
215 RESID = CLANHE( '1', 'Upper', N, R, LDA, RWORK )
216 RESULT( 3 ) = ( RESID / REAL( MAX( 1,N ) ) ) / ULP
217 *
218 * Compute I - Z'*Z
219 *
220 CALL CLASET( 'Full', P, P, CZERO, CONE, T, LDB )
221 CALL CHERK( 'Upper', 'Conjugate transpose', P, P, -ONE, Z, LDB,
222 $ ONE, T, LDB )
223 *
224 * Compute norm( I - Z'*Z ) / ( P*ULP ) .
225 *
226 RESID = CLANHE( '1', 'Upper', P, T, LDB, RWORK )
227 RESULT( 4 ) = ( RESID / REAL( MAX( 1,P ) ) ) / ULP
228 *
229 RETURN
230 *
231 * End of CGRQTS
232 *
233 END
2 $ BWK, LDB, TAUB, WORK, LWORK, RWORK, RESULT )
3 *
4 * -- LAPACK test routine (version 3.1) --
5 * Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd..
6 * November 2006
7 *
8 * .. Scalar Arguments ..
9 INTEGER LDA, LDB, LWORK, M, P, N
10 * ..
11 * .. Array Arguments ..
12 REAL RESULT( 4 ), RWORK( * )
13 COMPLEX A( LDA, * ), AF( LDA, * ), R( LDA, * ),
14 $ Q( LDA, * ), B( LDB, * ), BF( LDB, * ),
15 $ T( LDB, * ), Z( LDB, * ), BWK( LDB, * ),
16 $ TAUA( * ), TAUB( * ), WORK( LWORK )
17 * ..
18 *
19 * Purpose
20 * =======
21 *
22 * CGRQTS tests CGGRQF, which computes the GRQ factorization of an
23 * M-by-N matrix A and a P-by-N matrix B: A = R*Q and B = Z*T*Q.
24 *
25 * Arguments
26 * =========
27 *
28 * M (input) INTEGER
29 * The number of rows of the matrix A. M >= 0.
30 *
31 * P (input) INTEGER
32 * The number of rows of the matrix B. P >= 0.
33 *
34 * N (input) INTEGER
35 * The number of columns of the matrices A and B. N >= 0.
36 *
37 * A (input) COMPLEX array, dimension (LDA,N)
38 * The M-by-N matrix A.
39 *
40 * AF (output) COMPLEX array, dimension (LDA,N)
41 * Details of the GRQ factorization of A and B, as returned
42 * by CGGRQF, see CGGRQF for further details.
43 *
44 * Q (output) COMPLEX array, dimension (LDA,N)
45 * The N-by-N unitary matrix Q.
46 *
47 * R (workspace) COMPLEX array, dimension (LDA,MAX(M,N))
48 *
49 * LDA (input) INTEGER
50 * The leading dimension of the arrays A, AF, R and Q.
51 * LDA >= max(M,N).
52 *
53 * TAUA (output) COMPLEX array, dimension (min(M,N))
54 * The scalar factors of the elementary reflectors, as returned
55 * by SGGQRC.
56 *
57 * B (input) COMPLEX array, dimension (LDB,N)
58 * On entry, the P-by-N matrix A.
59 *
60 * BF (output) COMPLEX array, dimension (LDB,N)
61 * Details of the GQR factorization of A and B, as returned
62 * by CGGRQF, see CGGRQF for further details.
63 *
64 * Z (output) REAL array, dimension (LDB,P)
65 * The P-by-P unitary matrix Z.
66 *
67 * T (workspace) COMPLEX array, dimension (LDB,max(P,N))
68 *
69 * BWK (workspace) COMPLEX array, dimension (LDB,N)
70 *
71 * LDB (input) INTEGER
72 * The leading dimension of the arrays B, BF, Z and T.
73 * LDB >= max(P,N).
74 *
75 * TAUB (output) COMPLEX array, dimension (min(P,N))
76 * The scalar factors of the elementary reflectors, as returned
77 * by SGGRQF.
78 *
79 * WORK (workspace) COMPLEX array, dimension (LWORK)
80 *
81 * LWORK (input) INTEGER
82 * The dimension of the array WORK, LWORK >= max(M,P,N)**2.
83 *
84 * RWORK (workspace) REAL array, dimension (M)
85 *
86 * RESULT (output) REAL array, dimension (4)
87 * The test ratios:
88 * RESULT(1) = norm( R - A*Q' ) / ( MAX(M,N)*norm(A)*ULP)
89 * RESULT(2) = norm( T*Q - Z'*B ) / (MAX(P,N)*norm(B)*ULP)
90 * RESULT(3) = norm( I - Q'*Q ) / ( N*ULP )
91 * RESULT(4) = norm( I - Z'*Z ) / ( P*ULP )
92 *
93 * =====================================================================
94 *
95 * .. Parameters ..
96 REAL ZERO, ONE
97 PARAMETER ( ZERO = 0.0E+0, ONE = 1.0E+0 )
98 COMPLEX CZERO, CONE
99 PARAMETER ( CZERO = ( 0.0E+0, 0.0E+0 ),
100 $ CONE = ( 1.0E+0, 0.0E+0 ) )
101 COMPLEX CROGUE
102 PARAMETER ( CROGUE = ( -1.0E+10, 0.0E+0 ) )
103 * ..
104 * .. Local Scalars ..
105 INTEGER INFO
106 REAL ANORM, BNORM, ULP, UNFL, RESID
107 * ..
108 * .. External Functions ..
109 REAL SLAMCH, CLANGE, CLANHE
110 EXTERNAL SLAMCH, CLANGE, CLANHE
111 * ..
112 * .. External Subroutines ..
113 EXTERNAL CGEMM, CGGRQF, CLACPY, CLASET, CUNGQR,
114 $ CUNGRQ, CHERK
115 * ..
116 * .. Intrinsic Functions ..
117 INTRINSIC MAX, MIN, REAL
118 * ..
119 * .. Executable Statements ..
120 *
121 ULP = SLAMCH( 'Precision' )
122 UNFL = SLAMCH( 'Safe minimum' )
123 *
124 * Copy the matrix A to the array AF.
125 *
126 CALL CLACPY( 'Full', M, N, A, LDA, AF, LDA )
127 CALL CLACPY( 'Full', P, N, B, LDB, BF, LDB )
128 *
129 ANORM = MAX( CLANGE( '1', M, N, A, LDA, RWORK ), UNFL )
130 BNORM = MAX( CLANGE( '1', P, N, B, LDB, RWORK ), UNFL )
131 *
132 * Factorize the matrices A and B in the arrays AF and BF.
133 *
134 CALL CGGRQF( M, P, N, AF, LDA, TAUA, BF, LDB, TAUB, WORK,
135 $ LWORK, INFO )
136 *
137 * Generate the N-by-N matrix Q
138 *
139 CALL CLASET( 'Full', N, N, CROGUE, CROGUE, Q, LDA )
140 IF( M.LE.N ) THEN
141 IF( M.GT.0 .AND. M.LT.N )
142 $ CALL CLACPY( 'Full', M, N-M, AF, LDA, Q( N-M+1, 1 ), LDA )
143 IF( M.GT.1 )
144 $ CALL CLACPY( 'Lower', M-1, M-1, AF( 2, N-M+1 ), LDA,
145 $ Q( N-M+2, N-M+1 ), LDA )
146 ELSE
147 IF( N.GT.1 )
148 $ CALL CLACPY( 'Lower', N-1, N-1, AF( M-N+2, 1 ), LDA,
149 $ Q( 2, 1 ), LDA )
150 END IF
151 CALL CUNGRQ( N, N, MIN( M, N ), Q, LDA, TAUA, WORK, LWORK, INFO )
152 *
153 * Generate the P-by-P matrix Z
154 *
155 CALL CLASET( 'Full', P, P, CROGUE, CROGUE, Z, LDB )
156 IF( P.GT.1 )
157 $ CALL CLACPY( 'Lower', P-1, N, BF( 2,1 ), LDB, Z( 2,1 ), LDB )
158 CALL CUNGQR( P, P, MIN( P,N ), Z, LDB, TAUB, WORK, LWORK, INFO )
159 *
160 * Copy R
161 *
162 CALL CLASET( 'Full', M, N, CZERO, CZERO, R, LDA )
163 IF( M.LE.N )THEN
164 CALL CLACPY( 'Upper', M, M, AF( 1, N-M+1 ), LDA, R( 1, N-M+1 ),
165 $ LDA )
166 ELSE
167 CALL CLACPY( 'Full', M-N, N, AF, LDA, R, LDA )
168 CALL CLACPY( 'Upper', N, N, AF( M-N+1, 1 ), LDA, R( M-N+1, 1 ),
169 $ LDA )
170 END IF
171 *
172 * Copy T
173 *
174 CALL CLASET( 'Full', P, N, CZERO, CZERO, T, LDB )
175 CALL CLACPY( 'Upper', P, N, BF, LDB, T, LDB )
176 *
177 * Compute R - A*Q'
178 *
179 CALL CGEMM( 'No transpose', 'Conjugate transpose', M, N, N, -CONE,
180 $ A, LDA, Q, LDA, CONE, R, LDA )
181 *
182 * Compute norm( R - A*Q' ) / ( MAX(M,N)*norm(A)*ULP ) .
183 *
184 RESID = CLANGE( '1', M, N, R, LDA, RWORK )
185 IF( ANORM.GT.ZERO ) THEN
186 RESULT( 1 ) = ( ( RESID / REAL(MAX(1,M,N) ) ) / ANORM ) / ULP
187 ELSE
188 RESULT( 1 ) = ZERO
189 END IF
190 *
191 * Compute T*Q - Z'*B
192 *
193 CALL CGEMM( 'Conjugate transpose', 'No transpose', P, N, P, CONE,
194 $ Z, LDB, B, LDB, CZERO, BWK, LDB )
195 CALL CGEMM( 'No transpose', 'No transpose', P, N, N, CONE, T, LDB,
196 $ Q, LDA, -CONE, BWK, LDB )
197 *
198 * Compute norm( T*Q - Z'*B ) / ( MAX(P,N)*norm(A)*ULP ) .
199 *
200 RESID = CLANGE( '1', P, N, BWK, LDB, RWORK )
201 IF( BNORM.GT.ZERO ) THEN
202 RESULT( 2 ) = ( ( RESID / REAL( MAX( 1,P,M ) ) )/BNORM ) / ULP
203 ELSE
204 RESULT( 2 ) = ZERO
205 END IF
206 *
207 * Compute I - Q*Q'
208 *
209 CALL CLASET( 'Full', N, N, CZERO, CONE, R, LDA )
210 CALL CHERK( 'Upper', 'No Transpose', N, N, -ONE, Q, LDA, ONE, R,
211 $ LDA )
212 *
213 * Compute norm( I - Q'*Q ) / ( N * ULP ) .
214 *
215 RESID = CLANHE( '1', 'Upper', N, R, LDA, RWORK )
216 RESULT( 3 ) = ( RESID / REAL( MAX( 1,N ) ) ) / ULP
217 *
218 * Compute I - Z'*Z
219 *
220 CALL CLASET( 'Full', P, P, CZERO, CONE, T, LDB )
221 CALL CHERK( 'Upper', 'Conjugate transpose', P, P, -ONE, Z, LDB,
222 $ ONE, T, LDB )
223 *
224 * Compute norm( I - Z'*Z ) / ( P*ULP ) .
225 *
226 RESID = CLANHE( '1', 'Upper', P, T, LDB, RWORK )
227 RESULT( 4 ) = ( RESID / REAL( MAX( 1,P ) ) ) / ULP
228 *
229 RETURN
230 *
231 * End of CGRQTS
232 *
233 END