LAPACK  3.10.1
LAPACK: Linear Algebra PACKage
cerrtr.f
Go to the documentation of this file.
1 *> \brief \b CERRTR
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 CERRTR( 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 *> CERRTR tests the error exits for the COMPLEX triangular routines.
25 *> \endverbatim
26 *
27 * Arguments:
28 * ==========
29 *
30 *> \param[in] PATH
31 *> \verbatim
32 *> PATH is CHARACTER*3
33 *> The LAPACK path name for the routines to be tested.
34 *> \endverbatim
35 *>
36 *> \param[in] NUNIT
37 *> \verbatim
38 *> NUNIT is INTEGER
39 *> The unit number for output.
40 *> \endverbatim
41 *
42 * Authors:
43 * ========
44 *
45 *> \author Univ. of Tennessee
46 *> \author Univ. of California Berkeley
47 *> \author Univ. of Colorado Denver
48 *> \author NAG Ltd.
49 *
50 *> \ingroup complex_lin
51 *
52 * =====================================================================
53  SUBROUTINE cerrtr( PATH, NUNIT )
54 *
55 * -- LAPACK test routine --
56 * -- LAPACK is a software package provided by Univ. of Tennessee, --
57 * -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
58 *
59 * .. Scalar Arguments ..
60  CHARACTER*3 PATH
61  INTEGER NUNIT
62 * ..
63 *
64 * =====================================================================
65 *
66 * .. Parameters ..
67  INTEGER NMAX
68  parameter( nmax = 2 )
69 * ..
70 * .. Local Scalars ..
71  CHARACTER*2 C2
72  INTEGER INFO
73  REAL RCOND, SCALE
74 * ..
75 * .. Local Arrays ..
76  REAL R1( NMAX ), R2( NMAX ), RW( NMAX )
77  COMPLEX A( NMAX, NMAX ), B( NMAX ), W( NMAX ),
78  $ X( NMAX )
79 * ..
80 * .. External Functions ..
81  LOGICAL LSAMEN
82  EXTERNAL lsamen
83 * ..
84 * .. External Subroutines ..
85  EXTERNAL alaesm, chkxer, clatbs, clatps, clatrs, ctbcon,
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  WRITE( nout, fmt = * )
102  c2 = path( 2: 3 )
103  a( 1, 1 ) = 1.
104  a( 1, 2 ) = 2.
105  a( 2, 2 ) = 3.
106  a( 2, 1 ) = 4.
107  ok = .true.
108 *
109 * Test error exits for the general triangular routines.
110 *
111  IF( lsamen( 2, c2, 'TR' ) ) THEN
112 *
113 * CTRTRI
114 *
115  srnamt = 'CTRTRI'
116  infot = 1
117  CALL ctrtri( '/', 'N', 0, a, 1, info )
118  CALL chkxer( 'CTRTRI', infot, nout, lerr, ok )
119  infot = 2
120  CALL ctrtri( 'U', '/', 0, a, 1, info )
121  CALL chkxer( 'CTRTRI', infot, nout, lerr, ok )
122  infot = 3
123  CALL ctrtri( 'U', 'N', -1, a, 1, info )
124  CALL chkxer( 'CTRTRI', infot, nout, lerr, ok )
125  infot = 5
126  CALL ctrtri( 'U', 'N', 2, a, 1, info )
127  CALL chkxer( 'CTRTRI', infot, nout, lerr, ok )
128 *
129 * CTRTI2
130 *
131  srnamt = 'CTRTI2'
132  infot = 1
133  CALL ctrti2( '/', 'N', 0, a, 1, info )
134  CALL chkxer( 'CTRTI2', infot, nout, lerr, ok )
135  infot = 2
136  CALL ctrti2( 'U', '/', 0, a, 1, info )
137  CALL chkxer( 'CTRTI2', infot, nout, lerr, ok )
138  infot = 3
139  CALL ctrti2( 'U', 'N', -1, a, 1, info )
140  CALL chkxer( 'CTRTI2', infot, nout, lerr, ok )
141  infot = 5
142  CALL ctrti2( 'U', 'N', 2, a, 1, info )
143  CALL chkxer( 'CTRTI2', infot, nout, lerr, ok )
144 *
145 *
146 * CTRTRS
147 *
148  srnamt = 'CTRTRS'
149  infot = 1
150  CALL ctrtrs( '/', 'N', 'N', 0, 0, a, 1, x, 1, info )
151  CALL chkxer( 'CTRTRS', infot, nout, lerr, ok )
152  infot = 2
153  CALL ctrtrs( 'U', '/', 'N', 0, 0, a, 1, x, 1, info )
154  CALL chkxer( 'CTRTRS', infot, nout, lerr, ok )
155  infot = 3
156  CALL ctrtrs( 'U', 'N', '/', 0, 0, a, 1, x, 1, info )
157  CALL chkxer( 'CTRTRS', infot, nout, lerr, ok )
158  infot = 4
159  CALL ctrtrs( 'U', 'N', 'N', -1, 0, a, 1, x, 1, info )
160  CALL chkxer( 'CTRTRS', infot, nout, lerr, ok )
161  infot = 5
162  CALL ctrtrs( 'U', 'N', 'N', 0, -1, a, 1, x, 1, info )
163  CALL chkxer( 'CTRTRS', infot, nout, lerr, ok )
164  infot = 7
165 *
166 * CTRRFS
167 *
168  srnamt = 'CTRRFS'
169  infot = 1
170  CALL ctrrfs( '/', 'N', 'N', 0, 0, a, 1, b, 1, x, 1, r1, r2, w,
171  $ rw, info )
172  CALL chkxer( 'CTRRFS', infot, nout, lerr, ok )
173  infot = 2
174  CALL ctrrfs( 'U', '/', 'N', 0, 0, a, 1, b, 1, x, 1, r1, r2, w,
175  $ rw, info )
176  CALL chkxer( 'CTRRFS', infot, nout, lerr, ok )
177  infot = 3
178  CALL ctrrfs( 'U', 'N', '/', 0, 0, a, 1, b, 1, x, 1, r1, r2, w,
179  $ rw, info )
180  CALL chkxer( 'CTRRFS', infot, nout, lerr, ok )
181  infot = 4
182  CALL ctrrfs( 'U', 'N', 'N', -1, 0, a, 1, b, 1, x, 1, r1, r2, w,
183  $ rw, info )
184  CALL chkxer( 'CTRRFS', infot, nout, lerr, ok )
185  infot = 5
186  CALL ctrrfs( 'U', 'N', 'N', 0, -1, a, 1, b, 1, x, 1, r1, r2, w,
187  $ rw, info )
188  CALL chkxer( 'CTRRFS', infot, nout, lerr, ok )
189  infot = 7
190  CALL ctrrfs( 'U', 'N', 'N', 2, 1, a, 1, b, 2, x, 2, r1, r2, w,
191  $ rw, info )
192  CALL chkxer( 'CTRRFS', infot, nout, lerr, ok )
193  infot = 9
194  CALL ctrrfs( 'U', 'N', 'N', 2, 1, a, 2, b, 1, x, 2, r1, r2, w,
195  $ rw, info )
196  CALL chkxer( 'CTRRFS', infot, nout, lerr, ok )
197  infot = 11
198  CALL ctrrfs( 'U', 'N', 'N', 2, 1, a, 2, b, 2, x, 1, r1, r2, w,
199  $ rw, info )
200  CALL chkxer( 'CTRRFS', infot, nout, lerr, ok )
201 *
202 * CTRCON
203 *
204  srnamt = 'CTRCON'
205  infot = 1
206  CALL ctrcon( '/', 'U', 'N', 0, a, 1, rcond, w, rw, info )
207  CALL chkxer( 'CTRCON', infot, nout, lerr, ok )
208  infot = 2
209  CALL ctrcon( '1', '/', 'N', 0, a, 1, rcond, w, rw, info )
210  CALL chkxer( 'CTRCON', infot, nout, lerr, ok )
211  infot = 3
212  CALL ctrcon( '1', 'U', '/', 0, a, 1, rcond, w, rw, info )
213  CALL chkxer( 'CTRCON', infot, nout, lerr, ok )
214  infot = 4
215  CALL ctrcon( '1', 'U', 'N', -1, a, 1, rcond, w, rw, info )
216  CALL chkxer( 'CTRCON', infot, nout, lerr, ok )
217  infot = 6
218  CALL ctrcon( '1', 'U', 'N', 2, a, 1, rcond, w, rw, info )
219  CALL chkxer( 'CTRCON', infot, nout, lerr, ok )
220 *
221 * CLATRS
222 *
223  srnamt = 'CLATRS'
224  infot = 1
225  CALL clatrs( '/', 'N', 'N', 'N', 0, a, 1, x, scale, rw, info )
226  CALL chkxer( 'CLATRS', infot, nout, lerr, ok )
227  infot = 2
228  CALL clatrs( 'U', '/', 'N', 'N', 0, a, 1, x, scale, rw, info )
229  CALL chkxer( 'CLATRS', infot, nout, lerr, ok )
230  infot = 3
231  CALL clatrs( 'U', 'N', '/', 'N', 0, a, 1, x, scale, rw, info )
232  CALL chkxer( 'CLATRS', infot, nout, lerr, ok )
233  infot = 4
234  CALL clatrs( 'U', 'N', 'N', '/', 0, a, 1, x, scale, rw, info )
235  CALL chkxer( 'CLATRS', infot, nout, lerr, ok )
236  infot = 5
237  CALL clatrs( 'U', 'N', 'N', 'N', -1, a, 1, x, scale, rw, info )
238  CALL chkxer( 'CLATRS', infot, nout, lerr, ok )
239  infot = 7
240  CALL clatrs( 'U', 'N', 'N', 'N', 2, a, 1, x, scale, rw, info )
241  CALL chkxer( 'CLATRS', infot, nout, lerr, ok )
242 *
243 * Test error exits for the packed triangular routines.
244 *
245  ELSE IF( lsamen( 2, c2, 'TP' ) ) THEN
246 *
247 * CTPTRI
248 *
249  srnamt = 'CTPTRI'
250  infot = 1
251  CALL ctptri( '/', 'N', 0, a, info )
252  CALL chkxer( 'CTPTRI', infot, nout, lerr, ok )
253  infot = 2
254  CALL ctptri( 'U', '/', 0, a, info )
255  CALL chkxer( 'CTPTRI', infot, nout, lerr, ok )
256  infot = 3
257  CALL ctptri( 'U', 'N', -1, a, info )
258  CALL chkxer( 'CTPTRI', infot, nout, lerr, ok )
259 *
260 * CTPTRS
261 *
262  srnamt = 'CTPTRS'
263  infot = 1
264  CALL ctptrs( '/', 'N', 'N', 0, 0, a, x, 1, info )
265  CALL chkxer( 'CTPTRS', infot, nout, lerr, ok )
266  infot = 2
267  CALL ctptrs( 'U', '/', 'N', 0, 0, a, x, 1, info )
268  CALL chkxer( 'CTPTRS', infot, nout, lerr, ok )
269  infot = 3
270  CALL ctptrs( 'U', 'N', '/', 0, 0, a, x, 1, info )
271  CALL chkxer( 'CTPTRS', infot, nout, lerr, ok )
272  infot = 4
273  CALL ctptrs( 'U', 'N', 'N', -1, 0, a, x, 1, info )
274  CALL chkxer( 'CTPTRS', infot, nout, lerr, ok )
275  infot = 5
276  CALL ctptrs( 'U', 'N', 'N', 0, -1, a, x, 1, info )
277  CALL chkxer( 'CTPTRS', infot, nout, lerr, ok )
278  infot = 8
279  CALL ctptrs( 'U', 'N', 'N', 2, 1, a, x, 1, info )
280  CALL chkxer( 'CTPTRS', infot, nout, lerr, ok )
281 *
282 * CTPRFS
283 *
284  srnamt = 'CTPRFS'
285  infot = 1
286  CALL ctprfs( '/', 'N', 'N', 0, 0, a, b, 1, x, 1, r1, r2, w, rw,
287  $ info )
288  CALL chkxer( 'CTPRFS', infot, nout, lerr, ok )
289  infot = 2
290  CALL ctprfs( 'U', '/', 'N', 0, 0, a, b, 1, x, 1, r1, r2, w, rw,
291  $ info )
292  CALL chkxer( 'CTPRFS', infot, nout, lerr, ok )
293  infot = 3
294  CALL ctprfs( 'U', 'N', '/', 0, 0, a, b, 1, x, 1, r1, r2, w, rw,
295  $ info )
296  CALL chkxer( 'CTPRFS', infot, nout, lerr, ok )
297  infot = 4
298  CALL ctprfs( 'U', 'N', 'N', -1, 0, a, b, 1, x, 1, r1, r2, w,
299  $ rw, info )
300  CALL chkxer( 'CTPRFS', infot, nout, lerr, ok )
301  infot = 5
302  CALL ctprfs( 'U', 'N', 'N', 0, -1, a, b, 1, x, 1, r1, r2, w,
303  $ rw, info )
304  CALL chkxer( 'CTPRFS', infot, nout, lerr, ok )
305  infot = 8
306  CALL ctprfs( 'U', 'N', 'N', 2, 1, a, b, 1, x, 2, r1, r2, w, rw,
307  $ info )
308  CALL chkxer( 'CTPRFS', infot, nout, lerr, ok )
309  infot = 10
310  CALL ctprfs( 'U', 'N', 'N', 2, 1, a, b, 2, x, 1, r1, r2, w, rw,
311  $ info )
312  CALL chkxer( 'CTPRFS', infot, nout, lerr, ok )
313 *
314 * CTPCON
315 *
316  srnamt = 'CTPCON'
317  infot = 1
318  CALL ctpcon( '/', 'U', 'N', 0, a, rcond, w, rw, info )
319  CALL chkxer( 'CTPCON', infot, nout, lerr, ok )
320  infot = 2
321  CALL ctpcon( '1', '/', 'N', 0, a, rcond, w, rw, info )
322  CALL chkxer( 'CTPCON', infot, nout, lerr, ok )
323  infot = 3
324  CALL ctpcon( '1', 'U', '/', 0, a, rcond, w, rw, info )
325  CALL chkxer( 'CTPCON', infot, nout, lerr, ok )
326  infot = 4
327  CALL ctpcon( '1', 'U', 'N', -1, a, rcond, w, rw, info )
328  CALL chkxer( 'CTPCON', infot, nout, lerr, ok )
329 *
330 * CLATPS
331 *
332  srnamt = 'CLATPS'
333  infot = 1
334  CALL clatps( '/', 'N', 'N', 'N', 0, a, x, scale, rw, info )
335  CALL chkxer( 'CLATPS', infot, nout, lerr, ok )
336  infot = 2
337  CALL clatps( 'U', '/', 'N', 'N', 0, a, x, scale, rw, info )
338  CALL chkxer( 'CLATPS', infot, nout, lerr, ok )
339  infot = 3
340  CALL clatps( 'U', 'N', '/', 'N', 0, a, x, scale, rw, info )
341  CALL chkxer( 'CLATPS', infot, nout, lerr, ok )
342  infot = 4
343  CALL clatps( 'U', 'N', 'N', '/', 0, a, x, scale, rw, info )
344  CALL chkxer( 'CLATPS', infot, nout, lerr, ok )
345  infot = 5
346  CALL clatps( 'U', 'N', 'N', 'N', -1, a, x, scale, rw, info )
347  CALL chkxer( 'CLATPS', infot, nout, lerr, ok )
348 *
349 * Test error exits for the banded triangular routines.
350 *
351  ELSE IF( lsamen( 2, c2, 'TB' ) ) THEN
352 *
353 * CTBTRS
354 *
355  srnamt = 'CTBTRS'
356  infot = 1
357  CALL ctbtrs( '/', 'N', 'N', 0, 0, 0, a, 1, x, 1, info )
358  CALL chkxer( 'CTBTRS', infot, nout, lerr, ok )
359  infot = 2
360  CALL ctbtrs( 'U', '/', 'N', 0, 0, 0, a, 1, x, 1, info )
361  CALL chkxer( 'CTBTRS', infot, nout, lerr, ok )
362  infot = 3
363  CALL ctbtrs( 'U', 'N', '/', 0, 0, 0, a, 1, x, 1, info )
364  CALL chkxer( 'CTBTRS', infot, nout, lerr, ok )
365  infot = 4
366  CALL ctbtrs( 'U', 'N', 'N', -1, 0, 0, a, 1, x, 1, info )
367  CALL chkxer( 'CTBTRS', infot, nout, lerr, ok )
368  infot = 5
369  CALL ctbtrs( 'U', 'N', 'N', 0, -1, 0, a, 1, x, 1, info )
370  CALL chkxer( 'CTBTRS', infot, nout, lerr, ok )
371  infot = 6
372  CALL ctbtrs( 'U', 'N', 'N', 0, 0, -1, a, 1, x, 1, info )
373  CALL chkxer( 'CTBTRS', infot, nout, lerr, ok )
374  infot = 8
375  CALL ctbtrs( 'U', 'N', 'N', 2, 1, 1, a, 1, x, 2, info )
376  CALL chkxer( 'CTBTRS', infot, nout, lerr, ok )
377  infot = 10
378  CALL ctbtrs( 'U', 'N', 'N', 2, 0, 1, a, 1, x, 1, info )
379  CALL chkxer( 'CTBTRS', infot, nout, lerr, ok )
380 *
381 * CTBRFS
382 *
383  srnamt = 'CTBRFS'
384  infot = 1
385  CALL ctbrfs( '/', 'N', 'N', 0, 0, 0, a, 1, b, 1, x, 1, r1, r2,
386  $ w, rw, info )
387  CALL chkxer( 'CTBRFS', infot, nout, lerr, ok )
388  infot = 2
389  CALL ctbrfs( 'U', '/', 'N', 0, 0, 0, a, 1, b, 1, x, 1, r1, r2,
390  $ w, rw, info )
391  CALL chkxer( 'CTBRFS', infot, nout, lerr, ok )
392  infot = 3
393  CALL ctbrfs( 'U', 'N', '/', 0, 0, 0, a, 1, b, 1, x, 1, r1, r2,
394  $ w, rw, info )
395  CALL chkxer( 'CTBRFS', infot, nout, lerr, ok )
396  infot = 4
397  CALL ctbrfs( 'U', 'N', 'N', -1, 0, 0, a, 1, b, 1, x, 1, r1, r2,
398  $ w, rw, info )
399  CALL chkxer( 'CTBRFS', infot, nout, lerr, ok )
400  infot = 5
401  CALL ctbrfs( 'U', 'N', 'N', 0, -1, 0, a, 1, b, 1, x, 1, r1, r2,
402  $ w, rw, info )
403  CALL chkxer( 'CTBRFS', infot, nout, lerr, ok )
404  infot = 6
405  CALL ctbrfs( 'U', 'N', 'N', 0, 0, -1, a, 1, b, 1, x, 1, r1, r2,
406  $ w, rw, info )
407  CALL chkxer( 'CTBRFS', infot, nout, lerr, ok )
408  infot = 8
409  CALL ctbrfs( 'U', 'N', 'N', 2, 1, 1, a, 1, b, 2, x, 2, r1, r2,
410  $ w, rw, info )
411  CALL chkxer( 'CTBRFS', infot, nout, lerr, ok )
412  infot = 10
413  CALL ctbrfs( 'U', 'N', 'N', 2, 1, 1, a, 2, b, 1, x, 2, r1, r2,
414  $ w, rw, info )
415  CALL chkxer( 'CTBRFS', infot, nout, lerr, ok )
416  infot = 12
417  CALL ctbrfs( 'U', 'N', 'N', 2, 1, 1, a, 2, b, 2, x, 1, r1, r2,
418  $ w, rw, info )
419  CALL chkxer( 'CTBRFS', infot, nout, lerr, ok )
420 *
421 * CTBCON
422 *
423  srnamt = 'CTBCON'
424  infot = 1
425  CALL ctbcon( '/', 'U', 'N', 0, 0, a, 1, rcond, w, rw, info )
426  CALL chkxer( 'CTBCON', infot, nout, lerr, ok )
427  infot = 2
428  CALL ctbcon( '1', '/', 'N', 0, 0, a, 1, rcond, w, rw, info )
429  CALL chkxer( 'CTBCON', infot, nout, lerr, ok )
430  infot = 3
431  CALL ctbcon( '1', 'U', '/', 0, 0, a, 1, rcond, w, rw, info )
432  CALL chkxer( 'CTBCON', infot, nout, lerr, ok )
433  infot = 4
434  CALL ctbcon( '1', 'U', 'N', -1, 0, a, 1, rcond, w, rw, info )
435  CALL chkxer( 'CTBCON', infot, nout, lerr, ok )
436  infot = 5
437  CALL ctbcon( '1', 'U', 'N', 0, -1, a, 1, rcond, w, rw, info )
438  CALL chkxer( 'CTBCON', infot, nout, lerr, ok )
439  infot = 7
440  CALL ctbcon( '1', 'U', 'N', 2, 1, a, 1, rcond, w, rw, info )
441  CALL chkxer( 'CTBCON', infot, nout, lerr, ok )
442 *
443 * CLATBS
444 *
445  srnamt = 'CLATBS'
446  infot = 1
447  CALL clatbs( '/', 'N', 'N', 'N', 0, 0, a, 1, x, scale, rw,
448  $ info )
449  CALL chkxer( 'CLATBS', infot, nout, lerr, ok )
450  infot = 2
451  CALL clatbs( 'U', '/', 'N', 'N', 0, 0, a, 1, x, scale, rw,
452  $ info )
453  CALL chkxer( 'CLATBS', infot, nout, lerr, ok )
454  infot = 3
455  CALL clatbs( 'U', 'N', '/', 'N', 0, 0, a, 1, x, scale, rw,
456  $ info )
457  CALL chkxer( 'CLATBS', infot, nout, lerr, ok )
458  infot = 4
459  CALL clatbs( 'U', 'N', 'N', '/', 0, 0, a, 1, x, scale, rw,
460  $ info )
461  CALL chkxer( 'CLATBS', infot, nout, lerr, ok )
462  infot = 5
463  CALL clatbs( 'U', 'N', 'N', 'N', -1, 0, a, 1, x, scale, rw,
464  $ info )
465  CALL chkxer( 'CLATBS', infot, nout, lerr, ok )
466  infot = 6
467  CALL clatbs( 'U', 'N', 'N', 'N', 1, -1, a, 1, x, scale, rw,
468  $ info )
469  CALL chkxer( 'CLATBS', infot, nout, lerr, ok )
470  infot = 8
471  CALL clatbs( 'U', 'N', 'N', 'N', 2, 1, a, 1, x, scale, rw,
472  $ info )
473  CALL chkxer( 'CLATBS', infot, nout, lerr, ok )
474  END IF
475 *
476 * Print a summary line.
477 *
478  CALL alaesm( path, ok, nout )
479 *
480  RETURN
481 *
482 * End of CERRTR
483 *
484  END
subroutine chkxer(SRNAMT, INFOT, NOUT, LERR, OK)
Definition: cblat2.f:3196
subroutine alaesm(PATH, OK, NOUT)
ALAESM
Definition: alaesm.f:63
subroutine cerrtr(PATH, NUNIT)
CERRTR
Definition: cerrtr.f:54
subroutine clatrs(UPLO, TRANS, DIAG, NORMIN, N, A, LDA, X, SCALE, CNORM, INFO)
CLATRS solves a triangular system of equations with the scale factor set to prevent overflow.
Definition: clatrs.f:239
subroutine clatps(UPLO, TRANS, DIAG, NORMIN, N, AP, X, SCALE, CNORM, INFO)
CLATPS solves a triangular system of equations with the matrix held in packed storage.
Definition: clatps.f:231
subroutine clatbs(UPLO, TRANS, DIAG, NORMIN, N, KD, AB, LDAB, X, SCALE, CNORM, INFO)
CLATBS solves a triangular banded system of equations.
Definition: clatbs.f:243
subroutine ctbrfs(UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, B, LDB, X, LDX, FERR, BERR, WORK, RWORK, INFO)
CTBRFS
Definition: ctbrfs.f:188
subroutine ctptri(UPLO, DIAG, N, AP, INFO)
CTPTRI
Definition: ctptri.f:117
subroutine ctrtrs(UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB, INFO)
CTRTRS
Definition: ctrtrs.f:140
subroutine ctpcon(NORM, UPLO, DIAG, N, AP, RCOND, WORK, RWORK, INFO)
CTPCON
Definition: ctpcon.f:130
subroutine ctrcon(NORM, UPLO, DIAG, N, A, LDA, RCOND, WORK, RWORK, INFO)
CTRCON
Definition: ctrcon.f:137
subroutine ctrrfs(UPLO, TRANS, DIAG, N, NRHS, A, LDA, B, LDB, X, LDX, FERR, BERR, WORK, RWORK, INFO)
CTRRFS
Definition: ctrrfs.f:182
subroutine ctbcon(NORM, UPLO, DIAG, N, KD, AB, LDAB, RCOND, WORK, RWORK, INFO)
CTBCON
Definition: ctbcon.f:143
subroutine ctptrs(UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, INFO)
CTPTRS
Definition: ctptrs.f:130
subroutine ctprfs(UPLO, TRANS, DIAG, N, NRHS, AP, B, LDB, X, LDX, FERR, BERR, WORK, RWORK, INFO)
CTPRFS
Definition: ctprfs.f:174
subroutine ctrtri(UPLO, DIAG, N, A, LDA, INFO)
CTRTRI
Definition: ctrtri.f:109
subroutine ctbtrs(UPLO, TRANS, DIAG, N, KD, NRHS, AB, LDAB, B, LDB, INFO)
CTBTRS
Definition: ctbtrs.f:146
subroutine ctrti2(UPLO, DIAG, N, A, LDA, INFO)
CTRTI2 computes the inverse of a triangular matrix (unblocked algorithm).
Definition: ctrti2.f:110