|
28 | 28 | *> \verbatim |
29 | 29 | *> |
30 | 30 | *> CBDT01 reconstructs a general matrix A from its bidiagonal form |
31 | | -*> A = Q * B * P' |
32 | | -*> where Q (m by min(m,n)) and P' (min(m,n) by n) are unitary |
| 31 | +*> A = Q * B * P**H |
| 32 | +*> where Q (m by min(m,n)) and P**H (min(m,n) by n) are unitary |
33 | 33 | *> matrices and B is bidiagonal. |
34 | 34 | *> |
35 | 35 | *> The test ratio to test the reduction is |
36 | | -*> RESID = norm( A - Q * B * PT ) / ( n * norm(A) * EPS ) |
37 | | -*> where PT = P' and EPS is the machine precision. |
| 36 | +*> RESID = norm(A - Q * B * P**H) / ( n * norm(A) * EPS ) |
| 37 | +*> where EPS is the machine precision. |
38 | 38 | *> \endverbatim |
39 | 39 | * |
40 | 40 | * Arguments: |
|
49 | 49 | *> \param[in] N |
50 | 50 | *> \verbatim |
51 | 51 | *> N is INTEGER |
52 | | -*> The number of columns of the matrices A and P'. |
| 52 | +*> The number of columns of the matrices A and P**H. |
53 | 53 | *> \endverbatim |
54 | 54 | *> |
55 | 55 | *> \param[in] KD |
|
78 | 78 | *> \verbatim |
79 | 79 | *> Q is COMPLEX array, dimension (LDQ,N) |
80 | 80 | *> The m by min(m,n) unitary matrix Q in the reduction |
81 | | -*> A = Q * B * P'. |
| 81 | +*> A = Q * B * P**H. |
82 | 82 | *> \endverbatim |
83 | 83 | *> |
84 | 84 | *> \param[in] LDQ |
|
103 | 103 | *> \param[in] PT |
104 | 104 | *> \verbatim |
105 | 105 | *> PT is COMPLEX array, dimension (LDPT,N) |
106 | | -*> The min(m,n) by n unitary matrix P' in the reduction |
107 | | -*> A = Q * B * P'. |
| 106 | +*> The min(m,n) by n unitary matrix P**H in the reduction |
| 107 | +*> A = Q * B * P**H. |
108 | 108 | *> \endverbatim |
109 | 109 | *> |
110 | 110 | *> \param[in] LDPT |
|
127 | 127 | *> \param[out] RESID |
128 | 128 | *> \verbatim |
129 | 129 | *> RESID is REAL |
130 | | -*> The test ratio: norm(A - Q * B * P') / ( n * norm(A) * EPS ) |
| 130 | +*> The test ratio: |
| 131 | +*> norm(A - Q * B * P**H) / ( n * norm(A) * EPS ) |
131 | 132 | *> \endverbatim |
132 | 133 | * |
133 | 134 | * Authors: |
|
138 | 139 | *> \author Univ. of Colorado Denver |
139 | 140 | *> \author NAG Ltd. |
140 | 141 | * |
141 | | -*> \date December 2016 |
142 | | -* |
143 | 142 | *> \ingroup complex_eig |
144 | 143 | * |
145 | 144 | * ===================================================================== |
146 | 145 | SUBROUTINE CBDT01( M, N, KD, A, LDA, Q, LDQ, D, E, PT, LDPT, WORK, |
147 | 146 | $ RWORK, RESID ) |
148 | 147 | * |
149 | | -* -- LAPACK test routine (version 3.7.0) -- |
| 148 | +* -- LAPACK test routine -- |
150 | 149 | * -- LAPACK is a software package provided by Univ. of Tennessee, -- |
151 | 150 | * -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- |
152 | | -* December 2016 |
153 | 151 | * |
154 | 152 | * .. Scalar Arguments .. |
155 | 153 | INTEGER KD, LDA, LDPT, LDQ, M, N |
@@ -190,7 +188,7 @@ SUBROUTINE CBDT01( M, N, KD, A, LDA, Q, LDQ, D, E, PT, LDPT, WORK, |
190 | 188 | RETURN |
191 | 189 | END IF |
192 | 190 | * |
193 | | -* Compute A - Q * B * P' one column at a time. |
| 191 | +* Compute A - Q * B * P**H one column at a time. |
194 | 192 | * |
195 | 193 | RESID = ZERO |
196 | 194 | IF( KD.NE.0 ) THEN |
@@ -268,7 +266,7 @@ SUBROUTINE CBDT01( M, N, KD, A, LDA, Q, LDQ, D, E, PT, LDPT, WORK, |
268 | 266 | END IF |
269 | 267 | END IF |
270 | 268 | * |
271 | | -* Compute norm(A - Q * B * P') / ( n * norm(A) * EPS ) |
| 269 | +* Compute norm(A - Q * B * P**H) / ( n * norm(A) * EPS ) |
272 | 270 | * |
273 | 271 | ANORM = CLANGE( '1', M, N, A, LDA, RWORK ) |
274 | 272 | EPS = SLAMCH( 'Precision' ) |
|
0 commit comments