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.

cerrhe.f 14 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424
  1. *> \brief \b CERRHE
  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 CERRHE( 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. *> CERRHE tests the error exits for the COMPLEX routines
  25. *> for Hermitian indefinite matrices.
  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. *> \date November 2013
  52. *
  53. *> \ingroup complex_lin
  54. *
  55. * =====================================================================
  56. SUBROUTINE CERRHE( PATH, NUNIT )
  57. *
  58. * -- LAPACK test routine (version 3.5.0) --
  59. * -- LAPACK is a software package provided by Univ. of Tennessee, --
  60. * -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
  61. * November 2013
  62. *
  63. * .. Scalar Arguments ..
  64. CHARACTER*3 PATH
  65. INTEGER NUNIT
  66. * ..
  67. *
  68. * =====================================================================
  69. *
  70. *
  71. * .. Parameters ..
  72. INTEGER NMAX
  73. PARAMETER ( NMAX = 4 )
  74. * ..
  75. * .. Local Scalars ..
  76. CHARACTER*2 C2
  77. INTEGER I, INFO, J
  78. REAL ANRM, RCOND
  79. * ..
  80. * .. Local Arrays ..
  81. INTEGER IP( NMAX )
  82. REAL R( NMAX ), R1( NMAX ), R2( NMAX )
  83. COMPLEX A( NMAX, NMAX ), AF( NMAX, NMAX ), B( NMAX ),
  84. $ W( 2*NMAX ), X( NMAX )
  85. * ..
  86. * .. External Functions ..
  87. LOGICAL LSAMEN
  88. EXTERNAL LSAMEN
  89. * ..
  90. * .. External Subroutines ..
  91. EXTERNAL ALAESM, CHECON, CHECON_ROOK, CHERFS, CHETF2,
  92. $ CHETF2_ROOK, CHETRF, CHETRF_ROOK, CHETRI,
  93. $ CHETRI_ROOK, CHETRI2, CHETRS, CHETRS_ROOK,
  94. $ CHKXER, CHPCON, CHPRFS, CHPTRF, CHPTRI, CHPTRS
  95. * ..
  96. * .. Scalars in Common ..
  97. LOGICAL LERR, OK
  98. CHARACTER*32 SRNAMT
  99. INTEGER INFOT, NOUT
  100. * ..
  101. * .. Common blocks ..
  102. COMMON / INFOC / INFOT, NOUT, OK, LERR
  103. COMMON / SRNAMC / SRNAMT
  104. * ..
  105. * .. Intrinsic Functions ..
  106. INTRINSIC CMPLX, REAL
  107. * ..
  108. * .. Executable Statements ..
  109. *
  110. NOUT = NUNIT
  111. WRITE( NOUT, FMT = * )
  112. C2 = PATH( 2: 3 )
  113. *
  114. * Set the variables to innocuous values.
  115. *
  116. DO 20 J = 1, NMAX
  117. DO 10 I = 1, NMAX
  118. A( I, J ) = CMPLX( 1. / REAL( I+J ), -1. / REAL( I+J ) )
  119. AF( I, J ) = CMPLX( 1. / REAL( I+J ), -1. / REAL( I+J ) )
  120. 10 CONTINUE
  121. B( J ) = 0.
  122. R1( J ) = 0.
  123. R2( J ) = 0.
  124. W( J ) = 0.
  125. X( J ) = 0.
  126. IP( J ) = J
  127. 20 CONTINUE
  128. ANRM = 1.0
  129. OK = .TRUE.
  130. *
  131. * Test error exits of the routines that use factorization
  132. * of a Hermitian indefinite matrix with patrial
  133. * (Bunch-Kaufman) diagonal pivoting method.
  134. *
  135. IF( LSAMEN( 2, C2, 'HE' ) ) THEN
  136. *
  137. * CHETRF
  138. *
  139. SRNAMT = 'CHETRF'
  140. INFOT = 1
  141. CALL CHETRF( '/', 0, A, 1, IP, W, 1, INFO )
  142. CALL CHKXER( 'CHETRF', INFOT, NOUT, LERR, OK )
  143. INFOT = 2
  144. CALL CHETRF( 'U', -1, A, 1, IP, W, 1, INFO )
  145. CALL CHKXER( 'CHETRF', INFOT, NOUT, LERR, OK )
  146. INFOT = 4
  147. CALL CHETRF( 'U', 2, A, 1, IP, W, 4, INFO )
  148. CALL CHKXER( 'CHETRF', INFOT, NOUT, LERR, OK )
  149. *
  150. * CHETF2
  151. *
  152. SRNAMT = 'CHETF2'
  153. INFOT = 1
  154. CALL CHETF2( '/', 0, A, 1, IP, INFO )
  155. CALL CHKXER( 'CHETF2', INFOT, NOUT, LERR, OK )
  156. INFOT = 2
  157. CALL CHETF2( 'U', -1, A, 1, IP, INFO )
  158. CALL CHKXER( 'CHETF2', INFOT, NOUT, LERR, OK )
  159. INFOT = 4
  160. CALL CHETF2( 'U', 2, A, 1, IP, INFO )
  161. CALL CHKXER( 'CHETF2', INFOT, NOUT, LERR, OK )
  162. *
  163. * CHETRI
  164. *
  165. SRNAMT = 'CHETRI'
  166. INFOT = 1
  167. CALL CHETRI( '/', 0, A, 1, IP, W, INFO )
  168. CALL CHKXER( 'CHETRI', INFOT, NOUT, LERR, OK )
  169. INFOT = 2
  170. CALL CHETRI( 'U', -1, A, 1, IP, W, INFO )
  171. CALL CHKXER( 'CHETRI', INFOT, NOUT, LERR, OK )
  172. INFOT = 4
  173. CALL CHETRI( 'U', 2, A, 1, IP, W, INFO )
  174. CALL CHKXER( 'CHETRI', INFOT, NOUT, LERR, OK )
  175. *
  176. * CHETRI2
  177. *
  178. SRNAMT = 'CHETRI2'
  179. INFOT = 1
  180. CALL CHETRI2( '/', 0, A, 1, IP, W, 1, INFO )
  181. CALL CHKXER( 'CHETRI2', INFOT, NOUT, LERR, OK )
  182. INFOT = 2
  183. CALL CHETRI2( 'U', -1, A, 1, IP, W, 1, INFO )
  184. CALL CHKXER( 'CHETRI2', INFOT, NOUT, LERR, OK )
  185. INFOT = 4
  186. CALL CHETRI2( 'U', 2, A, 1, IP, W, 1, INFO )
  187. CALL CHKXER( 'CHETRI2', INFOT, NOUT, LERR, OK )
  188. *
  189. * CHETRS
  190. *
  191. SRNAMT = 'CHETRS'
  192. INFOT = 1
  193. CALL CHETRS( '/', 0, 0, A, 1, IP, B, 1, INFO )
  194. CALL CHKXER( 'CHETRS', INFOT, NOUT, LERR, OK )
  195. INFOT = 2
  196. CALL CHETRS( 'U', -1, 0, A, 1, IP, B, 1, INFO )
  197. CALL CHKXER( 'CHETRS', INFOT, NOUT, LERR, OK )
  198. INFOT = 3
  199. CALL CHETRS( 'U', 0, -1, A, 1, IP, B, 1, INFO )
  200. CALL CHKXER( 'CHETRS', INFOT, NOUT, LERR, OK )
  201. INFOT = 5
  202. CALL CHETRS( 'U', 2, 1, A, 1, IP, B, 2, INFO )
  203. CALL CHKXER( 'CHETRS', INFOT, NOUT, LERR, OK )
  204. INFOT = 8
  205. CALL CHETRS( 'U', 2, 1, A, 2, IP, B, 1, INFO )
  206. CALL CHKXER( 'CHETRS', INFOT, NOUT, LERR, OK )
  207. *
  208. * CHERFS
  209. *
  210. SRNAMT = 'CHERFS'
  211. INFOT = 1
  212. CALL CHERFS( '/', 0, 0, A, 1, AF, 1, IP, B, 1, X, 1, R1, R2, W,
  213. $ R, INFO )
  214. CALL CHKXER( 'CHERFS', INFOT, NOUT, LERR, OK )
  215. INFOT = 2
  216. CALL CHERFS( 'U', -1, 0, A, 1, AF, 1, IP, B, 1, X, 1, R1, R2,
  217. $ W, R, INFO )
  218. CALL CHKXER( 'CHERFS', INFOT, NOUT, LERR, OK )
  219. INFOT = 3
  220. CALL CHERFS( 'U', 0, -1, A, 1, AF, 1, IP, B, 1, X, 1, R1, R2,
  221. $ W, R, INFO )
  222. CALL CHKXER( 'CHERFS', INFOT, NOUT, LERR, OK )
  223. INFOT = 5
  224. CALL CHERFS( 'U', 2, 1, A, 1, AF, 2, IP, B, 2, X, 2, R1, R2, W,
  225. $ R, INFO )
  226. CALL CHKXER( 'CHERFS', INFOT, NOUT, LERR, OK )
  227. INFOT = 7
  228. CALL CHERFS( 'U', 2, 1, A, 2, AF, 1, IP, B, 2, X, 2, R1, R2, W,
  229. $ R, INFO )
  230. CALL CHKXER( 'CHERFS', INFOT, NOUT, LERR, OK )
  231. INFOT = 10
  232. CALL CHERFS( 'U', 2, 1, A, 2, AF, 2, IP, B, 1, X, 2, R1, R2, W,
  233. $ R, INFO )
  234. CALL CHKXER( 'CHERFS', INFOT, NOUT, LERR, OK )
  235. INFOT = 12
  236. CALL CHERFS( 'U', 2, 1, A, 2, AF, 2, IP, B, 2, X, 1, R1, R2, W,
  237. $ R, INFO )
  238. CALL CHKXER( 'CHERFS', INFOT, NOUT, LERR, OK )
  239. *
  240. * CHECON
  241. *
  242. SRNAMT = 'CHECON'
  243. INFOT = 1
  244. CALL CHECON( '/', 0, A, 1, IP, ANRM, RCOND, W, INFO )
  245. CALL CHKXER( 'CHECON', INFOT, NOUT, LERR, OK )
  246. INFOT = 2
  247. CALL CHECON( 'U', -1, A, 1, IP, ANRM, RCOND, W, INFO )
  248. CALL CHKXER( 'CHECON', INFOT, NOUT, LERR, OK )
  249. INFOT = 4
  250. CALL CHECON( 'U', 2, A, 1, IP, ANRM, RCOND, W, INFO )
  251. CALL CHKXER( 'CHECON', INFOT, NOUT, LERR, OK )
  252. INFOT = 6
  253. CALL CHECON( 'U', 1, A, 1, IP, -ANRM, RCOND, W, INFO )
  254. CALL CHKXER( 'CHECON', INFOT, NOUT, LERR, OK )
  255. *
  256. * Test error exits of the routines that use factorization
  257. * of a Hermitian indefinite matrix with "rook"
  258. * (bounded Bunch-Kaufman) diagonal pivoting method.
  259. *
  260. ELSE IF( LSAMEN( 2, C2, 'HR' ) ) THEN
  261. *
  262. * CHETRF_ROOK
  263. *
  264. SRNAMT = 'CHETRF_ROOK'
  265. INFOT = 1
  266. CALL CHETRF_ROOK( '/', 0, A, 1, IP, W, 1, INFO )
  267. CALL CHKXER( 'CHETRF_ROOK', INFOT, NOUT, LERR, OK )
  268. INFOT = 2
  269. CALL CHETRF_ROOK( 'U', -1, A, 1, IP, W, 1, INFO )
  270. CALL CHKXER( 'CHETRF_ROOK', INFOT, NOUT, LERR, OK )
  271. INFOT = 4
  272. CALL CHETRF_ROOK( 'U', 2, A, 1, IP, W, 4, INFO )
  273. CALL CHKXER( 'CHETRF_ROOK', INFOT, NOUT, LERR, OK )
  274. *
  275. * CHETF2_ROOK
  276. *
  277. SRNAMT = 'CHETF2_ROOK'
  278. INFOT = 1
  279. CALL CHETF2_ROOK( '/', 0, A, 1, IP, INFO )
  280. CALL CHKXER( 'CHETF2_ROOK', INFOT, NOUT, LERR, OK )
  281. INFOT = 2
  282. CALL CHETF2_ROOK( 'U', -1, A, 1, IP, INFO )
  283. CALL CHKXER( 'CHETF2_ROOK', INFOT, NOUT, LERR, OK )
  284. INFOT = 4
  285. CALL CHETF2_ROOK( 'U', 2, A, 1, IP, INFO )
  286. CALL CHKXER( 'CHETF2_ROOK', INFOT, NOUT, LERR, OK )
  287. *
  288. * CHETRI_ROOK
  289. *
  290. SRNAMT = 'CHETRI_ROOK'
  291. INFOT = 1
  292. CALL CHETRI_ROOK( '/', 0, A, 1, IP, W, INFO )
  293. CALL CHKXER( 'CHETRI_ROOK', INFOT, NOUT, LERR, OK )
  294. INFOT = 2
  295. CALL CHETRI_ROOK( 'U', -1, A, 1, IP, W, INFO )
  296. CALL CHKXER( 'CHETRI_ROOK', INFOT, NOUT, LERR, OK )
  297. INFOT = 4
  298. CALL CHETRI_ROOK( 'U', 2, A, 1, IP, W, INFO )
  299. CALL CHKXER( 'CHETRI_ROOK', INFOT, NOUT, LERR, OK )
  300. *
  301. * CHETRS_ROOK
  302. *
  303. SRNAMT = 'CHETRS_ROOK'
  304. INFOT = 1
  305. CALL CHETRS_ROOK( '/', 0, 0, A, 1, IP, B, 1, INFO )
  306. CALL CHKXER( 'CHETRS_ROOK', INFOT, NOUT, LERR, OK )
  307. INFOT = 2
  308. CALL CHETRS_ROOK( 'U', -1, 0, A, 1, IP, B, 1, INFO )
  309. CALL CHKXER( 'CHETRS_ROOK', INFOT, NOUT, LERR, OK )
  310. INFOT = 3
  311. CALL CHETRS_ROOK( 'U', 0, -1, A, 1, IP, B, 1, INFO )
  312. CALL CHKXER( 'CHETRS_ROOK', INFOT, NOUT, LERR, OK )
  313. INFOT = 5
  314. CALL CHETRS_ROOK( 'U', 2, 1, A, 1, IP, B, 2, INFO )
  315. CALL CHKXER( 'CHETRS_ROOK', INFOT, NOUT, LERR, OK )
  316. INFOT = 8
  317. CALL CHETRS_ROOK( 'U', 2, 1, A, 2, IP, B, 1, INFO )
  318. CALL CHKXER( 'CHETRS_ROOK', INFOT, NOUT, LERR, OK )
  319. *
  320. * CHECON_ROOK
  321. *
  322. SRNAMT = 'CHECON_ROOK'
  323. INFOT = 1
  324. CALL CHECON_ROOK( '/', 0, A, 1, IP, ANRM, RCOND, W, INFO )
  325. CALL CHKXER( 'CHECON_ROOK', INFOT, NOUT, LERR, OK )
  326. INFOT = 2
  327. CALL CHECON_ROOK( 'U', -1, A, 1, IP, ANRM, RCOND, W, INFO )
  328. CALL CHKXER( 'CHECON_ROOK', INFOT, NOUT, LERR, OK )
  329. INFOT = 4
  330. CALL CHECON_ROOK( 'U', 2, A, 1, IP, ANRM, RCOND, W, INFO )
  331. CALL CHKXER( 'CHECON_ROOK', INFOT, NOUT, LERR, OK )
  332. INFOT = 6
  333. CALL CHECON_ROOK( 'U', 1, A, 1, IP, -ANRM, RCOND, W, INFO )
  334. CALL CHKXER( 'CHECON_ROOK', INFOT, NOUT, LERR, OK )
  335. *
  336. * Test error exits of the routines that use factorization
  337. * of a Hermitian indefinite packed matrix with patrial
  338. * (Bunch-Kaufman) diagonal pivoting method.
  339. *
  340. ELSE IF( LSAMEN( 2, C2, 'HP' ) ) THEN
  341. *
  342. * CHPTRF
  343. *
  344. SRNAMT = 'CHPTRF'
  345. INFOT = 1
  346. CALL CHPTRF( '/', 0, A, IP, INFO )
  347. CALL CHKXER( 'CHPTRF', INFOT, NOUT, LERR, OK )
  348. INFOT = 2
  349. CALL CHPTRF( 'U', -1, A, IP, INFO )
  350. CALL CHKXER( 'CHPTRF', INFOT, NOUT, LERR, OK )
  351. *
  352. * CHPTRI
  353. *
  354. SRNAMT = 'CHPTRI'
  355. INFOT = 1
  356. CALL CHPTRI( '/', 0, A, IP, W, INFO )
  357. CALL CHKXER( 'CHPTRI', INFOT, NOUT, LERR, OK )
  358. INFOT = 2
  359. CALL CHPTRI( 'U', -1, A, IP, W, INFO )
  360. CALL CHKXER( 'CHPTRI', INFOT, NOUT, LERR, OK )
  361. *
  362. * CHPTRS
  363. *
  364. SRNAMT = 'CHPTRS'
  365. INFOT = 1
  366. CALL CHPTRS( '/', 0, 0, A, IP, B, 1, INFO )
  367. CALL CHKXER( 'CHPTRS', INFOT, NOUT, LERR, OK )
  368. INFOT = 2
  369. CALL CHPTRS( 'U', -1, 0, A, IP, B, 1, INFO )
  370. CALL CHKXER( 'CHPTRS', INFOT, NOUT, LERR, OK )
  371. INFOT = 3
  372. CALL CHPTRS( 'U', 0, -1, A, IP, B, 1, INFO )
  373. CALL CHKXER( 'CHPTRS', INFOT, NOUT, LERR, OK )
  374. INFOT = 7
  375. CALL CHPTRS( 'U', 2, 1, A, IP, B, 1, INFO )
  376. CALL CHKXER( 'CHPTRS', INFOT, NOUT, LERR, OK )
  377. *
  378. * CHPRFS
  379. *
  380. SRNAMT = 'CHPRFS'
  381. INFOT = 1
  382. CALL CHPRFS( '/', 0, 0, A, AF, IP, B, 1, X, 1, R1, R2, W, R,
  383. $ INFO )
  384. CALL CHKXER( 'CHPRFS', INFOT, NOUT, LERR, OK )
  385. INFOT = 2
  386. CALL CHPRFS( 'U', -1, 0, A, AF, IP, B, 1, X, 1, R1, R2, W, R,
  387. $ INFO )
  388. CALL CHKXER( 'CHPRFS', INFOT, NOUT, LERR, OK )
  389. INFOT = 3
  390. CALL CHPRFS( 'U', 0, -1, A, AF, IP, B, 1, X, 1, R1, R2, W, R,
  391. $ INFO )
  392. CALL CHKXER( 'CHPRFS', INFOT, NOUT, LERR, OK )
  393. INFOT = 8
  394. CALL CHPRFS( 'U', 2, 1, A, AF, IP, B, 1, X, 2, R1, R2, W, R,
  395. $ INFO )
  396. CALL CHKXER( 'CHPRFS', INFOT, NOUT, LERR, OK )
  397. INFOT = 10
  398. CALL CHPRFS( 'U', 2, 1, A, AF, IP, B, 2, X, 1, R1, R2, W, R,
  399. $ INFO )
  400. CALL CHKXER( 'CHPRFS', INFOT, NOUT, LERR, OK )
  401. *
  402. * CHPCON
  403. *
  404. SRNAMT = 'CHPCON'
  405. INFOT = 1
  406. CALL CHPCON( '/', 0, A, IP, ANRM, RCOND, W, INFO )
  407. CALL CHKXER( 'CHPCON', INFOT, NOUT, LERR, OK )
  408. INFOT = 2
  409. CALL CHPCON( 'U', -1, A, IP, ANRM, RCOND, W, INFO )
  410. CALL CHKXER( 'CHPCON', INFOT, NOUT, LERR, OK )
  411. INFOT = 5
  412. CALL CHPCON( 'U', 1, A, IP, -ANRM, RCOND, W, INFO )
  413. CALL CHKXER( 'CHPCON', INFOT, NOUT, LERR, OK )
  414. END IF
  415. *
  416. * Print a summary line.
  417. *
  418. CALL ALAESM( PATH, OK, NOUT )
  419. *
  420. RETURN
  421. *
  422. * End of CERRHE
  423. *
  424. END