nlKrylov: A Unified Framework for Nonlinear GCR-type Krylov Subspace Methods

Abstract

In this paper, we introduce a unified framework for nonlinear Krylov subspace methods (\textit{nlKrylov}) to solve systems of nonlinear equations. Building on classical GCR-like/type linear Krylov solvers such as GMRESR, we generalize these approaches to nonlinear problems via nested algorithmic structures. We present rigorous convergence results for problems, relying on relaxed assumptions that avoid the need for exact line searches. The framework is further extended to matrix-valued root finding problems using global nonlinear Krylov approaches. Extensive numerical experiments validate the theoretical insights and demonstrate the robustness and efficiency of our proposed algorithms.