root / src / blas / stpsv.f @ 2
Historique | Voir | Annoter | Télécharger (9,08 ko)
1 | 1 | equemene | SUBROUTINE STPSV(UPLO,TRANS,DIAG,N,AP,X,INCX) |
---|---|---|---|
2 | 1 | equemene | * .. Scalar Arguments .. |
3 | 1 | equemene | INTEGER INCX,N |
4 | 1 | equemene | CHARACTER DIAG,TRANS,UPLO |
5 | 1 | equemene | * .. |
6 | 1 | equemene | * .. Array Arguments .. |
7 | 1 | equemene | REAL AP(*),X(*) |
8 | 1 | equemene | * .. |
9 | 1 | equemene | * |
10 | 1 | equemene | * Purpose |
11 | 1 | equemene | * ======= |
12 | 1 | equemene | * |
13 | 1 | equemene | * STPSV solves one of the systems of equations |
14 | 1 | equemene | * |
15 | 1 | equemene | * A*x = b, or A'*x = b, |
16 | 1 | equemene | * |
17 | 1 | equemene | * where b and x are n element vectors and A is an n by n unit, or |
18 | 1 | equemene | * non-unit, upper or lower triangular matrix, supplied in packed form. |
19 | 1 | equemene | * |
20 | 1 | equemene | * No test for singularity or near-singularity is included in this |
21 | 1 | equemene | * routine. Such tests must be performed before calling this routine. |
22 | 1 | equemene | * |
23 | 1 | equemene | * Arguments |
24 | 1 | equemene | * ========== |
25 | 1 | equemene | * |
26 | 1 | equemene | * UPLO - CHARACTER*1. |
27 | 1 | equemene | * On entry, UPLO specifies whether the matrix is an upper or |
28 | 1 | equemene | * lower triangular matrix as follows: |
29 | 1 | equemene | * |
30 | 1 | equemene | * UPLO = 'U' or 'u' A is an upper triangular matrix. |
31 | 1 | equemene | * |
32 | 1 | equemene | * UPLO = 'L' or 'l' A is a lower triangular matrix. |
33 | 1 | equemene | * |
34 | 1 | equemene | * Unchanged on exit. |
35 | 1 | equemene | * |
36 | 1 | equemene | * TRANS - CHARACTER*1. |
37 | 1 | equemene | * On entry, TRANS specifies the equations to be solved as |
38 | 1 | equemene | * follows: |
39 | 1 | equemene | * |
40 | 1 | equemene | * TRANS = 'N' or 'n' A*x = b. |
41 | 1 | equemene | * |
42 | 1 | equemene | * TRANS = 'T' or 't' A'*x = b. |
43 | 1 | equemene | * |
44 | 1 | equemene | * TRANS = 'C' or 'c' A'*x = b. |
45 | 1 | equemene | * |
46 | 1 | equemene | * Unchanged on exit. |
47 | 1 | equemene | * |
48 | 1 | equemene | * DIAG - CHARACTER*1. |
49 | 1 | equemene | * On entry, DIAG specifies whether or not A is unit |
50 | 1 | equemene | * triangular as follows: |
51 | 1 | equemene | * |
52 | 1 | equemene | * DIAG = 'U' or 'u' A is assumed to be unit triangular. |
53 | 1 | equemene | * |
54 | 1 | equemene | * DIAG = 'N' or 'n' A is not assumed to be unit |
55 | 1 | equemene | * triangular. |
56 | 1 | equemene | * |
57 | 1 | equemene | * Unchanged on exit. |
58 | 1 | equemene | * |
59 | 1 | equemene | * N - INTEGER. |
60 | 1 | equemene | * On entry, N specifies the order of the matrix A. |
61 | 1 | equemene | * N must be at least zero. |
62 | 1 | equemene | * Unchanged on exit. |
63 | 1 | equemene | * |
64 | 1 | equemene | * AP - REAL array of DIMENSION at least |
65 | 1 | equemene | * ( ( n*( n + 1 ) )/2 ). |
66 | 1 | equemene | * Before entry with UPLO = 'U' or 'u', the array AP must |
67 | 1 | equemene | * contain the upper triangular matrix packed sequentially, |
68 | 1 | equemene | * column by column, so that AP( 1 ) contains a( 1, 1 ), |
69 | 1 | equemene | * AP( 2 ) and AP( 3 ) contain a( 1, 2 ) and a( 2, 2 ) |
70 | 1 | equemene | * respectively, and so on. |
71 | 1 | equemene | * Before entry with UPLO = 'L' or 'l', the array AP must |
72 | 1 | equemene | * contain the lower triangular matrix packed sequentially, |
73 | 1 | equemene | * column by column, so that AP( 1 ) contains a( 1, 1 ), |
74 | 1 | equemene | * AP( 2 ) and AP( 3 ) contain a( 2, 1 ) and a( 3, 1 ) |
75 | 1 | equemene | * respectively, and so on. |
76 | 1 | equemene | * Note that when DIAG = 'U' or 'u', the diagonal elements of |
77 | 1 | equemene | * A are not referenced, but are assumed to be unity. |
78 | 1 | equemene | * Unchanged on exit. |
79 | 1 | equemene | * |
80 | 1 | equemene | * X - REAL array of dimension at least |
81 | 1 | equemene | * ( 1 + ( n - 1 )*abs( INCX ) ). |
82 | 1 | equemene | * Before entry, the incremented array X must contain the n |
83 | 1 | equemene | * element right-hand side vector b. On exit, X is overwritten |
84 | 1 | equemene | * with the solution vector x. |
85 | 1 | equemene | * |
86 | 1 | equemene | * INCX - INTEGER. |
87 | 1 | equemene | * On entry, INCX specifies the increment for the elements of |
88 | 1 | equemene | * X. INCX must not be zero. |
89 | 1 | equemene | * Unchanged on exit. |
90 | 1 | equemene | * |
91 | 1 | equemene | * |
92 | 1 | equemene | * Level 2 Blas routine. |
93 | 1 | equemene | * |
94 | 1 | equemene | * -- Written on 22-October-1986. |
95 | 1 | equemene | * Jack Dongarra, Argonne National Lab. |
96 | 1 | equemene | * Jeremy Du Croz, Nag Central Office. |
97 | 1 | equemene | * Sven Hammarling, Nag Central Office. |
98 | 1 | equemene | * Richard Hanson, Sandia National Labs. |
99 | 1 | equemene | * |
100 | 1 | equemene | * |
101 | 1 | equemene | * .. Parameters .. |
102 | 1 | equemene | REAL ZERO |
103 | 1 | equemene | PARAMETER (ZERO=0.0E+0) |
104 | 1 | equemene | * .. |
105 | 1 | equemene | * .. Local Scalars .. |
106 | 1 | equemene | REAL TEMP |
107 | 1 | equemene | INTEGER I,INFO,IX,J,JX,K,KK,KX |
108 | 1 | equemene | LOGICAL NOUNIT |
109 | 1 | equemene | * .. |
110 | 1 | equemene | * .. External Functions .. |
111 | 1 | equemene | LOGICAL LSAME |
112 | 1 | equemene | EXTERNAL LSAME |
113 | 1 | equemene | * .. |
114 | 1 | equemene | * .. External Subroutines .. |
115 | 1 | equemene | EXTERNAL XERBLA |
116 | 1 | equemene | * .. |
117 | 1 | equemene | * |
118 | 1 | equemene | * Test the input parameters. |
119 | 1 | equemene | * |
120 | 1 | equemene | INFO = 0 |
121 | 1 | equemene | IF (.NOT.LSAME(UPLO,'U') .AND. .NOT.LSAME(UPLO,'L')) THEN |
122 | 1 | equemene | INFO = 1 |
123 | 1 | equemene | ELSE IF (.NOT.LSAME(TRANS,'N') .AND. .NOT.LSAME(TRANS,'T') .AND. |
124 | 1 | equemene | + .NOT.LSAME(TRANS,'C')) THEN |
125 | 1 | equemene | INFO = 2 |
126 | 1 | equemene | ELSE IF (.NOT.LSAME(DIAG,'U') .AND. .NOT.LSAME(DIAG,'N')) THEN |
127 | 1 | equemene | INFO = 3 |
128 | 1 | equemene | ELSE IF (N.LT.0) THEN |
129 | 1 | equemene | INFO = 4 |
130 | 1 | equemene | ELSE IF (INCX.EQ.0) THEN |
131 | 1 | equemene | INFO = 7 |
132 | 1 | equemene | END IF |
133 | 1 | equemene | IF (INFO.NE.0) THEN |
134 | 1 | equemene | CALL XERBLA('STPSV ',INFO) |
135 | 1 | equemene | RETURN |
136 | 1 | equemene | END IF |
137 | 1 | equemene | * |
138 | 1 | equemene | * Quick return if possible. |
139 | 1 | equemene | * |
140 | 1 | equemene | IF (N.EQ.0) RETURN |
141 | 1 | equemene | * |
142 | 1 | equemene | NOUNIT = LSAME(DIAG,'N') |
143 | 1 | equemene | * |
144 | 1 | equemene | * Set up the start point in X if the increment is not unity. This |
145 | 1 | equemene | * will be ( N - 1 )*INCX too small for descending loops. |
146 | 1 | equemene | * |
147 | 1 | equemene | IF (INCX.LE.0) THEN |
148 | 1 | equemene | KX = 1 - (N-1)*INCX |
149 | 1 | equemene | ELSE IF (INCX.NE.1) THEN |
150 | 1 | equemene | KX = 1 |
151 | 1 | equemene | END IF |
152 | 1 | equemene | * |
153 | 1 | equemene | * Start the operations. In this version the elements of AP are |
154 | 1 | equemene | * accessed sequentially with one pass through AP. |
155 | 1 | equemene | * |
156 | 1 | equemene | IF (LSAME(TRANS,'N')) THEN |
157 | 1 | equemene | * |
158 | 1 | equemene | * Form x := inv( A )*x. |
159 | 1 | equemene | * |
160 | 1 | equemene | IF (LSAME(UPLO,'U')) THEN |
161 | 1 | equemene | KK = (N* (N+1))/2 |
162 | 1 | equemene | IF (INCX.EQ.1) THEN |
163 | 1 | equemene | DO 20 J = N,1,-1 |
164 | 1 | equemene | IF (X(J).NE.ZERO) THEN |
165 | 1 | equemene | IF (NOUNIT) X(J) = X(J)/AP(KK) |
166 | 1 | equemene | TEMP = X(J) |
167 | 1 | equemene | K = KK - 1 |
168 | 1 | equemene | DO 10 I = J - 1,1,-1 |
169 | 1 | equemene | X(I) = X(I) - TEMP*AP(K) |
170 | 1 | equemene | K = K - 1 |
171 | 1 | equemene | 10 CONTINUE |
172 | 1 | equemene | END IF |
173 | 1 | equemene | KK = KK - J |
174 | 1 | equemene | 20 CONTINUE |
175 | 1 | equemene | ELSE |
176 | 1 | equemene | JX = KX + (N-1)*INCX |
177 | 1 | equemene | DO 40 J = N,1,-1 |
178 | 1 | equemene | IF (X(JX).NE.ZERO) THEN |
179 | 1 | equemene | IF (NOUNIT) X(JX) = X(JX)/AP(KK) |
180 | 1 | equemene | TEMP = X(JX) |
181 | 1 | equemene | IX = JX |
182 | 1 | equemene | DO 30 K = KK - 1,KK - J + 1,-1 |
183 | 1 | equemene | IX = IX - INCX |
184 | 1 | equemene | X(IX) = X(IX) - TEMP*AP(K) |
185 | 1 | equemene | 30 CONTINUE |
186 | 1 | equemene | END IF |
187 | 1 | equemene | JX = JX - INCX |
188 | 1 | equemene | KK = KK - J |
189 | 1 | equemene | 40 CONTINUE |
190 | 1 | equemene | END IF |
191 | 1 | equemene | ELSE |
192 | 1 | equemene | KK = 1 |
193 | 1 | equemene | IF (INCX.EQ.1) THEN |
194 | 1 | equemene | DO 60 J = 1,N |
195 | 1 | equemene | IF (X(J).NE.ZERO) THEN |
196 | 1 | equemene | IF (NOUNIT) X(J) = X(J)/AP(KK) |
197 | 1 | equemene | TEMP = X(J) |
198 | 1 | equemene | K = KK + 1 |
199 | 1 | equemene | DO 50 I = J + 1,N |
200 | 1 | equemene | X(I) = X(I) - TEMP*AP(K) |
201 | 1 | equemene | K = K + 1 |
202 | 1 | equemene | 50 CONTINUE |
203 | 1 | equemene | END IF |
204 | 1 | equemene | KK = KK + (N-J+1) |
205 | 1 | equemene | 60 CONTINUE |
206 | 1 | equemene | ELSE |
207 | 1 | equemene | JX = KX |
208 | 1 | equemene | DO 80 J = 1,N |
209 | 1 | equemene | IF (X(JX).NE.ZERO) THEN |
210 | 1 | equemene | IF (NOUNIT) X(JX) = X(JX)/AP(KK) |
211 | 1 | equemene | TEMP = X(JX) |
212 | 1 | equemene | IX = JX |
213 | 1 | equemene | DO 70 K = KK + 1,KK + N - J |
214 | 1 | equemene | IX = IX + INCX |
215 | 1 | equemene | X(IX) = X(IX) - TEMP*AP(K) |
216 | 1 | equemene | 70 CONTINUE |
217 | 1 | equemene | END IF |
218 | 1 | equemene | JX = JX + INCX |
219 | 1 | equemene | KK = KK + (N-J+1) |
220 | 1 | equemene | 80 CONTINUE |
221 | 1 | equemene | END IF |
222 | 1 | equemene | END IF |
223 | 1 | equemene | ELSE |
224 | 1 | equemene | * |
225 | 1 | equemene | * Form x := inv( A' )*x. |
226 | 1 | equemene | * |
227 | 1 | equemene | IF (LSAME(UPLO,'U')) THEN |
228 | 1 | equemene | KK = 1 |
229 | 1 | equemene | IF (INCX.EQ.1) THEN |
230 | 1 | equemene | DO 100 J = 1,N |
231 | 1 | equemene | TEMP = X(J) |
232 | 1 | equemene | K = KK |
233 | 1 | equemene | DO 90 I = 1,J - 1 |
234 | 1 | equemene | TEMP = TEMP - AP(K)*X(I) |
235 | 1 | equemene | K = K + 1 |
236 | 1 | equemene | 90 CONTINUE |
237 | 1 | equemene | IF (NOUNIT) TEMP = TEMP/AP(KK+J-1) |
238 | 1 | equemene | X(J) = TEMP |
239 | 1 | equemene | KK = KK + J |
240 | 1 | equemene | 100 CONTINUE |
241 | 1 | equemene | ELSE |
242 | 1 | equemene | JX = KX |
243 | 1 | equemene | DO 120 J = 1,N |
244 | 1 | equemene | TEMP = X(JX) |
245 | 1 | equemene | IX = KX |
246 | 1 | equemene | DO 110 K = KK,KK + J - 2 |
247 | 1 | equemene | TEMP = TEMP - AP(K)*X(IX) |
248 | 1 | equemene | IX = IX + INCX |
249 | 1 | equemene | 110 CONTINUE |
250 | 1 | equemene | IF (NOUNIT) TEMP = TEMP/AP(KK+J-1) |
251 | 1 | equemene | X(JX) = TEMP |
252 | 1 | equemene | JX = JX + INCX |
253 | 1 | equemene | KK = KK + J |
254 | 1 | equemene | 120 CONTINUE |
255 | 1 | equemene | END IF |
256 | 1 | equemene | ELSE |
257 | 1 | equemene | KK = (N* (N+1))/2 |
258 | 1 | equemene | IF (INCX.EQ.1) THEN |
259 | 1 | equemene | DO 140 J = N,1,-1 |
260 | 1 | equemene | TEMP = X(J) |
261 | 1 | equemene | K = KK |
262 | 1 | equemene | DO 130 I = N,J + 1,-1 |
263 | 1 | equemene | TEMP = TEMP - AP(K)*X(I) |
264 | 1 | equemene | K = K - 1 |
265 | 1 | equemene | 130 CONTINUE |
266 | 1 | equemene | IF (NOUNIT) TEMP = TEMP/AP(KK-N+J) |
267 | 1 | equemene | X(J) = TEMP |
268 | 1 | equemene | KK = KK - (N-J+1) |
269 | 1 | equemene | 140 CONTINUE |
270 | 1 | equemene | ELSE |
271 | 1 | equemene | KX = KX + (N-1)*INCX |
272 | 1 | equemene | JX = KX |
273 | 1 | equemene | DO 160 J = N,1,-1 |
274 | 1 | equemene | TEMP = X(JX) |
275 | 1 | equemene | IX = KX |
276 | 1 | equemene | DO 150 K = KK,KK - (N- (J+1)),-1 |
277 | 1 | equemene | TEMP = TEMP - AP(K)*X(IX) |
278 | 1 | equemene | IX = IX - INCX |
279 | 1 | equemene | 150 CONTINUE |
280 | 1 | equemene | IF (NOUNIT) TEMP = TEMP/AP(KK-N+J) |
281 | 1 | equemene | X(JX) = TEMP |
282 | 1 | equemene | JX = JX - INCX |
283 | 1 | equemene | KK = KK - (N-J+1) |
284 | 1 | equemene | 160 CONTINUE |
285 | 1 | equemene | END IF |
286 | 1 | equemene | END IF |
287 | 1 | equemene | END IF |
288 | 1 | equemene | * |
289 | 1 | equemene | RETURN |
290 | 1 | equemene | * |
291 | 1 | equemene | * End of STPSV . |
292 | 1 | equemene | * |
293 | 1 | equemene | END |