We consider a matrix polynomial equation (MPE) $$A_nX^n+A_{n-1}X^{n-1}+\cdots +A_0=0$$AnXn+An-1Xn-1+⋯+A0=0, where $$A_n, A_{n-1},\ldots , A_0 \in \mathbb {R}^{m\times m}$$An,An-1,…,A0∈Rm×m are the coefficient matrices, and $$X\in \mathbb {R}^{m\times m}$$X∈Rm×m is the unknown… Click to show full abstract
We consider a matrix polynomial equation (MPE) $$A_nX^n+A_{n-1}X^{n-1}+\cdots +A_0=0$$AnXn+An-1Xn-1+⋯+A0=0, where $$A_n, A_{n-1},\ldots , A_0 \in \mathbb {R}^{m\times m}$$An,An-1,…,A0∈Rm×m are the coefficient matrices, and $$X\in \mathbb {R}^{m\times m}$$X∈Rm×m is the unknown matrix. A sufficient condition for the existence of the minimal nonnegative solution is derived, where minimal means that any other solution is componentwise no less than the minimal one. The explicit expressions of normwise, mixed and componentwise condition numbers of the matrix polynomial equation are obtained. A backward error of the approximated minimal nonnegative solution is defined and evaluated. Some numerical examples are given to show the sharpness of the three kinds of condition numbers.
               
Click one of the above tabs to view related content.