Search arXivSearch

arXiv · 2409.11515

A Comparison of Sparse Solvers for Severely Ill-Conditioned Linear Systems in Geophysical Marker-In-Cell Simulations

Abstract

Solving sparse linear systems is a critical challenge in many scientific and engineering fields, particularly when these systems are severely ill-conditioned. This work aims to provide a comprehensive comparison of various solvers designed for such problems, offering valuable insights and guidance for domain scientists and researchers. We develop the tools required to accurately evaluate the performance and correctness of 16 solvers from 11 state-of-the-art numerical libraries, focusing on their effectiveness in handling ill-conditioned matrices. The solvers were tested on linear systems arising from a coupled hydro-mechanical marker-in-cell geophysical simulation. To address the challenge of computing accurate error bounds on the solution, we introduce the Projected Adam method, a novel algorithm to efficiently compute the condition number of a matrix without relying on eigenvalues or singular values. Our benchmark results demonstrate that Intel oneAPI MKL PARDISO, UMFPACK, and MUMPS are the most reliable solvers for the tested scenarios. This work serves as a resource for selecting appropriate solvers, understanding the impact of condition numbers, and improving the robustness of numerical solutions in practical applications.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marcel Ferrari. 2024-09-23. A Comparison of Sparse Solvers for Severely Ill-Conditioned Linear Systems in Geophysical Marker-In-Cell Simulations. https://arxiv.org/abs/2409.11515

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