关于最大体积子矩阵和对称半正定及对角占优矩阵的交叉近似
On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices
AI总结:
本文研究了如何通过交叉近似方法在对称半正定及对角占优矩阵中找到最大体积的k×k子矩阵,并分析了贪心方法在体积最大化中的低秩近似误差。
摘要:
寻找矩阵A的k×k子矩阵的最大体积问题在许多应用中具有兴趣。例如,它能产生一个由A的行和列构造的准最佳低秩近似。我们证明,如果A是对称半正定或对角占优矩阵,则这样的子矩阵总可以选为主子矩阵。然后我们分析了用于体积最大化中的贪心方法的低秩近似误差,即具有完全主元的交叉近似。我们对一般矩阵的界扩展了现有结果,适用于对称半正定矩阵,并为对角占优矩阵提供了新的误差估计。特别是,对于双对角占优矩阵,误差被证明仍保持在最佳近似误差的适度因子范围内。我们还说明了将我们的结果应用于函数的交叉近似如何导致新的更好的收敛结果。
英文摘要:
The problem of finding a $k \times k$ submatrix of maximum volume of a matrix $A$ is of interest in a variety of applications. For example, it yields a quasi-best low-rank approximation constructed from the rows and columns of $A$. We show that such a submatrix can always be chosen to be a principal submatrix if $A$ is symmetric semidefinite or diagonally dominant. Then we analyze the low-rank approximation error returned by a greedy method for volume maximization, cross approximation with complete pivoting. Our bound for general matrices extends an existing result for symmetric semidefinite matrices and yields new error estimates for diagonally dominant matrices. In particular, for doubly diagonally dominant matrices the error is shown to remain within a modest factor of the best approximation error. We also illustrate how the application of our results to cross approximation for functions leads to new and better convergence results.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。