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.

cget51.f 7.3 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280
  1. *> \brief \b CGET51
  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 CGET51( ITYPE, N, A, LDA, B, LDB, U, LDU, V, LDV, WORK,
  12. * RWORK, RESULT )
  13. *
  14. * .. Scalar Arguments ..
  15. * INTEGER ITYPE, LDA, LDB, LDU, LDV, N
  16. * REAL RESULT
  17. * ..
  18. * .. Array Arguments ..
  19. * REAL RWORK( * )
  20. * COMPLEX A( LDA, * ), B( LDB, * ), U( LDU, * ),
  21. * $ V( LDV, * ), WORK( * )
  22. * ..
  23. *
  24. *
  25. *> \par Purpose:
  26. * =============
  27. *>
  28. *> \verbatim
  29. *>
  30. *> CGET51 generally checks a decomposition of the form
  31. *>
  32. *> A = U B VC>
  33. *> where * means conjugate transpose and U and V are unitary.
  34. *>
  35. *> Specifically, if ITYPE=1
  36. *>
  37. *> RESULT = | A - U B V* | / ( |A| n ulp )
  38. *>
  39. *> If ITYPE=2, then:
  40. *>
  41. *> RESULT = | A - B | / ( |A| n ulp )
  42. *>
  43. *> If ITYPE=3, then:
  44. *>
  45. *> RESULT = | I - UU* | / ( n ulp )
  46. *> \endverbatim
  47. *
  48. * Arguments:
  49. * ==========
  50. *
  51. *> \param[in] ITYPE
  52. *> \verbatim
  53. *> ITYPE is INTEGER
  54. *> Specifies the type of tests to be performed.
  55. *> =1: RESULT = | A - U B V* | / ( |A| n ulp )
  56. *> =2: RESULT = | A - B | / ( |A| n ulp )
  57. *> =3: RESULT = | I - UU* | / ( n ulp )
  58. *> \endverbatim
  59. *>
  60. *> \param[in] N
  61. *> \verbatim
  62. *> N is INTEGER
  63. *> The size of the matrix. If it is zero, CGET51 does nothing.
  64. *> It must be at least zero.
  65. *> \endverbatim
  66. *>
  67. *> \param[in] A
  68. *> \verbatim
  69. *> A is COMPLEX array, dimension (LDA, N)
  70. *> The original (unfactored) matrix.
  71. *> \endverbatim
  72. *>
  73. *> \param[in] LDA
  74. *> \verbatim
  75. *> LDA is INTEGER
  76. *> The leading dimension of A. It must be at least 1
  77. *> and at least N.
  78. *> \endverbatim
  79. *>
  80. *> \param[in] B
  81. *> \verbatim
  82. *> B is COMPLEX array, dimension (LDB, N)
  83. *> The factored matrix.
  84. *> \endverbatim
  85. *>
  86. *> \param[in] LDB
  87. *> \verbatim
  88. *> LDB is INTEGER
  89. *> The leading dimension of B. It must be at least 1
  90. *> and at least N.
  91. *> \endverbatim
  92. *>
  93. *> \param[in] U
  94. *> \verbatim
  95. *> U is COMPLEX array, dimension (LDU, N)
  96. *> The unitary matrix on the left-hand side in the
  97. *> decomposition.
  98. *> Not referenced if ITYPE=2
  99. *> \endverbatim
  100. *>
  101. *> \param[in] LDU
  102. *> \verbatim
  103. *> LDU is INTEGER
  104. *> The leading dimension of U. LDU must be at least N and
  105. *> at least 1.
  106. *> \endverbatim
  107. *>
  108. *> \param[in] V
  109. *> \verbatim
  110. *> V is COMPLEX array, dimension (LDV, N)
  111. *> The unitary matrix on the left-hand side in the
  112. *> decomposition.
  113. *> Not referenced if ITYPE=2
  114. *> \endverbatim
  115. *>
  116. *> \param[in] LDV
  117. *> \verbatim
  118. *> LDV is INTEGER
  119. *> The leading dimension of V. LDV must be at least N and
  120. *> at least 1.
  121. *> \endverbatim
  122. *>
  123. *> \param[out] WORK
  124. *> \verbatim
  125. *> WORK is COMPLEX array, dimension (2*N**2)
  126. *> \endverbatim
  127. *>
  128. *> \param[out] RWORK
  129. *> \verbatim
  130. *> RWORK is REAL array, dimension (N)
  131. *> \endverbatim
  132. *>
  133. *> \param[out] RESULT
  134. *> \verbatim
  135. *> RESULT is REAL
  136. *> The values computed by the test specified by ITYPE. The
  137. *> value is currently limited to 1/ulp, to avoid overflow.
  138. *> Errors are flagged by RESULT=10/ulp.
  139. *> \endverbatim
  140. *
  141. * Authors:
  142. * ========
  143. *
  144. *> \author Univ. of Tennessee
  145. *> \author Univ. of California Berkeley
  146. *> \author Univ. of Colorado Denver
  147. *> \author NAG Ltd.
  148. *
  149. *> \date December 2016
  150. *
  151. *> \ingroup complex_eig
  152. *
  153. * =====================================================================
  154. SUBROUTINE CGET51( ITYPE, N, A, LDA, B, LDB, U, LDU, V, LDV, WORK,
  155. $ RWORK, RESULT )
  156. *
  157. * -- LAPACK test routine (version 3.7.0) --
  158. * -- LAPACK is a software package provided by Univ. of Tennessee, --
  159. * -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
  160. * December 2016
  161. *
  162. * .. Scalar Arguments ..
  163. INTEGER ITYPE, LDA, LDB, LDU, LDV, N
  164. REAL RESULT
  165. * ..
  166. * .. Array Arguments ..
  167. REAL RWORK( * )
  168. COMPLEX A( LDA, * ), B( LDB, * ), U( LDU, * ),
  169. $ V( LDV, * ), WORK( * )
  170. * ..
  171. *
  172. * =====================================================================
  173. *
  174. * .. Parameters ..
  175. REAL ZERO, ONE, TEN
  176. PARAMETER ( ZERO = 0.0E+0, ONE = 1.0E+0, TEN = 10.0E+0 )
  177. COMPLEX CZERO, CONE
  178. PARAMETER ( CZERO = ( 0.0E+0, 0.0E+0 ),
  179. $ CONE = ( 1.0E+0, 0.0E+0 ) )
  180. * ..
  181. * .. Local Scalars ..
  182. INTEGER JCOL, JDIAG, JROW
  183. REAL ANORM, ULP, UNFL, WNORM
  184. * ..
  185. * .. External Functions ..
  186. REAL CLANGE, SLAMCH
  187. EXTERNAL CLANGE, SLAMCH
  188. * ..
  189. * .. External Subroutines ..
  190. EXTERNAL CGEMM, CLACPY
  191. * ..
  192. * .. Intrinsic Functions ..
  193. INTRINSIC MAX, MIN, REAL
  194. * ..
  195. * .. Executable Statements ..
  196. *
  197. RESULT = ZERO
  198. IF( N.LE.0 )
  199. $ RETURN
  200. *
  201. * Constants
  202. *
  203. UNFL = SLAMCH( 'Safe minimum' )
  204. ULP = SLAMCH( 'Epsilon' )*SLAMCH( 'Base' )
  205. *
  206. * Some Error Checks
  207. *
  208. IF( ITYPE.LT.1 .OR. ITYPE.GT.3 ) THEN
  209. RESULT = TEN / ULP
  210. RETURN
  211. END IF
  212. *
  213. IF( ITYPE.LE.2 ) THEN
  214. *
  215. * Tests scaled by the norm(A)
  216. *
  217. ANORM = MAX( CLANGE( '1', N, N, A, LDA, RWORK ), UNFL )
  218. *
  219. IF( ITYPE.EQ.1 ) THEN
  220. *
  221. * ITYPE=1: Compute W = A - UBV'
  222. *
  223. CALL CLACPY( ' ', N, N, A, LDA, WORK, N )
  224. CALL CGEMM( 'N', 'N', N, N, N, CONE, U, LDU, B, LDB, CZERO,
  225. $ WORK( N**2+1 ), N )
  226. *
  227. CALL CGEMM( 'N', 'C', N, N, N, -CONE, WORK( N**2+1 ), N, V,
  228. $ LDV, CONE, WORK, N )
  229. *
  230. ELSE
  231. *
  232. * ITYPE=2: Compute W = A - B
  233. *
  234. CALL CLACPY( ' ', N, N, B, LDB, WORK, N )
  235. *
  236. DO 20 JCOL = 1, N
  237. DO 10 JROW = 1, N
  238. WORK( JROW+N*( JCOL-1 ) ) = WORK( JROW+N*( JCOL-1 ) )
  239. $ - A( JROW, JCOL )
  240. 10 CONTINUE
  241. 20 CONTINUE
  242. END IF
  243. *
  244. * Compute norm(W)/ ( ulp*norm(A) )
  245. *
  246. WNORM = CLANGE( '1', N, N, WORK, N, RWORK )
  247. *
  248. IF( ANORM.GT.WNORM ) THEN
  249. RESULT = ( WNORM / ANORM ) / ( N*ULP )
  250. ELSE
  251. IF( ANORM.LT.ONE ) THEN
  252. RESULT = ( MIN( WNORM, N*ANORM ) / ANORM ) / ( N*ULP )
  253. ELSE
  254. RESULT = MIN( WNORM / ANORM, REAL( N ) ) / ( N*ULP )
  255. END IF
  256. END IF
  257. *
  258. ELSE
  259. *
  260. * Tests not scaled by norm(A)
  261. *
  262. * ITYPE=3: Compute UU' - I
  263. *
  264. CALL CGEMM( 'N', 'C', N, N, N, CONE, U, LDU, U, LDU, CZERO,
  265. $ WORK, N )
  266. *
  267. DO 30 JDIAG = 1, N
  268. WORK( ( N+1 )*( JDIAG-1 )+1 ) = WORK( ( N+1 )*( JDIAG-1 )+
  269. $ 1 ) - CONE
  270. 30 CONTINUE
  271. *
  272. RESULT = MIN( CLANGE( '1', N, N, WORK, N, RWORK ),
  273. $ REAL( N ) ) / ( N*ULP )
  274. END IF
  275. *
  276. RETURN
  277. *
  278. * End of CGET51
  279. *
  280. END