--- rpl/lapack/lapack/zhptrs.f	2010/12/21 13:53:47	1.7
+++ rpl/lapack/lapack/zhptrs.f	2011/07/22 07:38:16	1.8
@@ -1,9 +1,9 @@
       SUBROUTINE ZHPTRS( UPLO, N, NRHS, AP, 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,    --
 *  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
-*     November 2006
+*  -- April 2011                                                      --
 *
 *     .. Scalar Arguments ..
       CHARACTER          UPLO
@@ -104,7 +104,7 @@
 *
       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.
 *
@@ -179,7 +179,7 @@
          GO TO 10
    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
 *        1 or 2, depending on the size of the diagonal blocks.
@@ -197,7 +197,7 @@
 *
 *           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.
 *
             IF( K.GT.1 ) THEN
@@ -218,7 +218,7 @@
 *
 *           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.
 *
             IF( K.GT.1 ) THEN
@@ -247,7 +247,7 @@
 *
       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.
 *
@@ -325,7 +325,7 @@
          GO TO 60
    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
 *        1 or 2, depending on the size of the diagonal blocks.
@@ -344,7 +344,7 @@
 *
 *           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.
 *
             IF( K.LT.N ) THEN
@@ -365,7 +365,7 @@
 *
 *           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.
 *
             IF( K.LT.N ) THEN