dlasdt.f

Go to the documentation of this file.

*> \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 
*> <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 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.4.2) --
*  -- LAPACK is a software package provided by Univ. of Tennessee,    --
*  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
*     September 2012
*
*     .. Scalar Arguments ..
      INTEGER            lvl, msub, n, nd
*     ..
*     .. Array Arguments ..
      INTEGER            inode( * ), ndiml( * ), ndimr( * )
*     ..
*
*  =====================================================================
*
*     .. Parameters ..
      DOUBLE PRECISION   two
      parameter( two = 2.0d+0 )
*     ..
*     .. Local Scalars ..
      INTEGER            i, il, ir, llst, maxn, ncrnt, nlvl
      DOUBLE PRECISION   temp
*     ..
*     .. Intrinsic Functions ..
      INTRINSIC          dble, int, log, max
*     ..
*     .. Executable Statements ..
*
*     Find the number of levels on the tree.
*
      maxn = max( 1, n )
      temp = log( dble( maxn ) / dble( msub+1 ) ) / log( two )
      lvl = int( temp ) + 1
*
      i = n / 2
      inode( 1 ) = i + 1
      ndiml( 1 ) = i
      ndimr( 1 ) = n - i - 1
      il = 0
      ir = 1
      llst = 1
      DO 20 nlvl = 1, lvl - 1
*
*        Constructing the tree at (NLVL+1)-st level. The number of
*        nodes created on this level is LLST * 2.
*
         DO 10 i = 0, llst - 1
            il = il + 2
            ir = ir + 2
            ncrnt = llst + i
            ndiml( il ) = ndiml( ncrnt ) / 2
            ndimr( il ) = ndiml( ncrnt ) - ndiml( il ) - 1
            inode( il ) = inode( ncrnt ) - ndimr( il ) - 1
            ndiml( ir ) = ndimr( ncrnt ) / 2
            ndimr( ir ) = ndimr( ncrnt ) - ndiml( ir ) - 1
            inode( ir ) = inode( ncrnt ) + ndiml( ir ) + 1
   10    continue
         llst = llst*2
   20 continue
      nd = llst*2 - 1
*
      return
*
*     End of DLASDT
*
      END