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.

dchkaa.f 35 kB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063
  1. *> \brief \b DCHKAA
  2. *
  3. * =========== DOCUMENTATION ===========
  4. *
  5. * Online html documentation available at
  6. * http://www.netlib.org/lapack/explore-html/
  7. *
  8. * Definition:
  9. * ===========
  10. *
  11. * PROGRAM DCHKAA
  12. *
  13. *
  14. *> \par Purpose:
  15. * =============
  16. *>
  17. *> \verbatim
  18. *>
  19. *> DCHKAA is the main test program for the DOUBLE PRECISION LAPACK
  20. *> linear equation routines
  21. *>
  22. *> The program must be driven by a short data file. The first 15 records
  23. *> (not including the first comment line) specify problem dimensions
  24. *> and program options using list-directed input. The remaining lines
  25. *> specify the LAPACK test paths and the number of matrix types to use
  26. *> in testing. An annotated example of a data file can be obtained by
  27. *> deleting the first 3 characters from the following 40 lines:
  28. *> Data file for testing DOUBLE PRECISION LAPACK linear eqn. routines
  29. *> 7 Number of values of M
  30. *> 0 1 2 3 5 10 16 Values of M (row dimension)
  31. *> 7 Number of values of N
  32. *> 0 1 2 3 5 10 16 Values of N (column dimension)
  33. *> 1 Number of values of NRHS
  34. *> 2 Values of NRHS (number of right hand sides)
  35. *> 5 Number of values of NB
  36. *> 1 3 3 3 20 Values of NB (the blocksize)
  37. *> 1 0 5 9 1 Values of NX (crossover point)
  38. *> 3 Number of values of RANK
  39. *> 30 50 90 Values of rank (as a % of N)
  40. *> 20.0 Threshold value of test ratio
  41. *> T Put T to test the LAPACK routines
  42. *> T Put T to test the driver routines
  43. *> T Put T to test the error exits
  44. *> DGE 11 List types on next line if 0 < NTYPES < 11
  45. *> DGB 8 List types on next line if 0 < NTYPES < 8
  46. *> DGT 12 List types on next line if 0 < NTYPES < 12
  47. *> DPO 9 List types on next line if 0 < NTYPES < 9
  48. *> DPS 9 List types on next line if 0 < NTYPES < 9
  49. *> DPP 9 List types on next line if 0 < NTYPES < 9
  50. *> DPB 8 List types on next line if 0 < NTYPES < 8
  51. *> DPT 12 List types on next line if 0 < NTYPES < 12
  52. *> DSY 10 List types on next line if 0 < NTYPES < 10
  53. *> DSR 10 List types on next line if 0 < NTYPES < 10
  54. *> DSK 10 List types on next line if 0 < NTYPES < 10
  55. *> DSA 10 List types on next line if 0 < NTYPES < 10
  56. *> DS2 10 List types on next line if 0 < NTYPES < 10
  57. *> DSP 10 List types on next line if 0 < NTYPES < 10
  58. *> DTR 18 List types on next line if 0 < NTYPES < 18
  59. *> DTP 18 List types on next line if 0 < NTYPES < 18
  60. *> DTB 17 List types on next line if 0 < NTYPES < 17
  61. *> DQR 8 List types on next line if 0 < NTYPES < 8
  62. *> DRQ 8 List types on next line if 0 < NTYPES < 8
  63. *> DLQ 8 List types on next line if 0 < NTYPES < 8
  64. *> DQL 8 List types on next line if 0 < NTYPES < 8
  65. *> DQP 6 List types on next line if 0 < NTYPES < 6
  66. *> DTZ 3 List types on next line if 0 < NTYPES < 3
  67. *> DLS 6 List types on next line if 0 < NTYPES < 6
  68. *> DEQ
  69. *> DQT
  70. *> DQX
  71. *> DTQ
  72. *> DXQ
  73. *> DTS
  74. *> DHH
  75. *> \endverbatim
  76. *
  77. * Parameters:
  78. * ==========
  79. *
  80. *> \verbatim
  81. *> NMAX INTEGER
  82. *> The maximum allowable value for M and N.
  83. *>
  84. *> MAXIN INTEGER
  85. *> The number of different values that can be used for each of
  86. *> M, N, NRHS, NB, NX and RANK
  87. *>
  88. *> MAXRHS INTEGER
  89. *> The maximum number of right hand sides
  90. *>
  91. *> MATMAX INTEGER
  92. *> The maximum number of matrix types to use for testing
  93. *>
  94. *> NIN INTEGER
  95. *> The unit number for input
  96. *>
  97. *> NOUT INTEGER
  98. *> The unit number for output
  99. *> \endverbatim
  100. *
  101. * Authors:
  102. * ========
  103. *
  104. *> \author Univ. of Tennessee
  105. *> \author Univ. of California Berkeley
  106. *> \author Univ. of Colorado Denver
  107. *> \author NAG Ltd.
  108. *
  109. *> \date November 2019
  110. *
  111. *> \ingroup double_lin
  112. *
  113. * =====================================================================
  114. PROGRAM DCHKAA
  115. *
  116. * -- LAPACK test routine (version 3.9.0) --
  117. * -- LAPACK is a software package provided by Univ. of Tennessee, --
  118. * -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
  119. * Novemebr 2019
  120. *
  121. * =====================================================================
  122. *
  123. * .. Parameters ..
  124. INTEGER NMAX
  125. PARAMETER ( NMAX = 132 )
  126. INTEGER MAXIN
  127. PARAMETER ( MAXIN = 12 )
  128. INTEGER MAXRHS
  129. PARAMETER ( MAXRHS = 16 )
  130. INTEGER MATMAX
  131. PARAMETER ( MATMAX = 30 )
  132. INTEGER NIN, NOUT
  133. PARAMETER ( NIN = 5, NOUT = 6 )
  134. INTEGER KDMAX
  135. PARAMETER ( KDMAX = NMAX+( NMAX+1 ) / 4 )
  136. * ..
  137. * .. Local Scalars ..
  138. LOGICAL FATAL, TSTCHK, TSTDRV, TSTERR
  139. CHARACTER C1
  140. CHARACTER*2 C2
  141. CHARACTER*3 PATH
  142. CHARACTER*10 INTSTR
  143. CHARACTER*72 ALINE
  144. INTEGER I, IC, J, K, LA, LAFAC, LDA, NB, NM, NMATS, NN,
  145. $ NNB, NNB2, NNS, NRHS, NTYPES, NRANK,
  146. $ VERS_MAJOR, VERS_MINOR, VERS_PATCH
  147. DOUBLE PRECISION EPS, S1, S2, THREQ, THRESH
  148. * ..
  149. * .. Local Arrays ..
  150. LOGICAL DOTYPE( MATMAX )
  151. INTEGER IWORK( 25*NMAX ), MVAL( MAXIN ),
  152. $ NBVAL( MAXIN ), NBVAL2( MAXIN ),
  153. $ NSVAL( MAXIN ), NVAL( MAXIN ), NXVAL( MAXIN ),
  154. $ RANKVAL( MAXIN ), PIV( NMAX )
  155. DOUBLE PRECISION A( ( KDMAX+1 )*NMAX, 7 ), B( NMAX*MAXRHS, 4 ),
  156. $ E( NMAX ), RWORK( 5*NMAX+2*MAXRHS ),
  157. $ S( 2*NMAX ), WORK( NMAX, 3*NMAX+MAXRHS+30 )
  158. * ..
  159. * .. External Functions ..
  160. LOGICAL LSAME, LSAMEN
  161. DOUBLE PRECISION DLAMCH, DSECND
  162. EXTERNAL LSAME, LSAMEN, DLAMCH, DSECND
  163. * ..
  164. * .. External Subroutines ..
  165. EXTERNAL ALAREQ, DCHKEQ, DCHKGB, DCHKGE, DCHKGT, DCHKLQ,
  166. $ DCHKORHR_COL, DCHKPB, DCHKPO, DCHKPS, DCHKPP,
  167. $ DCHKPT, DCHKQ3, DCHKQL, DCHKQR, DCHKRQ, DCHKSP,
  168. $ DCHKSY, DCHKSY_ROOK, DCHKSY_RK, DCHKSY_AA,
  169. $ DCHKTB, DCHKTP, DCHKTR, DCHKTZ, DDRVGB, DDRVGE,
  170. $ DDRVGT, DDRVLS, DDRVPB, DDRVPO, DDRVPP, DDRVPT,
  171. $ DDRVSP, DDRVSY, DDRVSY_ROOK, DDRVSY_RK,
  172. $ DDRVSY_AA, ILAVER, DCHKLQTP, DCHKQRT, DCHKQRTP,
  173. $ DCHKLQT,DCHKTSQR
  174. * ..
  175. * .. Scalars in Common ..
  176. LOGICAL LERR, OK
  177. CHARACTER*32 SRNAMT
  178. INTEGER INFOT, NUNIT
  179. * ..
  180. * .. Arrays in Common ..
  181. INTEGER IPARMS( 100 )
  182. * ..
  183. * .. Common blocks ..
  184. COMMON / INFOC / INFOT, NUNIT, OK, LERR
  185. COMMON / SRNAMC / SRNAMT
  186. COMMON / CLAENV / IPARMS
  187. * ..
  188. * .. Data statements ..
  189. DATA THREQ / 2.0D0 / , INTSTR / '0123456789' /
  190. * ..
  191. * .. Executable Statements ..
  192. *
  193. S1 = DSECND( )
  194. LDA = NMAX
  195. FATAL = .FALSE.
  196. *
  197. * Read a dummy line.
  198. *
  199. READ( NIN, FMT = * )
  200. *
  201. * Report values of parameters.
  202. *
  203. CALL ILAVER( VERS_MAJOR, VERS_MINOR, VERS_PATCH )
  204. WRITE( NOUT, FMT = 9994 ) VERS_MAJOR, VERS_MINOR, VERS_PATCH
  205. *
  206. * Read the values of M
  207. *
  208. READ( NIN, FMT = * )NM
  209. IF( NM.LT.1 ) THEN
  210. WRITE( NOUT, FMT = 9996 )' NM ', NM, 1
  211. NM = 0
  212. FATAL = .TRUE.
  213. ELSE IF( NM.GT.MAXIN ) THEN
  214. WRITE( NOUT, FMT = 9995 )' NM ', NM, MAXIN
  215. NM = 0
  216. FATAL = .TRUE.
  217. END IF
  218. READ( NIN, FMT = * )( MVAL( I ), I = 1, NM )
  219. DO 10 I = 1, NM
  220. IF( MVAL( I ).LT.0 ) THEN
  221. WRITE( NOUT, FMT = 9996 )' M ', MVAL( I ), 0
  222. FATAL = .TRUE.
  223. ELSE IF( MVAL( I ).GT.NMAX ) THEN
  224. WRITE( NOUT, FMT = 9995 )' M ', MVAL( I ), NMAX
  225. FATAL = .TRUE.
  226. END IF
  227. 10 CONTINUE
  228. IF( NM.GT.0 )
  229. $ WRITE( NOUT, FMT = 9993 )'M ', ( MVAL( I ), I = 1, NM )
  230. *
  231. * Read the values of N
  232. *
  233. READ( NIN, FMT = * )NN
  234. IF( NN.LT.1 ) THEN
  235. WRITE( NOUT, FMT = 9996 )' NN ', NN, 1
  236. NN = 0
  237. FATAL = .TRUE.
  238. ELSE IF( NN.GT.MAXIN ) THEN
  239. WRITE( NOUT, FMT = 9995 )' NN ', NN, MAXIN
  240. NN = 0
  241. FATAL = .TRUE.
  242. END IF
  243. READ( NIN, FMT = * )( NVAL( I ), I = 1, NN )
  244. DO 20 I = 1, NN
  245. IF( NVAL( I ).LT.0 ) THEN
  246. WRITE( NOUT, FMT = 9996 )' N ', NVAL( I ), 0
  247. FATAL = .TRUE.
  248. ELSE IF( NVAL( I ).GT.NMAX ) THEN
  249. WRITE( NOUT, FMT = 9995 )' N ', NVAL( I ), NMAX
  250. FATAL = .TRUE.
  251. END IF
  252. 20 CONTINUE
  253. IF( NN.GT.0 )
  254. $ WRITE( NOUT, FMT = 9993 )'N ', ( NVAL( I ), I = 1, NN )
  255. *
  256. * Read the values of NRHS
  257. *
  258. READ( NIN, FMT = * )NNS
  259. IF( NNS.LT.1 ) THEN
  260. WRITE( NOUT, FMT = 9996 )' NNS', NNS, 1
  261. NNS = 0
  262. FATAL = .TRUE.
  263. ELSE IF( NNS.GT.MAXIN ) THEN
  264. WRITE( NOUT, FMT = 9995 )' NNS', NNS, MAXIN
  265. NNS = 0
  266. FATAL = .TRUE.
  267. END IF
  268. READ( NIN, FMT = * )( NSVAL( I ), I = 1, NNS )
  269. DO 30 I = 1, NNS
  270. IF( NSVAL( I ).LT.0 ) THEN
  271. WRITE( NOUT, FMT = 9996 )'NRHS', NSVAL( I ), 0
  272. FATAL = .TRUE.
  273. ELSE IF( NSVAL( I ).GT.MAXRHS ) THEN
  274. WRITE( NOUT, FMT = 9995 )'NRHS', NSVAL( I ), MAXRHS
  275. FATAL = .TRUE.
  276. END IF
  277. 30 CONTINUE
  278. IF( NNS.GT.0 )
  279. $ WRITE( NOUT, FMT = 9993 )'NRHS', ( NSVAL( I ), I = 1, NNS )
  280. *
  281. * Read the values of NB
  282. *
  283. READ( NIN, FMT = * )NNB
  284. IF( NNB.LT.1 ) THEN
  285. WRITE( NOUT, FMT = 9996 )'NNB ', NNB, 1
  286. NNB = 0
  287. FATAL = .TRUE.
  288. ELSE IF( NNB.GT.MAXIN ) THEN
  289. WRITE( NOUT, FMT = 9995 )'NNB ', NNB, MAXIN
  290. NNB = 0
  291. FATAL = .TRUE.
  292. END IF
  293. READ( NIN, FMT = * )( NBVAL( I ), I = 1, NNB )
  294. DO 40 I = 1, NNB
  295. IF( NBVAL( I ).LT.0 ) THEN
  296. WRITE( NOUT, FMT = 9996 )' NB ', NBVAL( I ), 0
  297. FATAL = .TRUE.
  298. END IF
  299. 40 CONTINUE
  300. IF( NNB.GT.0 )
  301. $ WRITE( NOUT, FMT = 9993 )'NB ', ( NBVAL( I ), I = 1, NNB )
  302. *
  303. * Set NBVAL2 to be the set of unique values of NB
  304. *
  305. NNB2 = 0
  306. DO 60 I = 1, NNB
  307. NB = NBVAL( I )
  308. DO 50 J = 1, NNB2
  309. IF( NB.EQ.NBVAL2( J ) )
  310. $ GO TO 60
  311. 50 CONTINUE
  312. NNB2 = NNB2 + 1
  313. NBVAL2( NNB2 ) = NB
  314. 60 CONTINUE
  315. *
  316. * Read the values of NX
  317. *
  318. READ( NIN, FMT = * )( NXVAL( I ), I = 1, NNB )
  319. DO 70 I = 1, NNB
  320. IF( NXVAL( I ).LT.0 ) THEN
  321. WRITE( NOUT, FMT = 9996 )' NX ', NXVAL( I ), 0
  322. FATAL = .TRUE.
  323. END IF
  324. 70 CONTINUE
  325. IF( NNB.GT.0 )
  326. $ WRITE( NOUT, FMT = 9993 )'NX ', ( NXVAL( I ), I = 1, NNB )
  327. *
  328. * Read the values of RANKVAL
  329. *
  330. READ( NIN, FMT = * )NRANK
  331. IF( NN.LT.1 ) THEN
  332. WRITE( NOUT, FMT = 9996 )' NRANK ', NRANK, 1
  333. NRANK = 0
  334. FATAL = .TRUE.
  335. ELSE IF( NN.GT.MAXIN ) THEN
  336. WRITE( NOUT, FMT = 9995 )' NRANK ', NRANK, MAXIN
  337. NRANK = 0
  338. FATAL = .TRUE.
  339. END IF
  340. READ( NIN, FMT = * )( RANKVAL( I ), I = 1, NRANK )
  341. DO I = 1, NRANK
  342. IF( RANKVAL( I ).LT.0 ) THEN
  343. WRITE( NOUT, FMT = 9996 )' RANK ', RANKVAL( I ), 0
  344. FATAL = .TRUE.
  345. ELSE IF( RANKVAL( I ).GT.100 ) THEN
  346. WRITE( NOUT, FMT = 9995 )' RANK ', RANKVAL( I ), 100
  347. FATAL = .TRUE.
  348. END IF
  349. END DO
  350. IF( NRANK.GT.0 )
  351. $ WRITE( NOUT, FMT = 9993 )'RANK % OF N',
  352. $ ( RANKVAL( I ), I = 1, NRANK )
  353. *
  354. * Read the threshold value for the test ratios.
  355. *
  356. READ( NIN, FMT = * )THRESH
  357. WRITE( NOUT, FMT = 9992 )THRESH
  358. *
  359. * Read the flag that indicates whether to test the LAPACK routines.
  360. *
  361. READ( NIN, FMT = * )TSTCHK
  362. *
  363. * Read the flag that indicates whether to test the driver routines.
  364. *
  365. READ( NIN, FMT = * )TSTDRV
  366. *
  367. * Read the flag that indicates whether to test the error exits.
  368. *
  369. READ( NIN, FMT = * )TSTERR
  370. *
  371. IF( FATAL ) THEN
  372. WRITE( NOUT, FMT = 9999 )
  373. STOP
  374. END IF
  375. *
  376. * Calculate and print the machine dependent constants.
  377. *
  378. EPS = DLAMCH( 'Underflow threshold' )
  379. WRITE( NOUT, FMT = 9991 )'underflow', EPS
  380. EPS = DLAMCH( 'Overflow threshold' )
  381. WRITE( NOUT, FMT = 9991 )'overflow ', EPS
  382. EPS = DLAMCH( 'Epsilon' )
  383. WRITE( NOUT, FMT = 9991 )'precision', EPS
  384. WRITE( NOUT, FMT = * )
  385. *
  386. 80 CONTINUE
  387. *
  388. * Read a test path and the number of matrix types to use.
  389. *
  390. READ( NIN, FMT = '(A72)', END = 140 )ALINE
  391. PATH = ALINE( 1: 3 )
  392. NMATS = MATMAX
  393. I = 3
  394. 90 CONTINUE
  395. I = I + 1
  396. IF( I.GT.72 ) THEN
  397. NMATS = MATMAX
  398. GO TO 130
  399. END IF
  400. IF( ALINE( I: I ).EQ.' ' )
  401. $ GO TO 90
  402. NMATS = 0
  403. 100 CONTINUE
  404. C1 = ALINE( I: I )
  405. DO 110 K = 1, 10
  406. IF( C1.EQ.INTSTR( K: K ) ) THEN
  407. IC = K - 1
  408. GO TO 120
  409. END IF
  410. 110 CONTINUE
  411. GO TO 130
  412. 120 CONTINUE
  413. NMATS = NMATS*10 + IC
  414. I = I + 1
  415. IF( I.GT.72 )
  416. $ GO TO 130
  417. GO TO 100
  418. 130 CONTINUE
  419. C1 = PATH( 1: 1 )
  420. C2 = PATH( 2: 3 )
  421. NRHS = NSVAL( 1 )
  422. *
  423. * Check first character for correct precision.
  424. *
  425. IF( .NOT.LSAME( C1, 'Double precision' ) ) THEN
  426. WRITE( NOUT, FMT = 9990 )PATH
  427. *
  428. ELSE IF( NMATS.LE.0 ) THEN
  429. *
  430. * Check for a positive number of tests requested.
  431. *
  432. WRITE( NOUT, FMT = 9989 )PATH
  433. *
  434. ELSE IF( LSAMEN( 2, C2, 'GE' ) ) THEN
  435. *
  436. * GE: general matrices
  437. *
  438. NTYPES = 11
  439. CALL ALAREQ( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT )
  440. *
  441. IF( TSTCHK ) THEN
  442. CALL DCHKGE( DOTYPE, NM, MVAL, NN, NVAL, NNB2, NBVAL2, NNS,
  443. $ NSVAL, THRESH, TSTERR, LDA, A( 1, 1 ),
  444. $ A( 1, 2 ), A( 1, 3 ), B( 1, 1 ), B( 1, 2 ),
  445. $ B( 1, 3 ), WORK, RWORK, IWORK, NOUT )
  446. ELSE
  447. WRITE( NOUT, FMT = 9989 )PATH
  448. END IF
  449. *
  450. IF( TSTDRV ) THEN
  451. CALL DDRVGE( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, LDA,
  452. $ A( 1, 1 ), A( 1, 2 ), A( 1, 3 ), B( 1, 1 ),
  453. $ B( 1, 2 ), B( 1, 3 ), B( 1, 4 ), S, WORK,
  454. $ RWORK, IWORK, NOUT )
  455. ELSE
  456. WRITE( NOUT, FMT = 9988 )PATH
  457. END IF
  458. *
  459. ELSE IF( LSAMEN( 2, C2, 'GB' ) ) THEN
  460. *
  461. * GB: general banded matrices
  462. *
  463. LA = ( 2*KDMAX+1 )*NMAX
  464. LAFAC = ( 3*KDMAX+1 )*NMAX
  465. NTYPES = 8
  466. CALL ALAREQ( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT )
  467. *
  468. IF( TSTCHK ) THEN
  469. CALL DCHKGB( DOTYPE, NM, MVAL, NN, NVAL, NNB2, NBVAL2, NNS,
  470. $ NSVAL, THRESH, TSTERR, A( 1, 1 ), LA,
  471. $ A( 1, 3 ), LAFAC, B( 1, 1 ), B( 1, 2 ),
  472. $ B( 1, 3 ), WORK, RWORK, IWORK, NOUT )
  473. ELSE
  474. WRITE( NOUT, FMT = 9989 )PATH
  475. END IF
  476. *
  477. IF( TSTDRV ) THEN
  478. CALL DDRVGB( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR,
  479. $ A( 1, 1 ), LA, A( 1, 3 ), LAFAC, A( 1, 6 ),
  480. $ B( 1, 1 ), B( 1, 2 ), B( 1, 3 ), B( 1, 4 ), S,
  481. $ WORK, RWORK, IWORK, NOUT )
  482. ELSE
  483. WRITE( NOUT, FMT = 9988 )PATH
  484. END IF
  485. *
  486. ELSE IF( LSAMEN( 2, C2, 'GT' ) ) THEN
  487. *
  488. * GT: general tridiagonal matrices
  489. *
  490. NTYPES = 12
  491. CALL ALAREQ( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT )
  492. *
  493. IF( TSTCHK ) THEN
  494. CALL DCHKGT( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR,
  495. $ A( 1, 1 ), A( 1, 2 ), B( 1, 1 ), B( 1, 2 ),
  496. $ B( 1, 3 ), WORK, RWORK, IWORK, NOUT )
  497. ELSE
  498. WRITE( NOUT, FMT = 9989 )PATH
  499. END IF
  500. *
  501. IF( TSTDRV ) THEN
  502. CALL DDRVGT( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR,
  503. $ A( 1, 1 ), A( 1, 2 ), B( 1, 1 ), B( 1, 2 ),
  504. $ B( 1, 3 ), WORK, RWORK, IWORK, NOUT )
  505. ELSE
  506. WRITE( NOUT, FMT = 9988 )PATH
  507. END IF
  508. *
  509. ELSE IF( LSAMEN( 2, C2, 'PO' ) ) THEN
  510. *
  511. * PO: positive definite matrices
  512. *
  513. NTYPES = 9
  514. CALL ALAREQ( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT )
  515. *
  516. IF( TSTCHK ) THEN
  517. CALL DCHKPO( DOTYPE, NN, NVAL, NNB2, NBVAL2, NNS, NSVAL,
  518. $ THRESH, TSTERR, LDA, A( 1, 1 ), A( 1, 2 ),
  519. $ A( 1, 3 ), B( 1, 1 ), B( 1, 2 ), B( 1, 3 ),
  520. $ WORK, RWORK, IWORK, NOUT )
  521. ELSE
  522. WRITE( NOUT, FMT = 9989 )PATH
  523. END IF
  524. *
  525. IF( TSTDRV ) THEN
  526. CALL DDRVPO( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, LDA,
  527. $ A( 1, 1 ), A( 1, 2 ), A( 1, 3 ), B( 1, 1 ),
  528. $ B( 1, 2 ), B( 1, 3 ), B( 1, 4 ), S, WORK,
  529. $ RWORK, IWORK, NOUT )
  530. ELSE
  531. WRITE( NOUT, FMT = 9988 )PATH
  532. END IF
  533. *
  534. ELSE IF( LSAMEN( 2, C2, 'PS' ) ) THEN
  535. *
  536. * PS: positive semi-definite matrices
  537. *
  538. NTYPES = 9
  539. *
  540. CALL ALAREQ( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT )
  541. *
  542. IF( TSTCHK ) THEN
  543. CALL DCHKPS( DOTYPE, NN, NVAL, NNB2, NBVAL2, NRANK,
  544. $ RANKVAL, THRESH, TSTERR, LDA, A( 1, 1 ),
  545. $ A( 1, 2 ), A( 1, 3 ), PIV, WORK, RWORK,
  546. $ NOUT )
  547. ELSE
  548. WRITE( NOUT, FMT = 9989 )PATH
  549. END IF
  550. *
  551. ELSE IF( LSAMEN( 2, C2, 'PP' ) ) THEN
  552. *
  553. * PP: positive definite packed matrices
  554. *
  555. NTYPES = 9
  556. CALL ALAREQ( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT )
  557. *
  558. IF( TSTCHK ) THEN
  559. CALL DCHKPP( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR,
  560. $ LDA, A( 1, 1 ), A( 1, 2 ), A( 1, 3 ),
  561. $ B( 1, 1 ), B( 1, 2 ), B( 1, 3 ), WORK, RWORK,
  562. $ IWORK, NOUT )
  563. ELSE
  564. WRITE( NOUT, FMT = 9989 )PATH
  565. END IF
  566. *
  567. IF( TSTDRV ) THEN
  568. CALL DDRVPP( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, LDA,
  569. $ A( 1, 1 ), A( 1, 2 ), A( 1, 3 ), B( 1, 1 ),
  570. $ B( 1, 2 ), B( 1, 3 ), B( 1, 4 ), S, WORK,
  571. $ RWORK, IWORK, NOUT )
  572. ELSE
  573. WRITE( NOUT, FMT = 9988 )PATH
  574. END IF
  575. *
  576. ELSE IF( LSAMEN( 2, C2, 'PB' ) ) THEN
  577. *
  578. * PB: positive definite banded matrices
  579. *
  580. NTYPES = 8
  581. CALL ALAREQ( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT )
  582. *
  583. IF( TSTCHK ) THEN
  584. CALL DCHKPB( DOTYPE, NN, NVAL, NNB2, NBVAL2, NNS, NSVAL,
  585. $ THRESH, TSTERR, LDA, A( 1, 1 ), A( 1, 2 ),
  586. $ A( 1, 3 ), B( 1, 1 ), B( 1, 2 ), B( 1, 3 ),
  587. $ WORK, RWORK, IWORK, NOUT )
  588. ELSE
  589. WRITE( NOUT, FMT = 9989 )PATH
  590. END IF
  591. *
  592. IF( TSTDRV ) THEN
  593. CALL DDRVPB( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, LDA,
  594. $ A( 1, 1 ), A( 1, 2 ), A( 1, 3 ), B( 1, 1 ),
  595. $ B( 1, 2 ), B( 1, 3 ), B( 1, 4 ), S, WORK,
  596. $ RWORK, IWORK, NOUT )
  597. ELSE
  598. WRITE( NOUT, FMT = 9988 )PATH
  599. END IF
  600. *
  601. ELSE IF( LSAMEN( 2, C2, 'PT' ) ) THEN
  602. *
  603. * PT: positive definite tridiagonal matrices
  604. *
  605. NTYPES = 12
  606. CALL ALAREQ( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT )
  607. *
  608. IF( TSTCHK ) THEN
  609. CALL DCHKPT( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR,
  610. $ A( 1, 1 ), A( 1, 2 ), A( 1, 3 ), B( 1, 1 ),
  611. $ B( 1, 2 ), B( 1, 3 ), WORK, RWORK, NOUT )
  612. ELSE
  613. WRITE( NOUT, FMT = 9989 )PATH
  614. END IF
  615. *
  616. IF( TSTDRV ) THEN
  617. CALL DDRVPT( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR,
  618. $ A( 1, 1 ), A( 1, 2 ), A( 1, 3 ), B( 1, 1 ),
  619. $ B( 1, 2 ), B( 1, 3 ), WORK, RWORK, NOUT )
  620. ELSE
  621. WRITE( NOUT, FMT = 9988 )PATH
  622. END IF
  623. *
  624. ELSE IF( LSAMEN( 2, C2, 'SY' ) ) THEN
  625. *
  626. * SY: symmetric indefinite matrices,
  627. * with partial (Bunch-Kaufman) pivoting algorithm
  628. *
  629. NTYPES = 10
  630. CALL ALAREQ( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT )
  631. *
  632. IF( TSTCHK ) THEN
  633. CALL DCHKSY( DOTYPE, NN, NVAL, NNB2, NBVAL2, NNS, NSVAL,
  634. $ THRESH, TSTERR, LDA, A( 1, 1 ), A( 1, 2 ),
  635. $ A( 1, 3 ), B( 1, 1 ), B( 1, 2 ), B( 1, 3 ),
  636. $ WORK, RWORK, IWORK, NOUT )
  637. ELSE
  638. WRITE( NOUT, FMT = 9989 )PATH
  639. END IF
  640. *
  641. IF( TSTDRV ) THEN
  642. CALL DDRVSY( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, LDA,
  643. $ A( 1, 1 ), A( 1, 2 ), A( 1, 3 ), B( 1, 1 ),
  644. $ B( 1, 2 ), B( 1, 3 ), WORK, RWORK, IWORK,
  645. $ NOUT )
  646. ELSE
  647. WRITE( NOUT, FMT = 9988 )PATH
  648. END IF
  649. *
  650. ELSE IF( LSAMEN( 2, C2, 'SR' ) ) THEN
  651. *
  652. * SR: symmetric indefinite matrices,
  653. * with bounded Bunch-Kaufman (rook) pivoting algorithm
  654. *
  655. NTYPES = 10
  656. CALL ALAREQ( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT )
  657. *
  658. IF( TSTCHK ) THEN
  659. CALL DCHKSY_ROOK(DOTYPE, NN, NVAL, NNB2, NBVAL2, NNS, NSVAL,
  660. $ THRESH, TSTERR, LDA, A( 1, 1 ), A( 1, 2 ),
  661. $ A( 1, 3 ), B( 1, 1 ), B( 1, 2 ), B( 1, 3 ),
  662. $ WORK, RWORK, IWORK, NOUT )
  663. ELSE
  664. WRITE( NOUT, FMT = 9989 )PATH
  665. END IF
  666. *
  667. IF( TSTDRV ) THEN
  668. CALL DDRVSY_ROOK( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR,
  669. $ LDA, A( 1, 1 ), A( 1, 2 ), A( 1, 3 ),
  670. $ B( 1, 1 ), B( 1, 2 ), B( 1, 3 ),
  671. $ WORK, RWORK, IWORK, NOUT )
  672. ELSE
  673. WRITE( NOUT, FMT = 9988 )PATH
  674. END IF
  675. *
  676. ELSE IF( LSAMEN( 2, C2, 'SK' ) ) THEN
  677. *
  678. * SK: symmetric indefinite matrices,
  679. * with bounded Bunch-Kaufman (rook) pivoting algorithm,
  680. * differnet matrix storage format than SR path version.
  681. *
  682. NTYPES = 10
  683. CALL ALAREQ( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT )
  684. *
  685. IF( TSTCHK ) THEN
  686. CALL DCHKSY_RK( DOTYPE, NN, NVAL, NNB2, NBVAL2, NNS, NSVAL,
  687. $ THRESH, TSTERR, LDA, A( 1, 1 ), A( 1, 2 ),
  688. $ E, A( 1, 3 ), B( 1, 1 ), B( 1, 2 ),
  689. $ B( 1, 3 ), WORK, RWORK, IWORK, NOUT )
  690. ELSE
  691. WRITE( NOUT, FMT = 9989 )PATH
  692. END IF
  693. *
  694. IF( TSTDRV ) THEN
  695. CALL DDRVSY_RK( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR,
  696. $ LDA, A( 1, 1 ), A( 1, 2 ), E, A( 1, 3 ),
  697. $ B( 1, 1 ), B( 1, 2 ), B( 1, 3 ),
  698. $ WORK, RWORK, IWORK, NOUT )
  699. ELSE
  700. WRITE( NOUT, FMT = 9988 )PATH
  701. END IF
  702. *
  703. ELSE IF( LSAMEN( 2, C2, 'SA' ) ) THEN
  704. *
  705. * SA: symmetric indefinite matrices,
  706. * with partial (Aasen's) pivoting algorithm
  707. *
  708. NTYPES = 10
  709. CALL ALAREQ( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT )
  710. *
  711. IF( TSTCHK ) THEN
  712. CALL DCHKSY_AA( DOTYPE, NN, NVAL, NNB2, NBVAL2, NNS,
  713. $ NSVAL, THRESH, TSTERR, LDA,
  714. $ A( 1, 1 ), A( 1, 2 ), A( 1, 3 ),
  715. $ B( 1, 1 ), B( 1, 2 ), B( 1, 3 ),
  716. $ WORK, RWORK, IWORK, NOUT )
  717. ELSE
  718. WRITE( NOUT, FMT = 9989 )PATH
  719. END IF
  720. *
  721. IF( TSTDRV ) THEN
  722. CALL DDRVSY_AA( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR,
  723. $ LDA, A( 1, 1 ), A( 1, 2 ), A( 1, 3 ),
  724. $ B( 1, 1 ), B( 1, 2 ), B( 1, 3 ),
  725. $ WORK, RWORK, IWORK, NOUT )
  726. ELSE
  727. WRITE( NOUT, FMT = 9988 )PATH
  728. END IF
  729. *
  730. *
  731. ELSE IF( LSAMEN( 2, C2, 'S2' ) ) THEN
  732. *
  733. * SA: symmetric indefinite matrices,
  734. * with partial (Aasen's) pivoting algorithm
  735. *
  736. NTYPES = 10
  737. CALL ALAREQ( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT )
  738. *
  739. IF( TSTCHK ) THEN
  740. CALL DCHKSY_AA_2STAGE( DOTYPE, NN, NVAL, NNB2, NBVAL2,
  741. $ NNS, NSVAL, THRESH, TSTERR, LDA,
  742. $ A( 1, 1 ), A( 1, 2 ), A( 1, 3 ),
  743. $ B( 1, 1 ), B( 1, 2 ), B( 1, 3 ),
  744. $ WORK, RWORK, IWORK, NOUT )
  745. ELSE
  746. WRITE( NOUT, FMT = 9989 )PATH
  747. END IF
  748. *
  749. IF( TSTDRV ) THEN
  750. CALL DDRVSY_AA_2STAGE(
  751. $ DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR,
  752. $ LDA, A( 1, 1 ), A( 1, 2 ), A( 1, 3 ),
  753. $ B( 1, 1 ), B( 1, 2 ), B( 1, 3 ),
  754. $ WORK, RWORK, IWORK, NOUT )
  755. ELSE
  756. WRITE( NOUT, FMT = 9988 )PATH
  757. END IF
  758. *
  759. *
  760. ELSE IF( LSAMEN( 2, C2, 'SP' ) ) THEN
  761. *
  762. * SP: symmetric indefinite packed matrices,
  763. * with partial (Bunch-Kaufman) pivoting algorithm
  764. *
  765. NTYPES = 10
  766. CALL ALAREQ( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT )
  767. *
  768. IF( TSTCHK ) THEN
  769. CALL DCHKSP( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR,
  770. $ LDA, A( 1, 1 ), A( 1, 2 ), A( 1, 3 ),
  771. $ B( 1, 1 ), B( 1, 2 ), B( 1, 3 ), WORK, RWORK,
  772. $ IWORK, NOUT )
  773. ELSE
  774. WRITE( NOUT, FMT = 9989 )PATH
  775. END IF
  776. *
  777. IF( TSTDRV ) THEN
  778. CALL DDRVSP( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, LDA,
  779. $ A( 1, 1 ), A( 1, 2 ), A( 1, 3 ), B( 1, 1 ),
  780. $ B( 1, 2 ), B( 1, 3 ), WORK, RWORK, IWORK,
  781. $ NOUT )
  782. ELSE
  783. WRITE( NOUT, FMT = 9988 )PATH
  784. END IF
  785. *
  786. ELSE IF( LSAMEN( 2, C2, 'TR' ) ) THEN
  787. *
  788. * TR: triangular matrices
  789. *
  790. NTYPES = 18
  791. CALL ALAREQ( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT )
  792. *
  793. IF( TSTCHK ) THEN
  794. CALL DCHKTR( DOTYPE, NN, NVAL, NNB2, NBVAL2, NNS, NSVAL,
  795. $ THRESH, TSTERR, LDA, A( 1, 1 ), A( 1, 2 ),
  796. $ B( 1, 1 ), B( 1, 2 ), B( 1, 3 ), WORK, RWORK,
  797. $ IWORK, NOUT )
  798. ELSE
  799. WRITE( NOUT, FMT = 9989 )PATH
  800. END IF
  801. *
  802. ELSE IF( LSAMEN( 2, C2, 'TP' ) ) THEN
  803. *
  804. * TP: triangular packed matrices
  805. *
  806. NTYPES = 18
  807. CALL ALAREQ( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT )
  808. *
  809. IF( TSTCHK ) THEN
  810. CALL DCHKTP( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR,
  811. $ LDA, A( 1, 1 ), A( 1, 2 ), B( 1, 1 ),
  812. $ B( 1, 2 ), B( 1, 3 ), WORK, RWORK, IWORK,
  813. $ NOUT )
  814. ELSE
  815. WRITE( NOUT, FMT = 9989 )PATH
  816. END IF
  817. *
  818. ELSE IF( LSAMEN( 2, C2, 'TB' ) ) THEN
  819. *
  820. * TB: triangular banded matrices
  821. *
  822. NTYPES = 17
  823. CALL ALAREQ( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT )
  824. *
  825. IF( TSTCHK ) THEN
  826. CALL DCHKTB( DOTYPE, NN, NVAL, NNS, NSVAL, THRESH, TSTERR,
  827. $ LDA, A( 1, 1 ), A( 1, 2 ), B( 1, 1 ),
  828. $ B( 1, 2 ), B( 1, 3 ), WORK, RWORK, IWORK,
  829. $ NOUT )
  830. ELSE
  831. WRITE( NOUT, FMT = 9989 )PATH
  832. END IF
  833. *
  834. ELSE IF( LSAMEN( 2, C2, 'QR' ) ) THEN
  835. *
  836. * QR: QR factorization
  837. *
  838. NTYPES = 8
  839. CALL ALAREQ( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT )
  840. *
  841. IF( TSTCHK ) THEN
  842. CALL DCHKQR( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NXVAL,
  843. $ NRHS, THRESH, TSTERR, NMAX, A( 1, 1 ),
  844. $ A( 1, 2 ), A( 1, 3 ), A( 1, 4 ), A( 1, 5 ),
  845. $ B( 1, 1 ), B( 1, 2 ), B( 1, 3 ), B( 1, 4 ),
  846. $ WORK, RWORK, IWORK, NOUT )
  847. ELSE
  848. WRITE( NOUT, FMT = 9989 )PATH
  849. END IF
  850. *
  851. ELSE IF( LSAMEN( 2, C2, 'LQ' ) ) THEN
  852. *
  853. * LQ: LQ factorization
  854. *
  855. NTYPES = 8
  856. CALL ALAREQ( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT )
  857. *
  858. IF( TSTCHK ) THEN
  859. CALL DCHKLQ( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NXVAL,
  860. $ NRHS, THRESH, TSTERR, NMAX, A( 1, 1 ),
  861. $ A( 1, 2 ), A( 1, 3 ), A( 1, 4 ), A( 1, 5 ),
  862. $ B( 1, 1 ), B( 1, 2 ), B( 1, 3 ), B( 1, 4 ),
  863. $ WORK, RWORK, NOUT )
  864. ELSE
  865. WRITE( NOUT, FMT = 9989 )PATH
  866. END IF
  867. *
  868. ELSE IF( LSAMEN( 2, C2, 'QL' ) ) THEN
  869. *
  870. * QL: QL factorization
  871. *
  872. NTYPES = 8
  873. CALL ALAREQ( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT )
  874. *
  875. IF( TSTCHK ) THEN
  876. CALL DCHKQL( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NXVAL,
  877. $ NRHS, THRESH, TSTERR, NMAX, A( 1, 1 ),
  878. $ A( 1, 2 ), A( 1, 3 ), A( 1, 4 ), A( 1, 5 ),
  879. $ B( 1, 1 ), B( 1, 2 ), B( 1, 3 ), B( 1, 4 ),
  880. $ WORK, RWORK, NOUT )
  881. ELSE
  882. WRITE( NOUT, FMT = 9989 )PATH
  883. END IF
  884. *
  885. ELSE IF( LSAMEN( 2, C2, 'RQ' ) ) THEN
  886. *
  887. * RQ: RQ factorization
  888. *
  889. NTYPES = 8
  890. CALL ALAREQ( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT )
  891. *
  892. IF( TSTCHK ) THEN
  893. CALL DCHKRQ( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NXVAL,
  894. $ NRHS, THRESH, TSTERR, NMAX, A( 1, 1 ),
  895. $ A( 1, 2 ), A( 1, 3 ), A( 1, 4 ), A( 1, 5 ),
  896. $ B( 1, 1 ), B( 1, 2 ), B( 1, 3 ), B( 1, 4 ),
  897. $ WORK, RWORK, IWORK, NOUT )
  898. ELSE
  899. WRITE( NOUT, FMT = 9989 )PATH
  900. END IF
  901. *
  902. ELSE IF( LSAMEN( 2, C2, 'QP' ) ) THEN
  903. *
  904. * QP: QR factorization with pivoting
  905. *
  906. NTYPES = 6
  907. CALL ALAREQ( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT )
  908. *
  909. IF( TSTCHK ) THEN
  910. CALL DCHKQ3( DOTYPE, NM, MVAL, NN, NVAL, NNB, NBVAL, NXVAL,
  911. $ THRESH, A( 1, 1 ), A( 1, 2 ), B( 1, 1 ),
  912. $ B( 1, 3 ), WORK, IWORK, NOUT )
  913. ELSE
  914. WRITE( NOUT, FMT = 9989 )PATH
  915. END IF
  916. *
  917. ELSE IF( LSAMEN( 2, C2, 'TZ' ) ) THEN
  918. *
  919. * TZ: Trapezoidal matrix
  920. *
  921. NTYPES = 3
  922. CALL ALAREQ( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT )
  923. *
  924. IF( TSTCHK ) THEN
  925. CALL DCHKTZ( DOTYPE, NM, MVAL, NN, NVAL, THRESH, TSTERR,
  926. $ A( 1, 1 ), A( 1, 2 ), B( 1, 1 ),
  927. $ B( 1, 3 ), WORK, NOUT )
  928. ELSE
  929. WRITE( NOUT, FMT = 9989 )PATH
  930. END IF
  931. *
  932. ELSE IF( LSAMEN( 2, C2, 'LS' ) ) THEN
  933. *
  934. * LS: Least squares drivers
  935. *
  936. NTYPES = 6
  937. CALL ALAREQ( PATH, NMATS, DOTYPE, NTYPES, NIN, NOUT )
  938. *
  939. IF( TSTDRV ) THEN
  940. CALL DDRVLS( DOTYPE, NM, MVAL, NN, NVAL, NNS, NSVAL, NNB,
  941. $ NBVAL, NXVAL, THRESH, TSTERR, A( 1, 1 ),
  942. $ A( 1, 2 ), B( 1, 1 ), B( 1, 2 ), B( 1, 3 ),
  943. $ RWORK, RWORK( NMAX+1 ), NOUT )
  944. ELSE
  945. WRITE( NOUT, FMT = 9988 )PATH
  946. END IF
  947. *
  948. ELSE IF( LSAMEN( 2, C2, 'EQ' ) ) THEN
  949. *
  950. * EQ: Equilibration routines for general and positive definite
  951. * matrices (THREQ should be between 2 and 10)
  952. *
  953. IF( TSTCHK ) THEN
  954. CALL DCHKEQ( THREQ, NOUT )
  955. ELSE
  956. WRITE( NOUT, FMT = 9989 )PATH
  957. END IF
  958. *
  959. ELSE IF( LSAMEN( 2, C2, 'QT' ) ) THEN
  960. *
  961. * QT: QRT routines for general matrices
  962. *
  963. IF( TSTCHK ) THEN
  964. CALL DCHKQRT( THRESH, TSTERR, NM, MVAL, NN, NVAL, NNB,
  965. $ NBVAL, NOUT )
  966. ELSE
  967. WRITE( NOUT, FMT = 9989 )PATH
  968. END IF
  969. *
  970. ELSE IF( LSAMEN( 2, C2, 'QX' ) ) THEN
  971. *
  972. * QX: QRT routines for triangular-pentagonal matrices
  973. *
  974. IF( TSTCHK ) THEN
  975. CALL DCHKQRTP( THRESH, TSTERR, NM, MVAL, NN, NVAL, NNB,
  976. $ NBVAL, NOUT )
  977. ELSE
  978. WRITE( NOUT, FMT = 9989 )PATH
  979. END IF
  980. *
  981. ELSE IF( LSAMEN( 2, C2, 'TQ' ) ) THEN
  982. *
  983. * TQ: LQT routines for general matrices
  984. *
  985. IF( TSTCHK ) THEN
  986. CALL DCHKLQT( THRESH, TSTERR, NM, MVAL, NN, NVAL, NNB,
  987. $ NBVAL, NOUT )
  988. ELSE
  989. WRITE( NOUT, FMT = 9989 )PATH
  990. END IF
  991. *
  992. ELSE IF( LSAMEN( 2, C2, 'XQ' ) ) THEN
  993. *
  994. * XQ: LQT routines for triangular-pentagonal matrices
  995. *
  996. IF( TSTCHK ) THEN
  997. CALL DCHKLQTP( THRESH, TSTERR, NM, MVAL, NN, NVAL, NNB,
  998. $ NBVAL, NOUT )
  999. ELSE
  1000. WRITE( NOUT, FMT = 9989 )PATH
  1001. END IF
  1002. *
  1003. ELSE IF( LSAMEN( 2, C2, 'TS' ) ) THEN
  1004. *
  1005. * TS: QR routines for tall-skinny matrices
  1006. *
  1007. IF( TSTCHK ) THEN
  1008. CALL DCHKTSQR( THRESH, TSTERR, NM, MVAL, NN, NVAL, NNB,
  1009. $ NBVAL, NOUT )
  1010. ELSE
  1011. WRITE( NOUT, FMT = 9989 )PATH
  1012. END IF
  1013. *
  1014. ELSE IF( LSAMEN( 2, C2, 'HH' ) ) THEN
  1015. *
  1016. * HH: Householder reconstruction for tall-skinny matrices
  1017. *
  1018. IF( TSTCHK ) THEN
  1019. CALL DCHKORHR_COL( THRESH, TSTERR, NM, MVAL, NN, NVAL, NNB,
  1020. $ NBVAL, NOUT )
  1021. ELSE
  1022. WRITE( NOUT, FMT = 9989 ) PATH
  1023. END IF
  1024. *
  1025. ELSE
  1026. *
  1027. WRITE( NOUT, FMT = 9990 )PATH
  1028. END IF
  1029. *
  1030. * Go back to get another input line.
  1031. *
  1032. GO TO 80
  1033. *
  1034. * Branch to this line when the last record is read.
  1035. *
  1036. 140 CONTINUE
  1037. CLOSE ( NIN )
  1038. S2 = DSECND( )
  1039. WRITE( NOUT, FMT = 9998 )
  1040. WRITE( NOUT, FMT = 9997 )S2 - S1
  1041. *
  1042. 9999 FORMAT( / ' Execution not attempted due to input errors' )
  1043. 9998 FORMAT( / ' End of tests' )
  1044. 9997 FORMAT( ' Total time used = ', F12.2, ' seconds', / )
  1045. 9996 FORMAT( ' Invalid input value: ', A4, '=', I6, '; must be >=',
  1046. $ I6 )
  1047. 9995 FORMAT( ' Invalid input value: ', A4, '=', I6, '; must be <=',
  1048. $ I6 )
  1049. 9994 FORMAT( ' Tests of the DOUBLE PRECISION LAPACK routines ',
  1050. $ / ' LAPACK VERSION ', I1, '.', I1, '.', I1,
  1051. $ / / ' The following parameter values will be used:' )
  1052. 9993 FORMAT( 4X, A4, ': ', 10I6, / 11X, 10I6 )
  1053. 9992 FORMAT( / ' Routines pass computational tests if test ratio is ',
  1054. $ 'less than', F8.2, / )
  1055. 9991 FORMAT( ' Relative machine ', A, ' is taken to be', D16.6 )
  1056. 9990 FORMAT( / 1X, A3, ': Unrecognized path name' )
  1057. 9989 FORMAT( / 1X, A3, ' routines were not tested' )
  1058. 9988 FORMAT( / 1X, A3, ' driver routines were not tested' )
  1059. *
  1060. * End of DCHKAA
  1061. *
  1062. END