Hermite Positive Definite Solution of the Quaternion Matrix Equation Xm + B*XB = C

This paper discusses the necessary and sufficient conditions for the existence of Hermite positive definite solutions of the quaternion matrix equation Xm+ B*XB = C (m > 0) and its iterative solution method. According to the characteristics of the coefficient matrix, a corresponding algebraic equation system is ingeniously constructed, and by discussing the equation system’s solvability, the matrix equation’s existence interval is obtained. Based on the characteristics of the coefficient matrix, some necessary and sufficient conditions for the existence of Hermitian positive definite solutions of the matrix equation are derived. Then, the upper and lower bounds of the positive actual solutions are estimated by using matrix inequalities. Four iteration formats are constructed according to the given conditions and existence intervals, and their convergence is proven. The selection method for the initial matrix is also provided. Finally, using the complexification operator of quaternion matrices, an equivalent iteration on the complex field is established to solve the equation in the Matlab environment. Two numerical examples are used to test the effectiveness and feasibility of the given method. .

Extremal ranks of the solution to a system of real quaternion matrix equations

In this paper, the maximal and minimal ranks of the solution to a system of matrix equations over H, the real quaternion algebra, were derived. A previous known result could be regarded as a special case of the new result.

ON SOLUTIONS OF QUATERNION MATRIX EQUATIONS XF-AX=BY AND XF-A=BY

In this paper,the quaternion matrix equations XF-AX=BY and XF-A=BY are investigated.For convenience,they were called generalized Sylvesterquaternion matrix equation and generalized Sylvester-j-conjugate quaternion matrix equation,which include the Sylvester matrix equation and Lyapunov matrix equation as special cases.By applying of Kronecker map and complex representation of a quaternion matrix,the sufficient conditions to compute the solution can be given and the expressions of the explicit solutions to the above two quaternion matrix equations XF-AX=BY and XF-A=BY are also obtained.By the established expressions,it is easy to compute the solution of the quaternion matrix equation in the above two forms.In addition,two practical algorithms for these two quaternion matrix equations are give.One is complex representation matrix method and the other is a direct algorithm by the given expression.Furthermore,two illustrative examples are proposed to show the efficiency of the given method.

THE GENERALIZED REFLEXIVE SOLUTION FOR A CLASS OF MATRIX EQUATIONS (AX-B,XC=D)

In this article, the generalized reflexive solution of matrix equations （AX = B, XC = D） is considered. With special properties of generalized reflexive matrices, the necessary and sufficient conditions for the solvability and the general expression of the solution are obtained. Moreover, the related optimal approximation problem to a given matrix over the solution set is solved.

The Least Square Solutions to the Quaternion Matrix Equation AX=B

A norm of a quaternion matrix is defined. The expressions of the least square solutions of the quaternion matrix equation AX = B and the equation with the constraint condition DX = E are given.

An explicit solution to the matrix equation AV+BW=EVJ

In this note, the matrix equation AV ＋ BW = EVJ is considered, where E, A and B are given matrices of appropriate dimensions, J is an arbitrarily given Jordan matrix, V and W are the matrices to be determined. Firstly, a right factorization of （sE - A）^-1 B is given based on the Leverriver algorithm for descriptor systems. Then based on this factorization and a proposed parametric solution, an alternative parametric solution to this matrix equation is established in terms of the R-controllability matrix of （E, A, B）, the generalized symmetric operator and the observability matrix associated with the Jordan matrix d and a free parameter matrix. The proposed results provide great convenience for many analysis and design problems. Moreover, some equivalent forms are proposed. A numerical example is employed to illustrate the effect of the proposed approach.

A General Hermitian Nonnegative-Definite Solution to the Matrix Equation <i>AXB</i>= <i>C</i>

We derive necessary and sufficient conditions for the existence of a Hermitian nonnegative-definite solution to the matrix equation AXB = C. Moreover, we derive a representation of a general Hermitian nonnegative-definite solution. We then apply our solution to two examples, including a comparison of our solution to a proposed solution by Zhang in [1] using an example problem given from [1]. Our solution demonstrates that the proposed general solution from Zhang in [1] is incorrect. We also give a second example in which we derive the general covariance structure so that two matrix quadratic forms are independent.

A MATRIX EQUATION FROM AN INVERSE PROBLEM OF VIBRATION THEORY

The symmetric,positive semidefinite,and positive definite real solutions of the matrix equation XA=YAD from an inverse problem of vibration theory are considered.When D=T the necessary and sufficient conditions for the existence of such solutions and their general forms are derived.

THE POSITIVE SEMIDEFINITE SOLUTION OF THE MATRIX EQUATION (A^TXA, B^TXB) = (C, D)

In this paper, we consider the positive semidefinite solution of the matrix equation (AT X A, BT X B) - (C, D). A necessary and sufficient condition for the existence of such solution is derived using the generalized singular value decomposition.The general forms of positive semidefinite solution are given.

Generally Unitary Solution to a System of Matrix Equations over the Quaternion Field

Generally unitary solution to the system of martix equations over the quaternion field [X mA ns =B ns ,X nn C nt =D nt ] is considered. A necessary and sufficient condition for the existence of and the expression for the generally unitary solution of the system are derived.

The Quaternion Matrix Equation ∑A^iXB_i=E

