Fast enclosure of matrix polynomials
Shinya Miyajima · 2013
A method for enclosing matrix polynomials is proposed. This method is applicable when the matrix is diagonalizable and supplies an interval matrix including the matrix polynomial. The computational cost of this method does not depend on the degree of the polynomial. Hence the proposed method is faster than previous approaches when the degree is large. Numerical results show the properties of this method.