subroutine dlasdt (N, LVL, ND, INODE, NDIML, NDIMR, MSUB)
DLASDT creates a tree of subproblems for bidiagonal divide and conquer. Used by sbdsdc.
DLASDT creates a tree of subproblems for bidiagonal divide and conquer. Used by sbdsdc.
Purpose:
DLASDT creates a tree of subproblems for bidiagonal divide and conquer.
Parameters:
N is INTEGER On entry, the number of diagonal elements of the bidiagonal matrix.
LVL
LVL is INTEGER On exit, the number of levels on the computation tree.
ND
ND is INTEGER On exit, the number of nodes on the tree.
INODE
INODE is INTEGER array, dimension ( N ) On exit, centers of subproblems.
NDIML
NDIML is INTEGER array, dimension ( N ) On exit, row dimensions of left children.
NDIMR
NDIMR is INTEGER array, dimension ( N ) On exit, row dimensions of right children.
MSUB
MSUB is INTEGER On entry, the maximum row dimension each subproblem at the bottom of the tree can be of.
Author:
Univ. of California Berkeley
Univ. of Colorado Denver
NAG Ltd.
Date:
Contributors:
Definition at line 107 of file dlasdt.f.
Generated automatically by Doxygen for LAPACK from the source code.