--- rpl/lapack/lapack/ztrsna.f	2010/12/21 13:53:57	1.7
+++ rpl/lapack/lapack/ztrsna.f	2011/07/22 07:38:21	1.8
@@ -2,10 +2,10 @@
      $                   LDVR, S, SEP, MM, M, WORK, LDWORK, RWORK,
      $                   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                                                      --
 *
 *     Modified to call ZLACN2 in place of ZLACON, 10 Feb 03, SJH.
 *
@@ -124,10 +124,10 @@
 *  The reciprocal of the condition number of an eigenvalue lambda is
 *  defined as
 *
-*          S(lambda) = |v'*u| / (norm(u)*norm(v))
+*          S(lambda) = |v**H*u| / (norm(u)*norm(v))
 *
 *  where u and v are the right and left eigenvectors of T corresponding
-*  to lambda; v' denotes the conjugate transpose of v, and norm(u)
+*  to lambda; v**H denotes the conjugate transpose of v, and norm(u)
 *  denotes the Euclidean norm. These reciprocal condition numbers always
 *  lie between zero (very badly conditioned) and one (very well
 *  conditioned). If n = 1, S(lambda) is defined to be 1.
@@ -302,7 +302,7 @@
                WORK( I, I ) = WORK( I, I ) - WORK( 1, 1 )
    20       CONTINUE
 *
-*           Estimate a lower bound for the 1-norm of inv(C'). The 1st
+*           Estimate a lower bound for the 1-norm of inv(C**H). The 1st
 *           and (N+1)th columns of WORK are used to store work vectors.
 *
             SEP( KS ) = ZERO
@@ -315,7 +315,7 @@
             IF( KASE.NE.0 ) THEN
                IF( KASE.EQ.1 ) THEN
 *
-*                 Solve C'*x = scale*b
+*                 Solve C**H*x = scale*b
 *
                   CALL ZLATRS( 'Upper', 'Conjugate transpose',
      $                         'Nonunit', NORMIN, N-1, WORK( 2, 2 ),