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

Marcel Ferrari
{"title":"A Comparison of Sparse Solvers for Severely Ill-Conditioned Linear Systems in Geophysical Marker-In-Cell Simulations","authors":"Marcel Ferrari","doi":"arxiv-2409.11515","DOIUrl":null,"url":null,"abstract":"Solving sparse linear systems is a critical challenge in many scientific and\nengineering fields, particularly when these systems are severely\nill-conditioned. This work aims to provide a comprehensive comparison of\nvarious solvers designed for such problems, offering valuable insights and\nguidance for domain scientists and researchers. We develop the tools required\nto accurately evaluate the performance and correctness of 16 solvers from 11\nstate-of-the-art numerical libraries, focusing on their effectiveness in\nhandling ill-conditioned matrices. The solvers were tested on linear systems\narising from a coupled hydro-mechanical marker-in-cell geophysical simulation.\nTo address the challenge of computing accurate error bounds on the solution, we\nintroduce the Projected Adam method, a novel algorithm to efficiently compute\nthe condition number of a matrix without relying on eigenvalues or singular\nvalues. Our benchmark results demonstrate that Intel oneAPI MKL PARDISO,\nUMFPACK, and MUMPS are the most reliable solvers for the tested scenarios. This\nwork serves as a resource for selecting appropriate solvers, understanding the\nimpact of condition numbers, and improving the robustness of numerical\nsolutions in practical applications.","PeriodicalId":501162,"journal":{"name":"arXiv - MATH - Numerical Analysis","volume":"55 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Numerical Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.11515","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

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.
地球物理标记单元内模拟中严重条件不良线性系统的稀疏求解器比较
稀疏线性系统的求解是许多科学和工程领域的重要挑战,尤其是当这些系统的条件严重不足时。这项工作旨在全面比较针对此类问题设计的各种求解器,为领域科学家和研究人员提供有价值的见解和指导。我们开发了必要的工具,以准确评估来自 11 个最先进数值库的 16 个求解器的性能和正确性,重点关注它们处理非条件矩阵的有效性。为了解决计算解的精确误差边界这一难题,我们引入了亚当投影法(Projected Adam method),这是一种无需依赖特征值或奇异值即可高效计算矩阵条件数的新型算法。我们的基准测试结果表明,对于测试场景,英特尔一API MKL PARDISO、UMFPACK 和 MUMPS 是最可靠的求解器。这项工作可作为选择适当求解器、了解条件数的影响以及提高实际应用中数值求解稳健性的资源。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信