Let H_F be the generalized quaternion division algebra over a field F with charF≠2. In this paper, the ad joint matrix of any n×n matrix over H_F[λ] is defined and its properties is discussed. By using the adjoint matrix and the method of representation matrix, this paper obtains several necessary and sufficieut conditions for the existence of a solution or a unique solution to the matrix equation sum from n=i to k A^iXB_i=E over H_F, and gives some explicit formulas of solutions.

Ranks of the Common Solution to Six Quaternion Matrix Equations

A new expression is established for the common solution to six classical linear quaternion matrix equations A 1 X = C 1 , X B 1 = C 3 , A 2 X = C 2 , X B 2 = C 4 , A 3 X B 3 = C 5 , A 4 X B 4 = C 6 which was investigated recently by Wang, Chang and Ning （Q. Wang, H. Chang, Q. Ning, The common solution to six quaternion matrix equations with applications, Appl. Math. Comput. 195： 721-732 （2008））. Formulas are derived for the maximal and minimal ranks of the common solution to this system. Moreover, corresponding results on some special cases are presented. As an application, a necessary and sufficient condition is presented for the invariance of the rank of the general solution to this system. Some known results can be regarded as the special cases of the results in this paper.

On a Solution of the Quaternion Matrix Equation X-A B=C and Its Application

This paper first studies the solution of a complex matrix equation X - AXB = C, obtains an explicit solution of the equation by means of characteristic polynomial, and then studies the quaternion matrix equation X - A X B = C, characterizes the existence of a solution to the matrix equation, and derives closed-form solutions of the matrix equation in explicit forms by means of real representations of quaternion matrices. This paper also gives an application to the complex matrix equation X - AXB =C.

A System of Periodic Discrete-time Coupled Sylvester Quaternion Matrix Equations

We in this paper derive necessary and sufficient conditions for the system of the periodic discrete-time coupled Sylvester matrix equations AkXk ＋ YkBk = Mk, CkXk＋l ＋ YkDk ---- Nk （k = 1, 2） over the quaternion algebra to be consistent in terms of ranks and generalized inverses of the coefficient matrices. We also give an expression of the general solution to the system when it is solvable. The findings of this paper generalize some known results in the literature.

Least-norm and Extremal Ranks of the Least Square Solution to the Quaternion Matrix Equation AXB = C Subject to Two Equations

In this paper, we give the expression of the least square solution of the linear quaternion matrix equation AXB = C subject to a consistent system of quaternion matrix equations D1X = F1, XE2 =F2, and derive the maximal and minimal ranks and the leastnorm of the above mentioned solution. The finding of this paper extends some known results in the literature.

Solutions to the generalized Sylvester matrixequations by a singular value decomposition

In this paper, solutions to the generalized Sylvester matrix equations AX -XF = BY and MXN -X = TY with A, M ∈ R^n×n, B, T ∈ Rn×r, F, N ∈ R^p×p and the matrices N, F being in companion form, are established by a singular value decomposition of a matrix with dimensions n × （n ＋ pr）. The algorithm proposed in this paper for the euqation AX - XF = BY does not require the controllability of matrix pair （A, B） and the restriction that A, F do not have common eigenvalues. Since singular value decomposition is adopted, the algorithm is numerically stable and may provide great convenience to the computation of the solution to these equations, and can perform important functions in many design problems in control systems theory.

A System of Sylvester-type Quaternion Matrix Equations with Ten Variables

This paper studies a system of three Sylvester-type quaternion matrix equations with ten variables A_(i)X_(i)+Y_iB_(i)+C_(i)Z_(i)D_(i)+F_(i)Z_(i+1)G_(i)=E_(i),i=1,3^-.We derive some necessary and sufficient conditions for the existence of a solution to this system in terms of ranks and Moore–Penrose inverses of the matrices involved.We present the general solution to the system when the solvability conditions are satisfied.As applications of this system,we provide some solvability conditions and general solutions to some systems of quaternion matrix equations involvingφ-Hermicity.Moreover,we give some numerical examples to illustrate our results.The findings of this paper extend some known results in the literature.

A System of Matrix Equations over the Quaternion Algebra with Applications

We in this paper give necessary and sufficient conditions for the existence of the general solution to the system of matrix equations A1X1 = C1, AXiB1 ＋ X2B2 = C3, A2X2 ＋ A3X3B= C2 and X3B3 = C4 over the quaternion algebra H, and present an expression of the general solution to this system when it is solvable. Using the results, we give some necessary and sufficient conditions for the system of matrix equations AX = C, XB = C over H to have a reducible solution as well as the representation of such solution to the system when the consistency conditions are met. A numerical example is also given to illustrate our results. As another application, we give the necessary and sufficient conditions for two associated electronic networks to have the same branch current and branch voltage and give the expressions of the same branch current and branch voltage when the conditions are satisfied.

Schmidt Decomposition of Quaternion Matrix and the Orthonormalization of Vectors in a Generalized Unitary Space

In this paper we derive a practical method of solving simultaneously the problem of Schmidt decomposition of quaternion matrix and the orthonormalization of vectors in a generalized unitary space by using elementary column operations on matrices over the quaternion field.

Ranks of Submatrices in a Solution to a Consistent System of Linear Quaternion Matrix Equations with Applications

Suppose that A1X = C1, XB2 = C2, A3XB3= 63 is a consistent system of matrix equations and partition its solution X into a 2× 2 block form. In this paper, we give formulas for the maximal and minimal ranks of the submatrices in a solution X to the system. We also investigate the uniqueness and the independence of submatrices in a solution X. As applications, we give some properties of submatrices in generalized inverses of matrices. These extend some known results in the literature.