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
|
---
:name: clargv
:md5sum: 494d5c7b6b8663202a721836295fac6e
:category: :subroutine
:arguments:
- n:
:type: integer
:intent: input
- x:
:type: complex
:intent: input/output
:dims:
- 1+(n-1)*incx
- incx:
:type: integer
:intent: input
- y:
:type: complex
:intent: input/output
:dims:
- 1+(n-1)*incy
- incy:
:type: integer
:intent: input
- c:
:type: real
:intent: output
:dims:
- 1+(n-1)*incc
- incc:
:type: integer
:intent: input
:substitutions: {}
:fortran_help: " SUBROUTINE CLARGV( N, X, INCX, Y, INCY, C, INCC )\n\n\
* Purpose\n\
* =======\n\
*\n\
* CLARGV generates a vector of complex plane rotations with real\n\
* cosines, determined by elements of the complex vectors x and y.\n\
* For i = 1,2,...,n\n\
*\n\
* ( c(i) s(i) ) ( x(i) ) = ( r(i) )\n\
* ( -conjg(s(i)) c(i) ) ( y(i) ) = ( 0 )\n\
*\n\
* where c(i)**2 + ABS(s(i))**2 = 1\n\
*\n\
* The following conventions are used (these are the same as in CLARTG,\n\
* but differ from the BLAS1 routine CROTG):\n\
* If y(i)=0, then c(i)=1 and s(i)=0.\n\
* If x(i)=0, then c(i)=0 and s(i) is chosen so that r(i) is real.\n\
*\n\n\
* Arguments\n\
* =========\n\
*\n\
* N (input) INTEGER\n\
* The number of plane rotations to be generated.\n\
*\n\
* X (input/output) COMPLEX array, dimension (1+(N-1)*INCX)\n\
* On entry, the vector x.\n\
* On exit, x(i) is overwritten by r(i), for i = 1,...,n.\n\
*\n\
* INCX (input) INTEGER\n\
* The increment between elements of X. INCX > 0.\n\
*\n\
* Y (input/output) COMPLEX array, dimension (1+(N-1)*INCY)\n\
* On entry, the vector y.\n\
* On exit, the sines of the plane rotations.\n\
*\n\
* INCY (input) INTEGER\n\
* The increment between elements of Y. INCY > 0.\n\
*\n\
* C (output) REAL array, dimension (1+(N-1)*INCC)\n\
* The cosines of the plane rotations.\n\
*\n\
* INCC (input) INTEGER\n\
* The increment between elements of C. INCC > 0.\n\
*\n\n\
* Further Details\n\
* ======= =======\n\
*\n\
* 6-6-96 - Modified with a new algorithm by W. Kahan and J. Demmel\n\
*\n\
* This version has a few statements commented out for thread safety\n\
* (machine parameters are computed on each entry). 10 feb 03, SJH.\n\
*\n\
* =====================================================================\n\
*\n"
|
