--- rpl/lapack/lapack/zgelsy.f	2010/12/21 13:53:43	1.7
+++ rpl/lapack/lapack/zgelsy.f	2011/07/22 07:38:14	1.8
@@ -1,10 +1,10 @@
       SUBROUTINE ZGELSY( M, N, NRHS, A, LDA, B, LDB, JPVT, RCOND, RANK,
      $                   WORK, LWORK, RWORK, INFO )
 *
-*  -- LAPACK driver routine (version 3.2) --
+*  -- LAPACK driver 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 ..
       INTEGER            INFO, LDA, LDB, LWORK, M, N, NRHS, RANK
@@ -43,8 +43,8 @@
 *     A * P = Q * [ T11 0 ] * Z
 *                 [  0  0 ]
 *  The minimum-norm solution is then
-*     X = P * Z' [ inv(T11)*Q1'*B ]
-*                [        0       ]
+*     X = P * Z**H [ inv(T11)*Q1**H*B ]
+*                  [        0         ]
 *  where Q1 consists of the first RANK columns of Q.
 *
 *  This routine is basically identical to the original xGELSX except
@@ -319,7 +319,7 @@
 *     complex workspace: 2*MN.
 *     Details of Householder rotations stored in WORK(MN+1:2*MN)
 *
-*     B(1:M,1:NRHS) := Q' * B(1:M,1:NRHS)
+*     B(1:M,1:NRHS) := Q**H * B(1:M,1:NRHS)
 *
       CALL ZUNMQR( 'Left', 'Conjugate transpose', M, NRHS, MN, A, LDA,
      $             WORK( 1 ), B, LDB, WORK( 2*MN+1 ), LWORK-2*MN, INFO )
@@ -338,7 +338,7 @@
    30    CONTINUE
    40 CONTINUE
 *
-*     B(1:N,1:NRHS) := Y' * B(1:N,1:NRHS)
+*     B(1:N,1:NRHS) := Y**H * B(1:N,1:NRHS)
 *
       IF( RANK.LT.N ) THEN
          CALL ZUNMRZ( 'Left', 'Conjugate transpose', N, NRHS, RANK,