LAPACK  3.10.1
LAPACK: Linear Algebra PACKage
cerrlqt.f
Go to the documentation of this file.
1 *> \brief \b CERRLQT
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 CERRLQT( 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 *> CERRLQT tests the error exits for the COMPLEX routines
25 *> that use the LQT 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 cerrlqt( PATH, NUNIT )
55  IMPLICIT NONE
56 *
57 * -- LAPACK test routine --
58 * -- LAPACK is a software package provided by Univ. of Tennessee, --
59 * -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
60 *
61 * .. Scalar Arguments ..
62  CHARACTER*3 PATH
63  INTEGER NUNIT
64 * ..
65 *
66 * =====================================================================
67 *
68 * .. Parameters ..
69  INTEGER NMAX
70  parameter( nmax = 2 )
71 * ..
72 * .. Local Scalars ..
73  INTEGER I, INFO, J
74 * ..
75 * .. Local Arrays ..
76  COMPLEX A( NMAX, NMAX ), T( NMAX, NMAX ), W( NMAX ),
77  $ C( NMAX, NMAX )
78 * ..
79 * .. External Subroutines ..
80  EXTERNAL alaesm, chkxer, cgelqt3, cgelqt,
81  $ cgemlqt
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 real, cmplx
94 * ..
95 * .. Executable Statements ..
96 *
97  nout = nunit
98  WRITE( nout, fmt = * )
99 *
100 * Set the variables to innocuous values.
101 *
102  DO j = 1, nmax
103  DO i = 1, nmax
104  a( i, j ) = 1.e0 / cmplx( real( i+j ), 0.e0 )
105  c( i, j ) = 1.e0 / cmplx( real( i+j ), 0.e0 )
106  t( i, j ) = 1.e0 / cmplx( real( i+j ), 0.e0 )
107  END DO
108  w( j ) = 0.e0
109  END DO
110  ok = .true.
111 *
112 * Error exits for LQT factorization
113 *
114 * CGELQT
115 *
116  srnamt = 'CGELQT'
117  infot = 1
118  CALL cgelqt( -1, 0, 1, a, 1, t, 1, w, info )
119  CALL chkxer( 'CGELQT', infot, nout, lerr, ok )
120  infot = 2
121  CALL cgelqt( 0, -1, 1, a, 1, t, 1, w, info )
122  CALL chkxer( 'CGELQT', infot, nout, lerr, ok )
123  infot = 3
124  CALL cgelqt( 0, 0, 0, a, 1, t, 1, w, info )
125  CALL chkxer( 'CGELQT', infot, nout, lerr, ok )
126  infot = 5
127  CALL cgelqt( 2, 1, 1, a, 1, t, 1, w, info )
128  CALL chkxer( 'CGELQT', infot, nout, lerr, ok )
129  infot = 7
130  CALL cgelqt( 2, 2, 2, a, 2, t, 1, w, info )
131  CALL chkxer( 'CGELQT', infot, nout, lerr, ok )
132 *
133 * CGELQT3
134 *
135  srnamt = 'CGELQT3'
136  infot = 1
137  CALL cgelqt3( -1, 0, a, 1, t, 1, info )
138  CALL chkxer( 'CGELQT3', infot, nout, lerr, ok )
139  infot = 2
140  CALL cgelqt3( 0, -1, a, 1, t, 1, info )
141  CALL chkxer( 'CGELQT3', infot, nout, lerr, ok )
142  infot = 4
143  CALL cgelqt3( 2, 2, a, 1, t, 1, info )
144  CALL chkxer( 'CGELQT3', infot, nout, lerr, ok )
145  infot = 6
146  CALL cgelqt3( 2, 2, a, 2, t, 1, info )
147  CALL chkxer( 'CGELQT3', infot, nout, lerr, ok )
148 *
149 * CGEMLQT
150 *
151  srnamt = 'CGEMLQT'
152  infot = 1
153  CALL cgemlqt( '/', 'N', 0, 0, 0, 1, a, 1, t, 1, c, 1, w, info )
154  CALL chkxer( 'CGEMLQT', infot, nout, lerr, ok )
155  infot = 2
156  CALL cgemlqt( 'L', '/', 0, 0, 0, 1, a, 1, t, 1, c, 1, w, info )
157  CALL chkxer( 'CGEMLQT', infot, nout, lerr, ok )
158  infot = 3
159  CALL cgemlqt( 'L', 'N', -1, 0, 0, 1, a, 1, t, 1, c, 1, w, info )
160  CALL chkxer( 'CGEMLQT', infot, nout, lerr, ok )
161  infot = 4
162  CALL cgemlqt( 'L', 'N', 0, -1, 0, 1, a, 1, t, 1, c, 1, w, info )
163  CALL chkxer( 'CGEMLQT', infot, nout, lerr, ok )
164  infot = 5
165  CALL cgemlqt( 'L', 'N', 0, 0, -1, 1, a, 1, t, 1, c, 1, w, info )
166  CALL chkxer( 'CGEMLQT', infot, nout, lerr, ok )
167  infot = 5
168  CALL cgemlqt( 'R', 'N', 0, 0, -1, 1, a, 1, t, 1, c, 1, w, info )
169  CALL chkxer( 'CGEMLQT', infot, nout, lerr, ok )
170  infot = 6
171  CALL cgemlqt( 'L', 'N', 0, 0, 0, 0, a, 1, t, 1, c, 1, w, info )
172  CALL chkxer( 'CGEMLQT', infot, nout, lerr, ok )
173  infot = 8
174  CALL cgemlqt( 'R', 'N', 2, 2, 2, 1, a, 1, t, 1, c, 1, w, info )
175  CALL chkxer( 'CGEMLQT', infot, nout, lerr, ok )
176  infot = 8
177  CALL cgemlqt( 'L', 'N', 2, 2, 2, 1, a, 1, t, 1, c, 1, w, info )
178  CALL chkxer( 'CGEMLQT', infot, nout, lerr, ok )
179  infot = 10
180  CALL cgemlqt( 'R', 'N', 1, 1, 1, 1, a, 1, t, 0, c, 1, w, info )
181  CALL chkxer( 'CGEMLQT', infot, nout, lerr, ok )
182  infot = 12
183  CALL cgemlqt( 'L', 'N', 1, 1, 1, 1, a, 1, t, 1, c, 0, w, info )
184  CALL chkxer( 'CGEMLQT', infot, nout, lerr, ok )
185 *
186 * Print a summary line.
187 *
188  CALL alaesm( path, ok, nout )
189 *
190  RETURN
191 *
192 * End of CERRLQT
193 *
194  END
subroutine chkxer(SRNAMT, INFOT, NOUT, LERR, OK)
Definition: cblat2.f:3196
subroutine alaesm(PATH, OK, NOUT)
ALAESM
Definition: alaesm.f:63
subroutine cerrlqt(PATH, NUNIT)
CERRLQT
Definition: cerrlqt.f:55
subroutine cgelqt(M, N, MB, A, LDA, T, LDT, WORK, INFO)
CGELQT
Definition: cgelqt.f:124
recursive subroutine cgelqt3(M, N, A, LDA, T, LDT, INFO)
CGELQT3
Definition: cgelqt3.f:116
subroutine cgemlqt(SIDE, TRANS, M, N, K, MB, V, LDV, T, LDT, C, LDC, WORK, INFO)
CGEMLQT
Definition: cgemlqt.f:153