Matrix Riccati Equations in Optimal Control

In this paper, the matrix Riccati equation is considered. There is no general way for solving the matrix Riccati equation despite the many fields to which it applies. While scalar Riccati equation has been studied thoroughly, matrix Riccati equation of which scalar Riccati equations is a particular case, is much less investigated. This article proposes a change of variable that allows to find explicit solution of the Matrix Riccati equation. We then apply this solution to Optimal Control.

Matrix integrable fifth-order mKdV equations and their soliton solutions

We consider matrix integrable fifth-order mKdV equations via a kind of group reductions of the Ablowitz–Kaup–Newell–Segur matrix spectral problems. Based on properties of eigenvalue and adjoint eigenvalue problems, we solve the corresponding Riemann–Hilbert problems, where eigenvalues could equal adjoint eigenvalues, and construct their soliton solutions, when there are zero reflection coefficients. Illustrative examples of scalar and two-component integrable fifthorder mKdV equations are given.

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. .

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.

SOME FURTHER NOTES ON THE MATRIX EQUATIONS A^TXB+B^TX^TA=C AND A^TXB+B^TXA=C

Dehghan and Hajarian, [4], investigated the matrix equations A^TXB＋B^TX^TA = C and A^TXB ＋ B^TXA = C providing inequalities for the determinant of the solutions of these equations. In the same paper, the authors presented a lower bound for the product of the eigenvalues of the solutions to these matrix equations. Inspired by their work, we give some generalizations of Dehghan and Hajarian results. Using the theory of the numerical ranges, we present an inequality involving the trace of C when A, B, X are normal matrices satisfying A^T B = BA^T.

Reflexive solution to a system of matrix equations

We derive necessary and sufficient conditions for the existence and an expression of the （anti）reflexive solution with respect to the nontrivial generalized reflection matrix P to the system of complex matrix equations AX = B and XC = D. The explicit solutions of the approximation problem min x∈Ф ｜｜X - E｜｜F was given, where E is a given complex matrix and Ф is the set of all reflexive （or antireflexive） solutions of the system mentioned above, and ｜｜·｜｜ is the Frobenius norm. Furthermore, it was pointed that some results in a recent paper are special cases of this paper.

NEW OSCILLATION CRITERIA FOR SECOND-ORDER NONLINEAR MATRIX DIFFERENTIAL EQUATIONS

