Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the solution of the linear matrix equation $X=Af(X)B+C$

Published 30 Oct 2013 in math.NA | (1310.8124v2)

Abstract: In this paper, we derive a formula to compute the solution of the linear matrix equation $X=Af(X)B+C$ via finding any solution of a specific Stein matrix equation $\mathcal{X}=\mathcal{A} \mathcal{X} \mathcal{B}+\mathcal{C}$, where the linear (or anti-linear) matrix operator $f$ is period-$n$. According to this formula, we should pay much attention to solve the Stein matrix equation from recently famous numerical methods. For instance, Smith-type iterations, Bartels-Stewart algorithm, and etc.. Moreover, this transformation is used to provide necessary and sufficient conditions of the solvable of the linear matrix equation. On the other hand, it can be proven that the general solution of the linear matrix equation can be presented by the general solution of the Stein matrix equation. The necessary condition of the uniquely solvable of the linear matrix equation is developed. It is shown that several representations of this formula are coincident. Some examples are presented to illustrate and explain our results.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.