123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348 |
- *DECK CTPSV
- SUBROUTINE CTPSV (UPLO, TRANS, DIAG, N, AP, X, INCX)
- C***BEGIN PROLOGUE CTPSV
- C***PURPOSE Solve one of the systems of equations.
- C***LIBRARY SLATEC (BLAS)
- C***CATEGORY D1B4
- C***TYPE COMPLEX (STPSV-S, DTPSV-D, CTPSV-C)
- C***KEYWORDS LEVEL 2 BLAS, LINEAR ALGEBRA
- C***AUTHOR Dongarra, J. J., (ANL)
- C Du Croz, J., (NAG)
- C Hammarling, S., (NAG)
- C Hanson, R. J., (SNLA)
- C***DESCRIPTION
- C
- C CTPSV solves one of the systems of equations
- C
- C A*x = b, or A'*x = b, or conjg( A')*x = b,
- C
- C where b and x are n element vectors and A is an n by n unit, or
- C non-unit, upper or lower triangular matrix, supplied in packed form.
- C
- C No test for singularity or near-singularity is included in this
- C routine. Such tests must be performed before calling this routine.
- C
- C Parameters
- C ==========
- C
- C UPLO - CHARACTER*1.
- C On entry, UPLO specifies whether the matrix is an upper or
- C lower triangular matrix as follows:
- C
- C UPLO = 'U' or 'u' A is an upper triangular matrix.
- C
- C UPLO = 'L' or 'l' A is a lower triangular matrix.
- C
- C Unchanged on exit.
- C
- C TRANS - CHARACTER*1.
- C On entry, TRANS specifies the equations to be solved as
- C follows:
- C
- C TRANS = 'N' or 'n' A*x = b.
- C
- C TRANS = 'T' or 't' A'*x = b.
- C
- C TRANS = 'C' or 'c' conjg( A' )*x = b.
- C
- C Unchanged on exit.
- C
- C DIAG - CHARACTER*1.
- C On entry, DIAG specifies whether or not A is unit
- C triangular as follows:
- C
- C DIAG = 'U' or 'u' A is assumed to be unit triangular.
- C
- C DIAG = 'N' or 'n' A is not assumed to be unit
- C triangular.
- C
- C Unchanged on exit.
- C
- C N - INTEGER.
- C On entry, N specifies the order of the matrix A.
- C N must be at least zero.
- C Unchanged on exit.
- C
- C AP - COMPLEX array of DIMENSION at least
- C ( ( n*( n + 1 ) )/2 ).
- C Before entry with UPLO = 'U' or 'u', the array AP must
- C contain the upper triangular matrix packed sequentially,
- C column by column, so that AP( 1 ) contains a( 1, 1 ),
- C AP( 2 ) and AP( 3 ) contain a( 1, 2 ) and a( 2, 2 )
- C respectively, and so on.
- C Before entry with UPLO = 'L' or 'l', the array AP must
- C contain the lower triangular matrix packed sequentially,
- C column by column, so that AP( 1 ) contains a( 1, 1 ),
- C AP( 2 ) and AP( 3 ) contain a( 2, 1 ) and a( 3, 1 )
- C respectively, and so on.
- C Note that when DIAG = 'U' or 'u', the diagonal elements of
- C A are not referenced, but are assumed to be unity.
- C Unchanged on exit.
- C
- C X - COMPLEX array of dimension at least
- C ( 1 + ( n - 1 )*abs( INCX ) ).
- C Before entry, the incremented array X must contain the n
- C element right-hand side vector b. On exit, X is overwritten
- C with the solution vector x.
- C
- C INCX - INTEGER.
- C On entry, INCX specifies the increment for the elements of
- C X. INCX must not be zero.
- C Unchanged on exit.
- C
- C***REFERENCES Dongarra, J. J., Du Croz, J., Hammarling, S., and
- C Hanson, R. J. An extended set of Fortran basic linear
- C algebra subprograms. ACM TOMS, Vol. 14, No. 1,
- C pp. 1-17, March 1988.
- C***ROUTINES CALLED LSAME, XERBLA
- C***REVISION HISTORY (YYMMDD)
- C 861022 DATE WRITTEN
- C 910605 Modified to meet SLATEC prologue standards. Only comment
- C lines were modified. (BKS)
- C***END PROLOGUE CTPSV
- C .. Scalar Arguments ..
- INTEGER INCX, N
- CHARACTER*1 DIAG, TRANS, UPLO
- C .. Array Arguments ..
- COMPLEX AP( * ), X( * )
- C .. Parameters ..
- COMPLEX ZERO
- PARAMETER ( ZERO = ( 0.0E+0, 0.0E+0 ) )
- C .. Local Scalars ..
- COMPLEX TEMP
- INTEGER I, INFO, IX, J, JX, K, KK, KX
- LOGICAL NOCONJ, NOUNIT
- C .. External Functions ..
- LOGICAL LSAME
- EXTERNAL LSAME
- C .. External Subroutines ..
- EXTERNAL XERBLA
- C .. Intrinsic Functions ..
- INTRINSIC CONJG
- C***FIRST EXECUTABLE STATEMENT CTPSV
- C
- C Test the input parameters.
- C
- INFO = 0
- IF ( .NOT.LSAME( UPLO , 'U' ).AND.
- $ .NOT.LSAME( UPLO , 'L' ) )THEN
- INFO = 1
- ELSE IF( .NOT.LSAME( TRANS, 'N' ).AND.
- $ .NOT.LSAME( TRANS, 'T' ).AND.
- $ .NOT.LSAME( TRANS, 'C' ) )THEN
- INFO = 2
- ELSE IF( .NOT.LSAME( DIAG , 'U' ).AND.
- $ .NOT.LSAME( DIAG , 'N' ) )THEN
- INFO = 3
- ELSE IF( N.LT.0 )THEN
- INFO = 4
- ELSE IF( INCX.EQ.0 )THEN
- INFO = 7
- END IF
- IF( INFO.NE.0 )THEN
- CALL XERBLA( 'CTPSV ', INFO )
- RETURN
- END IF
- C
- C Quick return if possible.
- C
- IF( N.EQ.0 )
- $ RETURN
- C
- NOCONJ = LSAME( TRANS, 'T' )
- NOUNIT = LSAME( DIAG , 'N' )
- C
- C Set up the start point in X if the increment is not unity. This
- C will be ( N - 1 )*INCX too small for descending loops.
- C
- IF( INCX.LE.0 )THEN
- KX = 1 - ( N - 1 )*INCX
- ELSE IF( INCX.NE.1 )THEN
- KX = 1
- END IF
- C
- C Start the operations. In this version the elements of AP are
- C accessed sequentially with one pass through AP.
- C
- IF( LSAME( TRANS, 'N' ) )THEN
- C
- C Form x := inv( A )*x.
- C
- IF( LSAME( UPLO, 'U' ) )THEN
- KK = ( N*( N + 1 ) )/2
- IF( INCX.EQ.1 )THEN
- DO 20, J = N, 1, -1
- IF( X( J ).NE.ZERO )THEN
- IF( NOUNIT )
- $ X( J ) = X( J )/AP( KK )
- TEMP = X( J )
- K = KK - 1
- DO 10, I = J - 1, 1, -1
- X( I ) = X( I ) - TEMP*AP( K )
- K = K - 1
- 10 CONTINUE
- END IF
- KK = KK - J
- 20 CONTINUE
- ELSE
- JX = KX + ( N - 1 )*INCX
- DO 40, J = N, 1, -1
- IF( X( JX ).NE.ZERO )THEN
- IF( NOUNIT )
- $ X( JX ) = X( JX )/AP( KK )
- TEMP = X( JX )
- IX = JX
- DO 30, K = KK - 1, KK - J + 1, -1
- IX = IX - INCX
- X( IX ) = X( IX ) - TEMP*AP( K )
- 30 CONTINUE
- END IF
- JX = JX - INCX
- KK = KK - J
- 40 CONTINUE
- END IF
- ELSE
- KK = 1
- IF( INCX.EQ.1 )THEN
- DO 60, J = 1, N
- IF( X( J ).NE.ZERO )THEN
- IF( NOUNIT )
- $ X( J ) = X( J )/AP( KK )
- TEMP = X( J )
- K = KK + 1
- DO 50, I = J + 1, N
- X( I ) = X( I ) - TEMP*AP( K )
- K = K + 1
- 50 CONTINUE
- END IF
- KK = KK + ( N - J + 1 )
- 60 CONTINUE
- ELSE
- JX = KX
- DO 80, J = 1, N
- IF( X( JX ).NE.ZERO )THEN
- IF( NOUNIT )
- $ X( JX ) = X( JX )/AP( KK )
- TEMP = X( JX )
- IX = JX
- DO 70, K = KK + 1, KK + N - J
- IX = IX + INCX
- X( IX ) = X( IX ) - TEMP*AP( K )
- 70 CONTINUE
- END IF
- JX = JX + INCX
- KK = KK + ( N - J + 1 )
- 80 CONTINUE
- END IF
- END IF
- ELSE
- C
- C Form x := inv( A' )*x or x := inv( conjg( A' ) )*x.
- C
- IF( LSAME( UPLO, 'U' ) )THEN
- KK = 1
- IF( INCX.EQ.1 )THEN
- DO 110, J = 1, N
- TEMP = X( J )
- K = KK
- IF( NOCONJ )THEN
- DO 90, I = 1, J - 1
- TEMP = TEMP - AP( K )*X( I )
- K = K + 1
- 90 CONTINUE
- IF( NOUNIT )
- $ TEMP = TEMP/AP( KK + J - 1 )
- ELSE
- DO 100, I = 1, J - 1
- TEMP = TEMP - CONJG( AP( K ) )*X( I )
- K = K + 1
- 100 CONTINUE
- IF( NOUNIT )
- $ TEMP = TEMP/CONJG( AP( KK + J - 1 ) )
- END IF
- X( J ) = TEMP
- KK = KK + J
- 110 CONTINUE
- ELSE
- JX = KX
- DO 140, J = 1, N
- TEMP = X( JX )
- IX = KX
- IF( NOCONJ )THEN
- DO 120, K = KK, KK + J - 2
- TEMP = TEMP - AP( K )*X( IX )
- IX = IX + INCX
- 120 CONTINUE
- IF( NOUNIT )
- $ TEMP = TEMP/AP( KK + J - 1 )
- ELSE
- DO 130, K = KK, KK + J - 2
- TEMP = TEMP - CONJG( AP( K ) )*X( IX )
- IX = IX + INCX
- 130 CONTINUE
- IF( NOUNIT )
- $ TEMP = TEMP/CONJG( AP( KK + J - 1 ) )
- END IF
- X( JX ) = TEMP
- JX = JX + INCX
- KK = KK + J
- 140 CONTINUE
- END IF
- ELSE
- KK = ( N*( N + 1 ) )/2
- IF( INCX.EQ.1 )THEN
- DO 170, J = N, 1, -1
- TEMP = X( J )
- K = KK
- IF( NOCONJ )THEN
- DO 150, I = N, J + 1, -1
- TEMP = TEMP - AP( K )*X( I )
- K = K - 1
- 150 CONTINUE
- IF( NOUNIT )
- $ TEMP = TEMP/AP( KK - N + J )
- ELSE
- DO 160, I = N, J + 1, -1
- TEMP = TEMP - CONJG( AP( K ) )*X( I )
- K = K - 1
- 160 CONTINUE
- IF( NOUNIT )
- $ TEMP = TEMP/CONJG( AP( KK - N + J ) )
- END IF
- X( J ) = TEMP
- KK = KK - ( N - J + 1 )
- 170 CONTINUE
- ELSE
- KX = KX + ( N - 1 )*INCX
- JX = KX
- DO 200, J = N, 1, -1
- TEMP = X( JX )
- IX = KX
- IF( NOCONJ )THEN
- DO 180, K = KK, KK - ( N - ( J + 1 ) ), -1
- TEMP = TEMP - AP( K )*X( IX )
- IX = IX - INCX
- 180 CONTINUE
- IF( NOUNIT )
- $ TEMP = TEMP/AP( KK - N + J )
- ELSE
- DO 190, K = KK, KK - ( N - ( J + 1 ) ), -1
- TEMP = TEMP - CONJG( AP( K ) )*X( IX )
- IX = IX - INCX
- 190 CONTINUE
- IF( NOUNIT )
- $ TEMP = TEMP/CONJG( AP( KK - N + J ) )
- END IF
- X( JX ) = TEMP
- JX = JX - INCX
- KK = KK - ( N - J + 1 )
- 200 CONTINUE
- END IF
- END IF
- END IF
- C
- RETURN
- C
- C End of CTPSV .
- C
- END
|