并行MMF:矩阵计算的多分辨率方法
Parallel MMF: a Multiresolution Approach to Matrix Computation
AI总结:
本文提出并行MMF算法,用于多尺度结构分析和矩阵压缩,通过实验展示其在稀疏矩阵压缩和预处理中的有效性。
摘要:
多分辨率矩阵分解(MMF)最近被引入为一种寻找多尺度结构并定义图/矩阵上的小波的方法。在本文中,我们推导出pMMF,一种用于计算MMF分解的并行算法。经验上,pMMF的运行时间与稀疏矩阵的维度成线性关系。我们认为这使pMMF成为一种有价值的计算原语,并展示了将其用于两种不同目的的实验:压缩矩阵和预处理大型稀疏线性系统。
英文摘要:
Multiresolution Matrix Factorization (MMF) was recently introduced as a method for finding multiscale structure and defining wavelets on graphs/matrices. In this paper we derive pMMF, a parallel algorithm for computing the MMF factorization. Empirically, the running time of pMMF scales linearly in the dimension for sparse matrices. We argue that this makes pMMF a valuable new computational primitive in its own right, and present experiments on using pMMF for two distinct purposes: compressing matrices and preconditioning large sparse linear systems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。