LAPACK  3.7.1
LAPACK: Linear Algebra PACKage
zlasyf_aa.f
Go to the documentation of this file.
1 *> \brief \b ZLASYF_AA
2 *
3 * =========== DOCUMENTATION ===========
4 *
5 * Online html documentation available at
6 * http://www.netlib.org/lapack/explore-html/
7 *
8 *> \htmlonly
9 *> Download ZLASYF_AA + dependencies
10 *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zlasyf_aa.f">
11 *> [TGZ]</a>
12 *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zlasyf_aa.f">
13 *> [ZIP]</a>
14 *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zlasyf_aa.f">
15 *> [TXT]</a>
16 *> \endhtmlonly
17 *
18 * Definition:
19 * ===========
20 *
21 * SUBROUTINE ZLASYF_AA( UPLO, J1, M, NB, A, LDA, IPIV,
22 * H, LDH, WORK )
23 *
24 * .. Scalar Arguments ..
25 * CHARACTER UPLO
26 * INTEGER J1, M, NB, LDA, LDH
27 * ..
28 * .. Array Arguments ..
29 * INTEGER IPIV( * )
30 * COMPLEX*16 A( LDA, * ), H( LDH, * ), WORK( * )
31 * ..
32 *
33 *
34 *> \par Purpose:
35 * =============
36 *>
37 *> \verbatim
38 *>
39 *> DLATRF_AA factorizes a panel of a complex symmetric matrix A using
40 *> the Aasen's algorithm. The panel consists of a set of NB rows of A
41 *> when UPLO is U, or a set of NB columns when UPLO is L.
42 *>
43 *> In order to factorize the panel, the Aasen's algorithm requires the
44 *> last row, or column, of the previous panel. The first row, or column,
45 *> of A is set to be the first row, or column, of an identity matrix,
46 *> which is used to factorize the first panel.
47 *>
48 *> The resulting J-th row of U, or J-th column of L, is stored in the
49 *> (J-1)-th row, or column, of A (without the unit diagonals), while
50 *> the diagonal and subdiagonal of A are overwritten by those of T.
51 *>
52 *> \endverbatim
53 *
54 * Arguments:
55 * ==========
56 *
57 *> \param[in] UPLO
58 *> \verbatim
59 *> UPLO is CHARACTER*1
60 *> = 'U': Upper triangle of A is stored;
61 *> = 'L': Lower triangle of A is stored.
62 *> \endverbatim
63 *>
64 *> \param[in] J1
65 *> \verbatim
66 *> J1 is INTEGER
67 *> The location of the first row, or column, of the panel
68 *> within the submatrix of A, passed to this routine, e.g.,
69 *> when called by ZSYTRF_AA, for the first panel, J1 is 1,
70 *> while for the remaining panels, J1 is 2.
71 *> \endverbatim
72 *>
73 *> \param[in] M
74 *> \verbatim
75 *> M is INTEGER
76 *> The dimension of the submatrix. M >= 0.
77 *> \endverbatim
78 *>
79 *> \param[in] NB
80 *> \verbatim
81 *> NB is INTEGER
82 *> The dimension of the panel to be facotorized.
83 *> \endverbatim
84 *>
85 *> \param[in,out] A
86 *> \verbatim
87 *> A is COMPLEX*16 array, dimension (LDA,M) for
88 *> the first panel, while dimension (LDA,M+1) for the
89 *> remaining panels.
90 *>
91 *> On entry, A contains the last row, or column, of
92 *> the previous panel, and the trailing submatrix of A
93 *> to be factorized, except for the first panel, only
94 *> the panel is passed.
95 *>
96 *> On exit, the leading panel is factorized.
97 *> \endverbatim
98 *>
99 *> \param[in] LDA
100 *> \verbatim
101 *> LDA is INTEGER
102 *> The leading dimension of the array A. LDA >= max(1,M).
103 *> \endverbatim
104 *>
105 *> \param[out] IPIV
106 *> \verbatim
107 *> IPIV is INTEGER array, dimension (M)
108 *> Details of the row and column interchanges,
109 *> the row and column k were interchanged with the row and
110 *> column IPIV(k).
111 *> \endverbatim
112 *>
113 *> \param[in,out] H
114 *> \verbatim
115 *> H is COMPLEX*16 workspace, dimension (LDH,NB).
116 *>
117 *> \endverbatim
118 *>
119 *> \param[in] LDH
120 *> \verbatim
121 *> LDH is INTEGER
122 *> The leading dimension of the workspace H. LDH >= max(1,M).
123 *> \endverbatim
124 *>
125 *> \param[out] WORK
126 *> \verbatim
127 *> WORK is COMPLEX*16 workspace, dimension (M).
128 *> \endverbatim
129 *>
130 *
131 * Authors:
132 * ========
133 *
134 *> \author Univ. of Tennessee
135 *> \author Univ. of California Berkeley
136 *> \author Univ. of Colorado Denver
137 *> \author NAG Ltd.
138 *
139 *> \date June 2017
140 *
141 *> \ingroup complex16SYcomputational
142 *
143 * =====================================================================
144  SUBROUTINE zlasyf_aa( UPLO, J1, M, NB, A, LDA, IPIV,
145  $ H, LDH, WORK )
146 *
147 * -- LAPACK computational routine (version 3.7.1) --
148 * -- LAPACK is a software package provided by Univ. of Tennessee, --
149 * -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
150 * June 2017
151 *
152  IMPLICIT NONE
153 *
154 * .. Scalar Arguments ..
155  CHARACTER UPLO
156  INTEGER M, NB, J1, LDA, LDH
157 * ..
158 * .. Array Arguments ..
159  INTEGER IPIV( * )
160  COMPLEX*16 A( lda, * ), H( ldh, * ), WORK( * )
161 * ..
162 *
163 * =====================================================================
164 * .. Parameters ..
165  COMPLEX*16 ZERO, ONE
166  parameter( zero = 0.0d+0, one = 1.0d+0 )
167 *
168 * .. Local Scalars ..
169  INTEGER J, K, K1, I1, I2
170  COMPLEX*16 PIV, ALPHA
171 * ..
172 * .. External Functions ..
173  LOGICAL LSAME
174  INTEGER IZAMAX, ILAENV
175  EXTERNAL lsame, ilaenv, izamax
176 * ..
177 * .. External Subroutines ..
178  EXTERNAL xerbla
179 * ..
180 * .. Intrinsic Functions ..
181  INTRINSIC max
182 * ..
183 * .. Executable Statements ..
184 *
185  j = 1
186 *
187 * K1 is the first column of the panel to be factorized
188 * i.e., K1 is 2 for the first block column, and 1 for the rest of the blocks
189 *
190  k1 = (2-j1)+1
191 *
192  IF( lsame( uplo, 'U' ) ) THEN
193 *
194 * .....................................................
195 * Factorize A as U**T*D*U using the upper triangle of A
196 * .....................................................
197 *
198  10 CONTINUE
199  IF ( j.GT.min(m, nb) )
200  $ GO TO 20
201 *
202 * K is the column to be factorized
203 * when being called from ZSYTRF_AA,
204 * > for the first block column, J1 is 1, hence J1+J-1 is J,
205 * > for the rest of the columns, J1 is 2, and J1+J-1 is J+1,
206 *
207  k = j1+j-1
208 *
209 * H(J:M, J) := A(J, J:M) - H(J:M, 1:(J-1)) * L(J1:(J-1), J),
210 * where H(J:M, J) has been initialized to be A(J, J:M)
211 *
212  IF( k.GT.2 ) THEN
213 *
214 * K is the column to be factorized
215 * > for the first block column, K is J, skipping the first two
216 * columns
217 * > for the rest of the columns, K is J+1, skipping only the
218 * first column
219 *
220  CALL zgemv( 'No transpose', m-j+1, j-k1,
221  $ -one, h( j, k1 ), ldh,
222  $ a( 1, j ), 1,
223  $ one, h( j, j ), 1 )
224  END IF
225 *
226 * Copy H(i:M, i) into WORK
227 *
228  CALL zcopy( m-j+1, h( j, j ), 1, work( 1 ), 1 )
229 *
230  IF( j.GT.k1 ) THEN
231 *
232 * Compute WORK := WORK - L(J-1, J:M) * T(J-1,J),
233 * where A(J-1, J) stores T(J-1, J) and A(J-2, J:M) stores U(J-1, J:M)
234 *
235  alpha = -a( k-1, j )
236  CALL zaxpy( m-j+1, alpha, a( k-2, j ), lda, work( 1 ), 1 )
237  END IF
238 *
239 * Set A(J, J) = T(J, J)
240 *
241  a( k, j ) = work( 1 )
242 *
243  IF( j.LT.m ) THEN
244 *
245 * Compute WORK(2:M) = T(J, J) L(J, (J+1):M)
246 * where A(J, J) stores T(J, J) and A(J-1, (J+1):M) stores U(J, (J+1):M)
247 *
248  IF( k.GT.1 ) THEN
249  alpha = -a( k, j )
250  CALL zaxpy( m-j, alpha, a( k-1, j+1 ), lda,
251  $ work( 2 ), 1 )
252  ENDIF
253 *
254 * Find max(|WORK(2:M)|)
255 *
256  i2 = izamax( m-j, work( 2 ), 1 ) + 1
257  piv = work( i2 )
258 *
259 * Apply symmetric pivot
260 *
261  IF( (i2.NE.2) .AND. (piv.NE.0) ) THEN
262 *
263 * Swap WORK(I1) and WORK(I2)
264 *
265  i1 = 2
266  work( i2 ) = work( i1 )
267  work( i1 ) = piv
268 *
269 * Swap A(I1, I1+1:M) with A(I1+1:M, I2)
270 *
271  i1 = i1+j-1
272  i2 = i2+j-1
273  CALL zswap( i2-i1-1, a( j1+i1-1, i1+1 ), lda,
274  $ a( j1+i1, i2 ), 1 )
275 *
276 * Swap A(I1, I2+1:M) with A(I2, I2+1:M)
277 *
278  CALL zswap( m-i2, a( j1+i1-1, i2+1 ), lda,
279  $ a( j1+i2-1, i2+1 ), lda )
280 *
281 * Swap A(I1, I1) with A(I2,I2)
282 *
283  piv = a( i1+j1-1, i1 )
284  a( j1+i1-1, i1 ) = a( j1+i2-1, i2 )
285  a( j1+i2-1, i2 ) = piv
286 *
287 * Swap H(I1, 1:J1) with H(I2, 1:J1)
288 *
289  CALL zswap( i1-1, h( i1, 1 ), ldh, h( i2, 1 ), ldh )
290  ipiv( i1 ) = i2
291 *
292  IF( i1.GT.(k1-1) ) THEN
293 *
294 * Swap L(1:I1-1, I1) with L(1:I1-1, I2),
295 * skipping the first column
296 *
297  CALL zswap( i1-k1+1, a( 1, i1 ), 1,
298  $ a( 1, i2 ), 1 )
299  END IF
300  ELSE
301  ipiv( j+1 ) = j+1
302  ENDIF
303 *
304 * Set A(J, J+1) = T(J, J+1)
305 *
306  a( k, j+1 ) = work( 2 )
307 *
308  IF( j.LT.nb ) THEN
309 *
310 * Copy A(J+1:M, J+1) into H(J:M, J),
311 *
312  CALL zcopy( m-j, a( k+1, j+1 ), lda,
313  $ h( j+1, j+1 ), 1 )
314  END IF
315 *
316 * Compute L(J+2, J+1) = WORK( 3:M ) / T(J, J+1),
317 * where A(J, J+1) = T(J, J+1) and A(J+2:M, J) = L(J+2:M, J+1)
318 *
319  IF( a( k, j+1 ).NE.zero ) THEN
320  alpha = one / a( k, j+1 )
321  CALL zcopy( m-j-1, work( 3 ), 1, a( k, j+2 ), lda )
322  CALL zscal( m-j-1, alpha, a( k, j+2 ), lda )
323  ELSE
324  CALL zlaset( 'Full', 1, m-j-1, zero, zero,
325  $ a( k, j+2 ), lda)
326  END IF
327  END IF
328  j = j + 1
329  GO TO 10
330  20 CONTINUE
331 *
332  ELSE
333 *
334 * .....................................................
335 * Factorize A as L*D*L**T using the lower triangle of A
336 * .....................................................
337 *
338  30 CONTINUE
339  IF( j.GT.min( m, nb ) )
340  $ GO TO 40
341 *
342 * K is the column to be factorized
343 * when being called from ZSYTRF_AA,
344 * > for the first block column, J1 is 1, hence J1+J-1 is J,
345 * > for the rest of the columns, J1 is 2, and J1+J-1 is J+1,
346 *
347  k = j1+j-1
348 *
349 * H(J:M, J) := A(J:M, J) - H(J:M, 1:(J-1)) * L(J, J1:(J-1))^T,
350 * where H(J:M, J) has been initialized to be A(J:M, J)
351 *
352  IF( k.GT.2 ) THEN
353 *
354 * K is the column to be factorized
355 * > for the first block column, K is J, skipping the first two
356 * columns
357 * > for the rest of the columns, K is J+1, skipping only the
358 * first column
359 *
360  CALL zgemv( 'No transpose', m-j+1, j-k1,
361  $ -one, h( j, k1 ), ldh,
362  $ a( j, 1 ), lda,
363  $ one, h( j, j ), 1 )
364  END IF
365 *
366 * Copy H(J:M, J) into WORK
367 *
368  CALL zcopy( m-j+1, h( j, j ), 1, work( 1 ), 1 )
369 *
370  IF( j.GT.k1 ) THEN
371 *
372 * Compute WORK := WORK - L(J:M, J-1) * T(J-1,J),
373 * where A(J-1, J) = T(J-1, J) and A(J, J-2) = L(J, J-1)
374 *
375  alpha = -a( j, k-1 )
376  CALL zaxpy( m-j+1, alpha, a( j, k-2 ), 1, work( 1 ), 1 )
377  END IF
378 *
379 * Set A(J, J) = T(J, J)
380 *
381  a( j, k ) = work( 1 )
382 *
383  IF( j.LT.m ) THEN
384 *
385 * Compute WORK(2:M) = T(J, J) L((J+1):M, J)
386 * where A(J, J) = T(J, J) and A((J+1):M, J-1) = L((J+1):M, J)
387 *
388  IF( k.GT.1 ) THEN
389  alpha = -a( j, k )
390  CALL zaxpy( m-j, alpha, a( j+1, k-1 ), 1,
391  $ work( 2 ), 1 )
392  ENDIF
393 *
394 * Find max(|WORK(2:M)|)
395 *
396  i2 = izamax( m-j, work( 2 ), 1 ) + 1
397  piv = work( i2 )
398 *
399 * Apply symmetric pivot
400 *
401  IF( (i2.NE.2) .AND. (piv.NE.0) ) THEN
402 *
403 * Swap WORK(I1) and WORK(I2)
404 *
405  i1 = 2
406  work( i2 ) = work( i1 )
407  work( i1 ) = piv
408 *
409 * Swap A(I1+1:M, I1) with A(I2, I1+1:M)
410 *
411  i1 = i1+j-1
412  i2 = i2+j-1
413  CALL zswap( i2-i1-1, a( i1+1, j1+i1-1 ), 1,
414  $ a( i2, j1+i1 ), lda )
415 *
416 * Swap A(I2+1:M, I1) with A(I2+1:M, I2)
417 *
418  CALL zswap( m-i2, a( i2+1, j1+i1-1 ), 1,
419  $ a( i2+1, j1+i2-1 ), 1 )
420 *
421 * Swap A(I1, I1) with A(I2, I2)
422 *
423  piv = a( i1, j1+i1-1 )
424  a( i1, j1+i1-1 ) = a( i2, j1+i2-1 )
425  a( i2, j1+i2-1 ) = piv
426 *
427 * Swap H(I1, I1:J1) with H(I2, I2:J1)
428 *
429  CALL zswap( i1-1, h( i1, 1 ), ldh, h( i2, 1 ), ldh )
430  ipiv( i1 ) = i2
431 *
432  IF( i1.GT.(k1-1) ) THEN
433 *
434 * Swap L(1:I1-1, I1) with L(1:I1-1, I2),
435 * skipping the first column
436 *
437  CALL zswap( i1-k1+1, a( i1, 1 ), lda,
438  $ a( i2, 1 ), lda )
439  END IF
440  ELSE
441  ipiv( j+1 ) = j+1
442  ENDIF
443 *
444 * Set A(J+1, J) = T(J+1, J)
445 *
446  a( j+1, k ) = work( 2 )
447 *
448  IF( j.LT.nb ) THEN
449 *
450 * Copy A(J+1:M, J+1) into H(J+1:M, J),
451 *
452  CALL zcopy( m-j, a( j+1, k+1 ), 1,
453  $ h( j+1, j+1 ), 1 )
454  END IF
455 *
456 * Compute L(J+2, J+1) = WORK( 3:M ) / T(J, J+1),
457 * where A(J, J+1) = T(J, J+1) and A(J+2:M, J) = L(J+2:M, J+1)
458 *
459  IF( a( j+1, k ).NE.zero ) THEN
460  alpha = one / a( j+1, k )
461  CALL zcopy( m-j-1, work( 3 ), 1, a( j+2, k ), 1 )
462  CALL zscal( m-j-1, alpha, a( j+2, k ), 1 )
463  ELSE
464  CALL zlaset( 'Full', m-j-1, 1, zero, zero,
465  $ a( j+2, k ), lda )
466  END IF
467  END IF
468  j = j + 1
469  GO TO 30
470  40 CONTINUE
471  END IF
472  RETURN
473 *
474 * End of ZLASYF_AA
475 *
476  END
subroutine zcopy(N, ZX, INCX, ZY, INCY)
ZCOPY
Definition: zcopy.f:83
subroutine zgemv(TRANS, M, N, ALPHA, A, LDA, X, INCX, BETA, Y, INCY)
ZGEMV
Definition: zgemv.f:160
subroutine zswap(N, ZX, INCX, ZY, INCY)
ZSWAP
Definition: zswap.f:83
subroutine zlasyf_aa(UPLO, J1, M, NB, A, LDA, IPIV, H, LDH, WORK)
ZLASYF_AA
Definition: zlasyf_aa.f:146
subroutine xerbla(SRNAME, INFO)
XERBLA
Definition: xerbla.f:62
subroutine zlaset(UPLO, M, N, ALPHA, BETA, A, LDA)
ZLASET initializes the off-diagonal elements and the diagonal elements of a matrix to given values...
Definition: zlaset.f:108
subroutine zaxpy(N, ZA, ZX, INCX, ZY, INCY)
ZAXPY
Definition: zaxpy.f:90
subroutine zscal(N, ZA, ZX, INCX)
ZSCAL
Definition: zscal.f:80