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.

cdrvrf3.f 12 kB

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