Papers
Topics
Authors
Recent
Search
2000 character limit reached

Toward Solution of Matrix Equation X=Af(X)B+C

Published 2 Nov 2012 in math.NA | (1211.0346v1)

Abstract: This paper studies the solvability, existence of unique solution, closed-form solution and numerical solution of matrix equation $X=Af(X) B+C$ with $f(X) =X{\mathrm{T}},$ $f(X) =\bar{X}$ and $f(X) =X{\mathrm{H}},$ where $X$ is the unknown. It is proven that the solvability of these equations is equivalent to the solvability of some auxiliary standard Stein equations in the form of $W=\mathcal{A}W\mathcal{B}+\mathcal{C}$ where the dimensions of the coefficient matrices $\mathcal{A},\mathcal{B}$ and $\mathcal{C}$ are the same as those of the original equation. Closed-form solutions of equation $X=Af(X) B+C$ can then be obtained by utilizing standard results on the standard Stein equation. On the other hand, some generalized Stein iterations and accelerated Stein iterations are proposed to obtain numerical solutions of equation equation $X=Af(X) B+C$. Necessary and sufficient conditions are established to guarantee the convergence of the iterations.

Summary

Paper to Video (Beta)

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 (3)

Collections

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