Journal of Computational Physics
Testing Line Search Techniques for Finite Element Discretizations for Unsaturated Flow
ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
Towards a scalable fully-implicit fully-coupled resistive MHD formulation with stabilized FE methods
Journal of Computational Physics
A Simplified and Flexible Variant of GCROT for Solving Nonsymmetric Linear Systems
SIAM Journal on Scientific Computing
Nonsymmetric Preconditioner Updates in Newton-Krylov Methods for Nonlinear Systems
SIAM Journal on Scientific Computing
A parallel space-time finite difference solver for periodic solutions of the shallow-water equation
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part II
Matrix-free continuation of limit cycles for bifurcation analysis of large thermoacoustic systems
Journal of Computational Physics
Space pruning monotonic search for the non-unique probe selection problem
International Journal of Bioinformatics Research and Applications
Hi-index | 0.01 |
A Newton-Krylov method is an implementation of Newton’s method in which a Krylov subspace method is used to solve approximately the linear subproblems that determine Newton steps. To enhance robustness when good initial approximate solutions are not available, these methods are usually globalized, i.e., augmented with auxiliary procedures (globalizations) that improve the likelihood of convergence from a starting point that is not near a solution. In recent years, globalized Newton-Krylov methods have been used increasingly for the fully coupled solution of large-scale problems. In this paper, we review several representative globalizations, discuss their properties, and report on a numerical study aimed at evaluating their relative merits on large-scale two- and three-dimensional problems involving the steady-state Navier-Stokes equations.