LAPACK
3.6.1
LAPACK: Linear Algebra PACKage
|
subroutine dlasdt | ( | integer | N, |
integer | LVL, | ||
integer | ND, | ||
integer, dimension( * ) | INODE, | ||
integer, dimension( * ) | NDIML, | ||
integer, dimension( * ) | NDIMR, | ||
integer | MSUB | ||
) |
DLASDT creates a tree of subproblems for bidiagonal divide and conquer. Used by sbdsdc.
Download DLASDT + dependencies [TGZ] [ZIP] [TXT]
DLASDT creates a tree of subproblems for bidiagonal divide and conquer.
[in] | N | N is INTEGER On entry, the number of diagonal elements of the bidiagonal matrix. |
[out] | LVL | LVL is INTEGER On exit, the number of levels on the computation tree. |
[out] | ND | ND is INTEGER On exit, the number of nodes on the tree. |
[out] | INODE | INODE is INTEGER array, dimension ( N ) On exit, centers of subproblems. |
[out] | NDIML | NDIML is INTEGER array, dimension ( N ) On exit, row dimensions of left children. |
[out] | NDIMR | NDIMR is INTEGER array, dimension ( N ) On exit, row dimensions of right children. |
[in] | MSUB | MSUB is INTEGER On entry, the maximum row dimension each subproblem at the bottom of the tree can be of. |
Definition at line 107 of file dlasdt.f.