scholarly journals A Note on the⊤-Stein Matrix Equation

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Chun-Yueh Chiang

This note is concerned with the linear matrix equationX=AX⊤B + C, where the operator(·)⊤denotes the transpose (⊤) of a matrix. The first part of this paper sets forth the necessary and sufficient conditions for the unique solvability of the solutionX. 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. The final part of this paper starts with a brief review of numerical methods for solving the linear matrix equation. In relation 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 the discussion of linear matrix equations, perturbation bounds for solving the linear matrix equation are also proposed in this work.Erratum to “A Note on the⊤-Stein Matrix Equation”

2009 ◽  
Vol 16 (02) ◽  
pp. 293-308 ◽  
Author(s):  
Qingwen Wang ◽  
Guangjing Song ◽  
Xin Liu

We establish the formulas of the maximal and minimal ranks of the common solution of certain linear matrix equations A1X = C1, XB2 = C2, A3XB3 = C3 and A4XB4 = C4 over an arbitrary division ring. Corresponding results in some special cases are given. As an application, necessary and sufficient conditions for the invariance of the rank of the common solution mentioned above are presented. Some previously known results can be regarded as special cases of our results.


2021 ◽  
Vol 7 (1) ◽  
pp. 384-397
Author(s):  
Yinlan Chen ◽  
◽  
Lina Liu

<abstract><p>In this paper, we consider the common Re-nonnegative definite (Re-nnd) and Re-positive definite (Re-pd) solutions to a pair of linear matrix equations $ A_1XA_1^\ast = C_1, \ A_2XA_2^\ast = C_2 $ and present some necessary and sufficient conditions for their solvability as well as the explicit expressions for the general common Re-nnd and Re-pd solutions when the consistent conditions are satisfied.</p></abstract>


Author(s):  
Sujit Kumar Mitra

Penrose (4) gave a necessary and sufficient condition for the consistency of the linear matrix equation AXB = C and also its complete class of solutions. A necessary and sufficient condition for the equations AX = C, XB = D to have a common solution was given by Cecioni (3) and an expression for the general common solution by Rao and Mitra ((6), p. 25). In the present paper, we obtain a necessary and sufficient condition for the equations A1XB1 = C1 and A2XB2 = C2 to have a common solution and also an expression for the general common solution. This result isuseful in computing a constrained inverse of a matrix, a concept originallyintroduced by Bott and Duffin(2) and recently extended by Rao and Mitra(7) who consider more general constraints with the object of bringing together the various generalized inverses and pseudoinverses under a common classification scheme.


2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Yirong Sun ◽  
Junyang An ◽  
Xiaobin Guo

In this paper, a kind of complex fuzzy linear matrix equation A X ˜ B = C ˜ , in which C ˜ is a complex fuzzy matrix and A and B are crisp matrices, is investigated by using a matrix method. The complex fuzzy matrix equation is extended into a crisp system of matrix equations by means of arithmetic operations of fuzzy numbers. Two brand new and simplified procedures for solving the original fuzzy equation are proposed and the correspondingly sufficient condition for strong fuzzy solution are analysed. Some examples are calculated in detail to illustrate our proposed method.


2016 ◽  
Vol 23 (01) ◽  
pp. 71-81 ◽  
Author(s):  
Li Wang ◽  
Qingwen Wang ◽  
Zhuoheng He

In this paper we investigate the system of linear matrix equations A1X=C1, YB2=C2, A3XB3=C3, A4YB4=C4, BX+YC=A. We present some necessary and sufficient conditions for the existence of a solution to this system and give an expression of the general solution to the system when the solvability conditions are satisfied.


1993 ◽  
Vol 30 (3) ◽  
pp. 639-649 ◽  
Author(s):  
Richard M. Feldman ◽  
Bryan L. Deuermeyer ◽  
Ciriaco Valdez-Flores

The steady-state analysis of a quasi-birth-death process is possible by matrix geometric procedures in which the root to a quadratic matrix equation is found. A recent method that can be used for analyzing quasi-birth–death processes involves expanding the state space and using a linear matrix equation instead of the quadratic form. One of the difficulties of using the linear matrix equation approach regards the boundary conditions and obtaining the norming equation. In this paper, we present a method for calculating the boundary values and use the operator-machine interference problem as a vehicle to compare the two approaches for solving quasi-birth-death processes.


1993 ◽  
Vol 30 (03) ◽  
pp. 639-649
Author(s):  
Richard M. Feldman ◽  
Bryan L. Deuermeyer ◽  
Ciriaco Valdez-Flores

The steady-state analysis of a quasi-birth-death process is possible by matrix geometric procedures in which the root to a quadratic matrix equation is found. A recent method that can be used for analyzing quasi-birth–death processes involves expanding the state space and using a linear matrix equation instead of the quadratic form. One of the difficulties of using the linear matrix equation approach regards the boundary conditions and obtaining the norming equation. In this paper, we present a method for calculating the boundary values and use the operator-machine interference problem as a vehicle to compare the two approaches for solving quasi-birth-death processes.


Sign in / Sign up

Export Citation Format

Share Document