LAPACK  3.4.2 LAPACK: Linear Algebra PACKage
dqrt04.f
Go to the documentation of this file.
1 *> \brief \b DQRT04
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 DQRT04(M,N,NB,RESULT)
12 *
13 * .. Scalar Arguments ..
14 * INTEGER M, N, NB, LDT
15 * .. Return values ..
16 * DOUBLE PRECISION RESULT(6)
17 *
18 *
19 *> \par Purpose:
20 * =============
21 *>
22 *> \verbatim
23 *>
24 *> DQRT04 tests DGEQRT and DGEMQRT.
25 *> \endverbatim
26 *
27 * Arguments:
28 * ==========
29 *
30 *> \param[in] M
31 *> \verbatim
32 *> M is INTEGER
33 *> Number of rows in test matrix.
34 *> \endverbatim
35 *>
36 *> \param[in] N
37 *> \verbatim
38 *> N is INTEGER
39 *> Number of columns in test matrix.
40 *> \endverbatim
41 *>
42 *> \param[in] NB
43 *> \verbatim
44 *> NB is INTEGER
45 *> Block size of test matrix. NB <= Min(M,N).
46 *> \endverbatim
47 *>
48 *> \param[out] RESULT
49 *> \verbatim
50 *> RESULT is DOUBLE PRECISION array, dimension (6)
51 *> Results of each of the six tests below.
52 *>
53 *> RESULT(1) = | A - Q R |
54 *> RESULT(2) = | I - Q^H Q |
55 *> RESULT(3) = | Q C - Q C |
56 *> RESULT(4) = | Q^H C - Q^H C |
57 *> RESULT(5) = | C Q - C Q |
58 *> RESULT(6) = | C Q^H - C Q^H |
59 *> \endverbatim
60 *
61 * Authors:
62 * ========
63 *
64 *> \author Univ. of Tennessee
65 *> \author Univ. of California Berkeley
66 *> \author Univ. of Colorado Denver
67 *> \author NAG Ltd.
68 *
69 *> \date April 2012
70 *
71 *> \ingroup double_lin
72 *
73 * =====================================================================
74  SUBROUTINE dqrt04(M,N,NB,RESULT)
75  IMPLICIT NONE
76 *
77 * -- LAPACK test routine (version 3.4.1) --
78 * -- LAPACK is a software package provided by Univ. of Tennessee, --
79 * -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
80 * April 2012
81 *
82 * .. Scalar Arguments ..
83  INTEGER m, n, nb, ldt
84 * .. Return values ..
85  DOUBLE PRECISION result(6)
86 *
87 * =====================================================================
88 *
89 * ..
90 * .. Local allocatable arrays
91  DOUBLE PRECISION, ALLOCATABLE :: af(:,:), q(:,:),
92  \$ r(:,:), rwork(:), work( : ), t(:,:),
93  \$ cf(:,:), df(:,:), a(:,:), c(:,:), d(:,:)
94 *
95 * .. Parameters ..
96  DOUBLE PRECISION one, zero
97  parameter( zero = 0.0, one = 1.0 )
98 * ..
99 * .. Local Scalars ..
100  INTEGER info, j, k, l, lwork
101  DOUBLE PRECISION anorm, eps, resid, cnorm, dnorm
102 * ..
103 * .. Local Arrays ..
104  INTEGER iseed( 4 )
105 * ..
106 * .. External Functions ..
107  DOUBLE PRECISION dlamch, dlange, dlansy
108  LOGICAL lsame
109  EXTERNAL dlamch, dlange, dlansy, lsame
110 * ..
111 * .. Intrinsic Functions ..
112  INTRINSIC max, min
113 * ..
114 * .. Data statements ..
115  DATA iseed / 1988, 1989, 1990, 1991 /
116 *
117  eps = dlamch( 'Epsilon' )
118  k = min(m,n)
119  l = max(m,n)
120  lwork = max(2,l)*max(2,l)*nb
121 *
122 * Dynamically allocate local arrays
123 *
124  ALLOCATE ( a(m,n), af(m,n), q(m,m), r(m,l), rwork(l),
125  \$ work(lwork), t(nb,n), c(m,n), cf(m,n),
126  \$ d(n,m), df(n,m) )
127 *
128 * Put random numbers into A and copy to AF
129 *
130  ldt=nb
131  DO j=1,n
132  CALL dlarnv( 2, iseed, m, a( 1, j ) )
133  END DO
134  CALL dlacpy( 'Full', m, n, a, m, af, m )
135 *
136 * Factor the matrix A in the array AF.
137 *
138  CALL dgeqrt( m, n, nb, af, m, t, ldt, work, info )
139 *
140 * Generate the m-by-m matrix Q
141 *
142  CALL dlaset( 'Full', m, m, zero, one, q, m )
143  CALL dgemqrt( 'R', 'N', m, m, k, nb, af, m, t, ldt, q, m,
144  \$ work, info )
145 *
146 * Copy R
147 *
148  CALL dlaset( 'Full', m, n, zero, zero, r, m )
149  CALL dlacpy( 'Upper', m, n, af, m, r, m )
150 *
151 * Compute |R - Q'*A| / |A| and store in RESULT(1)
152 *
153  CALL dgemm( 'T', 'N', m, n, m, -one, q, m, a, m, one, r, m )
154  anorm = dlange( '1', m, n, a, m, rwork )
155  resid = dlange( '1', m, n, r, m, rwork )
156  IF( anorm.GT.zero ) THEN
157  result( 1 ) = resid / (eps*max(1,m)*anorm)
158  ELSE
159  result( 1 ) = zero
160  END IF
161 *
162 * Compute |I - Q'*Q| and store in RESULT(2)
163 *
164  CALL dlaset( 'Full', m, m, zero, one, r, m )
165  CALL dsyrk( 'U', 'C', m, m, -one, q, m, one, r, m )
166  resid = dlansy( '1', 'Upper', m, r, m, rwork )
167  result( 2 ) = resid / (eps*max(1,m))
168 *
169 * Generate random m-by-n matrix C and a copy CF
170 *
171  DO j=1,n
172  CALL dlarnv( 2, iseed, m, c( 1, j ) )
173  END DO
174  cnorm = dlange( '1', m, n, c, m, rwork)
175  CALL dlacpy( 'Full', m, n, c, m, cf, m )
176 *
177 * Apply Q to C as Q*C
178 *
179  CALL dgemqrt( 'L', 'N', m, n, k, nb, af, m, t, nb, cf, m,
180  \$ work, info)
181 *
182 * Compute |Q*C - Q*C| / |C|
183 *
184  CALL dgemm( 'N', 'N', m, n, m, -one, q, m, c, m, one, cf, m )
185  resid = dlange( '1', m, n, cf, m, rwork )
186  IF( cnorm.GT.zero ) THEN
187  result( 3 ) = resid / (eps*max(1,m)*cnorm)
188  ELSE
189  result( 3 ) = zero
190  END IF
191 *
192 * Copy C into CF again
193 *
194  CALL dlacpy( 'Full', m, n, c, m, cf, m )
195 *
196 * Apply Q to C as QT*C
197 *
198  CALL dgemqrt( 'L', 'T', m, n, k, nb, af, m, t, nb, cf, m,
199  \$ work, info)
200 *
201 * Compute |QT*C - QT*C| / |C|
202 *
203  CALL dgemm( 'T', 'N', m, n, m, -one, q, m, c, m, one, cf, m )
204  resid = dlange( '1', m, n, cf, m, rwork )
205  IF( cnorm.GT.zero ) THEN
206  result( 4 ) = resid / (eps*max(1,m)*cnorm)
207  ELSE
208  result( 4 ) = zero
209  END IF
210 *
211 * Generate random n-by-m matrix D and a copy DF
212 *
213  DO j=1,m
214  CALL dlarnv( 2, iseed, n, d( 1, j ) )
215  END DO
216  dnorm = dlange( '1', n, m, d, n, rwork)
217  CALL dlacpy( 'Full', n, m, d, n, df, n )
218 *
219 * Apply Q to D as D*Q
220 *
221  CALL dgemqrt( 'R', 'N', n, m, k, nb, af, m, t, nb, df, n,
222  \$ work, info)
223 *
224 * Compute |D*Q - D*Q| / |D|
225 *
226  CALL dgemm( 'N', 'N', n, m, m, -one, d, n, q, m, one, df, n )
227  resid = dlange( '1', n, m, df, n, rwork )
228  IF( cnorm.GT.zero ) THEN
229  result( 5 ) = resid / (eps*max(1,m)*dnorm)
230  ELSE
231  result( 5 ) = zero
232  END IF
233 *
234 * Copy D into DF again
235 *
236  CALL dlacpy( 'Full', n, m, d, n, df, n )
237 *
238 * Apply Q to D as D*QT
239 *
240  CALL dgemqrt( 'R', 'T', n, m, k, nb, af, m, t, nb, df, n,
241  \$ work, info)
242 *
243 * Compute |D*QT - D*QT| / |D|
244 *
245  CALL dgemm( 'N', 'T', n, m, m, -one, d, n, q, m, one, df, n )
246  resid = dlange( '1', n, m, df, n, rwork )
247  IF( cnorm.GT.zero ) THEN
248  result( 6 ) = resid / (eps*max(1,m)*dnorm)
249  ELSE
250  result( 6 ) = zero
251  END IF
252 *
253 * Deallocate all arrays
254 *
255  DEALLOCATE ( a, af, q, r, rwork, work, t, c, d, cf, df)
256 *
257  return
258  END
259