File: cptsv

package info (click to toggle)
ruby-lapack 1.8.1-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye, buster
  • size: 28,552 kB
  • sloc: ansic: 191,612; ruby: 3,934; makefile: 8
file content (89 lines) | stat: -rwxr-xr-x 2,989 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
--- 
:name: cptsv
:md5sum: 51cb8a965fde05d2a1884508d277624f
:category: :subroutine
:arguments: 
- n: 
    :type: integer
    :intent: input
- nrhs: 
    :type: integer
    :intent: input
- d: 
    :type: real
    :intent: input/output
    :dims: 
    - n
- e: 
    :type: complex
    :intent: input/output
    :dims: 
    - n-1
- b: 
    :type: complex
    :intent: input/output
    :dims: 
    - ldb
    - nrhs
- ldb: 
    :type: integer
    :intent: input
- info: 
    :type: integer
    :intent: output
:substitutions: {}

:fortran_help: "      SUBROUTINE CPTSV( N, NRHS, D, E, B, LDB, INFO )\n\n\
  *  Purpose\n\
  *  =======\n\
  *\n\
  *  CPTSV computes the solution to a complex system of linear equations\n\
  *  A*X = B, where A is an N-by-N Hermitian positive definite tridiagonal\n\
  *  matrix, and X and B are N-by-NRHS matrices.\n\
  *\n\
  *  A is factored as A = L*D*L**H, and the factored form of A is then\n\
  *  used to solve the system of equations.\n\
  *\n\n\
  *  Arguments\n\
  *  =========\n\
  *\n\
  *  N       (input) INTEGER\n\
  *          The order of the matrix A.  N >= 0.\n\
  *\n\
  *  NRHS    (input) INTEGER\n\
  *          The number of right hand sides, i.e., the number of columns\n\
  *          of the matrix B.  NRHS >= 0.\n\
  *\n\
  *  D       (input/output) REAL array, dimension (N)\n\
  *          On entry, the n diagonal elements of the tridiagonal matrix\n\
  *          A.  On exit, the n diagonal elements of the diagonal matrix\n\
  *          D from the factorization A = L*D*L**H.\n\
  *\n\
  *  E       (input/output) COMPLEX array, dimension (N-1)\n\
  *          On entry, the (n-1) subdiagonal elements of the tridiagonal\n\
  *          matrix A.  On exit, the (n-1) subdiagonal elements of the\n\
  *          unit bidiagonal factor L from the L*D*L**H factorization of\n\
  *          A.  E can also be regarded as the superdiagonal of the unit\n\
  *          bidiagonal factor U from the U**H*D*U factorization of A.\n\
  *\n\
  *  B       (input/output) COMPLEX array, dimension (LDB,NRHS)\n\
  *          On entry, the N-by-NRHS right hand side matrix B.\n\
  *          On exit, if INFO = 0, the N-by-NRHS solution matrix X.\n\
  *\n\
  *  LDB     (input) INTEGER\n\
  *          The leading dimension of the array B.  LDB >= max(1,N).\n\
  *\n\
  *  INFO    (output) INTEGER\n\
  *          = 0:  successful exit\n\
  *          < 0:  if INFO = -i, the i-th argument had an illegal value\n\
  *          > 0:  if INFO = i, the leading minor of order i is not\n\
  *                positive definite, and the solution has not been\n\
  *                computed.  The factorization has not been completed\n\
  *                unless i = N.\n\
  *\n\n\
  *  =====================================================================\n\
  *\n\
  *     .. External Subroutines ..\n      EXTERNAL           CPTTRF, CPTTRS, XERBLA\n\
  *     ..\n\
  *     .. Intrinsic Functions ..\n      INTRINSIC          MAX\n\
  *     ..\n"