LAPACK 3.12.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches
serrql.f
Go to the documentation of this file.
1*> \brief \b SERRQL
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 SERRQL( 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*> SERRQL tests the error exits for the REAL routines
25*> that use the QL 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 single_lin
52*
53* =====================================================================
54 SUBROUTINE serrql( 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 REAL A( NMAX, NMAX ), AF( NMAX, NMAX ), B( NMAX ),
76 $ W( NMAX ), X( NMAX )
77* ..
78* .. External Subroutines ..
79 EXTERNAL alaesm, chkxer, sgeql2, sgeqlf, sgeqls, sorg2l,
80 $ sorgql, sorm2l, sormql
81* ..
82* .. Scalars in Common ..
83 LOGICAL LERR, OK
84 CHARACTER*32 SRNAMT
85 INTEGER INFOT, NOUT
86* ..
87* .. Common blocks ..
88 COMMON / infoc / infot, nout, ok, lerr
89 COMMON / srnamc / srnamt
90* ..
91* .. Intrinsic Functions ..
92 INTRINSIC real
93* ..
94* .. Executable Statements ..
95*
96 nout = nunit
97 WRITE( nout, fmt = * )
98*
99* Set the variables to innocuous values.
100*
101 DO 20 j = 1, nmax
102 DO 10 i = 1, nmax
103 a( i, j ) = 1. / real( i+j )
104 af( i, j ) = 1. / real( i+j )
105 10 CONTINUE
106 b( j ) = 0.
107 w( j ) = 0.
108 x( j ) = 0.
109 20 CONTINUE
110 ok = .true.
111*
112* Error exits for QL factorization
113*
114* SGEQLF
115*
116 srnamt = 'SGEQLF'
117 infot = 1
118 CALL sgeqlf( -1, 0, a, 1, b, w, 1, info )
119 CALL chkxer( 'SGEQLF', infot, nout, lerr, ok )
120 infot = 2
121 CALL sgeqlf( 0, -1, a, 1, b, w, 1, info )
122 CALL chkxer( 'SGEQLF', infot, nout, lerr, ok )
123 infot = 4
124 CALL sgeqlf( 2, 1, a, 1, b, w, 1, info )
125 CALL chkxer( 'SGEQLF', infot, nout, lerr, ok )
126 infot = 7
127 CALL sgeqlf( 1, 2, a, 1, b, w, 1, info )
128 CALL chkxer( 'SGEQLF', infot, nout, lerr, ok )
129*
130* SGEQL2
131*
132 srnamt = 'SGEQL2'
133 infot = 1
134 CALL sgeql2( -1, 0, a, 1, b, w, info )
135 CALL chkxer( 'SGEQL2', infot, nout, lerr, ok )
136 infot = 2
137 CALL sgeql2( 0, -1, a, 1, b, w, info )
138 CALL chkxer( 'SGEQL2', infot, nout, lerr, ok )
139 infot = 4
140 CALL sgeql2( 2, 1, a, 1, b, w, info )
141 CALL chkxer( 'SGEQL2', infot, nout, lerr, ok )
142*
143* SGEQLS
144*
145 srnamt = 'SGEQLS'
146 infot = 1
147 CALL sgeqls( -1, 0, 0, a, 1, x, b, 1, w, 1, info )
148 CALL chkxer( 'SGEQLS', infot, nout, lerr, ok )
149 infot = 2
150 CALL sgeqls( 0, -1, 0, a, 1, x, b, 1, w, 1, info )
151 CALL chkxer( 'SGEQLS', infot, nout, lerr, ok )
152 infot = 2
153 CALL sgeqls( 1, 2, 0, a, 1, x, b, 1, w, 1, info )
154 CALL chkxer( 'SGEQLS', infot, nout, lerr, ok )
155 infot = 3
156 CALL sgeqls( 0, 0, -1, a, 1, x, b, 1, w, 1, info )
157 CALL chkxer( 'SGEQLS', infot, nout, lerr, ok )
158 infot = 5
159 CALL sgeqls( 2, 1, 0, a, 1, x, b, 2, w, 1, info )
160 CALL chkxer( 'SGEQLS', infot, nout, lerr, ok )
161 infot = 8
162 CALL sgeqls( 2, 1, 0, a, 2, x, b, 1, w, 1, info )
163 CALL chkxer( 'SGEQLS', infot, nout, lerr, ok )
164 infot = 10
165 CALL sgeqls( 1, 1, 2, a, 1, x, b, 1, w, 1, info )
166 CALL chkxer( 'SGEQLS', infot, nout, lerr, ok )
167*
168* SORGQL
169*
170 srnamt = 'SORGQL'
171 infot = 1
172 CALL sorgql( -1, 0, 0, a, 1, x, w, 1, info )
173 CALL chkxer( 'SORGQL', infot, nout, lerr, ok )
174 infot = 2
175 CALL sorgql( 0, -1, 0, a, 1, x, w, 1, info )
176 CALL chkxer( 'SORGQL', infot, nout, lerr, ok )
177 infot = 2
178 CALL sorgql( 1, 2, 0, a, 1, x, w, 2, info )
179 CALL chkxer( 'SORGQL', infot, nout, lerr, ok )
180 infot = 3
181 CALL sorgql( 0, 0, -1, a, 1, x, w, 1, info )
182 CALL chkxer( 'SORGQL', infot, nout, lerr, ok )
183 infot = 3
184 CALL sorgql( 1, 1, 2, a, 1, x, w, 1, info )
185 CALL chkxer( 'SORGQL', infot, nout, lerr, ok )
186 infot = 5
187 CALL sorgql( 2, 1, 0, a, 1, x, w, 1, info )
188 CALL chkxer( 'SORGQL', infot, nout, lerr, ok )
189 infot = 8
190 CALL sorgql( 2, 2, 0, a, 2, x, w, 1, info )
191 CALL chkxer( 'SORGQL', infot, nout, lerr, ok )
192*
193* SORG2L
194*
195 srnamt = 'SORG2L'
196 infot = 1
197 CALL sorg2l( -1, 0, 0, a, 1, x, w, info )
198 CALL chkxer( 'SORG2L', infot, nout, lerr, ok )
199 infot = 2
200 CALL sorg2l( 0, -1, 0, a, 1, x, w, info )
201 CALL chkxer( 'SORG2L', infot, nout, lerr, ok )
202 infot = 2
203 CALL sorg2l( 1, 2, 0, a, 1, x, w, info )
204 CALL chkxer( 'SORG2L', infot, nout, lerr, ok )
205 infot = 3
206 CALL sorg2l( 0, 0, -1, a, 1, x, w, info )
207 CALL chkxer( 'SORG2L', infot, nout, lerr, ok )
208 infot = 3
209 CALL sorg2l( 2, 1, 2, a, 2, x, w, info )
210 CALL chkxer( 'SORG2L', infot, nout, lerr, ok )
211 infot = 5
212 CALL sorg2l( 2, 1, 0, a, 1, x, w, info )
213 CALL chkxer( 'SORG2L', infot, nout, lerr, ok )
214*
215* SORMQL
216*
217 srnamt = 'SORMQL'
218 infot = 1
219 CALL sormql( '/', 'N', 0, 0, 0, a, 1, x, af, 1, w, 1, info )
220 CALL chkxer( 'SORMQL', infot, nout, lerr, ok )
221 infot = 2
222 CALL sormql( 'L', '/', 0, 0, 0, a, 1, x, af, 1, w, 1, info )
223 CALL chkxer( 'SORMQL', infot, nout, lerr, ok )
224 infot = 3
225 CALL sormql( 'L', 'N', -1, 0, 0, a, 1, x, af, 1, w, 1, info )
226 CALL chkxer( 'SORMQL', infot, nout, lerr, ok )
227 infot = 4
228 CALL sormql( 'L', 'N', 0, -1, 0, a, 1, x, af, 1, w, 1, info )
229 CALL chkxer( 'SORMQL', infot, nout, lerr, ok )
230 infot = 5
231 CALL sormql( 'L', 'N', 0, 0, -1, a, 1, x, af, 1, w, 1, info )
232 CALL chkxer( 'SORMQL', infot, nout, lerr, ok )
233 infot = 5
234 CALL sormql( 'L', 'N', 0, 1, 1, a, 1, x, af, 1, w, 1, info )
235 CALL chkxer( 'SORMQL', infot, nout, lerr, ok )
236 infot = 5
237 CALL sormql( 'R', 'N', 1, 0, 1, a, 1, x, af, 1, w, 1, info )
238 CALL chkxer( 'SORMQL', infot, nout, lerr, ok )
239 infot = 7
240 CALL sormql( 'L', 'N', 2, 1, 0, a, 1, x, af, 2, w, 1, info )
241 CALL chkxer( 'SORMQL', infot, nout, lerr, ok )
242 infot = 7
243 CALL sormql( 'R', 'N', 1, 2, 0, a, 1, x, af, 1, w, 1, info )
244 CALL chkxer( 'SORMQL', infot, nout, lerr, ok )
245 infot = 10
246 CALL sormql( 'L', 'N', 2, 1, 0, a, 2, x, af, 1, w, 1, info )
247 CALL chkxer( 'SORMQL', infot, nout, lerr, ok )
248 infot = 12
249 CALL sormql( 'L', 'N', 1, 2, 0, a, 1, x, af, 1, w, 1, info )
250 CALL chkxer( 'SORMQL', infot, nout, lerr, ok )
251 infot = 12
252 CALL sormql( 'R', 'N', 2, 1, 0, a, 1, x, af, 2, w, 1, info )
253 CALL chkxer( 'SORMQL', infot, nout, lerr, ok )
254*
255* SORM2L
256*
257 srnamt = 'SORM2L'
258 infot = 1
259 CALL sorm2l( '/', 'N', 0, 0, 0, a, 1, x, af, 1, w, info )
260 CALL chkxer( 'SORM2L', infot, nout, lerr, ok )
261 infot = 2
262 CALL sorm2l( 'L', '/', 0, 0, 0, a, 1, x, af, 1, w, info )
263 CALL chkxer( 'SORM2L', infot, nout, lerr, ok )
264 infot = 3
265 CALL sorm2l( 'L', 'N', -1, 0, 0, a, 1, x, af, 1, w, info )
266 CALL chkxer( 'SORM2L', infot, nout, lerr, ok )
267 infot = 4
268 CALL sorm2l( 'L', 'N', 0, -1, 0, a, 1, x, af, 1, w, info )
269 CALL chkxer( 'SORM2L', infot, nout, lerr, ok )
270 infot = 5
271 CALL sorm2l( 'L', 'N', 0, 0, -1, a, 1, x, af, 1, w, info )
272 CALL chkxer( 'SORM2L', infot, nout, lerr, ok )
273 infot = 5
274 CALL sorm2l( 'L', 'N', 0, 1, 1, a, 1, x, af, 1, w, info )
275 CALL chkxer( 'SORM2L', infot, nout, lerr, ok )
276 infot = 5
277 CALL sorm2l( 'R', 'N', 1, 0, 1, a, 1, x, af, 1, w, info )
278 CALL chkxer( 'SORM2L', infot, nout, lerr, ok )
279 infot = 7
280 CALL sorm2l( 'L', 'N', 2, 1, 0, a, 1, x, af, 2, w, info )
281 CALL chkxer( 'SORM2L', infot, nout, lerr, ok )
282 infot = 7
283 CALL sorm2l( 'R', 'N', 1, 2, 0, a, 1, x, af, 1, w, info )
284 CALL chkxer( 'SORM2L', infot, nout, lerr, ok )
285 infot = 10
286 CALL sorm2l( 'L', 'N', 2, 1, 0, a, 2, x, af, 1, w, info )
287 CALL chkxer( 'SORM2L', infot, nout, lerr, ok )
288*
289* Print a summary line.
290*
291 CALL alaesm( path, ok, nout )
292*
293 RETURN
294*
295* End of SERRQL
296*
297 END
alaesm
subroutine alaesm(path, ok, nout)
ALAESM
Definition alaesm.f:63
chkxer
subroutine chkxer(srnamt, infot, nout, lerr, ok)
Definition cblat2.f:3224
sgeql2
subroutine sgeql2(m, n, a, lda, tau, work, info)
SGEQL2 computes the QL factorization of a general rectangular matrix using an unblocked algorithm.
Definition sgeql2.f:123
sgeqlf
subroutine sgeqlf(m, n, a, lda, tau, work, lwork, info)
SGEQLF
Definition sgeqlf.f:138
sorg2l
subroutine sorg2l(m, n, k, a, lda, tau, work, info)
SORG2L generates all or part of the orthogonal matrix Q from a QL factorization determined by sgeqlf ...
Definition sorg2l.f:114
sorgql
subroutine sorgql(m, n, k, a, lda, tau, work, lwork, info)
SORGQL
Definition sorgql.f:128
sorm2l
subroutine sorm2l(side, trans, m, n, k, a, lda, tau, c, ldc, work, info)
SORM2L multiplies a general matrix by the orthogonal matrix from a QL factorization determined by sge...
Definition sorm2l.f:159
sormql
subroutine sormql(side, trans, m, n, k, a, lda, tau, c, ldc, work, lwork, info)
SORMQL
Definition sormql.f:168
serrql
subroutine serrql(path, nunit)
SERRQL
Definition serrql.f:55
sgeqls
subroutine sgeqls(m, n, nrhs, a, lda, tau, b, ldb, work, lwork, info)
SGEQLS
Definition sgeqls.f:122