应用求解算子方程的Ulm方法构造了求解一类矩阵特征值反问题(IEP)的新算法.所给算法避免了文献[Aishima K.,A quadratically convergent algorithm based on matrix equations for inverse eigenvalue problems,Linear Algebra and its ...应用求解算子方程的Ulm方法构造了求解一类矩阵特征值反问题(IEP)的新算法.所给算法避免了文献[Aishima K.,A quadratically convergent algorithm based on matrix equations for inverse eigenvalue problems,Linear Algebra and its Applications,2018,542:310-333]中算法在每次迭代中要求解一个线性方程组的不足,证明了在给定谱数据互不相同的条件下所给算法具有根收敛意义下的二次收敛性.数值实验表明本文所给算法在矩阵阶数较大时计算效果优于上文所给算法.展开更多
文摘应用求解算子方程的Ulm方法构造了求解一类矩阵特征值反问题(IEP)的新算法.所给算法避免了文献[Aishima K.,A quadratically convergent algorithm based on matrix equations for inverse eigenvalue problems,Linear Algebra and its Applications,2018,542:310-333]中算法在每次迭代中要求解一个线性方程组的不足,证明了在给定谱数据互不相同的条件下所给算法具有根收敛意义下的二次收敛性.数值实验表明本文所给算法在矩阵阶数较大时计算效果优于上文所给算法.
