1DLASDT(1)           LAPACK auxiliary routine (version 3.1)           DLASDT(1)
2
3
4

NAME

6       DLASDT - a tree of subproblems for bidiagonal divide and conquer
7

SYNOPSIS

9       SUBROUTINE DLASDT( N, LVL, ND, INODE, NDIML, NDIMR, MSUB )
10
11           INTEGER        LVL, MSUB, N, ND
12
13           INTEGER        INODE( * ), NDIML( * ), NDIMR( * )
14

PURPOSE

16       DLASDT creates a tree of subproblems for bidiagonal divide and conquer.
17
18

ARGUMENTS

20       N      (input) INTEGER
21              On  entry,  the  number  of  diagonal elements of the bidiagonal
22              matrix.
23
24       LVL    (output) INTEGER
25              On exit, the number of levels on the computation tree.
26
27       ND     (output) INTEGER
28              On exit, the number of nodes on the tree.
29
30       INODE  (output) INTEGER array, dimension ( N )
31              On exit, centers of subproblems.
32
33       NDIML  (output) INTEGER array, dimension ( N )
34              On exit, row dimensions of left children.
35
36       NDIMR  (output) INTEGER array, dimension ( N )
37              On exit, row dimensions of right children.
38
39       MSUB   (input) INTEGER.
40              On entry, the maximum row dimension each subproblem at the  bot‐
41              tom of the tree can be of.
42

FURTHER DETAILS

44       Based on contributions by
45          Ming Gu and Huan Ren, Computer Science Division, University of
46          California at Berkeley, USA
47
48
49
50
51 LAPACK auxiliary routine (versionNo3v.e1m)ber 2006                       DLASDT(1)