Search arXivSearch

arXiv · 2510.04920

Data-driven linear solver selection and performance tuning for multiphysics simulations in porous media

Abstract

Modeling multiphysics processes in porous media requires preconditioned iterative linear solvers to enable efficient simulations at industry-relevant scales. These solvers are typically composed of sub-algorithms that target individual physical processes. Various options are available for each algorithm, with the corresponding ranges of numerical parameters. The choices of sub-algorithms and their parameters significantly affects simulation performance and robustness. Optimizing these choices for each simulation is challenging due to the vast number of possible combinations. Moreover, optimization relies on performance data from past simulations, which becomes less representative as the simulation setup changes. This paper addresses the problem of automated selection and tuning of preconditioned linear solvers for multiphysics simulations. The proposed solver selection algorithm collects performance data during the run of the target simulation and continuously updates a machine learning model responsible for solver selection, resulting in an adaptively refined selection policy. The algorithm is evaluated on two time-dependent nonlinear model problems: (i) coupled fluid flow and heat transfer in porous media and (ii) thermo-poromechanics in porous media with fractures, governed by frictional contact mechanics. These experiments demonstrate that the algorithm selects efficient and robust solvers with negligible overhead and performs comparably to a reference selection policy that has full access to the performance data of prior simulations. Our results indicate that the proposed approach effectively addresses the challenge of solver selection and tuning, providing particular value to simulation engineers and researchers, especially when expert knowledge on linear solver tuning is not readily available.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yury Zabegaev, Inga Berre, Eirik Keilegavlen. 2025-10-06. Data-driven linear solver selection and performance tuning for multiphysics simulations in porous media. https://doi.org/10.1007/s44207-026-00013-y

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fully spectral scheme for the linear BGK equation on the whole space

In this article, we design a fully spectral method in both space and velocity for a linear inhomogeneous kinetic equation with mass, momentum and energy conservation. We focus on the linear BGK equation with a confinement potential $Φ$, even if the method could be applied to different collision operators. It is based upon the projection on Hermite polynomials in velocity and orthonormal polynomials with respect to the weight $e^{-$Φ$}$ in space. The potential $Φ$ is assumed to be a polynomial. It is, to the author's knowledge, the first scheme which preserves hypocoercive behavior in addition to the conservation laws. These different properties are illustrated numerically on both quadratic and double well potential.

math.NA

Inverse inequalities for kernel-based approximation on bounded domains and Riemannian manifolds

This paper establishes inverse inequalities for kernel-based approximation spaces defined on bounded Lipschitz domains in $\mathbb{R}^d$ and compact Riemannian manifolds. While inverse inequalities are well-studied for polynomial spaces, their extension to kernel-based trial spaces poses significant challenges. For bounded Lipschitz domains, we extend prior Bernstein inequalities, which only apply to a limited range of Sobolev orders, to the full range of lower and upper orders, and derive Nikolskii inequalities that bound $L_\infty$ norms by $L_2$ norms. For compact Riemannian manifolds, we focus on restricted kernels, which are defined as the restriction of positive definite kernels from the ambient Euclidean space to the manifold, and prove their counterparts.

math.NA

Error Estimates for Hyperbolic Scaling Limits of Linear Kinetic Models on Networks

This paper studies linear discrete kinetic models on networks and their asymptotic behavior in the small Knudsen number limit. For coupling conditions at an n-edge junction under a symmetric formulation, we introduce a change of variables that reformulates the system into n independent initial-boundary value problems. The asymptotic expansions are then constructed and rigorously justified by deriving an error estimate based on the energy method.

math.NA