Some new oscillation criteria are established for the second-order matrix differential system （r（t）Z＇（t））＇ ＋ p（t）Z＇（t） ＋ Q（t）F（Z＇（t））G（Z（t）） = 0, t ≥ to 〉 0, are different from most known ones in the sense that they are based on the information only on a sequence of subintervals of [to,∞）, rather than on the whole half-line. The results weaken the condition of Q（t） and generalize some well-known results of Wong （1999） to nonlinear matrix differential equation.

HERMITE MATRIX POLYNOMIALS AND SECOND ORDER MATRIX DIFFERENTIAL EQUATIONS

In this paper we introduce the class of Hermite's matrix polynomials which appear as finite series solutions of second order matrix differential equations Y'-xAY'+BY=0.An explicit expression for the Hermite matrix polynomials,the orthogonality property and a Rodrigues' formula are given.

Least square method based on Haar wavelet to solve multi-dimensional stochastic Ito-Volterra integral equations

This paper proposes a method combining blue the Haar wavelet and the least square to solve the multi-dimensional stochastic Ito-Volterra integral equation.This approach is to transform stochastic integral equations into a system of algebraic equations.Meanwhile,the error analysis is proven.Finally,the effectiveness of the approach is verified by two numerical examples.

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.

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.

The Exact Formulation of the Inverse of the Tridiagonal Matrix for Solving the 1D Poisson Equation with the Finite Difference Method

A new method for solving the 1D Poisson equation is presented using the finite difference method. This method is based on the exact formulation of the inverse of the tridiagonal matrix associated with the Laplacian. This is the first time that the inverse of this remarkable matrix is determined directly and exactly. Thus, solving 1D Poisson equation becomes very accurate and extremely fast. This method is a very important tool for physics and engineering where the Poisson equation appears very often in the description of certain phenomena.

Cyclic Solution and Optimal Approximation of the Quaternion Stein Equation

In this paper, two different methods are used to study the cyclic structure solution and the optimal approximation of the quaternion Stein equation AXB - X = F . Firstly, the matrix equation equivalent to the target structure matrix is constructed by using the complex decomposition of the quaternion matrix, to obtain the necessary and sufficient conditions for the existence of the cyclic solution of the equation and the expression of the general solution. Secondly, the Stein equation is converted into the Sylvester equation by adding the necessary parameters, and the condition for the existence of a cyclic solution and the expression of the equation’s solution are then obtained by using the real decomposition of the quaternion matrix and the Kronecker product of the matrix. At the same time, under the condition that the solution set is non-empty, the optimal approximation solution to the given quaternion circulant matrix is obtained by using the property of Frobenius norm property. Numerical examples are given to verify the correctness of the theoretical results and the feasibility of the proposed method. .

Improved gradient iterative algorithms for solving Lyapunov matrix equations

In this paper, an improved gradient iterative （GI） algorithm for solving the Lyapunov matrix equations is studied. Convergence of the improved method for any initial value is proved with some conditions. Compared with the GI algorithm, the improved algorithm reduces computational cost and storage. Finally, the algorithm is tested with GI several numerical examples.

The {P,k ＋ 1}-reflexive Solution to System of Matrix Equations AX=C, XB=D

Let P ∈ C^(n×n) be a Hermitian and {k + 1}-potent matrix, i.e., P^(k+1)= P = P~*,where(·)*~stands for the conjugate transpose of a matrix. A matrix X ∈ Cn×nis called{P, k + 1}-reflexive(anti-reflexive) if PXP = X(P XP =-X). The system of matrix equations AX = C, XB = D subject to {P, k + 1}-reflexive and anti-reflexive constraints are studied by converting into two simpler cases: k = 1 and k = 2, the least squares solution and the associated optimal approximation problem are also considered.

Semi-Analytical Solution of the 1D Helmholtz Equation, Obtained from Inversion of Symmetric Tridiagonal Matrix

An interesting semi-analytic solution is given for the Helmholtz equation. This solution is obtained from a rigorous discussion of the regularity and the inversion of the tridiagonal symmetric matrix. Then, applications are given, showing very good accuracy. This work provides also the analytical inverse of the skew-symmetric tridiagonal matrix.

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.

Hermite Matrix Polynomial Collocation Method for Linear Complex Differential Equations and Some Comparisons

In this paper, we introduce a Hermite operational matrix collocation method for solving higher-order linear complex differential equations in rectangular or elliptic domains. We show that based on a linear algebra theorem, the use of different polynomials such as Hermite, Bessel and Taylor in polynomial collocation methods for solving differential equations leads to an equal solution, and the difference in the numerical results arises from the difference in the coefficient matrix of final linear systems of equations. Some numerical examples will also be given.

A Study Regarding Solution of a Knowledge Model Based on the Containing-Type Error Matrix Equation

An error matrix equation based on error matrix theory was presented in previous research of the error-eliminating theory. The purpose of solving the error matrix equation is to create a decision support on how to switch from bad to good status. A matrix based on error logic is used to express current status u, expectant status u1 and transformation matrix T. It is u, u1, and T that are used to build error matrix equation T (u)= u1. This allows us to find a method whereby bad status “u” changes to good status “u1” by solving the equation. The conversion method that transform from current to expectant status can be obtained from the transformation matrix T. On this basis, this paper proposes a new kind of error matrix equation named “containing-type error matrix equation”. This equation is more suitable for analyzing the realistic question. The method of solving, existence and form of solution for this type of equation have been presented in this paper. This research provides a potential useful new technique for decision analysis.

THE SYMMETRIC AND SYMMETRIC POSITIVE SEMIDEFINITE SOLUTIONS OF LINEAR MATRIX EQUATION——B^TXB = D ON LINEAR MANIFOLDS

This paper discusses the solutions of the linear matrix equation BT X B=Don some linear manifolds.Some necessary and sufficient conditions for the existenceof the solution and the expression of the general solution are given.And also someoptimal approximation solutions are discussed.