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
|
---
:name: ssterf
:md5sum: 5ff23162e652c9a2477b1e5c9764dc26
:category: :subroutine
:arguments:
- n:
:type: integer
:intent: input
- d:
:type: real
:intent: input/output
:dims:
- n
- e:
:type: real
:intent: input/output
:dims:
- n-1
- info:
:type: integer
:intent: output
:substitutions: {}
:fortran_help: " SUBROUTINE SSTERF( N, D, E, INFO )\n\n\
* Purpose\n\
* =======\n\
*\n\
* SSTERF computes all eigenvalues of a symmetric tridiagonal matrix\n\
* using the Pal-Walker-Kahan variant of the QL or QR algorithm.\n\
*\n\n\
* Arguments\n\
* =========\n\
*\n\
* N (input) INTEGER\n\
* The order of the matrix. N >= 0.\n\
*\n\
* D (input/output) REAL array, dimension (N)\n\
* On entry, the n diagonal elements of the tridiagonal matrix.\n\
* On exit, if INFO = 0, the eigenvalues in ascending order.\n\
*\n\
* E (input/output) REAL array, dimension (N-1)\n\
* On entry, the (n-1) subdiagonal elements of the tridiagonal\n\
* matrix.\n\
* On exit, E has been destroyed.\n\
*\n\
* INFO (output) INTEGER\n\
* = 0: successful exit\n\
* < 0: if INFO = -i, the i-th argument had an illegal value\n\
* > 0: the algorithm failed to find all of the eigenvalues in\n\
* a total of 30*N iterations; if INFO = i, then i\n\
* elements of E have not converged to zero.\n\
*\n\n\
* =====================================================================\n\
*\n"
|
