GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems
SIAM Journal on Scientific and Statistical Computing
A flexible inner-outer preconditioned GMRES algorithm
SIAM Journal on Scientific Computing
Choosing the forcing terms in an inexact Newton method
SIAM Journal on Scientific Computing - Special issue on iterative methods in numerical linear algebra; selected papers from the Colorado conference
Matrix Renumbering ILU: An Effective Algebraic Multilevel ILU Preconditioner for Sparse Matrices
SIAM Journal on Matrix Analysis and Applications
A Multigrid Preconditioned Newton--Krylov Method
SIAM Journal on Scientific Computing
Incremental remapping as a transport&slash;advection algorithm
Journal of Computational Physics
On backtracking failure in newton-GMRES methods with a demonstration for the navier-stokes equations
Journal of Computational Physics
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
An overview of the Trilinos project
ACM Transactions on Mathematical Software (TOMS) - Special issue on the Advanced CompuTational Software (ACTS) Collection
Journal of Computational Physics
A modern solver interface to manage solution algorithms in the Community Earth System Model
International Journal of High Performance Computing Applications
Adaptive mesh, finite volume modeling of marine ice sheets
Journal of Computational Physics
Hi-index | 31.45 |
We have implemented the Jacobian-free Newton-Krylov (JFNK) method for solving the first-order ice sheet momentum equation in order to improve the numerical performance of the Glimmer-Community Ice Sheet Model (Glimmer-CISM), the land ice component of the Community Earth System Model (CESM). Our JFNK implementation is based on significant re-use of existing code. For example, our physics-based preconditioner uses the original Picard linear solver in Glimmer-CISM. For several test cases spanning a range of geometries and boundary conditions, our JFNK implementation is 1.8-3.6 times more efficient than the standard Picard solver in Glimmer-CISM. Importantly, this computational gain of JFNK over the Picard solver increases when refining the grid. Global convergence of the JFNK solver has been significantly improved by rescaling the equation for the basal boundary condition and through the use of an inexact Newton method. While a diverse set of test cases show that our JFNK implementation is usually robust, for some problems it may fail to converge with increasing resolution (as does the Picard solver). Globalization through parameter continuation did not remedy this problem and future work to improve robustness will explore a combination of Picard and JFNK and the use of homotopy methods.