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.

sla_geamv.f 12 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393
  1. *> \brief \b SLA_GEAMV computes a matrix-vector product using a general matrix to calculate error bounds.
  2. *
  3. * =========== DOCUMENTATION ===========
  4. *
  5. * Online html documentation available at
  6. * http://www.netlib.org/lapack/explore-html/
  7. *
  8. *> \htmlonly
  9. *> Download SLA_GEAMV + dependencies
  10. *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/sla_geamv.f">
  11. *> [TGZ]</a>
  12. *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/sla_geamv.f">
  13. *> [ZIP]</a>
  14. *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/sla_geamv.f">
  15. *> [TXT]</a>
  16. *> \endhtmlonly
  17. *
  18. * Definition:
  19. * ===========
  20. *
  21. * SUBROUTINE SLA_GEAMV ( TRANS, M, N, ALPHA, A, LDA, X, INCX, BETA,
  22. * Y, INCY )
  23. *
  24. * .. Scalar Arguments ..
  25. * REAL ALPHA, BETA
  26. * INTEGER INCX, INCY, LDA, M, N, TRANS
  27. * ..
  28. * .. Array Arguments ..
  29. * REAL A( LDA, * ), X( * ), Y( * )
  30. * ..
  31. *
  32. *
  33. *> \par Purpose:
  34. * =============
  35. *>
  36. *> \verbatim
  37. *>
  38. *> SLA_GEAMV performs one of the matrix-vector operations
  39. *>
  40. *> y := alpha*abs(A)*abs(x) + beta*abs(y),
  41. *> or y := alpha*abs(A)**T*abs(x) + beta*abs(y),
  42. *>
  43. *> where alpha and beta are scalars, x and y are vectors and A is an
  44. *> m by n matrix.
  45. *>
  46. *> This function is primarily used in calculating error bounds.
  47. *> To protect against underflow during evaluation, components in
  48. *> the resulting vector are perturbed away from zero by (N+1)
  49. *> times the underflow threshold. To prevent unnecessarily large
  50. *> errors for block-structure embedded in general matrices,
  51. *> "symbolically" zero components are not perturbed. A zero
  52. *> entry is considered "symbolic" if all multiplications involved
  53. *> in computing that entry have at least one zero multiplicand.
  54. *> \endverbatim
  55. *
  56. * Arguments:
  57. * ==========
  58. *
  59. *> \param[in] TRANS
  60. *> \verbatim
  61. *> TRANS is INTEGER
  62. *> On entry, TRANS specifies the operation to be performed as
  63. *> follows:
  64. *>
  65. *> BLAS_NO_TRANS y := alpha*abs(A)*abs(x) + beta*abs(y)
  66. *> BLAS_TRANS y := alpha*abs(A**T)*abs(x) + beta*abs(y)
  67. *> BLAS_CONJ_TRANS y := alpha*abs(A**T)*abs(x) + beta*abs(y)
  68. *>
  69. *> Unchanged on exit.
  70. *> \endverbatim
  71. *>
  72. *> \param[in] M
  73. *> \verbatim
  74. *> M is INTEGER
  75. *> On entry, M specifies the number of rows of the matrix A.
  76. *> M must be at least zero.
  77. *> Unchanged on exit.
  78. *> \endverbatim
  79. *>
  80. *> \param[in] N
  81. *> \verbatim
  82. *> N is INTEGER
  83. *> On entry, N specifies the number of columns of the matrix A.
  84. *> N must be at least zero.
  85. *> Unchanged on exit.
  86. *> \endverbatim
  87. *>
  88. *> \param[in] ALPHA
  89. *> \verbatim
  90. *> ALPHA is REAL
  91. *> On entry, ALPHA specifies the scalar alpha.
  92. *> Unchanged on exit.
  93. *> \endverbatim
  94. *>
  95. *> \param[in] A
  96. *> \verbatim
  97. *> A is REAL array, dimension ( LDA, n )
  98. *> Before entry, the leading m by n part of the array A must
  99. *> contain the matrix of coefficients.
  100. *> Unchanged on exit.
  101. *> \endverbatim
  102. *>
  103. *> \param[in] LDA
  104. *> \verbatim
  105. *> LDA is INTEGER
  106. *> On entry, LDA specifies the first dimension of A as declared
  107. *> in the calling (sub) program. LDA must be at least
  108. *> max( 1, m ).
  109. *> Unchanged on exit.
  110. *> \endverbatim
  111. *>
  112. *> \param[in] X
  113. *> \verbatim
  114. *> X is REAL array, dimension
  115. *> ( 1 + ( n - 1 )*abs( INCX ) ) when TRANS = 'N' or 'n'
  116. *> and at least
  117. *> ( 1 + ( m - 1 )*abs( INCX ) ) otherwise.
  118. *> Before entry, the incremented array X must contain the
  119. *> vector x.
  120. *> Unchanged on exit.
  121. *> \endverbatim
  122. *>
  123. *> \param[in] INCX
  124. *> \verbatim
  125. *> INCX is INTEGER
  126. *> On entry, INCX specifies the increment for the elements of
  127. *> X. INCX must not be zero.
  128. *> Unchanged on exit.
  129. *> \endverbatim
  130. *>
  131. *> \param[in] BETA
  132. *> \verbatim
  133. *> BETA is REAL
  134. *> On entry, BETA specifies the scalar beta. When BETA is
  135. *> supplied as zero then Y need not be set on input.
  136. *> Unchanged on exit.
  137. *> \endverbatim
  138. *>
  139. *> \param[in,out] Y
  140. *> \verbatim
  141. *> Y is REAL array,
  142. *> dimension at least
  143. *> ( 1 + ( m - 1 )*abs( INCY ) ) when TRANS = 'N' or 'n'
  144. *> and at least
  145. *> ( 1 + ( n - 1 )*abs( INCY ) ) otherwise.
  146. *> Before entry with BETA non-zero, the incremented array Y
  147. *> must contain the vector y. On exit, Y is overwritten by the
  148. *> updated vector y.
  149. *> \endverbatim
  150. *>
  151. *> \param[in] INCY
  152. *> \verbatim
  153. *> INCY is INTEGER
  154. *> On entry, INCY specifies the increment for the elements of
  155. *> Y. INCY must not be zero.
  156. *> Unchanged on exit.
  157. *>
  158. *> Level 2 Blas routine.
  159. *> \endverbatim
  160. *
  161. * Authors:
  162. * ========
  163. *
  164. *> \author Univ. of Tennessee
  165. *> \author Univ. of California Berkeley
  166. *> \author Univ. of Colorado Denver
  167. *> \author NAG Ltd.
  168. *
  169. *> \ingroup realGEcomputational
  170. *
  171. * =====================================================================
  172. SUBROUTINE SLA_GEAMV ( TRANS, M, N, ALPHA, A, LDA, X, INCX, BETA,
  173. $ Y, INCY )
  174. *
  175. * -- LAPACK computational routine --
  176. * -- LAPACK is a software package provided by Univ. of Tennessee, --
  177. * -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
  178. *
  179. * .. Scalar Arguments ..
  180. REAL ALPHA, BETA
  181. INTEGER INCX, INCY, LDA, M, N, TRANS
  182. * ..
  183. * .. Array Arguments ..
  184. REAL A( LDA, * ), X( * ), Y( * )
  185. * ..
  186. *
  187. * =====================================================================
  188. *
  189. * .. Parameters ..
  190. REAL ONE, ZERO
  191. PARAMETER ( ONE = 1.0E+0, ZERO = 0.0E+0 )
  192. * ..
  193. * .. Local Scalars ..
  194. LOGICAL SYMB_ZERO
  195. REAL TEMP, SAFE1
  196. INTEGER I, INFO, IY, J, JX, KX, KY, LENX, LENY
  197. * ..
  198. * .. External Subroutines ..
  199. EXTERNAL XERBLA, SLAMCH
  200. REAL SLAMCH
  201. * ..
  202. * .. External Functions ..
  203. EXTERNAL ILATRANS
  204. INTEGER ILATRANS
  205. * ..
  206. * .. Intrinsic Functions ..
  207. INTRINSIC MAX, ABS, SIGN
  208. * ..
  209. * .. Executable Statements ..
  210. *
  211. * Test the input parameters.
  212. *
  213. INFO = 0
  214. IF ( .NOT.( ( TRANS.EQ.ILATRANS( 'N' ) )
  215. $ .OR. ( TRANS.EQ.ILATRANS( 'T' ) )
  216. $ .OR. ( TRANS.EQ.ILATRANS( 'C' )) ) ) THEN
  217. INFO = 1
  218. ELSE IF( M.LT.0 )THEN
  219. INFO = 2
  220. ELSE IF( N.LT.0 )THEN
  221. INFO = 3
  222. ELSE IF( LDA.LT.MAX( 1, M ) )THEN
  223. INFO = 6
  224. ELSE IF( INCX.EQ.0 )THEN
  225. INFO = 8
  226. ELSE IF( INCY.EQ.0 )THEN
  227. INFO = 11
  228. END IF
  229. IF( INFO.NE.0 )THEN
  230. CALL XERBLA( 'SLA_GEAMV ', INFO )
  231. RETURN
  232. END IF
  233. *
  234. * Quick return if possible.
  235. *
  236. IF( ( M.EQ.0 ).OR.( N.EQ.0 ).OR.
  237. $ ( ( ALPHA.EQ.ZERO ).AND.( BETA.EQ.ONE ) ) )
  238. $ RETURN
  239. *
  240. * Set LENX and LENY, the lengths of the vectors x and y, and set
  241. * up the start points in X and Y.
  242. *
  243. IF( TRANS.EQ.ILATRANS( 'N' ) )THEN
  244. LENX = N
  245. LENY = M
  246. ELSE
  247. LENX = M
  248. LENY = N
  249. END IF
  250. IF( INCX.GT.0 )THEN
  251. KX = 1
  252. ELSE
  253. KX = 1 - ( LENX - 1 )*INCX
  254. END IF
  255. IF( INCY.GT.0 )THEN
  256. KY = 1
  257. ELSE
  258. KY = 1 - ( LENY - 1 )*INCY
  259. END IF
  260. *
  261. * Set SAFE1 essentially to be the underflow threshold times the
  262. * number of additions in each row.
  263. *
  264. SAFE1 = SLAMCH( 'Safe minimum' )
  265. SAFE1 = (N+1)*SAFE1
  266. *
  267. * Form y := alpha*abs(A)*abs(x) + beta*abs(y).
  268. *
  269. * The O(M*N) SYMB_ZERO tests could be replaced by O(N) queries to
  270. * the inexact flag. Still doesn't help change the iteration order
  271. * to per-column.
  272. *
  273. IY = KY
  274. IF ( INCX.EQ.1 ) THEN
  275. IF( TRANS.EQ.ILATRANS( 'N' ) )THEN
  276. DO I = 1, LENY
  277. IF ( BETA .EQ. ZERO ) THEN
  278. SYMB_ZERO = .TRUE.
  279. Y( IY ) = 0.0
  280. ELSE IF ( Y( IY ) .EQ. ZERO ) THEN
  281. SYMB_ZERO = .TRUE.
  282. ELSE
  283. SYMB_ZERO = .FALSE.
  284. Y( IY ) = BETA * ABS( Y( IY ) )
  285. END IF
  286. IF ( ALPHA .NE. ZERO ) THEN
  287. DO J = 1, LENX
  288. TEMP = ABS( A( I, J ) )
  289. SYMB_ZERO = SYMB_ZERO .AND.
  290. $ ( X( J ) .EQ. ZERO .OR. TEMP .EQ. ZERO )
  291. Y( IY ) = Y( IY ) + ALPHA*ABS( X( J ) )*TEMP
  292. END DO
  293. END IF
  294. IF ( .NOT.SYMB_ZERO )
  295. $ Y( IY ) = Y( IY ) + SIGN( SAFE1, Y( IY ) )
  296. IY = IY + INCY
  297. END DO
  298. ELSE
  299. DO I = 1, LENY
  300. IF ( BETA .EQ. ZERO ) THEN
  301. SYMB_ZERO = .TRUE.
  302. Y( IY ) = 0.0
  303. ELSE IF ( Y( IY ) .EQ. ZERO ) THEN
  304. SYMB_ZERO = .TRUE.
  305. ELSE
  306. SYMB_ZERO = .FALSE.
  307. Y( IY ) = BETA * ABS( Y( IY ) )
  308. END IF
  309. IF ( ALPHA .NE. ZERO ) THEN
  310. DO J = 1, LENX
  311. TEMP = ABS( A( J, I ) )
  312. SYMB_ZERO = SYMB_ZERO .AND.
  313. $ ( X( J ) .EQ. ZERO .OR. TEMP .EQ. ZERO )
  314. Y( IY ) = Y( IY ) + ALPHA*ABS( X( J ) )*TEMP
  315. END DO
  316. END IF
  317. IF ( .NOT.SYMB_ZERO )
  318. $ Y( IY ) = Y( IY ) + SIGN( SAFE1, Y( IY ) )
  319. IY = IY + INCY
  320. END DO
  321. END IF
  322. ELSE
  323. IF( TRANS.EQ.ILATRANS( 'N' ) )THEN
  324. DO I = 1, LENY
  325. IF ( BETA .EQ. ZERO ) THEN
  326. SYMB_ZERO = .TRUE.
  327. Y( IY ) = 0.0
  328. ELSE IF ( Y( IY ) .EQ. ZERO ) THEN
  329. SYMB_ZERO = .TRUE.
  330. ELSE
  331. SYMB_ZERO = .FALSE.
  332. Y( IY ) = BETA * ABS( Y( IY ) )
  333. END IF
  334. IF ( ALPHA .NE. ZERO ) THEN
  335. JX = KX
  336. DO J = 1, LENX
  337. TEMP = ABS( A( I, J ) )
  338. SYMB_ZERO = SYMB_ZERO .AND.
  339. $ ( X( JX ) .EQ. ZERO .OR. TEMP .EQ. ZERO )
  340. Y( IY ) = Y( IY ) + ALPHA*ABS( X( JX ) )*TEMP
  341. JX = JX + INCX
  342. END DO
  343. END IF
  344. IF (.NOT.SYMB_ZERO)
  345. $ Y( IY ) = Y( IY ) + SIGN( SAFE1, Y( IY ) )
  346. IY = IY + INCY
  347. END DO
  348. ELSE
  349. DO I = 1, LENY
  350. IF ( BETA .EQ. ZERO ) THEN
  351. SYMB_ZERO = .TRUE.
  352. Y( IY ) = 0.0
  353. ELSE IF ( Y( IY ) .EQ. ZERO ) THEN
  354. SYMB_ZERO = .TRUE.
  355. ELSE
  356. SYMB_ZERO = .FALSE.
  357. Y( IY ) = BETA * ABS( Y( IY ) )
  358. END IF
  359. IF ( ALPHA .NE. ZERO ) THEN
  360. JX = KX
  361. DO J = 1, LENX
  362. TEMP = ABS( A( J, I ) )
  363. SYMB_ZERO = SYMB_ZERO .AND.
  364. $ ( X( JX ) .EQ. ZERO .OR. TEMP .EQ. ZERO )
  365. Y( IY ) = Y( IY ) + ALPHA*ABS( X( JX ) )*TEMP
  366. JX = JX + INCX
  367. END DO
  368. END IF
  369. IF (.NOT.SYMB_ZERO)
  370. $ Y( IY ) = Y( IY ) + SIGN( SAFE1, Y( IY ) )
  371. IY = IY + INCY
  372. END DO
  373. END IF
  374. END IF
  375. *
  376. RETURN
  377. *
  378. * End of SLA_GEAMV
  379. *
  380. END