File: clartg

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 (66 lines) | stat: -rw-r--r-- 1,815 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
--- 
:name: clartg
:md5sum: aa8c43ad25ac528306b6dc6dd6d172f6
:category: :subroutine
:arguments: 
- f: 
    :type: complex
    :intent: input
- g: 
    :type: complex
    :intent: input
- cs: 
    :type: real
    :intent: output
- sn: 
    :type: complex
    :intent: output
- r: 
    :type: complex
    :intent: output
:substitutions: {}

:fortran_help: "      SUBROUTINE CLARTG( F, G, CS, SN, R )\n\n\
  *  Purpose\n\
  *  =======\n\
  *\n\
  *  CLARTG generates a plane rotation so that\n\
  *\n\
  *     [  CS  SN  ]     [ F ]     [ R ]\n\
  *     [  __      ]  .  [   ]  =  [   ]   where CS**2 + |SN|**2 = 1.\n\
  *     [ -SN  CS  ]     [ G ]     [ 0 ]\n\
  *\n\
  *  This is a faster version of the BLAS1 routine CROTG, except for\n\
  *  the following differences:\n\
  *     F and G are unchanged on return.\n\
  *     If G=0, then CS=1 and SN=0.\n\
  *     If F=0, then CS=0 and SN is chosen so that R is real.\n\
  *\n\n\
  *  Arguments\n\
  *  =========\n\
  *\n\
  *  F       (input) COMPLEX\n\
  *          The first component of vector to be rotated.\n\
  *\n\
  *  G       (input) COMPLEX\n\
  *          The second component of vector to be rotated.\n\
  *\n\
  *  CS      (output) REAL\n\
  *          The cosine of the rotation.\n\
  *\n\
  *  SN      (output) COMPLEX\n\
  *          The sine of the rotation.\n\
  *\n\
  *  R       (output) COMPLEX\n\
  *          The nonzero component of the rotated vector.\n\
  *\n\n\
  *  Further Details\n\
  *  ======= =======\n\
  *\n\
  *  3-5-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"