--- rpl/lapack/lapack/dlasdt.f	2012/08/22 09:48:20	1.11
+++ rpl/lapack/lapack/dlasdt.f	2012/12/14 12:30:25	1.12
@@ -1,4 +1,4 @@
-*> \brief \b DLASDT
+*> \brief \b DLASDT creates a tree of subproblems for bidiagonal divide and conquer. Used by sbdsdc.
 *
 *  =========== DOCUMENTATION ===========
 *
@@ -92,7 +92,7 @@
 *> \author Univ. of Colorado Denver 
 *> \author NAG Ltd. 
 *
-*> \date November 2011
+*> \date September 2012
 *
 *> \ingroup auxOTHERauxiliary
 *
@@ -105,10 +105,10 @@
 *  =====================================================================
       SUBROUTINE DLASDT( N, LVL, ND, INODE, NDIML, NDIMR, MSUB )
 *
-*  -- LAPACK auxiliary routine (version 3.4.0) --
+*  -- LAPACK auxiliary routine (version 3.4.2) --
 *  -- LAPACK is a software package provided by Univ. of Tennessee,    --
 *  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
-*     November 2011
+*     September 2012
 *
 *     .. Scalar Arguments ..
       INTEGER            LVL, MSUB, N, ND