Exact and approximate solutions of some operator equations based on the Cayley transform Original Research Article

We consider the operator equation SX ≡ Σj−1M UjXVj = Y where Uj, Vj are some communicative sets of operators but in general Uj need not compute with Vj. Particular cases of this equation are the Sylvester and Ljapunov equations. We give a new representation and an approximation of the solution which is suitable to perform it algorithmically. Error estimates are given which show exponential covergence for bounded operators and polynomial convergence for unbounded ones. Based on these considerations we construct an iterative process and give an existence theorem for the operator equation Z2 + A1Z + A2 = 0, arising for example when solving an abstract second order differential equation with non-commutative coefficients.