非平凡Smith型的近似计算
Computing Nearby Non-trivial Smith Forms
摘要:
考虑了具有非平凡Smith范式的最近矩阵多项式的计算问题。我们表明,计算史密斯形式的矩阵多项式是服从数值计算作为一个优化问题。此外,我们描述了一种有效的优化技术,找到一个附近的矩阵多项式与非平凡的史密斯形式。然后将结果推广到包括具有Smith形式中的最大指定数目的矩阵多项式的计算(即,具有最大指定McCoy秩)。我们讨论的几何形状和存在的解决方案,以及如何我们的结果可以用于误差分析。我们开发了一种基于优化的方法,并展示了一种迭代数值方法,用于计算附近的矩阵多项式所需的光谱特性。我们还描述了我们的算法的实现,并证明了在Maple的例子的鲁棒性。
英文摘要:
We consider the problem of computing the nearest matrix polynomial with a non-trivial Smith Normal Form. We show that computing the Smith form of a matrix polynomial is amenable to numeric computation as an optimization problem. Furthermore, we describe an effective optimization technique to find a nearby matrix polynomial with a non-trivial Smith form. The results are then generalized to include the computation of a matrix polynomial having a maximum specified number of ones in the Smith Form (i.e., with a maximum specified McCoy rank). We discuss the geometry and existence of solutions and how our results can be used for an error analysis. We develop an optimization-based approach and demonstrate an iterative numerical method for computing a nearby matrix polynomial with the desired spectral properties. We also describe an implementation of our algorithms and demonstrate the robustness with examples in Maple.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。