--- rpl/lapack/lapack/dlasdt.f 2010/08/06 15:28:43 1.3
+++ rpl/lapack/lapack/dlasdt.f 2014/01/27 09:28:23 1.14
@@ -1,9 +1,114 @@
+*> \brief \b DLASDT creates a tree of subproblems for bidiagonal divide and conquer. Used by sbdsdc.
+*
+* =========== DOCUMENTATION ===========
+*
+* Online html documentation available at
+* http://www.netlib.org/lapack/explore-html/
+*
+*> \htmlonly
+*> Download DLASDT + dependencies
+*>
+*> [TGZ]
+*>
+*> [ZIP]
+*>
+*> [TXT]
+*> \endhtmlonly
+*
+* Definition:
+* ===========
+*
+* SUBROUTINE DLASDT( N, LVL, ND, INODE, NDIML, NDIMR, MSUB )
+*
+* .. Scalar Arguments ..
+* INTEGER LVL, MSUB, N, ND
+* ..
+* .. Array Arguments ..
+* INTEGER INODE( * ), NDIML( * ), NDIMR( * )
+* ..
+*
+*
+*> \par Purpose:
+* =============
+*>
+*> \verbatim
+*>
+*> DLASDT creates a tree of subproblems for bidiagonal divide and
+*> conquer.
+*> \endverbatim
+*
+* Arguments:
+* ==========
+*
+*> \param[in] N
+*> \verbatim
+*> N is INTEGER
+*> On entry, the number of diagonal elements of the
+*> bidiagonal matrix.
+*> \endverbatim
+*>
+*> \param[out] LVL
+*> \verbatim
+*> LVL is INTEGER
+*> On exit, the number of levels on the computation tree.
+*> \endverbatim
+*>
+*> \param[out] ND
+*> \verbatim
+*> ND is INTEGER
+*> On exit, the number of nodes on the tree.
+*> \endverbatim
+*>
+*> \param[out] INODE
+*> \verbatim
+*> INODE is INTEGER array, dimension ( N )
+*> On exit, centers of subproblems.
+*> \endverbatim
+*>
+*> \param[out] NDIML
+*> \verbatim
+*> NDIML is INTEGER array, dimension ( N )
+*> On exit, row dimensions of left children.
+*> \endverbatim
+*>
+*> \param[out] NDIMR
+*> \verbatim
+*> NDIMR is INTEGER array, dimension ( N )
+*> On exit, row dimensions of right children.
+*> \endverbatim
+*>
+*> \param[in] MSUB
+*> \verbatim
+*> MSUB is INTEGER
+*> On entry, the maximum row dimension each subproblem at the
+*> bottom of the tree can be of.
+*> \endverbatim
+*
+* Authors:
+* ========
+*
+*> \author Univ. of Tennessee
+*> \author Univ. of California Berkeley
+*> \author Univ. of Colorado Denver
+*> \author NAG Ltd.
+*
+*> \date September 2012
+*
+*> \ingroup auxOTHERauxiliary
+*
+*> \par Contributors:
+* ==================
+*>
+*> Ming Gu and Huan Ren, Computer Science Division, University of
+*> California at Berkeley, USA
+*>
+* =====================================================================
SUBROUTINE DLASDT( N, LVL, ND, INODE, NDIML, NDIMR, MSUB )
*
-* -- LAPACK auxiliary routine (version 3.2) --
+* -- 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 2006
+* September 2012
*
* .. Scalar Arguments ..
INTEGER LVL, MSUB, N, ND
@@ -12,45 +117,6 @@
INTEGER INODE( * ), NDIML( * ), NDIMR( * )
* ..
*
-* Purpose
-* =======
-*
-* DLASDT creates a tree of subproblems for bidiagonal divide and
-* conquer.
-*
-* Arguments
-* =========
-*
-* N (input) INTEGER
-* On entry, the number of diagonal elements of the
-* bidiagonal matrix.
-*
-* LVL (output) INTEGER
-* On exit, the number of levels on the computation tree.
-*
-* ND (output) INTEGER
-* On exit, the number of nodes on the tree.
-*
-* INODE (output) INTEGER array, dimension ( N )
-* On exit, centers of subproblems.
-*
-* NDIML (output) INTEGER array, dimension ( N )
-* On exit, row dimensions of left children.
-*
-* NDIMR (output) INTEGER array, dimension ( N )
-* On exit, row dimensions of right children.
-*
-* MSUB (input) INTEGER.
-* On entry, the maximum row dimension each subproblem at the
-* bottom of the tree can be of.
-*
-* Further Details
-* ===============
-*
-* Based on contributions by
-* Ming Gu and Huan Ren, Computer Science Division, University of
-* California at Berkeley, USA
-*
* =====================================================================
*
* .. Parameters ..