NSPOD: Accelerating the convergence of Krylov-based iterative linear solvers via approximated PODs

The convergence of Krylov-based linear iterative solvers applied to parametric partial differential equations (PDEs) is often highly sensitive to the domain, its discretization, the location/values of the applied Dirichlet/Neumann boundary conditions, body forces and material properties, among others. We have previously introduced hybridization of classical linear iterative solvers with neural operators for specific geometries, but they tend to not perform well on geometries not previously seen during training (Zhang et al., 2024). We partially addressed this challenge by introducing the deep operator network Geo-DeepONet and hybridizing it with Krylov-based iterative linear solvers (Lee et al., 2025a), which, despite learning effectively across arbitrary unstructured meshes without requiring retraining, led to only modest reductions in iterations compared to state-of-the-art preconditioners. In this study we introduce Neural Subspace Proper Orthogonal Decomposition (NSPOD), a multigrid-like deep operator network-based preconditioner, which can reduce the number of iterations needed for convergence in Krylov-based linear iterative solvers on complex curved domains, performing comparably to state-of-the-art algebraic multigrid preconditioners, and substantially improving on other widely used standard preconditioners, such as Jacobi or SOR, in both number of iterations and computational time. We expect that the findings in this study lead to more efficient hybrid preconditioners that complement the convergence properties of current gold-standard preconditioning methods for solid mechanics PDEs in three dimensions. We demonstrate its efficiency via numerical experiments on a linearized version of solid mechanics PDEs applied to unstructured domains obtained from complex CAD geometries. We expect that the findings in this study lead to more efficient hybrid preconditioners that can match, or possibly even surpass, the convergence properties of the current gold-standard preconditioning methods when applied to solid mechanics PDEs.

Authors

Institutions

Publication Details

Journal
Computer Methods in Applied Mechanics and Engineering
Published
2026-10-16
DOI
https://doi.org/10.1016/j.cma.2026.119488
Primary Topic
Model Reduction and Neural Networks
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

NSPOD: Accelerating the convergence of Krylov-based iterative linear solvers via approximated PODs

Jay Pathak, George Em Karniadakis, Francesc Levrero-Florencio, Youngkyu Lee
Computer Methods in Applied Mechanics and Engineering
Model Reduction and Neural Networks
article

NSPOD: Accelerating the convergence of Krylov-based iterative linear solvers via approximated PODs

Jay Pathak, George Em Karniadakis, Francesc Levrero-Florencio, Youngkyu Lee
article en

Abstract

The convergence of Krylov-based linear iterative solvers applied to parametric partial differential equations (PDEs) is often highly sensitive to the domain, its discretization, the location/values of the applied Dirichlet/Neumann boundary conditions, body forces and material properties, among others. We have previously introduced hybridization of classical linear iterative solvers with neural operators for specific geometries, but they tend to not perform well on geometries not previously seen during training (Zhang et al., 2024). We partially addressed this challenge by introducing the deep operator network Geo-DeepONet and hybridizing it with Krylov-based iterative linear solvers (Lee et al., 2025a), which, despite learning effectively across arbitrary unstructured meshes without requiring retraining, led to only modest reductions in iterations compared to state-of-the-art preconditioners. In this study we introduce Neural Subspace Proper Orthogonal Decomposition (NSPOD), a multigrid-like deep operator network-based preconditioner, which can reduce the number of iterations needed for convergence in Krylov-based linear iterative solvers on complex curved domains, performing comparably to state-of-the-art algebraic multigrid preconditioners, and substantially improving on other widely used standard preconditioners, such as Jacobi or SOR, in both number of iterations and computational time. We expect that the findings in this study lead to more efficient hybrid preconditioners that complement the convergence properties of current gold-standard preconditioning methods for solid mechanics PDEs in three dimensions. We demonstrate its efficiency via numerical experiments on a linearized version of solid mechanics PDEs applied to unstructured domains obtained from complex CAD geometries. We expect that the findings in this study lead to more efficient hybrid preconditioners that can match, or possibly even surpass, the convergence properties of the current gold-standard preconditioning methods when applied to solid mechanics PDEs.

Computer Methods in Applied Mechanics and EngineeringVol. 464
Synopsys (Switzerland) (CH), Brown University (US), Kyung Hee University (KR), Synopsys (United States) (US)
Defense Sciences Office, DARPA
Openalex Percentile: Top 13%
Model Reduction and Neural Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.