File: dlarrj

package info (click to toggle)
ruby-lapack 1.7.2-1
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 29,304 kB
  • ctags: 3,419
  • sloc: ansic: 190,572; ruby: 3,937; makefile: 4
file content (138 lines) | stat: -rw-r--r-- 4,175 bytes parent folder | download | duplicates (5)
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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
--- 
:name: dlarrj
:md5sum: 2a08a838ca5660f3b1cf1b9237f3741e
:category: :subroutine
:arguments: 
- n: 
    :type: integer
    :intent: input
- d: 
    :type: doublereal
    :intent: input
    :dims: 
    - n
- e2: 
    :type: doublereal
    :intent: input
    :dims: 
    - n-1
- ifirst: 
    :type: integer
    :intent: input
- ilast: 
    :type: integer
    :intent: input
- rtol: 
    :type: doublereal
    :intent: input
- offset: 
    :type: integer
    :intent: input
- w: 
    :type: doublereal
    :intent: input/output
    :dims: 
    - n
- werr: 
    :type: doublereal
    :intent: input/output
    :dims: 
    - n
- work: 
    :type: doublereal
    :intent: workspace
    :dims: 
    - 2*n
- iwork: 
    :type: integer
    :intent: workspace
    :dims: 
    - 2*n
- pivmin: 
    :type: doublereal
    :intent: input
- spdiam: 
    :type: doublereal
    :intent: input
- info: 
    :type: integer
    :intent: output
:substitutions: {}

:fortran_help: "      SUBROUTINE DLARRJ( N, D, E2, IFIRST, ILAST, RTOL, OFFSET, W, WERR, WORK, IWORK, PIVMIN, SPDIAM, INFO )\n\n\
  *  Purpose\n\
  *  =======\n\
  *\n\
  *  Given the initial eigenvalue approximations of T, DLARRJ\n\
  *  does  bisection to refine the eigenvalues of T,\n\
  *  W( IFIRST-OFFSET ) through W( ILAST-OFFSET ), to more accuracy. Initial\n\
  *  guesses for these eigenvalues are input in W, the corresponding estimate\n\
  *  of the error in these guesses in WERR. During bisection, intervals\n\
  *  [left, right] are maintained by storing their mid-points and\n\
  *  semi-widths in the arrays W and WERR respectively.\n\
  *\n\n\
  *  Arguments\n\
  *  =========\n\
  *\n\
  *  N       (input) INTEGER\n\
  *          The order of the matrix.\n\
  *\n\
  *  D       (input) DOUBLE PRECISION array, dimension (N)\n\
  *          The N diagonal elements of T.\n\
  *\n\
  *  E2      (input) DOUBLE PRECISION array, dimension (N-1)\n\
  *          The Squares of the (N-1) subdiagonal elements of T.\n\
  *\n\
  *  IFIRST  (input) INTEGER\n\
  *          The index of the first eigenvalue to be computed.\n\
  *\n\
  *  ILAST   (input) INTEGER\n\
  *          The index of the last eigenvalue to be computed.\n\
  *\n\
  *  RTOL    (input) DOUBLE PRECISION\n\
  *          Tolerance for the convergence of the bisection intervals.\n\
  *          An interval [LEFT,RIGHT] has converged if\n\
  *          RIGHT-LEFT.LT.RTOL*MAX(|LEFT|,|RIGHT|).\n\
  *\n\
  *  OFFSET  (input) INTEGER\n\
  *          Offset for the arrays W and WERR, i.e., the IFIRST-OFFSET\n\
  *          through ILAST-OFFSET elements of these arrays are to be used.\n\
  *\n\
  *  W       (input/output) DOUBLE PRECISION array, dimension (N)\n\
  *          On input, W( IFIRST-OFFSET ) through W( ILAST-OFFSET ) are\n\
  *          estimates of the eigenvalues of L D L^T indexed IFIRST through\n\
  *          ILAST.\n\
  *          On output, these estimates are refined.\n\
  *\n\
  *  WERR    (input/output) DOUBLE PRECISION array, dimension (N)\n\
  *          On input, WERR( IFIRST-OFFSET ) through WERR( ILAST-OFFSET ) are\n\
  *          the errors in the estimates of the corresponding elements in W.\n\
  *          On output, these errors are refined.\n\
  *\n\
  *  WORK    (workspace) DOUBLE PRECISION array, dimension (2*N)\n\
  *          Workspace.\n\
  *\n\
  *  IWORK   (workspace) INTEGER array, dimension (2*N)\n\
  *          Workspace.\n\
  *\n\
  *  PIVMIN  (input) DOUBLE PRECISION\n\
  *          The minimum pivot in the Sturm sequence for T.\n\
  *\n\
  *  SPDIAM  (input) DOUBLE PRECISION\n\
  *          The spectral diameter of T.\n\
  *\n\
  *  INFO    (output) INTEGER\n\
  *          Error flag.\n\
  *\n\n\
  *  Further Details\n\
  *  ===============\n\
  *\n\
  *  Based on contributions by\n\
  *     Beresford Parlett, University of California, Berkeley, USA\n\
  *     Jim Demmel, University of California, Berkeley, USA\n\
  *     Inderjit Dhillon, University of Texas, Austin, USA\n\
  *     Osni Marques, LBNL/NERSC, USA\n\
  *     Christof Voemel, University of California, Berkeley, USA\n\
  *\n\
  *  =====================================================================\n\
  *\n"