计算无结构和有结构多项式伪谱近似
Computing Unstructured and Structured Polynomial Pseudospectrum Approximations
AI总结:
本文提出利用秩一或投影秩一扰动计算多项式伪谱近似的方法,有效提升对有结构和无结构伪谱的逼近性能,优于随机秩一扰动方法。
摘要:
在许多应用中,理解矩阵多项式特征值对多项式扰动的敏感性至关重要。通常通过条件数或伪谱描述。然而,计算矩阵多项式伪谱计算成本很高。本文提出利用秩一或投影秩一扰动计算伪谱近似的新方法,受Wilkinson对特征值敏感性分析启发。该方法可近似有结构和无结构伪谱。计算实例显示,该方法在逼近有结构和无结构多项式伪谱方面均优于基于随机秩一扰动的方法。
英文摘要:
In many applications it is important to understand the sensitivity of eigenvalues of a matrix polynomial to perturbations of the polynomial. The sensitivity commonly is described by condition numbers or pseudospectra. However, the computation of pseudospectra of matrix polynomials is very demanding computationally. This paper describes a new approach to computing approximations of pseudospectra of matrix polynomials by using rank-one or projected rank-one perturbations. These perturbations are inspired by Wilkinson's analysis of eigenvalue sensitivity. This approach allows the approximation of both structured and unstructured pseudospectra. Computed examples show the method to perform much better than a method based on random rank-one perturbations both for the approximation of structured and unstructured (i.e., standard) polynomial pseudospectra.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。