Probabilistic Perturbation Bounds of Matrix Decompositions
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS(2024)
摘要
In this article, we determine probabilistic approximations of the entries of random perturbation matrices implementing the Markoff inequality. These approximations are used to derive with prescribed probability asymptotic componentwise perturbation bounds of some orthogonal and unitary matrix decompositions. We show that the probabilistic asymptotic bounds are significantly less conservative than the corresponding deterministic perturbation bounds. As case studies, we consider the determining of probabilistic perturbation bounds of the QR decomposition, the singular value decomposition and the Schur decomposition of a matrix using an unified method for asymptotic componentwise perturbation analysis of these decompositions. It is demonstrated that the probability bounds of the orthogonal transformations, singular values and eigenvalues are much tighter than the corresponding deterministic asymptotic bounds. The probabilistic bounds derived are appropriate for perturbation analysis of large-order matrix problems.
更多查看译文
关键词
Markoff inequality,perturbation analysis,probabilistic bounds,QR decomposition,Schur decomposition,singular value decomposition
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要