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.

sdrvrf3.f 13 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402
  1. *> \brief \b SDRVRF3
  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 SDRVRF3( NOUT, NN, NVAL, THRESH, A, LDA, ARF, B1, B2,
  12. * + S_WORK_SLANGE, S_WORK_SGEQRF, TAU )
  13. *
  14. * .. Scalar Arguments ..
  15. * INTEGER LDA, NN, NOUT
  16. * REAL THRESH
  17. * ..
  18. * .. Array Arguments ..
  19. * INTEGER NVAL( NN )
  20. * REAL A( LDA, * ), ARF( * ), B1( LDA, * ),
  21. * + B2( LDA, * ), S_WORK_SGEQRF( * ),
  22. * + S_WORK_SLANGE( * ), TAU( * )
  23. * ..
  24. *
  25. *
  26. *> \par Purpose:
  27. * =============
  28. *>
  29. *> \verbatim
  30. *>
  31. *> SDRVRF3 tests the LAPACK RFP routines:
  32. *> STFSM
  33. *> \endverbatim
  34. *
  35. * Arguments:
  36. * ==========
  37. *
  38. *> \param[in] NOUT
  39. *> \verbatim
  40. *> NOUT is INTEGER
  41. *> The unit number for output.
  42. *> \endverbatim
  43. *>
  44. *> \param[in] NN
  45. *> \verbatim
  46. *> NN is INTEGER
  47. *> The number of values of N contained in the vector NVAL.
  48. *> \endverbatim
  49. *>
  50. *> \param[in] NVAL
  51. *> \verbatim
  52. *> NVAL is INTEGER array, dimension (NN)
  53. *> The values of the matrix dimension N.
  54. *> \endverbatim
  55. *>
  56. *> \param[in] THRESH
  57. *> \verbatim
  58. *> THRESH is REAL
  59. *> The threshold value for the test ratios. A result is
  60. *> included in the output file if RESULT >= THRESH. To have
  61. *> every test ratio printed, use THRESH = 0.
  62. *> \endverbatim
  63. *>
  64. *> \param[out] A
  65. *> \verbatim
  66. *> A is REAL array, dimension (LDA,NMAX)
  67. *> \endverbatim
  68. *>
  69. *> \param[in] LDA
  70. *> \verbatim
  71. *> LDA is INTEGER
  72. *> The leading dimension of the array A. LDA >= max(1,NMAX).
  73. *> \endverbatim
  74. *>
  75. *> \param[out] ARF
  76. *> \verbatim
  77. *> ARF is REAL array, dimension ((NMAX*(NMAX+1))/2).
  78. *> \endverbatim
  79. *>
  80. *> \param[out] B1
  81. *> \verbatim
  82. *> B1 is REAL array, dimension (LDA,NMAX)
  83. *> \endverbatim
  84. *>
  85. *> \param[out] B2
  86. *> \verbatim
  87. *> B2 is REAL array, dimension (LDA,NMAX)
  88. *> \endverbatim
  89. *>
  90. *> \param[out] S_WORK_SLANGE
  91. *> \verbatim
  92. *> S_WORK_SLANGE is REAL array, dimension (NMAX)
  93. *> \endverbatim
  94. *>
  95. *> \param[out] S_WORK_SGEQRF
  96. *> \verbatim
  97. *> S_WORK_SGEQRF is REAL array, dimension (NMAX)
  98. *> \endverbatim
  99. *>
  100. *> \param[out] TAU
  101. *> \verbatim
  102. *> TAU is REAL array, dimension (NMAX)
  103. *> \endverbatim
  104. *
  105. * Authors:
  106. * ========
  107. *
  108. *> \author Univ. of Tennessee
  109. *> \author Univ. of California Berkeley
  110. *> \author Univ. of Colorado Denver
  111. *> \author NAG Ltd.
  112. *
  113. *> \ingroup single_lin
  114. *
  115. * =====================================================================
  116. SUBROUTINE SDRVRF3( NOUT, NN, NVAL, THRESH, A, LDA, ARF, B1, B2,
  117. + S_WORK_SLANGE, S_WORK_SGEQRF, TAU )
  118. *
  119. * -- LAPACK test routine --
  120. * -- LAPACK is a software package provided by Univ. of Tennessee, --
  121. * -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
  122. *
  123. * .. Scalar Arguments ..
  124. INTEGER LDA, NN, NOUT
  125. REAL THRESH
  126. * ..
  127. * .. Array Arguments ..
  128. INTEGER NVAL( NN )
  129. REAL A( LDA, * ), ARF( * ), B1( LDA, * ),
  130. + B2( LDA, * ), S_WORK_SGEQRF( * ),
  131. + S_WORK_SLANGE( * ), TAU( * )
  132. * ..
  133. *
  134. * =====================================================================
  135. * ..
  136. * .. Parameters ..
  137. REAL ZERO, ONE
  138. PARAMETER ( ZERO = ( 0.0E+0, 0.0E+0 ) ,
  139. + ONE = ( 1.0E+0, 0.0E+0 ) )
  140. INTEGER NTESTS
  141. PARAMETER ( NTESTS = 1 )
  142. * ..
  143. * .. Local Scalars ..
  144. CHARACTER UPLO, CFORM, DIAG, TRANS, SIDE
  145. INTEGER I, IFORM, IIM, IIN, INFO, IUPLO, J, M, N, NA,
  146. + NFAIL, NRUN, ISIDE, IDIAG, IALPHA, ITRANS
  147. REAL EPS, ALPHA
  148. * ..
  149. * .. Local Arrays ..
  150. CHARACTER UPLOS( 2 ), FORMS( 2 ), TRANSS( 2 ),
  151. + DIAGS( 2 ), SIDES( 2 )
  152. INTEGER ISEED( 4 ), ISEEDY( 4 )
  153. REAL RESULT( NTESTS )
  154. * ..
  155. * .. External Functions ..
  156. LOGICAL LSAME
  157. REAL SLAMCH, SLANGE, SLARND
  158. EXTERNAL SLAMCH, SLANGE, SLARND, LSAME
  159. * ..
  160. * .. External Subroutines ..
  161. EXTERNAL STRTTF, SGEQRF, SGEQLF, STFSM, STRSM
  162. * ..
  163. * .. Intrinsic Functions ..
  164. INTRINSIC MAX, SQRT
  165. * ..
  166. * .. Scalars in Common ..
  167. CHARACTER*32 SRNAMT
  168. * ..
  169. * .. Common blocks ..
  170. COMMON / SRNAMC / SRNAMT
  171. * ..
  172. * .. Data statements ..
  173. DATA ISEEDY / 1988, 1989, 1990, 1991 /
  174. DATA UPLOS / 'U', 'L' /
  175. DATA FORMS / 'N', 'T' /
  176. DATA SIDES / 'L', 'R' /
  177. DATA TRANSS / 'N', 'T' /
  178. DATA DIAGS / 'N', 'U' /
  179. * ..
  180. * .. Executable Statements ..
  181. *
  182. * Initialize constants and the random number seed.
  183. *
  184. NRUN = 0
  185. NFAIL = 0
  186. INFO = 0
  187. DO 10 I = 1, 4
  188. ISEED( I ) = ISEEDY( I )
  189. 10 CONTINUE
  190. EPS = SLAMCH( 'Precision' )
  191. *
  192. DO 170 IIM = 1, NN
  193. *
  194. M = NVAL( IIM )
  195. *
  196. DO 160 IIN = 1, NN
  197. *
  198. N = NVAL( IIN )
  199. *
  200. DO 150 IFORM = 1, 2
  201. *
  202. CFORM = FORMS( IFORM )
  203. *
  204. DO 140 IUPLO = 1, 2
  205. *
  206. UPLO = UPLOS( IUPLO )
  207. *
  208. DO 130 ISIDE = 1, 2
  209. *
  210. SIDE = SIDES( ISIDE )
  211. *
  212. DO 120 ITRANS = 1, 2
  213. *
  214. TRANS = TRANSS( ITRANS )
  215. *
  216. DO 110 IDIAG = 1, 2
  217. *
  218. DIAG = DIAGS( IDIAG )
  219. *
  220. DO 100 IALPHA = 1, 3
  221. *
  222. IF ( IALPHA.EQ.1 ) THEN
  223. ALPHA = ZERO
  224. ELSE IF ( IALPHA.EQ.2 ) THEN
  225. ALPHA = ONE
  226. ELSE
  227. ALPHA = SLARND( 2, ISEED )
  228. END IF
  229. *
  230. * All the parameters are set:
  231. * CFORM, SIDE, UPLO, TRANS, DIAG, M, N,
  232. * and ALPHA
  233. * READY TO TEST!
  234. *
  235. NRUN = NRUN + 1
  236. *
  237. IF ( ISIDE.EQ.1 ) THEN
  238. *
  239. * The case ISIDE.EQ.1 is when SIDE.EQ.'L'
  240. * -> A is M-by-M ( B is M-by-N )
  241. *
  242. NA = M
  243. *
  244. ELSE
  245. *
  246. * The case ISIDE.EQ.2 is when SIDE.EQ.'R'
  247. * -> A is N-by-N ( B is M-by-N )
  248. *
  249. NA = N
  250. *
  251. END IF
  252. *
  253. * Generate A our NA--by--NA triangular
  254. * matrix.
  255. * Our test is based on forward error so we
  256. * do want A to be well conditioned! To get
  257. * a well-conditioned triangular matrix, we
  258. * take the R factor of the QR/LQ factorization
  259. * of a random matrix.
  260. *
  261. DO J = 1, NA
  262. DO I = 1, NA
  263. A( I, J ) = SLARND( 2, ISEED )
  264. END DO
  265. END DO
  266. *
  267. IF ( IUPLO.EQ.1 ) THEN
  268. *
  269. * The case IUPLO.EQ.1 is when SIDE.EQ.'U'
  270. * -> QR factorization.
  271. *
  272. SRNAMT = 'SGEQRF'
  273. CALL SGEQRF( NA, NA, A, LDA, TAU,
  274. + S_WORK_SGEQRF, LDA,
  275. + INFO )
  276. *
  277. * Forcing main diagonal of test matrix to
  278. * be unit makes it ill-conditioned for
  279. * some test cases
  280. *
  281. IF ( LSAME( DIAG, 'U' ) ) THEN
  282. DO J = 1, NA
  283. DO I = 1, J
  284. A( I, J ) = A( I, J ) /
  285. + ( 2.0 * A( J, J ) )
  286. END DO
  287. END DO
  288. END IF
  289. *
  290. ELSE
  291. *
  292. * The case IUPLO.EQ.2 is when SIDE.EQ.'L'
  293. * -> QL factorization.
  294. *
  295. SRNAMT = 'SGELQF'
  296. CALL SGELQF( NA, NA, A, LDA, TAU,
  297. + S_WORK_SGEQRF, LDA,
  298. + INFO )
  299. *
  300. * Forcing main diagonal of test matrix to
  301. * be unit makes it ill-conditioned for
  302. * some test cases
  303. *
  304. IF ( LSAME( DIAG, 'U' ) ) THEN
  305. DO I = 1, NA
  306. DO J = 1, I
  307. A( I, J ) = A( I, J ) /
  308. + ( 2.0 * A( I, I ) )
  309. END DO
  310. END DO
  311. END IF
  312. *
  313. END IF
  314. *
  315. * Store a copy of A in RFP format (in ARF).
  316. *
  317. SRNAMT = 'STRTTF'
  318. CALL STRTTF( CFORM, UPLO, NA, A, LDA, ARF,
  319. + INFO )
  320. *
  321. * Generate B1 our M--by--N right-hand side
  322. * and store a copy in B2.
  323. *
  324. DO J = 1, N
  325. DO I = 1, M
  326. B1( I, J ) = SLARND( 2, ISEED )
  327. B2( I, J ) = B1( I, J )
  328. END DO
  329. END DO
  330. *
  331. * Solve op( A ) X = B or X op( A ) = B
  332. * with STRSM
  333. *
  334. SRNAMT = 'STRSM'
  335. CALL STRSM( SIDE, UPLO, TRANS, DIAG, M, N,
  336. + ALPHA, A, LDA, B1, LDA )
  337. *
  338. * Solve op( A ) X = B or X op( A ) = B
  339. * with STFSM
  340. *
  341. SRNAMT = 'STFSM'
  342. CALL STFSM( CFORM, SIDE, UPLO, TRANS,
  343. + DIAG, M, N, ALPHA, ARF, B2,
  344. + LDA )
  345. *
  346. * Check that the result agrees.
  347. *
  348. DO J = 1, N
  349. DO I = 1, M
  350. B1( I, J ) = B2( I, J ) - B1( I, J )
  351. END DO
  352. END DO
  353. *
  354. RESULT( 1 ) = SLANGE( 'I', M, N, B1, LDA,
  355. + S_WORK_SLANGE )
  356. *
  357. RESULT( 1 ) = RESULT( 1 ) / SQRT( EPS )
  358. + / MAX ( MAX( M, N ), 1 )
  359. *
  360. IF( RESULT( 1 ).GE.THRESH ) THEN
  361. IF( NFAIL.EQ.0 ) THEN
  362. WRITE( NOUT, * )
  363. WRITE( NOUT, FMT = 9999 )
  364. END IF
  365. WRITE( NOUT, FMT = 9997 ) 'STFSM',
  366. + CFORM, SIDE, UPLO, TRANS, DIAG, M,
  367. + N, RESULT( 1 )
  368. NFAIL = NFAIL + 1
  369. END IF
  370. *
  371. 100 CONTINUE
  372. 110 CONTINUE
  373. 120 CONTINUE
  374. 130 CONTINUE
  375. 140 CONTINUE
  376. 150 CONTINUE
  377. 160 CONTINUE
  378. 170 CONTINUE
  379. *
  380. * Print a summary of the results.
  381. *
  382. IF ( NFAIL.EQ.0 ) THEN
  383. WRITE( NOUT, FMT = 9996 ) 'STFSM', NRUN
  384. ELSE
  385. WRITE( NOUT, FMT = 9995 ) 'STFSM', NFAIL, NRUN
  386. END IF
  387. *
  388. 9999 FORMAT( 1X, ' *** Error(s) or Failure(s) while testing STFSM
  389. + ***')
  390. 9997 FORMAT( 1X, ' Failure in ',A5,', CFORM=''',A1,''',',
  391. + ' SIDE=''',A1,''',',' UPLO=''',A1,''',',' TRANS=''',A1,''',',
  392. + ' DIAG=''',A1,''',',' M=',I3,', N =', I3,', test=',G12.5)
  393. 9996 FORMAT( 1X, 'All tests for ',A5,' auxiliary routine passed the ',
  394. + 'threshold ( ',I5,' tests run)')
  395. 9995 FORMAT( 1X, A6, ' auxiliary routine: ',I5,' out of ',I5,
  396. + ' tests failed to pass the threshold')
  397. *
  398. RETURN
  399. *
  400. * End of SDRVRF3
  401. *
  402. END