arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1605.09148math.NAcs.NAmath.OC
收藏

稀疏矩阵分解用于快速线性求解器:应用于拉普拉斯系统

Sparse matrix factorizations for fast linear solvers with application to Laplacian systems

Université catholique de Louvain(天主教鲁汶大学);Université de Namur(纳穆尔大学);Massachusetts Institute of Technology(麻省理工学院)

Michael T. Schaub, Maguy Trefois, Paul Van Dooren, Jean-Charles Delvenne

AI总结:

本文提出了一种在稀疏搜索方向和非稀疏搜索方向之间进行插值的方法,通过新的稀疏分解技术实现高效的线性系统求解,并应用于拉普拉斯系统的近线性时间求解。

摘要:

在求解线性系统时,通常需要在稀疏搜索方向(如坐标下降)的廉价但低效迭代和非稀疏搜索方向(如共轭梯度)的昂贵但高效迭代之间做出抉择。本文提出了一种在两者之间进行插值的方法,展示了如何通过新的稀疏分解技术实现非稀疏搜索方向的廉价迭代。例如,如果搜索方向是分层矩阵的列,则每次迭代的成本通常与变量数量呈对数关系。利用图论中关于低伸展生成树的一些结果,我们得出了一种近线性时间算法,用于近似线性系统$Bx= b$的最小范数解,其中$B$是图的关联矩阵。因此,我们的结果可以连接到最近提出的近线性时间求解拉普拉斯系统的算法,这些算法在这里作为我们稀疏矩阵分解的特定应用出现。

英文摘要:

In solving a linear system with iterative methods, one is usually confronted with the dilemma of having to choose between cheap, inefficient iterates over sparse search directions (e.g., coordinate descent), or expensive iterates in well-chosen search directions (e.g., conjugate gradients). In this paper, we propose to interpolate between these two extremes, and show how to perform cheap iterations along non-sparse search directions, provided that these directions can be extracted from a new kind of sparse factorization. For example, if the search directions are the columns of a hierarchical matrix, then the cost of each iteration is typically logarithmic in the number of variables. Using some graph-theoretical results on low-stretch spanning trees, we deduce as a special case a nearly-linear time algorithm to approximate the minimal norm solution of a linear system $Bx= b$ where $B$ is the incidence matrix of a graph. We thereby can connect our results to recently proposed nearly-linear time solvers for Laplacian systems, which emerge here as a particular application of our sparse matrix factorization.

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

↑