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.

Numerical Methods for a Class of Quadratic Matrix Equations

Quadratic matrix equations arise in many elds of scienti c computing and engineering applications.In this paper,we consider a class of quadratic matrix equations.Under a certain condition,we rst prove the existence of minimal nonnegative solution for this quadratic matrix equation,and then propose some numerical methods for solving it.Convergence analysis and numerical examples are given to verify the theories and the numerical methods of this paper.

Second-order two-scale analysis and numerical algorithms for the hyperbolic–parabolic equations with rapidly oscillating coefficients

We study the hyperbolic–parabolic equations with rapidly oscillating coefficients. The formal second-order two-scale asymptotic expansion solutions are constructed by the multiscale asymptotic analysis. In addition, we theoretically explain the importance of the second-order two-scale solution by the error analysis in the pointwise sense. The associated explicit convergence rates are also obtained. Then a second-order two-scale numerical method based on the Newmark scheme is presented to solve the equations. Finally, some numerical examples are used to verify the effectiveness and efficiency of the multiscale numerical algorithm we proposed.

SYMMETRIC POSITIVE DEFINITE SOLUTIONS OF MATRIX EQUATIONS (AX,XB)=(C,D) AND AXB=C

The symmetric positive definite solutions of matrix equations (AX,XB)=(C,D) and AXB=C are considered in this paper. Necessary and sufficient conditions for the matrix equations to have symmetric positive definite solutions are derived using the singular value and the generalized singular value decompositions. The expressions for the general symmetric positive definite solutions are given when certain conditions hold.

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.

Minor Self-conjugate and Skewpositive Semidefinite Solutions to a System of Matrix Equations over Skew Fields

Minor self conjugate (msc) and skewpositive semidefinite (ssd) solutions to the system of matrix equations over skew fields [A mn X nn =A mn ,B sn X nn =O sn ] are considered. Necessary and sufficient conditions for the existence of and the expressions for the msc solutions and the ssd solutions are obtained for the system.

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.

The General and Centro(Kewsy) Symmetric Solutions to a System of Matrix Equations over an Arbitrary Skew Field

Necessary and sufficient conditions are given for the existence of the general solution, the centrosymmetric solution, and the centroskewsymmetric solution to a system of linear matrix equations over an arbitrary skew field. The representations of such the solutions of the system are also derived.

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.

An Extended Numerical Method by Stancu Polynomials for Solution of Integro-Differential Equations Arising in Oscillating Magnetic Fields

In this study, the Bernstein collocation method has been expanded to Stancu collocation method for numerical solution of the charged particle motion for certain configurations of oscillating magnetic fields modelled by a class of linear integro-differential equations. As the method has been improved, the Stancu polynomials that are generalization of the Bernstein polynomials have been used. The method has been tested on a physical problem how the method can be applied. Moreover, numerical results of the method have been compared with the numerical results of the other methods to indicate the efficiency of the method.

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.

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.

AOR Iterative Method for Coupled Lyapunov Matrix Equations

An AOR(Accelerated Over-Relaxation)iterative method is suggested by introducing one more parameter than SOR(Successive Over-Relaxation)method for solving coupled Lyapunov matrix equations(CLMEs)that come from continuous-time Markovian jump linear systems.The proposed algorithm improves the convergence rate,which can be seen from the given illustrative examples.The comprehensive theoretical analysis of convergence and optimal parameter needs further investigation.

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.

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∈C^(n×n)is 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.