LAPACK 3.12.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches
derrqr.f
Go to the documentation of this file.
1*> \brief \b DERRQR
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 DERRQR( PATH, NUNIT )
12*
13* .. Scalar Arguments ..
14* CHARACTER*3 PATH
15* INTEGER NUNIT
16* ..
17*
18*
19*> \par Purpose:
20* =============
21*>
22*> \verbatim
23*>
24*> DERRQR tests the error exits for the DOUBLE PRECISION routines
25*> that use the QR decomposition of a general matrix.
26*> \endverbatim
27*
28* Arguments:
29* ==========
30*
31*> \param[in] PATH
32*> \verbatim
33*> PATH is CHARACTER*3
34*> The LAPACK path name for the routines to be tested.
35*> \endverbatim
36*>
37*> \param[in] NUNIT
38*> \verbatim
39*> NUNIT is INTEGER
40*> The unit number for output.
41*> \endverbatim
42*
43* Authors:
44* ========
45*
46*> \author Univ. of Tennessee
47*> \author Univ. of California Berkeley
48*> \author Univ. of Colorado Denver
49*> \author NAG Ltd.
50*
51*> \ingroup double_lin
52*
53* =====================================================================
54 SUBROUTINE derrqr( PATH, NUNIT )
55*
56* -- LAPACK test routine --
57* -- LAPACK is a software package provided by Univ. of Tennessee, --
58* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
59*
60* .. Scalar Arguments ..
61 CHARACTER*3 PATH
62 INTEGER NUNIT
63* ..
64*
65* =====================================================================
66*
67* .. Parameters ..
68 INTEGER NMAX
69 parameter( nmax = 2 )
70* ..
71* .. Local Scalars ..
72 INTEGER I, INFO, J
73* ..
74* .. Local Arrays ..
75 DOUBLE PRECISION A( NMAX, NMAX ), AF( NMAX, NMAX ), B( NMAX ),
76 $ W( NMAX ), X( NMAX )
77* ..
78* .. External Subroutines ..
79 EXTERNAL alaesm, chkxer, dgeqr2, dgeqr2p, dgeqrf,
81 $ dormqr
82* ..
83* .. Scalars in Common ..
84 LOGICAL LERR, OK
85 CHARACTER*32 SRNAMT
86 INTEGER INFOT, NOUT
87* ..
88* .. Common blocks ..
89 COMMON / infoc / infot, nout, ok, lerr
90 COMMON / srnamc / srnamt
91* ..
92* .. Intrinsic Functions ..
93 INTRINSIC dble
94* ..
95* .. Executable Statements ..
96*
97 nout = nunit
98 WRITE( nout, fmt = * )
99*
100* Set the variables to innocuous values.
101*
102 DO 20 j = 1, nmax
103 DO 10 i = 1, nmax
104 a( i, j ) = 1.d0 / dble( i+j )
105 af( i, j ) = 1.d0 / dble( i+j )
106 10 CONTINUE
107 b( j ) = 0.d0
108 w( j ) = 0.d0
109 x( j ) = 0.d0
110 20 CONTINUE
111 ok = .true.
112*
113* Error exits for QR factorization
114*
115* DGEQRF
116*
117 srnamt = 'DGEQRF'
118 infot = 1
119 CALL dgeqrf( -1, 0, a, 1, b, w, 1, info )
120 CALL chkxer( 'DGEQRF', infot, nout, lerr, ok )
121 infot = 2
122 CALL dgeqrf( 0, -1, a, 1, b, w, 1, info )
123 CALL chkxer( 'DGEQRF', infot, nout, lerr, ok )
124 infot = 4
125 CALL dgeqrf( 2, 1, a, 1, b, w, 1, info )
126 CALL chkxer( 'DGEQRF', infot, nout, lerr, ok )
127 infot = 7
128 CALL dgeqrf( 1, 2, a, 1, b, w, 1, info )
129 CALL chkxer( 'DGEQRF', infot, nout, lerr, ok )
130*
131* DGEQRFP
132*
133 srnamt = 'DGEQRFP'
134 infot = 1
135 CALL dgeqrfp( -1, 0, a, 1, b, w, 1, info )
136 CALL chkxer( 'DGEQRFP', infot, nout, lerr, ok )
137 infot = 2
138 CALL dgeqrfp( 0, -1, a, 1, b, w, 1, info )
139 CALL chkxer( 'DGEQRFP', infot, nout, lerr, ok )
140 infot = 4
141 CALL dgeqrfp( 2, 1, a, 1, b, w, 1, info )
142 CALL chkxer( 'DGEQRFP', infot, nout, lerr, ok )
143 infot = 7
144 CALL dgeqrfp( 1, 2, a, 1, b, w, 1, info )
145 CALL chkxer( 'DGEQRFP', infot, nout, lerr, ok )
146*
147* DGEQR2
148*
149 srnamt = 'DGEQR2'
150 infot = 1
151 CALL dgeqr2( -1, 0, a, 1, b, w, info )
152 CALL chkxer( 'DGEQR2', infot, nout, lerr, ok )
153 infot = 2
154 CALL dgeqr2( 0, -1, a, 1, b, w, info )
155 CALL chkxer( 'DGEQR2', infot, nout, lerr, ok )
156 infot = 4
157 CALL dgeqr2( 2, 1, a, 1, b, w, info )
158 CALL chkxer( 'DGEQR2', infot, nout, lerr, ok )
159*
160* DGEQR2P
161*
162 srnamt = 'DGEQR2P'
163 infot = 1
164 CALL dgeqr2p( -1, 0, a, 1, b, w, info )
165 CALL chkxer( 'DGEQR2P', infot, nout, lerr, ok )
166 infot = 2
167 CALL dgeqr2p( 0, -1, a, 1, b, w, info )
168 CALL chkxer( 'DGEQR2P', infot, nout, lerr, ok )
169 infot = 4
170 CALL dgeqr2p( 2, 1, a, 1, b, w, info )
171 CALL chkxer( 'DGEQR2P', infot, nout, lerr, ok )
172*
173* DORGQR
174*
175 srnamt = 'DORGQR'
176 infot = 1
177 CALL dorgqr( -1, 0, 0, a, 1, x, w, 1, info )
178 CALL chkxer( 'DORGQR', infot, nout, lerr, ok )
179 infot = 2
180 CALL dorgqr( 0, -1, 0, a, 1, x, w, 1, info )
181 CALL chkxer( 'DORGQR', infot, nout, lerr, ok )
182 infot = 2
183 CALL dorgqr( 1, 2, 0, a, 1, x, w, 2, info )
184 CALL chkxer( 'DORGQR', infot, nout, lerr, ok )
185 infot = 3
186 CALL dorgqr( 0, 0, -1, a, 1, x, w, 1, info )
187 CALL chkxer( 'DORGQR', infot, nout, lerr, ok )
188 infot = 3
189 CALL dorgqr( 1, 1, 2, a, 1, x, w, 1, info )
190 CALL chkxer( 'DORGQR', infot, nout, lerr, ok )
191 infot = 5
192 CALL dorgqr( 2, 2, 0, a, 1, x, w, 2, info )
193 CALL chkxer( 'DORGQR', infot, nout, lerr, ok )
194 infot = 8
195 CALL dorgqr( 2, 2, 0, a, 2, x, w, 1, info )
196 CALL chkxer( 'DORGQR', infot, nout, lerr, ok )
197*
198* DORG2R
199*
200 srnamt = 'DORG2R'
201 infot = 1
202 CALL dorg2r( -1, 0, 0, a, 1, x, w, info )
203 CALL chkxer( 'DORG2R', infot, nout, lerr, ok )
204 infot = 2
205 CALL dorg2r( 0, -1, 0, a, 1, x, w, info )
206 CALL chkxer( 'DORG2R', infot, nout, lerr, ok )
207 infot = 2
208 CALL dorg2r( 1, 2, 0, a, 1, x, w, info )
209 CALL chkxer( 'DORG2R', infot, nout, lerr, ok )
210 infot = 3
211 CALL dorg2r( 0, 0, -1, a, 1, x, w, info )
212 CALL chkxer( 'DORG2R', infot, nout, lerr, ok )
213 infot = 3
214 CALL dorg2r( 2, 1, 2, a, 2, x, w, info )
215 CALL chkxer( 'DORG2R', infot, nout, lerr, ok )
216 infot = 5
217 CALL dorg2r( 2, 1, 0, a, 1, x, w, info )
218 CALL chkxer( 'DORG2R', infot, nout, lerr, ok )
219*
220* DORMQR
221*
222 srnamt = 'DORMQR'
223 infot = 1
224 CALL dormqr( '/', 'N', 0, 0, 0, a, 1, x, af, 1, w, 1, info )
225 CALL chkxer( 'DORMQR', infot, nout, lerr, ok )
226 infot = 2
227 CALL dormqr( 'L', '/', 0, 0, 0, a, 1, x, af, 1, w, 1, info )
228 CALL chkxer( 'DORMQR', infot, nout, lerr, ok )
229 infot = 3
230 CALL dormqr( 'L', 'N', -1, 0, 0, a, 1, x, af, 1, w, 1, info )
231 CALL chkxer( 'DORMQR', infot, nout, lerr, ok )
232 infot = 4
233 CALL dormqr( 'L', 'N', 0, -1, 0, a, 1, x, af, 1, w, 1, info )
234 CALL chkxer( 'DORMQR', infot, nout, lerr, ok )
235 infot = 5
236 CALL dormqr( 'L', 'N', 0, 0, -1, a, 1, x, af, 1, w, 1, info )
237 CALL chkxer( 'DORMQR', infot, nout, lerr, ok )
238 infot = 5
239 CALL dormqr( 'L', 'N', 0, 1, 1, a, 1, x, af, 1, w, 1, info )
240 CALL chkxer( 'DORMQR', infot, nout, lerr, ok )
241 infot = 5
242 CALL dormqr( 'R', 'N', 1, 0, 1, a, 1, x, af, 1, w, 1, info )
243 CALL chkxer( 'DORMQR', infot, nout, lerr, ok )
244 infot = 7
245 CALL dormqr( 'L', 'N', 2, 1, 0, a, 1, x, af, 2, w, 1, info )
246 CALL chkxer( 'DORMQR', infot, nout, lerr, ok )
247 infot = 7
248 CALL dormqr( 'R', 'N', 1, 2, 0, a, 1, x, af, 1, w, 1, info )
249 CALL chkxer( 'DORMQR', infot, nout, lerr, ok )
250 infot = 10
251 CALL dormqr( 'L', 'N', 2, 1, 0, a, 2, x, af, 1, w, 1, info )
252 CALL chkxer( 'DORMQR', infot, nout, lerr, ok )
253 infot = 12
254 CALL dormqr( 'L', 'N', 1, 2, 0, a, 1, x, af, 1, w, 1, info )
255 CALL chkxer( 'DORMQR', infot, nout, lerr, ok )
256 infot = 12
257 CALL dormqr( 'R', 'N', 2, 1, 0, a, 1, x, af, 2, w, 1, info )
258 CALL chkxer( 'DORMQR', infot, nout, lerr, ok )
259*
260* DORM2R
261*
262 srnamt = 'DORM2R'
263 infot = 1
264 CALL dorm2r( '/', 'N', 0, 0, 0, a, 1, x, af, 1, w, info )
265 CALL chkxer( 'DORM2R', infot, nout, lerr, ok )
266 infot = 2
267 CALL dorm2r( 'L', '/', 0, 0, 0, a, 1, x, af, 1, w, info )
268 CALL chkxer( 'DORM2R', infot, nout, lerr, ok )
269 infot = 3
270 CALL dorm2r( 'L', 'N', -1, 0, 0, a, 1, x, af, 1, w, info )
271 CALL chkxer( 'DORM2R', infot, nout, lerr, ok )
272 infot = 4
273 CALL dorm2r( 'L', 'N', 0, -1, 0, a, 1, x, af, 1, w, info )
274 CALL chkxer( 'DORM2R', infot, nout, lerr, ok )
275 infot = 5
276 CALL dorm2r( 'L', 'N', 0, 0, -1, a, 1, x, af, 1, w, info )
277 CALL chkxer( 'DORM2R', infot, nout, lerr, ok )
278 infot = 5
279 CALL dorm2r( 'L', 'N', 0, 1, 1, a, 1, x, af, 1, w, info )
280 CALL chkxer( 'DORM2R', infot, nout, lerr, ok )
281 infot = 5
282 CALL dorm2r( 'R', 'N', 1, 0, 1, a, 1, x, af, 1, w, info )
283 CALL chkxer( 'DORM2R', infot, nout, lerr, ok )
284 infot = 7
285 CALL dorm2r( 'L', 'N', 2, 1, 0, a, 1, x, af, 2, w, info )
286 CALL chkxer( 'DORM2R', infot, nout, lerr, ok )
287 infot = 7
288 CALL dorm2r( 'R', 'N', 1, 2, 0, a, 1, x, af, 1, w, info )
289 CALL chkxer( 'DORM2R', infot, nout, lerr, ok )
290 infot = 10
291 CALL dorm2r( 'L', 'N', 2, 1, 0, a, 2, x, af, 1, w, info )
292 CALL chkxer( 'DORM2R', infot, nout, lerr, ok )
293*
294* Print a summary line.
295*
296 CALL alaesm( path, ok, nout )
297*
298 RETURN
299*
300* End of DERRQR
301*
302 END
subroutine alaesm(path, ok, nout)
ALAESM
Definition alaesm.f:63
subroutine chkxer(srnamt, infot, nout, lerr, ok)
Definition cblat2.f:3224
subroutine derrqr(path, nunit)
DERRQR
Definition derrqr.f:55
subroutine dgeqr2(m, n, a, lda, tau, work, info)
DGEQR2 computes the QR factorization of a general rectangular matrix using an unblocked algorithm.
Definition dgeqr2.f:130
subroutine dgeqr2p(m, n, a, lda, tau, work, info)
DGEQR2P computes the QR factorization of a general rectangular matrix with non-negative diagonal elem...
Definition dgeqr2p.f:134
subroutine dgeqrf(m, n, a, lda, tau, work, lwork, info)
DGEQRF
Definition dgeqrf.f:146
subroutine dgeqrfp(m, n, a, lda, tau, work, lwork, info)
DGEQRFP
Definition dgeqrfp.f:149
subroutine dorg2r(m, n, k, a, lda, tau, work, info)
DORG2R generates all or part of the orthogonal matrix Q from a QR factorization determined by sgeqrf ...
Definition dorg2r.f:114
subroutine dorgqr(m, n, k, a, lda, tau, work, lwork, info)
DORGQR
Definition dorgqr.f:128
subroutine dorm2r(side, trans, m, n, k, a, lda, tau, c, ldc, work, info)
DORM2R multiplies a general matrix by the orthogonal matrix from a QR factorization determined by sge...
Definition dorm2r.f:159
subroutine dormqr(side, trans, m, n, k, a, lda, tau, c, ldc, work, lwork, info)
DORMQR
Definition dormqr.f:167