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.

cgerqs.f 5.0 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195
  1. *> \brief \b CGERQS
  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 CGERQS( M, N, NRHS, A, LDA, TAU, B, LDB, WORK, LWORK,
  12. * INFO )
  13. *
  14. * .. Scalar Arguments ..
  15. * INTEGER INFO, LDA, LDB, LWORK, M, N, NRHS
  16. * ..
  17. * .. Array Arguments ..
  18. * COMPLEX A( LDA, * ), B( LDB, * ), TAU( * ),
  19. * $ WORK( LWORK )
  20. * ..
  21. *
  22. *
  23. *> \par Purpose:
  24. * =============
  25. *>
  26. *> \verbatim
  27. *>
  28. *> Compute a minimum-norm solution
  29. *> min || A*X - B ||
  30. *> using the RQ factorization
  31. *> A = R*Q
  32. *> computed by CGERQF.
  33. *> \endverbatim
  34. *
  35. * Arguments:
  36. * ==========
  37. *
  38. *> \param[in] M
  39. *> \verbatim
  40. *> M is INTEGER
  41. *> The number of rows of the matrix A. M >= 0.
  42. *> \endverbatim
  43. *>
  44. *> \param[in] N
  45. *> \verbatim
  46. *> N is INTEGER
  47. *> The number of columns of the matrix A. N >= M >= 0.
  48. *> \endverbatim
  49. *>
  50. *> \param[in] NRHS
  51. *> \verbatim
  52. *> NRHS is INTEGER
  53. *> The number of columns of B. NRHS >= 0.
  54. *> \endverbatim
  55. *>
  56. *> \param[in] A
  57. *> \verbatim
  58. *> A is COMPLEX array, dimension (LDA,N)
  59. *> Details of the RQ factorization of the original matrix A as
  60. *> returned by CGERQF.
  61. *> \endverbatim
  62. *>
  63. *> \param[in] LDA
  64. *> \verbatim
  65. *> LDA is INTEGER
  66. *> The leading dimension of the array A. LDA >= M.
  67. *> \endverbatim
  68. *>
  69. *> \param[in] TAU
  70. *> \verbatim
  71. *> TAU is COMPLEX array, dimension (M)
  72. *> Details of the orthogonal matrix Q.
  73. *> \endverbatim
  74. *>
  75. *> \param[in,out] B
  76. *> \verbatim
  77. *> B is COMPLEX array, dimension (LDB,NRHS)
  78. *> On entry, the right hand side vectors for the linear system.
  79. *> On exit, the solution vectors X. Each solution vector
  80. *> is contained in rows 1:N of a column of B.
  81. *> \endverbatim
  82. *>
  83. *> \param[in] LDB
  84. *> \verbatim
  85. *> LDB is INTEGER
  86. *> The leading dimension of the array B. LDB >= max(1,N).
  87. *> \endverbatim
  88. *>
  89. *> \param[out] WORK
  90. *> \verbatim
  91. *> WORK is COMPLEX array, dimension (LWORK)
  92. *> \endverbatim
  93. *>
  94. *> \param[in] LWORK
  95. *> \verbatim
  96. *> LWORK is INTEGER
  97. *> The length of the array WORK. LWORK must be at least NRHS,
  98. *> and should be at least NRHS*NB, where NB is the block size
  99. *> for this environment.
  100. *> \endverbatim
  101. *>
  102. *> \param[out] INFO
  103. *> \verbatim
  104. *> INFO is INTEGER
  105. *> = 0: successful exit
  106. *> < 0: if INFO = -i, the i-th argument had an illegal value
  107. *> \endverbatim
  108. *
  109. * Authors:
  110. * ========
  111. *
  112. *> \author Univ. of Tennessee
  113. *> \author Univ. of California Berkeley
  114. *> \author Univ. of Colorado Denver
  115. *> \author NAG Ltd.
  116. *
  117. *> \ingroup complex_lin
  118. *
  119. * =====================================================================
  120. SUBROUTINE CGERQS( M, N, NRHS, A, LDA, TAU, B, LDB, WORK, LWORK,
  121. $ INFO )
  122. *
  123. * -- LAPACK test routine --
  124. * -- LAPACK is a software package provided by Univ. of Tennessee, --
  125. * -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
  126. *
  127. * .. Scalar Arguments ..
  128. INTEGER INFO, LDA, LDB, LWORK, M, N, NRHS
  129. * ..
  130. * .. Array Arguments ..
  131. COMPLEX A( LDA, * ), B( LDB, * ), TAU( * ),
  132. $ WORK( LWORK )
  133. * ..
  134. *
  135. * =====================================================================
  136. *
  137. * .. Parameters ..
  138. COMPLEX CZERO, CONE
  139. PARAMETER ( CZERO = ( 0.0E+0, 0.0E+0 ),
  140. $ CONE = ( 1.0E+0, 0.0E+0 ) )
  141. * ..
  142. * .. External Subroutines ..
  143. EXTERNAL CLASET, CTRSM, CUNMRQ, XERBLA
  144. * ..
  145. * .. Intrinsic Functions ..
  146. INTRINSIC MAX
  147. * ..
  148. * .. Executable Statements ..
  149. *
  150. * Test the input parameters.
  151. *
  152. INFO = 0
  153. IF( M.LT.0 ) THEN
  154. INFO = -1
  155. ELSE IF( N.LT.0 .OR. M.GT.N ) THEN
  156. INFO = -2
  157. ELSE IF( NRHS.LT.0 ) THEN
  158. INFO = -3
  159. ELSE IF( LDA.LT.MAX( 1, M ) ) THEN
  160. INFO = -5
  161. ELSE IF( LDB.LT.MAX( 1, N ) ) THEN
  162. INFO = -8
  163. ELSE IF( LWORK.LT.1 .OR. LWORK.LT.NRHS .AND. M.GT.0 .AND. N.GT.0 )
  164. $ THEN
  165. INFO = -10
  166. END IF
  167. IF( INFO.NE.0 ) THEN
  168. CALL XERBLA( 'CGERQS', -INFO )
  169. RETURN
  170. END IF
  171. *
  172. * Quick return if possible
  173. *
  174. IF( N.EQ.0 .OR. NRHS.EQ.0 .OR. M.EQ.0 )
  175. $ RETURN
  176. *
  177. * Solve R*X = B(n-m+1:n,:)
  178. *
  179. CALL CTRSM( 'Left', 'Upper', 'No transpose', 'Non-unit', M, NRHS,
  180. $ CONE, A( 1, N-M+1 ), LDA, B( N-M+1, 1 ), LDB )
  181. *
  182. * Set B(1:n-m,:) to zero
  183. *
  184. CALL CLASET( 'Full', N-M, NRHS, CZERO, CZERO, B, LDB )
  185. *
  186. * B := Q' * B
  187. *
  188. CALL CUNMRQ( 'Left', 'Conjugate transpose', N, NRHS, M, A, LDA,
  189. $ TAU, B, LDB, WORK, LWORK, INFO )
  190. *
  191. RETURN
  192. *
  193. * End of CGERQS
  194. *
  195. END