On a relationship between the T-congruence Sylvester equation and the Lyapunov equation

preprint2015arXivOpen access

Abstract

We consider the T-congruence Sylvester equation AX+XTB=CAX+X^{\rm T}B=C, where A∈Rm×nA\in \mathbb R^{m\times n}, B∈Rn×mB\in \mathbb R^{n\times m} and C∈Rm×mC\in \mathbb R^{m\times m} are given, and matrix X∈Rn×mX \in \mathbb R^{n\times m} is to be determined. The T-congruence Sylvester equation has recently attracted attention because of a relationship with palindromic eigenvalue problems. For example, necessary and sufficient conditions for the existence and uniqueness of solutions, and numerical solvers have been intensively studied. In this note, we will show that, under a certain condition, the T-congruence Sylvester equation can be transformed into the Lyapunov equation. This may lead to further properties and efficient numerical solvers by utilizing a great deal of studies on the Lyapunov equation.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.