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.

sdrvpt.f 18 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578
  1. *> \brief \b SDRVPT
  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 SDRVPT( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, A, D,
  12. * E, B, X, XACT, WORK, RWORK, NOUT )
  13. *
  14. * .. Scalar Arguments ..
  15. * LOGICAL TSTERR
  16. * INTEGER NN, NOUT, NRHS
  17. * REAL THRESH
  18. * ..
  19. * .. Array Arguments ..
  20. * LOGICAL DOTYPE( * )
  21. * INTEGER NVAL( * )
  22. * REAL A( * ), B( * ), D( * ), E( * ), RWORK( * ),
  23. * $ WORK( * ), X( * ), XACT( * )
  24. * ..
  25. *
  26. *
  27. *> \par Purpose:
  28. * =============
  29. *>
  30. *> \verbatim
  31. *>
  32. *> SDRVPT tests SPTSV and -SVX.
  33. *> \endverbatim
  34. *
  35. * Arguments:
  36. * ==========
  37. *
  38. *> \param[in] DOTYPE
  39. *> \verbatim
  40. *> DOTYPE is LOGICAL array, dimension (NTYPES)
  41. *> The matrix types to be used for testing. Matrices of type j
  42. *> (for 1 <= j <= NTYPES) are used for testing if DOTYPE(j) =
  43. *> .TRUE.; if DOTYPE(j) = .FALSE., then type j is not used.
  44. *> \endverbatim
  45. *>
  46. *> \param[in] NN
  47. *> \verbatim
  48. *> NN is INTEGER
  49. *> The number of values of N contained in the vector NVAL.
  50. *> \endverbatim
  51. *>
  52. *> \param[in] NVAL
  53. *> \verbatim
  54. *> NVAL is INTEGER array, dimension (NN)
  55. *> The values of the matrix dimension N.
  56. *> \endverbatim
  57. *>
  58. *> \param[in] NRHS
  59. *> \verbatim
  60. *> NRHS is INTEGER
  61. *> The number of right hand side vectors to be generated for
  62. *> each linear system.
  63. *> \endverbatim
  64. *>
  65. *> \param[in] THRESH
  66. *> \verbatim
  67. *> THRESH is REAL
  68. *> The threshold value for the test ratios. A result is
  69. *> included in the output file if RESULT >= THRESH. To have
  70. *> every test ratio printed, use THRESH = 0.
  71. *> \endverbatim
  72. *>
  73. *> \param[in] TSTERR
  74. *> \verbatim
  75. *> TSTERR is LOGICAL
  76. *> Flag that indicates whether error exits are to be tested.
  77. *> \endverbatim
  78. *>
  79. *> \param[out] A
  80. *> \verbatim
  81. *> A is REAL array, dimension (NMAX*2)
  82. *> \endverbatim
  83. *>
  84. *> \param[out] D
  85. *> \verbatim
  86. *> D is REAL array, dimension (NMAX*2)
  87. *> \endverbatim
  88. *>
  89. *> \param[out] E
  90. *> \verbatim
  91. *> E is REAL array, dimension (NMAX*2)
  92. *> \endverbatim
  93. *>
  94. *> \param[out] B
  95. *> \verbatim
  96. *> B is REAL array, dimension (NMAX*NRHS)
  97. *> \endverbatim
  98. *>
  99. *> \param[out] X
  100. *> \verbatim
  101. *> X is REAL array, dimension (NMAX*NRHS)
  102. *> \endverbatim
  103. *>
  104. *> \param[out] XACT
  105. *> \verbatim
  106. *> XACT is REAL array, dimension (NMAX*NRHS)
  107. *> \endverbatim
  108. *>
  109. *> \param[out] WORK
  110. *> \verbatim
  111. *> WORK is REAL array, dimension
  112. *> (NMAX*max(3,NRHS))
  113. *> \endverbatim
  114. *>
  115. *> \param[out] RWORK
  116. *> \verbatim
  117. *> RWORK is REAL array, dimension
  118. *> (max(NMAX,2*NRHS))
  119. *> \endverbatim
  120. *>
  121. *> \param[in] NOUT
  122. *> \verbatim
  123. *> NOUT is INTEGER
  124. *> The unit number for output.
  125. *> \endverbatim
  126. *
  127. * Authors:
  128. * ========
  129. *
  130. *> \author Univ. of Tennessee
  131. *> \author Univ. of California Berkeley
  132. *> \author Univ. of Colorado Denver
  133. *> \author NAG Ltd.
  134. *
  135. *> \date November 2011
  136. *
  137. *> \ingroup single_lin
  138. *
  139. * =====================================================================
  140. SUBROUTINE SDRVPT( DOTYPE, NN, NVAL, NRHS, THRESH, TSTERR, A, D,
  141. $ E, B, X, XACT, WORK, RWORK, NOUT )
  142. *
  143. * -- LAPACK test routine (version 3.4.0) --
  144. * -- LAPACK is a software package provided by Univ. of Tennessee, --
  145. * -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
  146. * November 2011
  147. *
  148. * .. Scalar Arguments ..
  149. LOGICAL TSTERR
  150. INTEGER NN, NOUT, NRHS
  151. REAL THRESH
  152. * ..
  153. * .. Array Arguments ..
  154. LOGICAL DOTYPE( * )
  155. INTEGER NVAL( * )
  156. REAL A( * ), B( * ), D( * ), E( * ), RWORK( * ),
  157. $ WORK( * ), X( * ), XACT( * )
  158. * ..
  159. *
  160. * =====================================================================
  161. *
  162. * .. Parameters ..
  163. REAL ONE, ZERO
  164. PARAMETER ( ONE = 1.0E+0, ZERO = 0.0E+0 )
  165. INTEGER NTYPES
  166. PARAMETER ( NTYPES = 12 )
  167. INTEGER NTESTS
  168. PARAMETER ( NTESTS = 6 )
  169. * ..
  170. * .. Local Scalars ..
  171. LOGICAL ZEROT
  172. CHARACTER DIST, FACT, TYPE
  173. CHARACTER*3 PATH
  174. INTEGER I, IA, IFACT, IMAT, IN, INFO, IX, IZERO, J, K,
  175. $ K1, KL, KU, LDA, MODE, N, NERRS, NFAIL, NIMAT,
  176. $ NRUN, NT
  177. REAL AINVNM, ANORM, COND, DMAX, RCOND, RCONDC
  178. * ..
  179. * .. Local Arrays ..
  180. INTEGER ISEED( 4 ), ISEEDY( 4 )
  181. REAL RESULT( NTESTS ), Z( 3 )
  182. * ..
  183. * .. External Functions ..
  184. INTEGER ISAMAX
  185. REAL SASUM, SGET06, SLANST
  186. EXTERNAL ISAMAX, SASUM, SGET06, SLANST
  187. * ..
  188. * .. External Subroutines ..
  189. EXTERNAL ALADHD, ALAERH, ALASVM, SCOPY, SERRVX, SGET04,
  190. $ SLACPY, SLAPTM, SLARNV, SLASET, SLATB4, SLATMS,
  191. $ SPTSV, SPTSVX, SPTT01, SPTT02, SPTT05, SPTTRF,
  192. $ SPTTRS, SSCAL
  193. * ..
  194. * .. Intrinsic Functions ..
  195. INTRINSIC ABS, MAX
  196. * ..
  197. * .. Scalars in Common ..
  198. LOGICAL LERR, OK
  199. CHARACTER*32 SRNAMT
  200. INTEGER INFOT, NUNIT
  201. * ..
  202. * .. Common blocks ..
  203. COMMON / INFOC / INFOT, NUNIT, OK, LERR
  204. COMMON / SRNAMC / SRNAMT
  205. * ..
  206. * .. Data statements ..
  207. DATA ISEEDY / 0, 0, 0, 1 /
  208. * ..
  209. * .. Executable Statements ..
  210. *
  211. PATH( 1: 1 ) = 'Single precision'
  212. PATH( 2: 3 ) = 'PT'
  213. NRUN = 0
  214. NFAIL = 0
  215. NERRS = 0
  216. DO 10 I = 1, 4
  217. ISEED( I ) = ISEEDY( I )
  218. 10 CONTINUE
  219. *
  220. * Test the error exits
  221. *
  222. IF( TSTERR )
  223. $ CALL SERRVX( PATH, NOUT )
  224. INFOT = 0
  225. *
  226. DO 120 IN = 1, NN
  227. *
  228. * Do for each value of N in NVAL.
  229. *
  230. N = NVAL( IN )
  231. LDA = MAX( 1, N )
  232. NIMAT = NTYPES
  233. IF( N.LE.0 )
  234. $ NIMAT = 1
  235. *
  236. DO 110 IMAT = 1, NIMAT
  237. *
  238. * Do the tests only if DOTYPE( IMAT ) is true.
  239. *
  240. IF( N.GT.0 .AND. .NOT.DOTYPE( IMAT ) )
  241. $ GO TO 110
  242. *
  243. * Set up parameters with SLATB4.
  244. *
  245. CALL SLATB4( PATH, IMAT, N, N, TYPE, KL, KU, ANORM, MODE,
  246. $ COND, DIST )
  247. *
  248. ZEROT = IMAT.GE.8 .AND. IMAT.LE.10
  249. IF( IMAT.LE.6 ) THEN
  250. *
  251. * Type 1-6: generate a symmetric tridiagonal matrix of
  252. * known condition number in lower triangular band storage.
  253. *
  254. SRNAMT = 'SLATMS'
  255. CALL SLATMS( N, N, DIST, ISEED, TYPE, RWORK, MODE, COND,
  256. $ ANORM, KL, KU, 'B', A, 2, WORK, INFO )
  257. *
  258. * Check the error code from SLATMS.
  259. *
  260. IF( INFO.NE.0 ) THEN
  261. CALL ALAERH( PATH, 'SLATMS', INFO, 0, ' ', N, N, KL,
  262. $ KU, -1, IMAT, NFAIL, NERRS, NOUT )
  263. GO TO 110
  264. END IF
  265. IZERO = 0
  266. *
  267. * Copy the matrix to D and E.
  268. *
  269. IA = 1
  270. DO 20 I = 1, N - 1
  271. D( I ) = A( IA )
  272. E( I ) = A( IA+1 )
  273. IA = IA + 2
  274. 20 CONTINUE
  275. IF( N.GT.0 )
  276. $ D( N ) = A( IA )
  277. ELSE
  278. *
  279. * Type 7-12: generate a diagonally dominant matrix with
  280. * unknown condition number in the vectors D and E.
  281. *
  282. IF( .NOT.ZEROT .OR. .NOT.DOTYPE( 7 ) ) THEN
  283. *
  284. * Let D and E have values from [-1,1].
  285. *
  286. CALL SLARNV( 2, ISEED, N, D )
  287. CALL SLARNV( 2, ISEED, N-1, E )
  288. *
  289. * Make the tridiagonal matrix diagonally dominant.
  290. *
  291. IF( N.EQ.1 ) THEN
  292. D( 1 ) = ABS( D( 1 ) )
  293. ELSE
  294. D( 1 ) = ABS( D( 1 ) ) + ABS( E( 1 ) )
  295. D( N ) = ABS( D( N ) ) + ABS( E( N-1 ) )
  296. DO 30 I = 2, N - 1
  297. D( I ) = ABS( D( I ) ) + ABS( E( I ) ) +
  298. $ ABS( E( I-1 ) )
  299. 30 CONTINUE
  300. END IF
  301. *
  302. * Scale D and E so the maximum element is ANORM.
  303. *
  304. IX = ISAMAX( N, D, 1 )
  305. DMAX = D( IX )
  306. CALL SSCAL( N, ANORM / DMAX, D, 1 )
  307. IF( N.GT.1 )
  308. $ CALL SSCAL( N-1, ANORM / DMAX, E, 1 )
  309. *
  310. ELSE IF( IZERO.GT.0 ) THEN
  311. *
  312. * Reuse the last matrix by copying back the zeroed out
  313. * elements.
  314. *
  315. IF( IZERO.EQ.1 ) THEN
  316. D( 1 ) = Z( 2 )
  317. IF( N.GT.1 )
  318. $ E( 1 ) = Z( 3 )
  319. ELSE IF( IZERO.EQ.N ) THEN
  320. E( N-1 ) = Z( 1 )
  321. D( N ) = Z( 2 )
  322. ELSE
  323. E( IZERO-1 ) = Z( 1 )
  324. D( IZERO ) = Z( 2 )
  325. E( IZERO ) = Z( 3 )
  326. END IF
  327. END IF
  328. *
  329. * For types 8-10, set one row and column of the matrix to
  330. * zero.
  331. *
  332. IZERO = 0
  333. IF( IMAT.EQ.8 ) THEN
  334. IZERO = 1
  335. Z( 2 ) = D( 1 )
  336. D( 1 ) = ZERO
  337. IF( N.GT.1 ) THEN
  338. Z( 3 ) = E( 1 )
  339. E( 1 ) = ZERO
  340. END IF
  341. ELSE IF( IMAT.EQ.9 ) THEN
  342. IZERO = N
  343. IF( N.GT.1 ) THEN
  344. Z( 1 ) = E( N-1 )
  345. E( N-1 ) = ZERO
  346. END IF
  347. Z( 2 ) = D( N )
  348. D( N ) = ZERO
  349. ELSE IF( IMAT.EQ.10 ) THEN
  350. IZERO = ( N+1 ) / 2
  351. IF( IZERO.GT.1 ) THEN
  352. Z( 1 ) = E( IZERO-1 )
  353. Z( 3 ) = E( IZERO )
  354. E( IZERO-1 ) = ZERO
  355. E( IZERO ) = ZERO
  356. END IF
  357. Z( 2 ) = D( IZERO )
  358. D( IZERO ) = ZERO
  359. END IF
  360. END IF
  361. *
  362. * Generate NRHS random solution vectors.
  363. *
  364. IX = 1
  365. DO 40 J = 1, NRHS
  366. CALL SLARNV( 2, ISEED, N, XACT( IX ) )
  367. IX = IX + LDA
  368. 40 CONTINUE
  369. *
  370. * Set the right hand side.
  371. *
  372. CALL SLAPTM( N, NRHS, ONE, D, E, XACT, LDA, ZERO, B, LDA )
  373. *
  374. DO 100 IFACT = 1, 2
  375. IF( IFACT.EQ.1 ) THEN
  376. FACT = 'F'
  377. ELSE
  378. FACT = 'N'
  379. END IF
  380. *
  381. * Compute the condition number for comparison with
  382. * the value returned by SPTSVX.
  383. *
  384. IF( ZEROT ) THEN
  385. IF( IFACT.EQ.1 )
  386. $ GO TO 100
  387. RCONDC = ZERO
  388. *
  389. ELSE IF( IFACT.EQ.1 ) THEN
  390. *
  391. * Compute the 1-norm of A.
  392. *
  393. ANORM = SLANST( '1', N, D, E )
  394. *
  395. CALL SCOPY( N, D, 1, D( N+1 ), 1 )
  396. IF( N.GT.1 )
  397. $ CALL SCOPY( N-1, E, 1, E( N+1 ), 1 )
  398. *
  399. * Factor the matrix A.
  400. *
  401. CALL SPTTRF( N, D( N+1 ), E( N+1 ), INFO )
  402. *
  403. * Use SPTTRS to solve for one column at a time of
  404. * inv(A), computing the maximum column sum as we go.
  405. *
  406. AINVNM = ZERO
  407. DO 60 I = 1, N
  408. DO 50 J = 1, N
  409. X( J ) = ZERO
  410. 50 CONTINUE
  411. X( I ) = ONE
  412. CALL SPTTRS( N, 1, D( N+1 ), E( N+1 ), X, LDA,
  413. $ INFO )
  414. AINVNM = MAX( AINVNM, SASUM( N, X, 1 ) )
  415. 60 CONTINUE
  416. *
  417. * Compute the 1-norm condition number of A.
  418. *
  419. IF( ANORM.LE.ZERO .OR. AINVNM.LE.ZERO ) THEN
  420. RCONDC = ONE
  421. ELSE
  422. RCONDC = ( ONE / ANORM ) / AINVNM
  423. END IF
  424. END IF
  425. *
  426. IF( IFACT.EQ.2 ) THEN
  427. *
  428. * --- Test SPTSV --
  429. *
  430. CALL SCOPY( N, D, 1, D( N+1 ), 1 )
  431. IF( N.GT.1 )
  432. $ CALL SCOPY( N-1, E, 1, E( N+1 ), 1 )
  433. CALL SLACPY( 'Full', N, NRHS, B, LDA, X, LDA )
  434. *
  435. * Factor A as L*D*L' and solve the system A*X = B.
  436. *
  437. SRNAMT = 'SPTSV '
  438. CALL SPTSV( N, NRHS, D( N+1 ), E( N+1 ), X, LDA,
  439. $ INFO )
  440. *
  441. * Check error code from SPTSV .
  442. *
  443. IF( INFO.NE.IZERO )
  444. $ CALL ALAERH( PATH, 'SPTSV ', INFO, IZERO, ' ', N,
  445. $ N, 1, 1, NRHS, IMAT, NFAIL, NERRS,
  446. $ NOUT )
  447. NT = 0
  448. IF( IZERO.EQ.0 ) THEN
  449. *
  450. * Check the factorization by computing the ratio
  451. * norm(L*D*L' - A) / (n * norm(A) * EPS )
  452. *
  453. CALL SPTT01( N, D, E, D( N+1 ), E( N+1 ), WORK,
  454. $ RESULT( 1 ) )
  455. *
  456. * Compute the residual in the solution.
  457. *
  458. CALL SLACPY( 'Full', N, NRHS, B, LDA, WORK, LDA )
  459. CALL SPTT02( N, NRHS, D, E, X, LDA, WORK, LDA,
  460. $ RESULT( 2 ) )
  461. *
  462. * Check solution from generated exact solution.
  463. *
  464. CALL SGET04( N, NRHS, X, LDA, XACT, LDA, RCONDC,
  465. $ RESULT( 3 ) )
  466. NT = 3
  467. END IF
  468. *
  469. * Print information about the tests that did not pass
  470. * the threshold.
  471. *
  472. DO 70 K = 1, NT
  473. IF( RESULT( K ).GE.THRESH ) THEN
  474. IF( NFAIL.EQ.0 .AND. NERRS.EQ.0 )
  475. $ CALL ALADHD( NOUT, PATH )
  476. WRITE( NOUT, FMT = 9999 )'SPTSV ', N, IMAT, K,
  477. $ RESULT( K )
  478. NFAIL = NFAIL + 1
  479. END IF
  480. 70 CONTINUE
  481. NRUN = NRUN + NT
  482. END IF
  483. *
  484. * --- Test SPTSVX ---
  485. *
  486. IF( IFACT.GT.1 ) THEN
  487. *
  488. * Initialize D( N+1:2*N ) and E( N+1:2*N ) to zero.
  489. *
  490. DO 80 I = 1, N - 1
  491. D( N+I ) = ZERO
  492. E( N+I ) = ZERO
  493. 80 CONTINUE
  494. IF( N.GT.0 )
  495. $ D( N+N ) = ZERO
  496. END IF
  497. *
  498. CALL SLASET( 'Full', N, NRHS, ZERO, ZERO, X, LDA )
  499. *
  500. * Solve the system and compute the condition number and
  501. * error bounds using SPTSVX.
  502. *
  503. SRNAMT = 'SPTSVX'
  504. CALL SPTSVX( FACT, N, NRHS, D, E, D( N+1 ), E( N+1 ), B,
  505. $ LDA, X, LDA, RCOND, RWORK, RWORK( NRHS+1 ),
  506. $ WORK, INFO )
  507. *
  508. * Check the error code from SPTSVX.
  509. *
  510. IF( INFO.NE.IZERO )
  511. $ CALL ALAERH( PATH, 'SPTSVX', INFO, IZERO, FACT, N, N,
  512. $ 1, 1, NRHS, IMAT, NFAIL, NERRS, NOUT )
  513. IF( IZERO.EQ.0 ) THEN
  514. IF( IFACT.EQ.2 ) THEN
  515. *
  516. * Check the factorization by computing the ratio
  517. * norm(L*D*L' - A) / (n * norm(A) * EPS )
  518. *
  519. K1 = 1
  520. CALL SPTT01( N, D, E, D( N+1 ), E( N+1 ), WORK,
  521. $ RESULT( 1 ) )
  522. ELSE
  523. K1 = 2
  524. END IF
  525. *
  526. * Compute the residual in the solution.
  527. *
  528. CALL SLACPY( 'Full', N, NRHS, B, LDA, WORK, LDA )
  529. CALL SPTT02( N, NRHS, D, E, X, LDA, WORK, LDA,
  530. $ RESULT( 2 ) )
  531. *
  532. * Check solution from generated exact solution.
  533. *
  534. CALL SGET04( N, NRHS, X, LDA, XACT, LDA, RCONDC,
  535. $ RESULT( 3 ) )
  536. *
  537. * Check error bounds from iterative refinement.
  538. *
  539. CALL SPTT05( N, NRHS, D, E, B, LDA, X, LDA, XACT, LDA,
  540. $ RWORK, RWORK( NRHS+1 ), RESULT( 4 ) )
  541. ELSE
  542. K1 = 6
  543. END IF
  544. *
  545. * Check the reciprocal of the condition number.
  546. *
  547. RESULT( 6 ) = SGET06( RCOND, RCONDC )
  548. *
  549. * Print information about the tests that did not pass
  550. * the threshold.
  551. *
  552. DO 90 K = K1, 6
  553. IF( RESULT( K ).GE.THRESH ) THEN
  554. IF( NFAIL.EQ.0 .AND. NERRS.EQ.0 )
  555. $ CALL ALADHD( NOUT, PATH )
  556. WRITE( NOUT, FMT = 9998 )'SPTSVX', FACT, N, IMAT,
  557. $ K, RESULT( K )
  558. NFAIL = NFAIL + 1
  559. END IF
  560. 90 CONTINUE
  561. NRUN = NRUN + 7 - K1
  562. 100 CONTINUE
  563. 110 CONTINUE
  564. 120 CONTINUE
  565. *
  566. * Print a summary of the results.
  567. *
  568. CALL ALASVM( PATH, NOUT, NFAIL, NRUN, NERRS )
  569. *
  570. 9999 FORMAT( 1X, A, ', N =', I5, ', type ', I2, ', test ', I2,
  571. $ ', ratio = ', G12.5 )
  572. 9998 FORMAT( 1X, A, ', FACT=''', A1, ''', N =', I5, ', type ', I2,
  573. $ ', test ', I2, ', ratio = ', G12.5 )
  574. RETURN
  575. *
  576. * End of SDRVPT
  577. *
  578. END