Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the Sylvester-like matrix equation $AX+f(X)B=C$

Published 1 Dec 2014 in math.NA | (1412.0359v5)

Abstract: Many applications in applied mathematics and control theory give rise to the unique solution of a Sylvester-like matrix equation associated with an underlying structured matrix operator $f$. In this paper, we will discuss the solvability of the Sylvester-like matrix equation through an auxiliary standard (or generalized) Sylvester matrix equation. We also show that when this Sylvester-like matrix equation is uniquely solvable, the closed-form solutions can be found by using previous result. In addition, with the aid of the Kronecker product some useful results of the solvability of this matrix equation are provided.

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.