[BACK]Return to dlasdt.f CVS log [TXT] [DIR] Up to [local] / rpl / lapack / lapack

Diff for /rpl/lapack/lapack/dlasdt.f between versions 1.8 and 1.9

version 1.8, 2010/12/21 13:53:33 version 1.9, 2011/11/21 20:42:59
Line 1 Line 1
   *> \brief \b DLASDT
   *
   *  =========== DOCUMENTATION ===========
   *
   * Online html documentation available at 
   *            http://www.netlib.org/lapack/explore-html/ 
   *
   *> \htmlonly
   *> Download DLASDT + dependencies 
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dlasdt.f"> 
   *> [TGZ]</a> 
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dlasdt.f"> 
   *> [ZIP]</a> 
   *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dlasdt.f"> 
   *> [TXT]</a>
   *> \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 November 2011
   *
   *> \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 )        SUBROUTINE DLASDT( N, LVL, ND, INODE, NDIML, NDIMR, MSUB )
 *  *
 *  -- LAPACK auxiliary routine (version 3.2.2) --  *  -- LAPACK auxiliary routine (version 3.4.0) --
 *  -- LAPACK is a software package provided by Univ. of Tennessee,    --  *  -- LAPACK is a software package provided by Univ. of Tennessee,    --
 *  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--  *  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
 *     June 2010  *     November 2011
 *  *
 *     .. Scalar Arguments ..  *     .. Scalar Arguments ..
       INTEGER            LVL, MSUB, N, ND        INTEGER            LVL, MSUB, N, ND
Line 12 Line 117
       INTEGER            INODE( * ), NDIML( * ), NDIMR( * )        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 ..  *     .. Parameters ..
Removed from v.1.8  
changed lines
  Added in v.1.9

CVSweb interface <joel.bertrand@systella.fr>