2013/05/18 by Chun-Yueh Chiang, Chiang, Chun-Yueh
Computer Science · Mathematics · Physics and Astronomy · #Electromagnetic Scattering and Analysis #FOS: Mathematics #Mathematical functions and polynomials #Matrix Theory and Algorithms #Numerical Analysis (math.NA)
paper · pdf · doi:10.48550/arxiv.1305.4243
openalex publication_date 2013/05/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
This note is concerned with the linear matrix equation X = AX^\top B + C, where the operator (⋅)^\top denotes the transpose (\top) of a matrix. The first part of this paper set forth the necessary and sufficient conditions for the unique solvability of the solution X. The second part of this paper aims to provide a comprehensive treatment of the relationship between the theory of the generalized eigenvalue problem and the theory of the linear matrix equation. In the finally part of this paper starts with a briefly review of numerical methods for solving the linear matrix equation. Related to the computed methods, knowledge of the residual is discussed. An expression related to the backward error of an approximate solution is obtained; it shows that a small backward error implies a small residual. Just like for the discussion of linear matrix equations, perturbation bounds for solving the linear matrix equation are also proposed in this work.