\brief \b ESMF_DLASDT \htmlonly Download ESMF_DLASDT + dependencies [TGZ] [ZIP] [TXT] \endhtmlonly \par Purpose:
\verbatim
ESMF_DLASDT creates a tree of subproblems for bidiagonal divide and conquer. \endverbatim \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 \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
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| integer | :: | N | ||||
| integer | :: | LVL | ||||
| integer | :: | ND | ||||
| integer | :: | INODE(*) | ||||
| integer | :: | NDIML(*) | ||||
| integer | :: | NDIMR(*) | ||||
| integer | :: | MSUB |