arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.11208cs.MS
收藏

线性方程组的自适应求解器

An Adaptive Solver for Systems of Linear Equations

Conrad Sanderson, Ryan Curtin

摘要:

求解线性方程组的计算实现通常依赖于基于以列为主格式存储的稠密矩阵的LU分解的一刀切方法。这种求解器通常是在低级LAPACK软件中可用的xGESV函数集的帮助下实现的,目的是通过利用经过良好测试的例程来减少开发时间。然而,这种直接的方法没有考虑各种矩阵属性,可以利用这些属性来减少计算工作量和/或增加数值稳定性。此外,直接使用LAPACK函数对于非专家用户来说可能容易出错,并且导致源代码与原始数学表达式几乎没有相似之处。我们描述了一个自适应求解器,我们已经实现了最新版本的高级别Armadillo C++线性代数库。求解器自动检测给定系统的几个常见属性(带状,三角形,对称正定),然后通过映射到一组与每个属性最匹配的合适LAPACK函数来求解系统。求解器还可以检测条件较差的系统,并通过奇异值分解自动寻求解决方案。我们表明,自适应求解器导致显着的加速,同时也解放了用户使用繁琐的LAPACK函数的直接调用。

英文摘要:

Computational implementations for solving systems of linear equations often rely on a one-size-fits-all approach based on LU decomposition of dense matrices stored in column-major format. Such solvers are typically implemented with the aid of the xGESV set of functions available in the low-level LAPACK software, with the aim of reducing development time by taking advantage of well-tested routines. However, this straightforward approach does not take into account various matrix properties which can be exploited to reduce the computational effort and/or to increase numerical stability. Furthermore, direct use of LAPACK functions can be error-prone for non-expert users and results in source code that has little resemblance to originating mathematical expressions. We describe an adaptive solver that we have implemented inside recent versions of the high-level Armadillo C++ library for linear algebra. The solver automatically detects several common properties of a given system (banded, triangular, symmetric positive definite), followed by solving the system via mapping to a set of suitable LAPACK functions best matched to each property. The solver also detects poorly conditioned systems and automatically seeks a solution via singular value decomposition as a fallback. We show that the adaptive solver leads to notable speedups, while also freeing the user from using direct calls to cumbersome LAPACK functions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