| /phasta/svLS/ |
| H A D | SPARMUL.f | 53 INTEGER i, j, l, col, s, e local
66 col = colPtr(j)
67 KU(1,i) = KU(1,i) + K(1,j)*U(1,col) + K(2,j)*U(2,col)
68 KU(2,i) = KU(2,i) + K(3,j)*U(1,col) + K(4,j)*U(2,col)
74 col = colPtr(j)
75 KU(1,i) = KU(1,i) + K(1,j)*U(1,col) + K(2,j)*U(2,col)
76 2 + K(3,j)*U(3,col)
77 KU(2,i) = KU(2,i) + K(4,j)*U(1,col) + K(5,j)*U(2,col)
78 2 + K(6,j)*U(3,col)
79 KU(3,i) = KU(3,i) + K(7,j)*U(1,col) + K(8,j)*U(2,col)
[all …]
|
| /phasta/phSolver/common/ |
| H A D | fillsparse.f | 3 1 row, col) argument
9 integer ien(npro,nshl), col(nshg+1), row(nshg*nnz) local
30 c = col(i) ! starting point to look for the matching column
31 n = col(i+1) - c !length of the list of entries in rowp
69 1 row, col) argument
82 integer ien(npro,nshl), col(nshg+1), row(nnz*nshg) local
106 c = col(i) !Get the mapping from the ith row of lhsk to
108 n = col(i+1) - c !number of nonzero blocks in the row
132 & lhsk, row, col) argument
145 integer ien(npro,nshl), col(nshg+1), row(nnz*nshg) local
[all …]
|
| H A D | fillsparse.c | 16 #define COLMAJ2D(row,col,numrow) (row-1)+(col-1)*numrow argument
18 #define ROWMAJ2D_ONE(row,col,numcol) (row-1)*numcol+(col-1) argument
|
| /phasta/phSolver/incompressible/ |
| H A D | lesSparse.f | 204 subroutine fLesSparseApG( col, row, pLhs, argument
212 integer col(nNodes+1), row(nnz_tot)
232 do k = col(i), col(i+1)-1
252 subroutine fLesSparseApKG( col, row, kLhs, pLhs, argument
262 integer col(nNodes+1), row(nnz_tot)
286 do k = col(i), col(i+1)-1
327 subroutine fLesSparseApNGt( col, row, pLhs, argument
335 integer col(nNodes+1), row(nnz_tot)
346 do k = col(i), col(i+1)-1
368 subroutine fLesSparseApNGtC( col, row, pLhs, argument
[all …]
|
| H A D | filters.f | 1430 subroutine sparseCG (rhsorig, trx, lhsM, row, col, iper, argument
1453 integer row(nshg*nnz), col(nshg+1) local
1512 call fLesSparseApSclr( col, row, lhsM,
|
| /phasta/phSolver/compressible/ |
| H A D | sparseap.f | 1 subroutine SparseAp(iper, ilwork, iBC, col, row, lhsK, p) argument
18 integer col(nshg+1), row(nnz*nshg), local
56 do k = col(i), col(i+1)-1
|
| H A D | spsi3pre.f | 1 subroutine Spsi3pre (BDiag, lhsK, col, row) argument
24 integer col(nshg+1), row(nnz*nshg) local
48 do k = col(i), col(i+1)-1
128 do k = col(i), col(i+1)-1
|
| H A D | solgmr.f | 370 & col, row, lhsk,
410 integer col(nshg+1), row(nnz*nshg)
454 & ilwork, lhsK, col,
495 if(lhs.eq.1) call Spsi3pre (BDiag, lhsK, col, row)
540 call SparseAp (iper,ilwork,iBC, col, row, lhsK, temp)
585 & col, row, lhsK,
|
| H A D | solgmrpetsc.c | 61 int* col, int* row, double* lhsk, in SolGMRp() argument
144 for(j=col[i]-1;j<col[i+1]-1;j++) { in SolGMRp()
408 int* col, int* row, in SolGMRpSclr() argument
493 for(j=col[i]-1;j<col[i+1]-1;j++) { in SolGMRpSclr()
|
| H A D | elmgmr.f | 285 & col, row, rerr) argument
303 integer col(nshg+1), row(nnz*nshg) local
460 1 lhsK, row, col)
526 & lhsk, row, col)
|