1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
|
.TH DLASDT l "15 June 2000" "LAPACK version 3.0" ")"
.SH NAME
DLASDT - create a tree of subproblems for bidiagonal divide and conquer
.SH SYNOPSIS
.TP 19
SUBROUTINE DLASDT(
N, LVL, ND, INODE, NDIML, NDIMR, MSUB )
.TP 19
.ti +4
INTEGER
LVL, MSUB, N, ND
.TP 19
.ti +4
INTEGER
INODE( * ), NDIML( * ), NDIMR( * )
.SH PURPOSE
DLASDT creates a tree of subproblems for bidiagonal divide and conquer.
.SH ARGUMENTS
.TP 7
N (input) INTEGER
On entry, the number of diagonal elements of the
bidiagonal matrix.
.TP 7
LVL (output) INTEGER
On exit, the number of levels on the computation tree.
.TP 7
ND (output) INTEGER
On exit, the number of nodes on the tree.
.TP 7
INODE (output) INTEGER array, dimension ( N )
On exit, centers of subproblems.
.TP 7
NDIML (output) INTEGER array, dimension ( N )
On exit, row dimensions of left children.
.TP 7
NDIMR (output) INTEGER array, dimension ( N )
On exit, row dimensions of right children.
.TP 7
MSUB (input) INTEGER.
On entry, the maximum row dimension each subproblem at the
bottom of the tree can be of.
.SH FURTHER DETAILS
Based on contributions by
.br
Ming Gu and Huan Ren, Computer Science Division, University of
California at Berkeley, USA
.br
|
