DLASDT(3)      LAPACK routine of NEC Numeric Library Collection      DLASDT(3)



NAME
       DLASDT

SYNOPSIS
       SUBROUTINE DLASDT (N, LVL, ND, INODE, NDIML, NDIMR, MSUB)



PURPOSE
            DLASDT creates a tree of subproblems for bidiagonal divide and
            conquer.




ARGUMENTS
           N         (input)
                     N is INTEGER
                     On entry, the number of diagonal elements of the
                     bidiagonal matrix.

           LVL       (output)
                     LVL is INTEGER
                     On exit, the number of levels on the computation tree.

           ND        (output)
                     ND is INTEGER
                     On exit, the number of nodes on the tree.

           INODE     (output)
                     INODE is INTEGER array, dimension ( N )
                     On exit, centers of subproblems.

           NDIML     (output)
                     NDIML is INTEGER array, dimension ( N )
                     On exit, row dimensions of left children.

           NDIMR     (output)
                     NDIMR is INTEGER array, dimension ( N )
                     On exit, row dimensions of right children.

           MSUB      (input)
                     MSUB is INTEGER
                     On entry, the maximum row dimension each subproblem at the
                     bottom of the tree can be of.



LAPACK routine                  31 October 2017                      DLASDT(3)