Searched refs:CG (Results 1 – 7 of 7) sorted by relevance
| /phasta/svLS/ |
| H A D | LS.f | 64 ls%CG%relTol = 1D-1 67 ls%CG%mItr = 500 82 ls%CG%absTol = 1D-10 94 ls%CG%relTol = relTolIn(2) 98 ls%CG%absTol = absTolIn(2) 102 ls%CG%mItr = maxItrIn(2)
|
| H A D | NSSOLVER.f | 80 ls%CG%callD = 0D0 82 ls%CG%itr = 0 103 2 ls%CG, rowPtr, colPtr, Gt, mG, mL, P(:,i)) 326 IF (ls%CG%suc) i = i + 1 329 2 i, ls%RI%itr, ls%GM%itr, ls%CG%itr, 330 3 NINT((ls%RI%CallD-ls%GM%CallD-ls%CG%CallD)/ls%RI%CallD*1D2), 332 5 NINT(ls%CG%callD/ls%RI%CallD*1D2),
|
| H A D | svLS_STRUCT_c.h | 133 svLS_subLsType CG; member
|
| H A D | svLS_STRUCT.h | 188 TYPE(svLS_subLsType) CG
|
| /phasta/phSolver/AMG/ |
| H A D | amgread.txt | 114 For "smartamg" prototype, we check consecutive 7 norms from CG (stored 117 the first sweep of solves (last iteration of CG and first iteration of 125 possibilities (mode) to do a stand-alone Preconditioned CG by us, which 231 matrices. Everything is similar to plain CG, but smaller in size because 249 do parallel direct solve (or CG! Farzin said so because that destroy
|
| /phasta/phSolver/common/ |
| H A D | input.config | 413 Run AMG As CG-preconditioner: 0 # 0: no-run. 415 … # 2: first try plain CG, if hit plateau, restart CG with AMG. 416 … # 3: first try plain CG, if hit maximum iteration, restart CG with AMG.
|
| /phasta/phSolver/incompressible/ |
| H A D | solfar.f | 202 statsflow(4)=1.0*svLS_ls%CG%itr
|