dlasdt()

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]

Purpose:

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

Parameters

[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. !>

Author

Univ. of Tennessee

Univ. of California Berkeley

Univ. of Colorado Denver

NAG Ltd.

Contributors:

Ming Gu and Huan Ren, Computer Science Division, University of California at Berkeley, USA