Diff for /rpl/lapack/lapack/zhetrs.f between versions 1.7 and 1.8

version 1.7, 2010/12/21 13:53:47 version 1.8, 2011/07/22 07:38:15
Line 1 Line 1
       SUBROUTINE ZHETRS( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, INFO )        SUBROUTINE ZHETRS( UPLO, N, NRHS, A, LDA, IPIV, B, LDB, INFO )
 *  *
 *  -- LAPACK routine (version 3.2) --  *  -- LAPACK routine (version 3.3.1) --
 *  -- LAPACK is a software package provided by Univ. of Tennessee,    --  *  -- LAPACK is a software package provided by Univ. of Tennessee,    --
 *  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--  *  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
 *     November 2006  *  -- April 2011                                                      --
 *  *
 *     .. Scalar Arguments ..  *     .. Scalar Arguments ..
       CHARACTER          UPLO        CHARACTER          UPLO
Line 108 Line 108
 *  *
       IF( UPPER ) THEN        IF( UPPER ) THEN
 *  *
 *        Solve A*X = B, where A = U*D*U'.  *        Solve A*X = B, where A = U*D*U**H.
 *  *
 *        First solve U*D*X = B, overwriting B with X.  *        First solve U*D*X = B, overwriting B with X.
 *  *
Line 180 Line 180
          GO TO 10           GO TO 10
    30    CONTINUE     30    CONTINUE
 *  *
 *        Next solve U'*X = B, overwriting B with X.  *        Next solve U**H *X = B, overwriting B with X.
 *  *
 *        K is the main loop index, increasing from 1 to N in steps of  *        K is the main loop index, increasing from 1 to N in steps of
 *        1 or 2, depending on the size of the diagonal blocks.  *        1 or 2, depending on the size of the diagonal blocks.
Line 197 Line 197
 *  *
 *           1 x 1 diagonal block  *           1 x 1 diagonal block
 *  *
 *           Multiply by inv(U'(K)), where U(K) is the transformation  *           Multiply by inv(U**H(K)), where U(K) is the transformation
 *           stored in column K of A.  *           stored in column K of A.
 *  *
             IF( K.GT.1 ) THEN              IF( K.GT.1 ) THEN
Line 217 Line 217
 *  *
 *           2 x 2 diagonal block  *           2 x 2 diagonal block
 *  *
 *           Multiply by inv(U'(K+1)), where U(K+1) is the transformation  *           Multiply by inv(U**H(K+1)), where U(K+1) is the transformation
 *           stored in columns K and K+1 of A.  *           stored in columns K and K+1 of A.
 *  *
             IF( K.GT.1 ) THEN              IF( K.GT.1 ) THEN
Line 245 Line 245
 *  *
       ELSE        ELSE
 *  *
 *        Solve A*X = B, where A = L*D*L'.  *        Solve A*X = B, where A = L*D*L**H.
 *  *
 *        First solve L*D*X = B, overwriting B with X.  *        First solve L*D*X = B, overwriting B with X.
 *  *
Line 320 Line 320
          GO TO 60           GO TO 60
    80    CONTINUE     80    CONTINUE
 *  *
 *        Next solve L'*X = B, overwriting B with X.  *        Next solve L**H *X = B, overwriting B with X.
 *  *
 *        K is the main loop index, decreasing from N to 1 in steps of  *        K is the main loop index, decreasing from N to 1 in steps of
 *        1 or 2, depending on the size of the diagonal blocks.  *        1 or 2, depending on the size of the diagonal blocks.
Line 337 Line 337
 *  *
 *           1 x 1 diagonal block  *           1 x 1 diagonal block
 *  *
 *           Multiply by inv(L'(K)), where L(K) is the transformation  *           Multiply by inv(L**H(K)), where L(K) is the transformation
 *           stored in column K of A.  *           stored in column K of A.
 *  *
             IF( K.LT.N ) THEN              IF( K.LT.N ) THEN
Line 358 Line 358
 *  *
 *           2 x 2 diagonal block  *           2 x 2 diagonal block
 *  *
 *           Multiply by inv(L'(K-1)), where L(K-1) is the transformation  *           Multiply by inv(L**H(K-1)), where L(K-1) is the transformation
 *           stored in columns K-1 and K of A.  *           stored in columns K-1 and K of A.
 *  *
             IF( K.LT.N ) THEN              IF( K.LT.N ) THEN

Removed from v.1.7  
changed lines
  Added in v.1.8


CVSweb interface <joel.bertrand@systella.fr>