.TH "dlasdt.f" 3 "Wed Oct 15 2014" "Version 3.4.2" "LAPACK" \" -*- nroff -*- .ad l .nh .SH NAME dlasdt.f \- .SH SYNOPSIS .br .PP .SS "Functions/Subroutines" .in +1c .ti -1c .RI "subroutine \fBdlasdt\fP (N, LVL, ND, INODE, NDIML, NDIMR, MSUB)" .br .RI "\fI\fBDLASDT\fP creates a tree of subproblems for bidiagonal divide and conquer\&. Used by sbdsdc\&. \fP" .in -1c .SH "Function/Subroutine Documentation" .PP .SS "subroutine dlasdt (integerN, integerLVL, integerND, integer, dimension( * )INODE, integer, dimension( * )NDIML, integer, dimension( * )NDIMR, integerMSUB)" .PP \fBDLASDT\fP creates a tree of subproblems for bidiagonal divide and conquer\&. Used by sbdsdc\&. .PP \fBPurpose: \fP .RS 4 .PP .nf DLASDT creates a tree of subproblems for bidiagonal divide and conquer. .fi .PP .RE .PP \fBParameters:\fP .RS 4 \fIN\fP .PP .nf N is INTEGER On entry, the number of diagonal elements of the bidiagonal matrix. .fi .PP .br \fILVL\fP .PP .nf LVL is INTEGER On exit, the number of levels on the computation tree. .fi .PP .br \fIND\fP .PP .nf ND is INTEGER On exit, the number of nodes on the tree. .fi .PP .br \fIINODE\fP .PP .nf INODE is INTEGER array, dimension ( N ) On exit, centers of subproblems. .fi .PP .br \fINDIML\fP .PP .nf NDIML is INTEGER array, dimension ( N ) On exit, row dimensions of left children. .fi .PP .br \fINDIMR\fP .PP .nf NDIMR is INTEGER array, dimension ( N ) On exit, row dimensions of right children. .fi .PP .br \fIMSUB\fP .PP .nf MSUB is INTEGER On entry, the maximum row dimension each subproblem at the bottom of the tree can be of. .fi .PP .RE .PP \fBAuthor:\fP .RS 4 Univ\&. of Tennessee .PP Univ\&. of California Berkeley .PP Univ\&. of Colorado Denver .PP NAG Ltd\&. .RE .PP \fBDate:\fP .RS 4 September 2012 .RE .PP \fBContributors: \fP .RS 4 Ming Gu and Huan Ren, Computer Science Division, University of California at Berkeley, USA .RE .PP .PP Definition at line 106 of file dlasdt\&.f\&. .SH "Author" .PP Generated automatically by Doxygen for LAPACK from the source code\&.