arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1605.04893math.NAcs.NA
收藏

随机矩阵无迹和对数行列式估计器

Randomized Matrix-free Trace and Log-Determinant Estimators

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

Arvind K. Saibaba, Alen Alexanderian, Ilse C. F. Ipsen

AI总结:

本文提出基于子空间迭代的随机算法,用于估计半正定矩阵的迹和行列式,通过矩阵向量乘法访问矩阵,并分析随机化误差,提供非渐近的绝对界和渐近样本数界,通过数值实验验证性能和界限的紧致性。

摘要:

我们提出随机算法用于估计半正定矩阵的迹和行列式。算法基于子空间迭代,仅通过矩阵向量乘法访问矩阵。我们分析了随机化误差,对于初始猜测元素为高斯或拉德玛赫随机变量的情况。分析分为结构性(确定性)部分和概率部分。我们对估计器的期望和集中程度的绝对界是非渐近的,并且即使对于低维矩阵也是有用的。对于迹估计器,我们还给出了渐近界,以确定达到用户指定的相对误差所需的样本数(初始猜测的列数)。数值实验展示了估计器的性能以及低维矩阵上的界限紧致性;并在来自贝叶斯最优实验设计的挑战性不确定性量化应用中进行了验证。

英文摘要:

We present randomized algorithms for estimating the trace and deter- minant of Hermitian positive semi-definite matrices. The algorithms are based on subspace iteration, and access the matrix only through matrix vector products. We analyse the error due to randomization, for starting guesses whose elements are Gaussian or Rademacher random variables. The analysis is cleanly separated into a structural (deterministic) part followed by a probabilistic part. Our absolute bounds for the expectation and concentration of the estimators are non-asymptotic and informative even for matrices of low dimension. For the trace estimators, we also present asymptotic bounds on the number of samples (columns of the starting guess) required to achieve a user-specified relative error. Numerical experiments illustrate the performance of the estimators and the tightness of the bounds on low-dimensional matrices; and on a challenging application in uncertainty quantification arising from Bayesian optimal experimental design.

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

↑