Lines 20-26
Link Here
|
20 |
! U is unit upper diagonal triangular, L is lower triangular, |
20 |
! U is unit upper diagonal triangular, L is lower triangular, |
21 |
! piv pivots columns. |
21 |
! piv pivots columns. |
22 |
|
22 |
|
23 |
fortranname clapack_<tchar=s,d,c,z>gesv |
23 |
fortranname <tchar=s,d,c,z>gesv_ |
24 |
integer intent(c,hide) :: <tchar=s,d,c,z>gesv |
24 |
integer intent(c,hide) :: <tchar=s,d,c,z>gesv |
25 |
callstatement <tchar=s,d,c,z>gesv_return_value = info = (*f2py_func)(102-rowmajor,n,nrhs,a,n,piv,b,n) |
25 |
callstatement <tchar=s,d,c,z>gesv_return_value = info = (*f2py_func)(102-rowmajor,n,nrhs,a,n,piv,b,n) |
26 |
callprotoargument const int,const int,const int,<type_in_c>*,const int,int*,<type_in_c>*,const int |
26 |
callprotoargument const int,const int,const int,<type_in_c>*,const int,int*,<type_in_c>*,const int |
Lines 44-50
Link Here
|
44 |
! Compute an LU factorization of a general M-by-N matrix A. |
44 |
! Compute an LU factorization of a general M-by-N matrix A. |
45 |
! A * P = L * U |
45 |
! A * P = L * U |
46 |
threadsafe |
46 |
threadsafe |
47 |
fortranname clapack_<tchar=s,d,c,z>getrf |
47 |
fortranname <tchar=s,d,c,z>getrf_ |
48 |
integer intent(c,hide) :: <tchar=s,d,c,z>getrf |
48 |
integer intent(c,hide) :: <tchar=s,d,c,z>getrf |
49 |
callstatement <tchar=s,d,c,z>getrf_return_value = info = (*f2py_func)(102-rowmajor,m,n,a,(rowmajor?n:m),piv) |
49 |
callstatement <tchar=s,d,c,z>getrf_return_value = info = (*f2py_func)(102-rowmajor,m,n,a,(rowmajor?n:m),piv) |
50 |
callprotoargument const int,const int,const int,<type_in_c>*,const int,int* |
50 |
callprotoargument const int,const int,const int,<type_in_c>*,const int,int* |
Lines 67-73
Link Here
|
67 |
! Solve A^H * X = B if trans=2 |
67 |
! Solve A^H * X = B if trans=2 |
68 |
! A * P = L * U |
68 |
! A * P = L * U |
69 |
|
69 |
|
70 |
fortranname clapack_<tchar=s,d,c,z>getrs |
70 |
fortranname <tchar=s,d,c,z>getrs_ |
71 |
integer intent(c,hide) :: <tchar=s,d,c,z>getrs |
71 |
integer intent(c,hide) :: <tchar=s,d,c,z>getrs |
72 |
callstatement <tchar=s,d,c,z>getrs_return_value = info = (*f2py_func)(102-rowmajor,111+trans,n,nrhs,lu,n,piv,b,n) |
72 |
callstatement <tchar=s,d,c,z>getrs_return_value = info = (*f2py_func)(102-rowmajor,111+trans,n,nrhs,lu,n,piv,b,n) |
73 |
callprotoargument const int,const int,const int,const int,<type_in_c>*,const int,int*,<type_in_c>*,const int |
73 |
callprotoargument const int,const int,const int,const int,<type_in_c>*,const int,int*,<type_in_c>*,const int |
Lines 91-97
Link Here
|
91 |
! Find A inverse A^-1. |
91 |
! Find A inverse A^-1. |
92 |
! A * P = L * U |
92 |
! A * P = L * U |
93 |
|
93 |
|
94 |
fortranname clapack_<tchar=s,d,c,z>getri |
94 |
fortranname <tchar=s,d,c,z>getri_ |
95 |
integer intent(c,hide) :: <tchar=s,d,c,z>getri |
95 |
integer intent(c,hide) :: <tchar=s,d,c,z>getri |
96 |
callstatement <tchar=s,d,c,z>getri_return_value = info = (*f2py_func)(102-rowmajor,n,lu,n,piv) |
96 |
callstatement <tchar=s,d,c,z>getri_return_value = info = (*f2py_func)(102-rowmajor,n,lu,n,piv) |
97 |
callprotoargument const int,const int,<type_in_c>*,const int,const int* |
97 |
callprotoargument const int,const int,<type_in_c>*,const int,const int* |
Lines 115-121
Link Here
|
115 |
! A = L * L^T, C = L if lower = 1 |
115 |
! A = L * L^T, C = L if lower = 1 |
116 |
! C is triangular matrix of the corresponding Cholesky decomposition. |
116 |
! C is triangular matrix of the corresponding Cholesky decomposition. |
117 |
|
117 |
|
118 |
fortranname clapack_<tchar=s,d,c,z>posv |
118 |
fortranname <tchar=s,d,c,z>posv_ |
119 |
integer intent(c,hide) :: <tchar=s,d,c,z>posv |
119 |
integer intent(c,hide) :: <tchar=s,d,c,z>posv |
120 |
callstatement <tchar=s,d,c,z>posv_return_value = info = (*f2py_func)(102-rowmajor,121+lower,n,nrhs,a,n,b,n) |
120 |
callstatement <tchar=s,d,c,z>posv_return_value = info = (*f2py_func)(102-rowmajor,121+lower,n,nrhs,a,n,b,n) |
121 |
callprotoargument const int,const int,const int,const int,<type_in_c>*,const int,<type_in_c>*,const int |
121 |
callprotoargument const int,const int,const int,const int,<type_in_c>*,const int,<type_in_c>*,const int |
Lines 142-148
Link Here
|
142 |
! C is triangular matrix of the corresponding Cholesky decomposition. |
142 |
! C is triangular matrix of the corresponding Cholesky decomposition. |
143 |
! clean==1 zeros strictly lower or upper parts of U or L, respectively |
143 |
! clean==1 zeros strictly lower or upper parts of U or L, respectively |
144 |
|
144 |
|
145 |
fortranname clapack_<tchar=s,d>potrf |
145 |
fortranname <tchar=s,d>potrf_ |
146 |
integer intent(c,hide) :: <tchar=s,d>potrf |
146 |
integer intent(c,hide) :: <tchar=s,d>potrf |
147 |
callstatement <tchar=s,d>potrf_return_value = info = (*f2py_func)(102-rowmajor,121+lower,n,a,n); if(clean){int i,j;if(lower){for(i=0;i<n;++i) for(j=i+1;j<n;++j) *(a+i*n+j)=0.0;} else {for(i=0;i<n;++i) for(j=i+1;j<n;++j) *(a+j*n+i)=0.0;}} |
147 |
callstatement <tchar=s,d>potrf_return_value = info = (*f2py_func)(102-rowmajor,121+lower,n,a,n); if(clean){int i,j;if(lower){for(i=0;i<n;++i) for(j=i+1;j<n;++j) *(a+i*n+j)=0.0;} else {for(i=0;i<n;++i) for(j=i+1;j<n;++j) *(a+j*n+i)=0.0;}} |
148 |
callprotoargument const int,const int,const int,<type_in_c>*,const int |
148 |
callprotoargument const int,const int,const int,<type_in_c>*,const int |
Lines 167-173
Link Here
|
167 |
! C is triangular matrix of the corresponding Cholesky decomposition. |
167 |
! C is triangular matrix of the corresponding Cholesky decomposition. |
168 |
! clean==1 zeros strictly lower or upper parts of U or L, respectively |
168 |
! clean==1 zeros strictly lower or upper parts of U or L, respectively |
169 |
|
169 |
|
170 |
fortranname clapack_<tchar=c,z>potrf |
170 |
fortranname <tchar=c,z>potrf_ |
171 |
integer intent(c,hide) :: <tchar=c,z>potrf |
171 |
integer intent(c,hide) :: <tchar=c,z>potrf |
172 |
callstatement <tchar=c,z>potrf_return_value = info = (*f2py_func)(102-rowmajor,121+lower,n,a,n); if(clean){int i,j,k;if(lower){for(i=0;i<n;++i) for(j=i+1;j<n;++j) {k=i*n+j;(a+k)->r=(a+k)->i=0.0;}} else {for(i=0;i<n;++i) for(j=i+1;j<n;++j) {k=j*n+i;(a+k)->r=(a+k)->i=0.0;}}} |
172 |
callstatement <tchar=c,z>potrf_return_value = info = (*f2py_func)(102-rowmajor,121+lower,n,a,n); if(clean){int i,j,k;if(lower){for(i=0;i<n;++i) for(j=i+1;j<n;++j) {k=i*n+j;(a+k)->r=(a+k)->i=0.0;}} else {for(i=0;i<n;++i) for(j=i+1;j<n;++j) {k=j*n+i;(a+k)->r=(a+k)->i=0.0;}}} |
173 |
callprotoargument const int,const int,const int,<type_in_c>*,const int |
173 |
callprotoargument const int,const int,const int,<type_in_c>*,const int |
Lines 193-199
Link Here
|
193 |
! A = L * L^T, C = L if lower = 1 |
193 |
! A = L * L^T, C = L if lower = 1 |
194 |
! C is triangular matrix of the corresponding Cholesky decomposition. |
194 |
! C is triangular matrix of the corresponding Cholesky decomposition. |
195 |
|
195 |
|
196 |
fortranname clapack_<tchar=s,d,c,z>potrs |
196 |
fortranname <tchar=s,d,c,z>potrs_ |
197 |
integer intent(c,hide) :: <tchar=s,d,c,z>potrs |
197 |
integer intent(c,hide) :: <tchar=s,d,c,z>potrs |
198 |
callstatement <tchar=s,d,c,z>potrs_return_value = info = (*f2py_func)(102-rowmajor,121+lower,n,nrhs,c,n,b,n) |
198 |
callstatement <tchar=s,d,c,z>potrs_return_value = info = (*f2py_func)(102-rowmajor,121+lower,n,nrhs,c,n,b,n) |
199 |
callprotoargument const int,const int,const int,const int,<type_in_c>*,const int,<type_in_c>*,const int |
199 |
callprotoargument const int,const int,const int,const int,<type_in_c>*,const int,<type_in_c>*,const int |
Lines 219-225
Link Here
|
219 |
! A = L * L^T, C = L if lower = 1 |
219 |
! A = L * L^T, C = L if lower = 1 |
220 |
! C is triangular matrix of the corresponding Cholesky decomposition. |
220 |
! C is triangular matrix of the corresponding Cholesky decomposition. |
221 |
|
221 |
|
222 |
fortranname clapack_<tchar=s,d,c,z>potri |
222 |
fortranname <tchar=s,d,c,z>potri_ |
223 |
integer intent(c,hide) :: <tchar=s,d,c,z>potri |
223 |
integer intent(c,hide) :: <tchar=s,d,c,z>potri |
224 |
callstatement <tchar=s,d,c,z>potri_return_value = info = (*f2py_func)(102-rowmajor,121+lower,n,c,n) |
224 |
callstatement <tchar=s,d,c,z>potri_return_value = info = (*f2py_func)(102-rowmajor,121+lower,n,c,n) |
225 |
callprotoargument const int,const int,const int,<type_in_c>*,const int |
225 |
callprotoargument const int,const int,const int,<type_in_c>*,const int |
Lines 243-249
Link Here
|
243 |
! L * L^T, C = L if lower = 1 |
243 |
! L * L^T, C = L if lower = 1 |
244 |
! C is triangular matrix of the corresponding Cholesky decomposition. |
244 |
! C is triangular matrix of the corresponding Cholesky decomposition. |
245 |
|
245 |
|
246 |
fortranname clapack_<tchar=s,d,c,z>lauum |
246 |
fortranname <tchar=s,d,c,z>lauum_ |
247 |
integer intent(c,hide) :: <tchar=s,d,c,z>lauum |
247 |
integer intent(c,hide) :: <tchar=s,d,c,z>lauum |
248 |
callstatement <tchar=s,d,c,z>lauum_return_value = info = (*f2py_func)(102-rowmajor,121+lower,n,c,n) |
248 |
callstatement <tchar=s,d,c,z>lauum_return_value = info = (*f2py_func)(102-rowmajor,121+lower,n,c,n) |
249 |
callprotoargument const int,const int,const int,<type_in_c>*,const int |
249 |
callprotoargument const int,const int,const int,<type_in_c>*,const int |
Lines 267-273
Link Here
|
267 |
! C is non-unit triangular matrix if unitdiag = 0 |
267 |
! C is non-unit triangular matrix if unitdiag = 0 |
268 |
! C is unit triangular matrix if unitdiag = 1 |
268 |
! C is unit triangular matrix if unitdiag = 1 |
269 |
|
269 |
|
270 |
fortranname clapack_<tchar=s,d,c,z>trtri |
270 |
fortranname <tchar=s,d,c,z>trtri_ |
271 |
integer intent(c,hide) :: <tchar=s,d,c,z>trtri |
271 |
integer intent(c,hide) :: <tchar=s,d,c,z>trtri |
272 |
callstatement <tchar=s,d,c,z>trtri_return_value = info = (*f2py_func)(102-rowmajor,121+lower,131+unitdiag,n,c,n) |
272 |
callstatement <tchar=s,d,c,z>trtri_return_value = info = (*f2py_func)(102-rowmajor,121+lower,131+unitdiag,n,c,n) |
273 |
callprotoargument const int,const int,const int,const int,<type_in_c>*,const int |
273 |
callprotoargument const int,const int,const int,const int,<type_in_c>*,const int |