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.

serrge.f 14 kB

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