Solving groundwater flow problems by conjugate-gradient methods and the strongly implicit procedure
The performance of the preconditioned conjugate-gradient method with three preconditioners is compared with the strongly implicit procedure (SIP) using a scalar computer. The preconditioners considered are the incomplete Cholesky (ICCG) and the modified incomplete Cholesky (MICCG), which require the same computer storage as SIP as programmed for a problem with a symmetric matrix, and a polynomial preconditioner (POLCG), which requires less computer storage than SIP. Although POLCG is usually used on vector computers, it is included here because of its small storage requirements. In this paper, published comparisons of the solvers are evaluated, all four solvers are compared for the first time, and new test cases are presented to provide a more complete basis by which the solvers can be judged for typical groundwater flow problems. Based on nine test cases, the following conclusions are reached: (1) SIP is actually as efficient as ICCG for some of the published, linear, two-dimensional test cases that were reportedly solved much more efficiently by ICCG; (2) SIP is more efficient than other published comparisons would indicate when common convergence criteria are used; and (3) for problems that are three-dimensional, nonlinear, or both, and for which common convergence criteria are used, SIP is often more efficient than ICCG, and is sometimes more efficient than MICCG.
Citation Information
Publication Year | 1990 |
---|---|
Title | Solving groundwater flow problems by conjugate-gradient methods and the strongly implicit procedure |
DOI | 10.1029/WR026i009p01961 |
Authors | Mary C. Hill |
Publication Type | Article |
Publication Subtype | Journal Article |
Series Title | Water Resources Research |
Index ID | 70187667 |
Record Source | USGS Publications Warehouse |
USGS Organization | Office of Ground Water |