--- rpl/lapack/lapack/zgglse.f	2010/12/21 13:53:45	1.7
+++ rpl/lapack/lapack/zgglse.f	2011/07/22 07:38:14	1.8
@@ -1,10 +1,10 @@
       SUBROUTINE ZGGLSE( M, N, P, A, LDA, B, LDB, C, D, X, WORK, LWORK,
      $                   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..--
-*     February 2007
+*  -- April 2011                                                      --
 *
 *     .. Scalar Arguments ..
       INTEGER            INFO, LDA, LDB, LWORK, M, N, P
@@ -26,8 +26,8 @@
 *  M-vector, and d is a given P-vector. It is assumed that
 *  P <= N <= M+P, and
 *
-*           rank(B) = P and  rank( ( A ) ) = N.
-*                                ( ( B ) )
+*           rank(B) = P and  rank( (A) ) = N.
+*                                ( (B) )
 *
 *  These conditions ensure that the LSE problem has a unique solution,
 *  which is obtained using a generalized RQ factorization of the
@@ -183,9 +183,9 @@
 *
 *     Compute the GRQ factorization of matrices B and A:
 *
-*            B*Q' = (  0  T12 ) P   Z'*A*Q' = ( R11 R12 ) N-P
-*                     N-P  P                  (  0  R22 ) M+P-N
-*                                               N-P  P
+*            B*Q**H = (  0  T12 ) P   Z**H*A*Q**H = ( R11 R12 ) N-P
+*                        N-P  P                     (  0  R22 ) M+P-N
+*                                                      N-P  P
 *
 *     where T12 and R11 are upper triangular, and Q and Z are
 *     unitary.
@@ -194,7 +194,7 @@
      $             WORK( P+MN+1 ), LWORK-P-MN, INFO )
       LOPT = WORK( P+MN+1 )
 *
-*     Update c = Z'*c = ( c1 ) N-P
+*     Update c = Z**H *c = ( c1 ) N-P
 *                       ( c2 ) M+P-N
 *
       CALL ZUNMQR( 'Left', 'Conjugate Transpose', M, 1, MN, A, LDA,
@@ -255,7 +255,7 @@
          CALL ZAXPY( NR, -CONE, D, 1, C( N-P+1 ), 1 )
       END IF
 *
-*     Backward transformation x = Q'*x
+*     Backward transformation x = Q**H*x
 *
       CALL ZUNMRQ( 'Left', 'Conjugate Transpose', N, 1, P, B, LDB,
      $             WORK( 1 ), X, N, WORK( P+MN+1 ), LWORK-P-MN, INFO )