arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2607.06758math.NAcs.NA
收藏

自适应、无矩阵低秩逼近

Adaptive, Matrix-Free Low-Rank Approximation

North Carolina State University(北卡罗来纳州立大学)

Arnel I. Smith, Elly Do, Chao Chen

AI总结:

研究无矩阵环境下固定容差低秩逼近问题,提出自适应、无矩阵的随机QB算法,通过随机误差指示器、无矩阵秩修剪步骤等,在不同测试矩阵上大概率满足容差并获接近最优的秩。

摘要:

我们研究无矩阵环境下的固定容差低秩逼近,其中矩阵或线性算子\(\mathbf{A}\)只能通过矩阵向量积访问,且其秩必须自适应确定以满足规定的误差容限。我们引入了一族自适应、无矩阵的随机QB算法。一个随机误差指示器直接从随机草图估计残差范数(弗罗贝尼乌斯范数或谱范数),精确到机器精度。一个无矩阵秩修剪步骤将计算块大小与最终秩解耦,从而可以使用大的、对BLAS - 3友好的块而不过高估计秩,并且一个无伴随变体仅使用前向算子返回正交基。在具有不同奇异值衰减的测试矩阵上,所提出的方法在大概率满足规定容差的同时,获得接近截断奇异值分解最优的秩。

英文摘要:

We study fixed-tolerance low-rank approximation in the matrix-free setting, where a matrix or linear operator $\mathbf{A}$ is accessible only through matrix-vector products and its rank must be determined adaptively to meet a prescribed error tolerance. We introduce a family of adaptive, matrix-free randomized QB algorithms. A randomized error indicator estimates the residual norm -- in either the Frobenius or the spectral norm -- directly from a random sketch, remaining accurate down to machine precision. A matrix-free rank-pruning step decouples the computational block size from the final rank, so that large, BLAS-3-friendly blocks can be used without over-estimating the rank, and an adjoint-free variant returns the orthonormal basis using only the forward operator. Across test matrices with diverse singular-value decays, the proposed methods attain ranks close to the truncated-SVD optimum while meeting the prescribed tolerance with high probability.

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

↑