NALGNov 11, 2025

A Neural-Operator Preconditioned Newton Method for Accelerated Nonlinear Solvers

arXiv:2511.08811v13 citationsh-index: 13
Originality Incremental advance
AI Analysis

This work addresses a specific bottleneck in nonlinear solvers for applications with strong nonlinearities, representing an incremental improvement over traditional methods.

The paper tackles the problem of stagnation or instability in Newton iterations for solving parametric nonlinear systems by proposing a neural preconditioned Newton method that uses a fixed-point neural operator to learn direct mappings and adaptively employs negative step sizes, demonstrating computational efficiency and robustness in numerical experiments, especially for very strong nonlinearities.

We propose a novel neural preconditioned Newton (NP-Newton) method for solving parametric nonlinear systems of equations. To overcome the stagnation or instability of Newton iterations caused by unbalanced nonlinearities, we introduce a fixed-point neural operator (FPNO) that learns the direct mapping from the current iterate to the solution by emulating fixed-point iterations. Unlike traditional line-search or trust-region algorithms, the proposed FPNO adaptively employs negative step sizes to effectively mitigate the effects of unbalanced nonlinearities. Through numerical experiments we demonstrate the computational efficiency and robustness of the proposed NP-Newton method across multiple real-world applications, especially for very strong nonlinearities.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes