Skip to content

A domain decomposition online-learning-enhanced nonlinear elimination preconditioner

Jul 2026 · arXiv.org · Vol abs/2607.17723 · 0 citations · 35 references
Computer Science Mathematics

TL;DR

Numerical experiments show that the proposed online-learning-enhanced nonlinear elimination preconditioner produces more reliable and coherent bad subsets, is robust with respect to both NE and learning parameters, and outperforms the baseline NE preconditioner in terms of the convergence.

Abstract

Nonlinearly preconditioned inexact Newton methods form an effective class of solvers for large-scale nonlinear algebraic systems arising from the discretization of partial differential equations. A central challenge in nonlinear elimination (NE) preconditioning is the reliable identification of the slowly converging components to be eliminated. Existing selection strategies often rely on problem-specific physical information or user-tuned thresholds applied directly to the raw nonlinear residual, which may contain irregular oscillatory structures near stagnation regions, making the selected bad subset highly sensitive to threshold parameters. In this work, we propose an online-learning-enhanced NE preconditioner that identifies the bad subset from the dominant structure of the nonlinear residual rather than from the raw residual itself. Residual snapshots are collected online during the stagnation phase of the current Newton solve, and an unsupervised extraction model is trained to capture the principal nonlinear imbalance. We consider both a linear extractor based on principal component analysis and nonlinear extractors based on autoencoder neural networks. Moreover, we integrate the approach into a parallel domain decomposition framework, which trains a local extraction model independently on each subdomain. The learned residual reconstruction is then used to define the bad subset and guide the nonlinear elimination process. Numerical experiments on lid-driven cavity flows at Reynolds numbers up to 10,000 show that the proposed method produces more reliable and coherent bad subsets, is robust with respect to both NE and learning parameters, and outperforms the baseline NE preconditioner in terms of the convergence.

View source

Similar papers

Jul 2026

Learning Adaptive Coarse Spaces Using Transferable Neural Network Models for Linear and Nonlinear Overlapping Domain Decomposition Methods

A two-stage approach is proposed in which regression neural networks are used to predict the adaptive coarse basis functions, while a classification neural network is employed to predict the number of basis functions required to ensure robustness, and particular attention is paid to problem-specific aspects.

A. Klawonn, M. Lanser, Janine Weber-Hamacher · 0 citations
Jul 2026

Adaptive Krylov Methods for Low-Rank Exponential Integrators

KIOPS-TT and RK2EXPINT-TT are developed as extensions of the original KIOPS and RK2EXPINT algorithms, reformulating the scheme of explicit exponential Runge-Kutta integrators for tensors and augmenting the stiffness tensor to compute linear combinations of $\varphi$-functions acting on tensors through a single evaluati...

R. Weigel, Tom-Christian Riemer, Martin Stoll · 0 citations
Jul 2026

Residual-Driven Lifting Identification for Nonlinear-Manifold Reduced-Order Models of Parametrized Linear PDEs

We introduce a residual-driven procedure for training nonlinear-manifold reduced-order models for parametrized linear partial differential equations that, given prescribed latent and lifting spaces, identifies the nonlinear lifting without high-fidelity solution snapshots. The approximation is represented by a low-dime...

Francesco A. B. Silva, J. Ragusa, T. Guo et al. · 0 citations
Preprint Aug 2026

PANDA: A Matrix-Free Differentiable NMPC Solver via Proximal Averaged Quasi-Newton with Adaptive Linesearch Algorithm

PANDA is proposed, a matrix-free solver for differentiable NMPC that achieves much faster forward and backward computation and lower memory overhead than representative differentiable optimization solvers, while maintaining effective imitation learning performance.

Yuan-Kun Chen, Zi-Fei Nie, Xun Gong et al. · 1 citation
Preprint Aug 2026

Adaptive Hybrid Subspace Levenberg Marquardt Algorithm with Adequacy Monitor for Large Scale Least Squares Problems

The Levenberg-Marquardt (LM) algorithm is the most widely used method for solving nonlinear least-squares problems, as it combines the robustness of steepest descent with the fast local convergence of the Gauss-Newton method. However, its computational cost can become prohibitive for large-scale problems because each i...

M. D. Hoang, Timothy J. Lewis · 1 citation · ⚡1
Book Jul 2026

Graph Neural Multilevel Preconditioners for Iterative Solvers

This work proposes a Graph Neural Multilevel Preconditioner (GMP) that adopts an AMG hierarchy as a structural prior and learns smoothing, restriction, and interpolation operators in a unified framework and highlights both the promise and the limitations of enforcing AMG-style multilevel structure in learned preconditi...

Zecheng Zhang, Rui-Peng Li, Yousef Saad · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.