Solvability Theory and Iteration Method for One Self-Adjoint Polynomial Matrix Equation

Table 2

Iteration, CPU time (seconds) and residue for solving (1) with 𝑠=𝑡 and different initial solutions.

(𝑠,𝑡,𝑋0)	Algorithm 1			MONO
	Ite	CPU	Res	Ite	CPU	Res
(1,1,𝛿1𝐼𝑛)	20	0.0223	3.4947𝑒−13	20	0.0202	3.4947𝑒−13
(1,1,𝛿2𝐼𝑛)	31	0.0258	7.3027𝑒−13	31	0.0305	7.3027𝑒−13
(2,2,𝛿1𝐼𝑛)	20	0.1170	8.9978𝑒−13	200	2.6421	0.0037
(2,2,𝛿2𝐼𝑛)	43	0.5475	9.6421𝑒−13	200	2.7224	0.0037
(10,10,𝛿1𝐼𝑛)	29	0.1890	2.9296𝑒−13	200	2.9717	0.0059
(10,10,𝛿2𝐼𝑛)	157	3.0859	7.1154𝑒−13	200	2.9788	0.0059