Abstract

The main goal of this paper is the numerical computation of solutions of the so-called Yang–Baxter-like matrix equation AXA=XAX, where A is a given complex square matrix. Two novel matrix iterations are proposed, both having second-order convergence. A sign modification in one of the iterations gives rise to a third matrix iteration. Strategies for finding starting approximations are discussed as well as a technique for estimating the relative error. One of the methods involves a very small cost per iteration and is shown to be stable. Numerical experiments are carried out to illustrate the effectiveness of the new methods.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call