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
|
---
:name: cposv
:md5sum: 1485e74677b64f3f220c975c8c0afcb6
:category: :subroutine
:arguments:
- uplo:
:type: char
:intent: input
- n:
:type: integer
:intent: input
- nrhs:
:type: integer
:intent: input
- a:
:type: complex
:intent: input/output
:dims:
- lda
- n
- lda:
:type: integer
:intent: input
- b:
:type: complex
:intent: input/output
:dims:
- ldb
- nrhs
- ldb:
:type: integer
:intent: input
- info:
:type: integer
:intent: output
:substitutions: {}
:fortran_help: " SUBROUTINE CPOSV( UPLO, N, NRHS, A, LDA, B, LDB, INFO )\n\n\
* Purpose\n\
* =======\n\
*\n\
* CPOSV computes the solution to a complex system of linear equations\n\
* A * X = B,\n\
* where A is an N-by-N Hermitian positive definite matrix and X and B\n\
* are N-by-NRHS matrices.\n\
*\n\
* The Cholesky decomposition is used to factor A as\n\
* A = U**H* U, if UPLO = 'U', or\n\
* A = L * L**H, if UPLO = 'L',\n\
* where U is an upper triangular matrix and L is a lower triangular\n\
* matrix. The factored form of A is then used to solve the system of\n\
* equations A * X = B.\n\
*\n\n\
* Arguments\n\
* =========\n\
*\n\
* UPLO (input) CHARACTER*1\n\
* = 'U': Upper triangle of A is stored;\n\
* = 'L': Lower triangle of A is stored.\n\
*\n\
* N (input) INTEGER\n\
* The number of linear equations, i.e., the order of the\n\
* 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\
* A (input/output) COMPLEX array, dimension (LDA,N)\n\
* On entry, the Hermitian matrix A. If UPLO = 'U', the leading\n\
* N-by-N upper triangular part of A contains the upper\n\
* triangular part of the matrix A, and the strictly lower\n\
* triangular part of A is not referenced. If UPLO = 'L', the\n\
* leading N-by-N lower triangular part of A contains the lower\n\
* triangular part of the matrix A, and the strictly upper\n\
* triangular part of A is not referenced.\n\
*\n\
* On exit, if INFO = 0, the factor U or L from the Cholesky\n\
* factorization A = U**H*U or A = L*L**H.\n\
*\n\
* LDA (input) INTEGER\n\
* The leading dimension of the array A. LDA >= max(1,N).\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 of A is not\n\
* positive definite, so the factorization could not be\n\
* completed, and the solution has not been computed.\n\
*\n\n\
* =====================================================================\n\
*\n\
* .. External Functions ..\n LOGICAL LSAME\n EXTERNAL LSAME\n\
* ..\n\
* .. External Subroutines ..\n EXTERNAL CPOTRF, CPOTRS, XERBLA\n\
* ..\n\
* .. Intrinsic Functions ..\n INTRINSIC MAX\n\
* ..\n"
|
