In this paper we propose a modification to the invariant polytope algorithm (ipa) using ideas of the finite expressible tree algorithm (feta) by M\"oller and Reif. We show that our new feta-flavoured-ipa applies to a wider range of matrix families.

翻译：本文提出了一种对不变多面体算法（IPA）的改进，借鉴了Möller和Reif的有限可表达树算法（FETA）的思想。我们证明，这种新的FETA风格的IPA适用于更广泛的矩阵族。