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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
|
---
:name: slasdt
:md5sum: 5376f79e53fc9785b46d6951f8772790
:category: :subroutine
:arguments:
- n:
:type: integer
:intent: input
- lvl:
:type: integer
:intent: output
- nd:
:type: integer
:intent: output
- inode:
:type: integer
:intent: output
:dims:
- MAX(1,n)
- ndiml:
:type: integer
:intent: output
:dims:
- MAX(1,n)
- ndimr:
:type: integer
:intent: output
:dims:
- MAX(1,n)
- msub:
:type: integer
:intent: input
:substitutions: {}
:fortran_help: " SUBROUTINE SLASDT( N, LVL, ND, INODE, NDIML, NDIMR, MSUB )\n\n\
* Purpose\n\
* =======\n\
*\n\
* SLASDT creates a tree of subproblems for bidiagonal divide and\n\
* conquer.\n\
*\n\n\
* Arguments\n\
* =========\n\
*\n\
* N (input) INTEGER\n\
* On entry, the number of diagonal elements of the\n\
* bidiagonal matrix.\n\
*\n\
* LVL (output) INTEGER\n\
* On exit, the number of levels on the computation tree.\n\
*\n\
* ND (output) INTEGER\n\
* On exit, the number of nodes on the tree.\n\
*\n\
* INODE (output) INTEGER array, dimension ( N )\n\
* On exit, centers of subproblems.\n\
*\n\
* NDIML (output) INTEGER array, dimension ( N )\n\
* On exit, row dimensions of left children.\n\
*\n\
* NDIMR (output) INTEGER array, dimension ( N )\n\
* On exit, row dimensions of right children.\n\
*\n\
* MSUB (input) INTEGER\n\
* On entry, the maximum row dimension each subproblem at the\n\
* bottom of the tree can be of.\n\
*\n\n\
* Further Details\n\
* ===============\n\
*\n\
* Based on contributions by\n\
* Ming Gu and Huan Ren, Computer Science Division, University of\n\
* California at Berkeley, USA\n\
*\n\
* =====================================================================\n\
*\n"
|
