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

矩阵多项式的低秩逼近计算

Computing Lower Rank Approximations of Matrix Polynomials

Mark Giesbrecht, Joseph Haraldson, George Labahn

摘要:

给定一个系数为浮点数的输入矩阵多项式,考虑求其秩至多为一个指定值的最近矩阵多项式的问题。这推广了问题的发现一个最近的矩阵多项式,是代数奇异的规定的下限上的尺寸在以前的文件中给出的作者。在本文中,我们证明了这样的低秩矩阵在最小距离总是存在的,满足正则性条件,都是孤立的,并包围着一个盆地的吸引力的非最小的解决方案。此外,我们提出了一个迭代算法,在给定的输入足够接近的秩在最多的矩阵,产生该矩阵。该算法是有效的,并被证明是二次收敛给出一个足够好的起点。一个实现证明了我们的算法在实践中的有效性和数值鲁棒性。

英文摘要:

Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified value. This generalizes the problem of finding a nearest matrix polynomial that is algebraically singular with a prescribed lower bound on the dimension given in a previous paper by the authors. In this paper we prove that such lower rank matrices at minimal distance always exist, satisfy regularity conditions, and are all isolated and surrounded by a basin of attraction of non-minimal solutions. In addition, we present an iterative algorithm which, on given input sufficiently close to a rank-at-most matrix, produces that matrix. The algorithm is efficient and is proven to converge quadratically given a sufficiently good starting point. An implementation demonstrates the effectiveness and numerical robustness of our algorithm in practice.

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

↑