LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches
zerrls.f
Go to the documentation of this file.
1*> \brief \b ZERRLS
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 ZERRLS( 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*> ZERRLS tests the error exits for the COMPLEX*16 least squares
25*> driver routines (ZGELS, ZGELST, ZGETSLS, CGELSS, CGELSY, CGELSD).
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 complex16_lin
52*
53* =====================================================================
54 SUBROUTINE zerrls( 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 CHARACTER*2 C2
73 INTEGER INFO, IRNK
74 DOUBLE PRECISION RCOND
75* ..
76* .. Local Arrays ..
77 INTEGER IP( NMAX )
78 DOUBLE PRECISION RW( NMAX ), S( NMAX )
79 COMPLEX*16 A( NMAX, NMAX ), B( NMAX, NMAX ), W( NMAX )
80* ..
81* .. External Functions ..
82 LOGICAL LSAMEN
83 EXTERNAL lsamen
84* ..
85* .. External Subroutines ..
86 EXTERNAL alaesm, chkxer, zgels, zgelsd, zgelss, zgelst,
87 $ zgelsy, zgetsls
88* ..
89* .. Scalars in Common ..
90 LOGICAL LERR, OK
91 CHARACTER*32 SRNAMT
92 INTEGER INFOT, NOUT
93* ..
94* .. Common blocks ..
95 COMMON / infoc / infot, nout, ok, lerr
96 COMMON / srnamc / srnamt
97* ..
98* .. Executable Statements ..
99*
100 nout = nunit
101 c2 = path( 2: 3 )
102 a( 1, 1 ) = ( 1.0d+0, 0.0d+0 )
103 a( 1, 2 ) = ( 2.0d+0, 0.0d+0 )
104 a( 2, 2 ) = ( 3.0d+0, 0.0d+0 )
105 a( 2, 1 ) = ( 4.0d+0, 0.0d+0 )
106 ok = .true.
107 WRITE( nout, fmt = * )
108*
109* Test error exits for the least squares driver routines.
110*
111 IF( lsamen( 2, c2, 'LS' ) ) THEN
112*
113* ZGELS
114*
115 srnamt = 'ZGELS '
116 infot = 1
117 CALL zgels( '/', 0, 0, 0, a, 1, b, 1, w, 1, info )
118 CALL chkxer( 'ZGELS ', infot, nout, lerr, ok )
119 infot = 2
120 CALL zgels( 'N', -1, 0, 0, a, 1, b, 1, w, 1, info )
121 CALL chkxer( 'ZGELS ', infot, nout, lerr, ok )
122 infot = 3
123 CALL zgels( 'N', 0, -1, 0, a, 1, b, 1, w, 1, info )
124 CALL chkxer( 'ZGELS ', infot, nout, lerr, ok )
125 infot = 4
126 CALL zgels( 'N', 0, 0, -1, a, 1, b, 1, w, 1, info )
127 CALL chkxer( 'ZGELS ', infot, nout, lerr, ok )
128 infot = 6
129 CALL zgels( 'N', 2, 0, 0, a, 1, b, 2, w, 2, info )
130 CALL chkxer( 'ZGELS ', infot, nout, lerr, ok )
131 infot = 8
132 CALL zgels( 'N', 2, 0, 0, a, 2, b, 1, w, 2, info )
133 CALL chkxer( 'ZGELS ', infot, nout, lerr, ok )
134 infot = 8
135 CALL zgels( 'N', 0, 2, 0, a, 1, b, 1, w, 2, info )
136 CALL chkxer( 'ZGELS', infot, nout, lerr, ok )
137 infot = 10
138 CALL zgels( 'N', 1, 1, 0, a, 1, b, 1, w, 1, info )
139 CALL chkxer( 'ZGELS ', infot, nout, lerr, ok )
140*
141* ZGELST
142*
143 srnamt = 'ZGELST'
144 infot = 1
145 CALL zgelst( '/', 0, 0, 0, a, 1, b, 1, w, 1, info )
146 CALL chkxer( 'ZGELST', infot, nout, lerr, ok )
147 infot = 2
148 CALL zgelst( 'N', -1, 0, 0, a, 1, b, 1, w, 1, info )
149 CALL chkxer( 'ZGELST', infot, nout, lerr, ok )
150 infot = 3
151 CALL zgelst( 'N', 0, -1, 0, a, 1, b, 1, w, 1, info )
152 CALL chkxer( 'ZGELST', infot, nout, lerr, ok )
153 infot = 4
154 CALL zgelst( 'N', 0, 0, -1, a, 1, b, 1, w, 1, info )
155 CALL chkxer( 'ZGELST', infot, nout, lerr, ok )
156 infot = 6
157 CALL zgelst( 'N', 2, 0, 0, a, 1, b, 2, w, 2, info )
158 CALL chkxer( 'ZGELST', infot, nout, lerr, ok )
159 infot = 8
160 CALL zgelst( 'N', 2, 0, 0, a, 2, b, 1, w, 2, info )
161 CALL chkxer( 'ZGELST', infot, nout, lerr, ok )
162 infot = 8
163 CALL zgelst( 'N', 0, 2, 0, a, 1, b, 1, w, 2, info )
164 CALL chkxer( 'ZGELST', infot, nout, lerr, ok )
165 infot = 10
166 CALL zgelst( 'N', 1, 1, 0, a, 1, b, 1, w, 1, info )
167 CALL chkxer( 'ZGELST', infot, nout, lerr, ok )
168*
169* ZGETSLS
170*
171 srnamt = 'ZGETSLS'
172 infot = 1
173 CALL zgetsls( '/', 0, 0, 0, a, 1, b, 1, w, 1, info )
174 CALL chkxer( 'ZGETSLS', infot, nout, lerr, ok )
175 infot = 2
176 CALL zgetsls( 'N', -1, 0, 0, a, 1, b, 1, w, 1, info )
177 CALL chkxer( 'ZGETSLS', infot, nout, lerr, ok )
178 infot = 3
179 CALL zgetsls( 'N', 0, -1, 0, a, 1, b, 1, w, 1, info )
180 CALL chkxer( 'ZGETSLS', infot, nout, lerr, ok )
181 infot = 4
182 CALL zgetsls( 'N', 0, 0, -1, a, 1, b, 1, w, 1, info )
183 CALL chkxer( 'ZGETSLS', infot, nout, lerr, ok )
184 infot = 6
185 CALL zgetsls( 'N', 2, 0, 0, a, 1, b, 2, w, 2, info )
186 CALL chkxer( 'ZGETSLS', infot, nout, lerr, ok )
187 infot = 8
188 CALL zgetsls( 'N', 2, 0, 0, a, 2, b, 1, w, 2, info )
189 CALL chkxer( 'ZGETSLS', infot, nout, lerr, ok )
190 infot = 8
191 CALL zgetsls( 'N', 0, 2, 0, a, 1, b, 1, w, 2, info )
192 CALL chkxer( 'ZGETSLS', infot, nout, lerr, ok )
193*
194* ZGELSS
195*
196 srnamt = 'ZGELSS'
197 infot = 1
198 CALL zgelss( -1, 0, 0, a, 1, b, 1, s, rcond, irnk, w, 1, rw,
199 $ info )
200 CALL chkxer( 'ZGELSS', infot, nout, lerr, ok )
201 infot = 2
202 CALL zgelss( 0, -1, 0, a, 1, b, 1, s, rcond, irnk, w, 1, rw,
203 $ info )
204 CALL chkxer( 'ZGELSS', infot, nout, lerr, ok )
205 infot = 3
206 CALL zgelss( 0, 0, -1, a, 1, b, 1, s, rcond, irnk, w, 1, rw,
207 $ info )
208 CALL chkxer( 'ZGELSS', infot, nout, lerr, ok )
209 infot = 5
210 CALL zgelss( 2, 0, 0, a, 1, b, 2, s, rcond, irnk, w, 2, rw,
211 $ info )
212 CALL chkxer( 'ZGELSS', infot, nout, lerr, ok )
213 infot = 7
214 CALL zgelss( 2, 0, 0, a, 2, b, 1, s, rcond, irnk, w, 2, rw,
215 $ info )
216 CALL chkxer( 'ZGELSS', infot, nout, lerr, ok )
217*
218* ZGELSY
219*
220 srnamt = 'ZGELSY'
221 infot = 1
222 CALL zgelsy( -1, 0, 0, a, 1, b, 1, ip, rcond, irnk, w, 10, rw,
223 $ info )
224 CALL chkxer( 'ZGELSY', infot, nout, lerr, ok )
225 infot = 2
226 CALL zgelsy( 0, -1, 0, a, 1, b, 1, ip, rcond, irnk, w, 10, rw,
227 $ info )
228 CALL chkxer( 'ZGELSY', infot, nout, lerr, ok )
229 infot = 3
230 CALL zgelsy( 0, 0, -1, a, 1, b, 1, ip, rcond, irnk, w, 10, rw,
231 $ info )
232 CALL chkxer( 'ZGELSY', infot, nout, lerr, ok )
233 infot = 5
234 CALL zgelsy( 2, 0, 0, a, 1, b, 2, ip, rcond, irnk, w, 10, rw,
235 $ info )
236 CALL chkxer( 'ZGELSY', infot, nout, lerr, ok )
237 infot = 7
238 CALL zgelsy( 2, 0, 0, a, 2, b, 1, ip, rcond, irnk, w, 10, rw,
239 $ info )
240 CALL chkxer( 'ZGELSY', infot, nout, lerr, ok )
241 infot = 12
242 CALL zgelsy( 0, 3, 0, a, 1, b, 3, ip, rcond, irnk, w, 1, rw,
243 $ info )
244 CALL chkxer( 'ZGELSY', infot, nout, lerr, ok )
245*
246* ZGELSD
247*
248 srnamt = 'ZGELSD'
249 infot = 1
250 CALL zgelsd( -1, 0, 0, a, 1, b, 1, s, rcond, irnk, w, 10, rw,
251 $ ip, info )
252 CALL chkxer( 'ZGELSD', infot, nout, lerr, ok )
253 infot = 2
254 CALL zgelsd( 0, -1, 0, a, 1, b, 1, s, rcond, irnk, w, 10, rw,
255 $ ip, info )
256 CALL chkxer( 'ZGELSD', infot, nout, lerr, ok )
257 infot = 3
258 CALL zgelsd( 0, 0, -1, a, 1, b, 1, s, rcond, irnk, w, 10, rw,
259 $ ip, info )
260 CALL chkxer( 'ZGELSD', infot, nout, lerr, ok )
261 infot = 5
262 CALL zgelsd( 2, 0, 0, a, 1, b, 2, s, rcond, irnk, w, 10, rw,
263 $ ip, info )
264 CALL chkxer( 'ZGELSD', infot, nout, lerr, ok )
265 infot = 7
266 CALL zgelsd( 2, 0, 0, a, 2, b, 1, s, rcond, irnk, w, 10, rw,
267 $ ip, info )
268 CALL chkxer( 'ZGELSD', infot, nout, lerr, ok )
269 infot = 12
270 CALL zgelsd( 2, 2, 1, a, 2, b, 2, s, rcond, irnk, w, 1, rw, ip,
271 $ info )
272 CALL chkxer( 'ZGELSD', infot, nout, lerr, ok )
273 END IF
274*
275* Print a summary line.
276*
277 CALL alaesm( path, ok, nout )
278*
279 RETURN
280*
281* End of ZERRLS
282*
283 END
chkxer
subroutine chkxer(SRNAMT, INFOT, NOUT, LERR, OK)
Definition: cblat2.f:3224
alaesm
subroutine alaesm(PATH, OK, NOUT)
ALAESM
Definition: alaesm.f:63
zerrls
subroutine zerrls(PATH, NUNIT)
ZERRLS
Definition: zerrls.f:55
zgels
subroutine zgels(TRANS, M, N, NRHS, A, LDA, B, LDB, WORK, LWORK, INFO)
ZGELS solves overdetermined or underdetermined systems for GE matrices
Definition: zgels.f:182
zgetsls
subroutine zgetsls(TRANS, M, N, NRHS, A, LDA, B, LDB, WORK, LWORK, INFO)
ZGETSLS
Definition: zgetsls.f:162
zgelss
subroutine zgelss(M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK, WORK, LWORK, RWORK, INFO)
ZGELSS solves overdetermined or underdetermined systems for GE matrices
Definition: zgelss.f:178
zgelst
subroutine zgelst(TRANS, M, N, NRHS, A, LDA, B, LDB, WORK, LWORK, INFO)
ZGELST solves overdetermined or underdetermined systems for GE matrices using QR or LQ factorization ...
Definition: zgelst.f:194
zgelsy
subroutine zgelsy(M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK, WORK, LWORK, RWORK, INFO)
ZGELSY solves overdetermined or underdetermined systems for GE matrices
Definition: zgelsy.f:210
zgelsd
subroutine zgelsd(M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK, WORK, LWORK, RWORK, IWORK, INFO)
ZGELSD computes the minimum-norm solution to a linear least squares problem for GE matrices
Definition: zgelsd.f:225