LAPACK 3.11.0 LAPACK: Linear Algebra PACKage
Searching...
No Matches
cgerqs.f
Go to the documentation of this file.
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
subroutine xerbla(SRNAME, INFO)
XERBLA
Definition: xerbla.f:60
subroutine ctrsm(SIDE, UPLO, TRANSA, DIAG, M, N, ALPHA, A, LDA, B, LDB)
CTRSM
Definition: ctrsm.f:180
subroutine cgerqs(M, N, NRHS, A, LDA, TAU, B, LDB, WORK, LWORK, INFO)
CGERQS
Definition: cgerqs.f:122
subroutine claset(UPLO, M, N, ALPHA, BETA, A, LDA)
CLASET initializes the off-diagonal elements and the diagonal elements of a matrix to given values.
Definition: claset.f:106
subroutine cunmrq(SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, WORK, LWORK, INFO)
CUNMRQ
Definition: cunmrq.f:168