You can not select more than 25 topics Topics must start with a chinese character,a letter or number, can include dashes ('-') and can be up to 35 characters long.

zerrgt.f 7.6 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253
  1. *> \brief \b ZERRGT
  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 ZERRGT( 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. *> ZERRGT tests the error exits for the COMPLEX*16 tridiagonal
  25. *> routines.
  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 ZERRGT( 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 I, INFO
  74. DOUBLE PRECISION ANORM, RCOND
  75. * ..
  76. * .. Local Arrays ..
  77. INTEGER IP( NMAX )
  78. DOUBLE PRECISION D( NMAX ), DF( NMAX ), R1( NMAX ), R2( NMAX ),
  79. $ RW( NMAX )
  80. COMPLEX*16 B( NMAX ), DL( NMAX ), DLF( NMAX ), DU( NMAX ),
  81. $ DU2( NMAX ), DUF( NMAX ), E( NMAX ),
  82. $ EF( NMAX ), W( NMAX ), X( NMAX )
  83. * ..
  84. * .. External Functions ..
  85. LOGICAL LSAMEN
  86. EXTERNAL LSAMEN
  87. * ..
  88. * .. External Subroutines ..
  89. EXTERNAL ALAESM, CHKXER, ZGTCON, ZGTRFS, ZGTTRF, ZGTTRS,
  90. $ ZPTCON, ZPTRFS, ZPTTRF, ZPTTRS
  91. * ..
  92. * .. Scalars in Common ..
  93. LOGICAL LERR, OK
  94. CHARACTER*32 SRNAMT
  95. INTEGER INFOT, NOUT
  96. * ..
  97. * .. Common blocks ..
  98. COMMON / INFOC / INFOT, NOUT, OK, LERR
  99. COMMON / SRNAMC / SRNAMT
  100. * ..
  101. * .. Executable Statements ..
  102. *
  103. NOUT = NUNIT
  104. WRITE( NOUT, FMT = * )
  105. C2 = PATH( 2: 3 )
  106. DO 10 I = 1, NMAX
  107. D( I ) = 1.D0
  108. E( I ) = 2.D0
  109. DL( I ) = 3.D0
  110. DU( I ) = 4.D0
  111. 10 CONTINUE
  112. ANORM = 1.0D0
  113. OK = .TRUE.
  114. *
  115. IF( LSAMEN( 2, C2, 'GT' ) ) THEN
  116. *
  117. * Test error exits for the general tridiagonal routines.
  118. *
  119. * ZGTTRF
  120. *
  121. SRNAMT = 'ZGTTRF'
  122. INFOT = 1
  123. CALL ZGTTRF( -1, DL, E, DU, DU2, IP, INFO )
  124. CALL CHKXER( 'ZGTTRF', INFOT, NOUT, LERR, OK )
  125. *
  126. * ZGTTRS
  127. *
  128. SRNAMT = 'ZGTTRS'
  129. INFOT = 1
  130. CALL ZGTTRS( '/', 0, 0, DL, E, DU, DU2, IP, X, 1, INFO )
  131. CALL CHKXER( 'ZGTTRS', INFOT, NOUT, LERR, OK )
  132. INFOT = 2
  133. CALL ZGTTRS( 'N', -1, 0, DL, E, DU, DU2, IP, X, 1, INFO )
  134. CALL CHKXER( 'ZGTTRS', INFOT, NOUT, LERR, OK )
  135. INFOT = 3
  136. CALL ZGTTRS( 'N', 0, -1, DL, E, DU, DU2, IP, X, 1, INFO )
  137. CALL CHKXER( 'ZGTTRS', INFOT, NOUT, LERR, OK )
  138. INFOT = 10
  139. CALL ZGTTRS( 'N', 2, 1, DL, E, DU, DU2, IP, X, 1, INFO )
  140. CALL CHKXER( 'ZGTTRS', INFOT, NOUT, LERR, OK )
  141. *
  142. * ZGTRFS
  143. *
  144. SRNAMT = 'ZGTRFS'
  145. INFOT = 1
  146. CALL ZGTRFS( '/', 0, 0, DL, E, DU, DLF, EF, DUF, DU2, IP, B, 1,
  147. $ X, 1, R1, R2, W, RW, INFO )
  148. CALL CHKXER( 'ZGTRFS', INFOT, NOUT, LERR, OK )
  149. INFOT = 2
  150. CALL ZGTRFS( 'N', -1, 0, DL, E, DU, DLF, EF, DUF, DU2, IP, B,
  151. $ 1, X, 1, R1, R2, W, RW, INFO )
  152. CALL CHKXER( 'ZGTRFS', INFOT, NOUT, LERR, OK )
  153. INFOT = 3
  154. CALL ZGTRFS( 'N', 0, -1, DL, E, DU, DLF, EF, DUF, DU2, IP, B,
  155. $ 1, X, 1, R1, R2, W, RW, INFO )
  156. CALL CHKXER( 'ZGTRFS', INFOT, NOUT, LERR, OK )
  157. INFOT = 13
  158. CALL ZGTRFS( 'N', 2, 1, DL, E, DU, DLF, EF, DUF, DU2, IP, B, 1,
  159. $ X, 2, R1, R2, W, RW, INFO )
  160. CALL CHKXER( 'ZGTRFS', INFOT, NOUT, LERR, OK )
  161. INFOT = 15
  162. CALL ZGTRFS( 'N', 2, 1, DL, E, DU, DLF, EF, DUF, DU2, IP, B, 2,
  163. $ X, 1, R1, R2, W, RW, INFO )
  164. CALL CHKXER( 'ZGTRFS', INFOT, NOUT, LERR, OK )
  165. *
  166. * ZGTCON
  167. *
  168. SRNAMT = 'ZGTCON'
  169. INFOT = 1
  170. CALL ZGTCON( '/', 0, DL, E, DU, DU2, IP, ANORM, RCOND, W,
  171. $ INFO )
  172. CALL CHKXER( 'ZGTCON', INFOT, NOUT, LERR, OK )
  173. INFOT = 2
  174. CALL ZGTCON( 'I', -1, DL, E, DU, DU2, IP, ANORM, RCOND, W,
  175. $ INFO )
  176. CALL CHKXER( 'ZGTCON', INFOT, NOUT, LERR, OK )
  177. INFOT = 8
  178. CALL ZGTCON( 'I', 0, DL, E, DU, DU2, IP, -ANORM, RCOND, W,
  179. $ INFO )
  180. CALL CHKXER( 'ZGTCON', INFOT, NOUT, LERR, OK )
  181. *
  182. ELSE IF( LSAMEN( 2, C2, 'PT' ) ) THEN
  183. *
  184. * Test error exits for the positive definite tridiagonal
  185. * routines.
  186. *
  187. * ZPTTRF
  188. *
  189. SRNAMT = 'ZPTTRF'
  190. INFOT = 1
  191. CALL ZPTTRF( -1, D, E, INFO )
  192. CALL CHKXER( 'ZPTTRF', INFOT, NOUT, LERR, OK )
  193. *
  194. * ZPTTRS
  195. *
  196. SRNAMT = 'ZPTTRS'
  197. INFOT = 1
  198. CALL ZPTTRS( '/', 1, 0, D, E, X, 1, INFO )
  199. CALL CHKXER( 'ZPTTRS', INFOT, NOUT, LERR, OK )
  200. INFOT = 2
  201. CALL ZPTTRS( 'U', -1, 0, D, E, X, 1, INFO )
  202. CALL CHKXER( 'ZPTTRS', INFOT, NOUT, LERR, OK )
  203. INFOT = 3
  204. CALL ZPTTRS( 'U', 0, -1, D, E, X, 1, INFO )
  205. CALL CHKXER( 'ZPTTRS', INFOT, NOUT, LERR, OK )
  206. INFOT = 7
  207. CALL ZPTTRS( 'U', 2, 1, D, E, X, 1, INFO )
  208. CALL CHKXER( 'ZPTTRS', INFOT, NOUT, LERR, OK )
  209. *
  210. * ZPTRFS
  211. *
  212. SRNAMT = 'ZPTRFS'
  213. INFOT = 1
  214. CALL ZPTRFS( '/', 1, 0, D, E, DF, EF, B, 1, X, 1, R1, R2, W,
  215. $ RW, INFO )
  216. CALL CHKXER( 'ZPTRFS', INFOT, NOUT, LERR, OK )
  217. INFOT = 2
  218. CALL ZPTRFS( 'U', -1, 0, D, E, DF, EF, B, 1, X, 1, R1, R2, W,
  219. $ RW, INFO )
  220. CALL CHKXER( 'ZPTRFS', INFOT, NOUT, LERR, OK )
  221. INFOT = 3
  222. CALL ZPTRFS( 'U', 0, -1, D, E, DF, EF, B, 1, X, 1, R1, R2, W,
  223. $ RW, INFO )
  224. CALL CHKXER( 'ZPTRFS', INFOT, NOUT, LERR, OK )
  225. INFOT = 9
  226. CALL ZPTRFS( 'U', 2, 1, D, E, DF, EF, B, 1, X, 2, R1, R2, W,
  227. $ RW, INFO )
  228. CALL CHKXER( 'ZPTRFS', INFOT, NOUT, LERR, OK )
  229. INFOT = 11
  230. CALL ZPTRFS( 'U', 2, 1, D, E, DF, EF, B, 2, X, 1, R1, R2, W,
  231. $ RW, INFO )
  232. CALL CHKXER( 'ZPTRFS', INFOT, NOUT, LERR, OK )
  233. *
  234. * ZPTCON
  235. *
  236. SRNAMT = 'ZPTCON'
  237. INFOT = 1
  238. CALL ZPTCON( -1, D, E, ANORM, RCOND, RW, INFO )
  239. CALL CHKXER( 'ZPTCON', INFOT, NOUT, LERR, OK )
  240. INFOT = 4
  241. CALL ZPTCON( 0, D, E, -ANORM, RCOND, RW, INFO )
  242. CALL CHKXER( 'ZPTCON', INFOT, NOUT, LERR, OK )
  243. END IF
  244. *
  245. * Print a summary line.
  246. *
  247. CALL ALAESM( PATH, OK, NOUT )
  248. *
  249. RETURN
  250. *
  251. * End of ZERRGT
  252. *
  253. END