Answers are grounded in this paper and cite their sources.
We introduce a novel nonlinear elimination-based inexact Newton algorithm, NEINA, and its simplified variant, SNEINA, that address problems characterized by localized strong nonlinearities. The algorithms employ a subspace correction mechanism through nonlinear elimination that implicitly updates components that most severely hinder global convergence. This process generates a modified direction for the global Newton iteration. We conduct numerical experiments using five different Jacobian-preserving nonlinearly preconditioned inexact Newton algorithms on challenging benchmark problems, establishing NEINA and SNEINA as valuable complements to the growing family of Jacobian-preserving nonlinearly preconditioned inexact Newton algorithms. Applications include flame sheet combustion, lid-driven cavity flow, and backward-facing step flow. The results demonstrate the effectiveness of NEINA and SNEINA in reducing the number of Newton iterations in cases where existing Jacobian-preserving algorithms either converge slowly or fail to converge at all.
No takes yet. Share an insight, caveat, or question.
Liu et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: