We consider the system of four linear matrix equations A_1 X = C_1,XB_2 =C_2,A_3,XB_3, = C3 and A_4XB_4 = C_4 over R, an arbitrary von Neumann regular ring with identity. Anecessary and sufficient condition for the ex...We consider the system of four linear matrix equations A_1 X = C_1,XB_2 =C_2,A_3,XB_3, = C3 and A_4XB_4 = C_4 over R, an arbitrary von Neumann regular ring with identity. Anecessary and sufficient condition for the existence and the expression of the general solution tothe system are derived. As applications, necessary and sufficient conditions are given for thesystem of matrix equations A_1X = C_1 and A_3X = C_3 to have a bisymmetric solution, the system ofmatrix equations A_1X = C_1 and A_3XB_3 = C_3 to have a perselfconjugate solution over R with aninvolution and char R≠2, respectively. The representations of such solutions are also presented.Moreover, some auxiliary results on other systems over R are obtained. The previous known results onsome systems of matrix equations are special cases of the new results.展开更多
In this paper, we set up a general framework of parallel matrix mullisplitting relaxation methods for solving large scale system of linear equations. We investigate the convergence properties of this framework and giv...In this paper, we set up a general framework of parallel matrix mullisplitting relaxation methods for solving large scale system of linear equations. We investigate the convergence properties of this framework and give several sufficient conditions ensuring it to converge as well as diverge. At last, we conclude a necessary and sufficient condition for the convergence of this framework when the coefficient matrix is an L-matrix.展开更多
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 investiga...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.展开更多
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 equati...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.展开更多
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...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.展开更多
The convergence of the parallel matrix multisplitting relaxation methods presented by Wang (Linear Algebra and Its Applications 154/156 (1991) 473 486) is further investigated. The investigations show that these relax...The convergence of the parallel matrix multisplitting relaxation methods presented by Wang (Linear Algebra and Its Applications 154/156 (1991) 473 486) is further investigated. The investigations show that these relaxation methods really have considerably larger convergence domains.展开更多
Signal and image restoration problems are often solved by minimizing a cost function consisting of an l2 data-fidelity term and a regularization term. We consider a class of convex and edge-preserving regularization f...Signal and image restoration problems are often solved by minimizing a cost function consisting of an l2 data-fidelity term and a regularization term. We consider a class of convex and edge-preserving regularization functions. In specific, half-quadratic regularization as a fixed-point iteration method is usually employed to solve this problem. The main aim of this paper is to solve the above-described signal and image restoration problems with the half-quadratic regularization technique by making use of the Newton method. At each iteration of the Newton method, the Newton equation is a structured system of linear equations of a symmetric positive definite coefficient matrix, and may be efficiently solved by the preconditioned conjugate gradient method accelerated with the modified block SSOR preconditioner. Our experimental results show that the modified block-SSOR preconditioned conjugate gradient method is feasible and effective for further improving the numerical performance of the half-quadratic regularization approach.展开更多
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 ...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.展开更多
We establish the convergence theories of the symmetric relaxation methods for the system of linear equations with symmetric positive definite coefficient matrix, and more generally, those of the unsymmetric relaxation...We establish the convergence theories of the symmetric relaxation methods for the system of linear equations with symmetric positive definite coefficient matrix, and more generally, those of the unsymmetric relaxation methods for the system of linear equations with positive definite matrix.展开更多
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 re...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.展开更多
Presents preconditioning matrices having parallel computing function for the coefficient matrix and a class of parallel hybrid algebraic multilevel iteration methods for solving linear equations. Solution to elliptic ...Presents preconditioning matrices having parallel computing function for the coefficient matrix and a class of parallel hybrid algebraic multilevel iteration methods for solving linear equations. Solution to elliptic boundary value problem; Discussion on symmetric positive definite matrix; Computational complexities.展开更多
The problem of analysis and synthesis of robust control is addressed in this work. The approach transferring the robust control design into Linear Matrix Inequality (LMI) is provided. The LMI standard structure of rob...The problem of analysis and synthesis of robust control is addressed in this work. The approach transferring the robust control design into Linear Matrix Inequality (LMI) is provided. The LMI standard structure of robust controller is also given and the controller is obtained through solving three LMIs. As an example, a robust control law is designed to the twin-spool turbojet engine system using the given approach. The result shows that LMI approach is feasible.展开更多
In this paper, the matrix algebraic equations involved in the optimal control problem of time-invariant linear Ito stochastic systems, named Riccati- Ito equations in the paper, are investigated. The necessary and suf...In this paper, the matrix algebraic equations involved in the optimal control problem of time-invariant linear Ito stochastic systems, named Riccati- Ito equations in the paper, are investigated. The necessary and sufficient condition for the existence of positive definite solutions of the Riccati- Ito equations is obtained and an iterative solution to the Riccati- Ito equations is also given in the paper thus a complete solution to the basic problem of optimal control of time-invariant linear Ito stochastic systems is then obtained. An example is given at the end of the paper to illustrate the application of the result of the paper.展开更多
In this paper we study a matrix equation AX+BX=C(I)over an arbitrary skew field,and give a consistency criterion of(I)and an explicit expression of general solutions of(I).A convenient,simple and practical method of s...In this paper we study a matrix equation AX+BX=C(I)over an arbitrary skew field,and give a consistency criterion of(I)and an explicit expression of general solutions of(I).A convenient,simple and practical method of solving(I)is also given.As a particular case,we also give a simple method of finding a system of fundamental solutions of a homogeneous system of right linear equations over a skew field.展开更多
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(...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.展开更多
For M-matrix equations, we provide a necessary and sufficient condition for that the solution of the equations has the property p, which improves and generalizes the corresponding results of [1] and [2].
The formulation of multibody dynamics was studied based on variational principle. The body coonection matrix was introduced to define the connection configuration. The expression for the system kinematics was obtained...The formulation of multibody dynamics was studied based on variational principle. The body coonection matrix was introduced to define the connection configuration. The expression for the system kinematics was obtained by using the body connection matrix. From variational principle the general dynamical equations for multibody system were derived and the dynamical equations were given for multibody system subjected to the constraints.展开更多
基金This research is supported by the Natural Science Foundation of China(No.0471085the Natural Science Foundation of Shanghai)the Development Foundation of Shanghai Educational Committee the Special Funds for Major Specialities of Shanghai Education Co
文摘We consider the system of four linear matrix equations A_1 X = C_1,XB_2 =C_2,A_3,XB_3, = C3 and A_4XB_4 = C_4 over R, an arbitrary von Neumann regular ring with identity. Anecessary and sufficient condition for the existence and the expression of the general solution tothe system are derived. As applications, necessary and sufficient conditions are given for thesystem of matrix equations A_1X = C_1 and A_3X = C_3 to have a bisymmetric solution, the system ofmatrix equations A_1X = C_1 and A_3XB_3 = C_3 to have a perselfconjugate solution over R with aninvolution and char R≠2, respectively. The representations of such solutions are also presented.Moreover, some auxiliary results on other systems over R are obtained. The previous known results onsome systems of matrix equations are special cases of the new results.
基金Supported by Natural Science Fundations of China and Shanghai.
文摘In this paper, we set up a general framework of parallel matrix mullisplitting relaxation methods for solving large scale system of linear equations. We investigate the convergence properties of this framework and give several sufficient conditions ensuring it to converge as well as diverge. At last, we conclude a necessary and sufficient condition for the convergence of this framework when the coefficient matrix is an L-matrix.
基金Supported by the National Natural Science Foundation of Shanghai (No. 11ZR1412500)the Ph.D. Programs Foundation of Ministry of Education of China (No. 20093108110001)Shanghai Leading Academic Discipline Project (No. J50101)
文摘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.
基金supported by the National Natural Science Foundation of China （Grant No.60672160）
文摘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.
基金Supported by the National Natural Science Foundation of China(10471085)
文摘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.
文摘The convergence of the parallel matrix multisplitting relaxation methods presented by Wang (Linear Algebra and Its Applications 154/156 (1991) 473 486) is further investigated. The investigations show that these relaxation methods really have considerably larger convergence domains.
基金supported by the China NSF Outstanding Young Scientist Foundation(No.10525102)National Natural Science Foundation(No.10471146)+3 种基金the National Basic Research Program (No.2005CB321702)P.R.Chinasupported in part by the Fundamental Research Fund for Physics and Mathematics of Lanzhou University.P.R.Chinasupported in part by Hong Kong Research Grants Council Grant Nos.7035/04P and 7035/05PHKBU FRGs
文摘Signal and image restoration problems are often solved by minimizing a cost function consisting of an l2 data-fidelity term and a regularization term. We consider a class of convex and edge-preserving regularization functions. In specific, half-quadratic regularization as a fixed-point iteration method is usually employed to solve this problem. The main aim of this paper is to solve the above-described signal and image restoration problems with the half-quadratic regularization technique by making use of the Newton method. At each iteration of the Newton method, the Newton equation is a structured system of linear equations of a symmetric positive definite coefficient matrix, and may be efficiently solved by the preconditioned conjugate gradient method accelerated with the modified block SSOR preconditioner. Our experimental results show that the modified block-SSOR preconditioned conjugate gradient method is feasible and effective for further improving the numerical performance of the half-quadratic regularization approach.
基金This research was supported by the grants from the National Natural Science Foundation of China （11571220, 11171205）.
文摘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.
文摘We establish the convergence theories of the symmetric relaxation methods for the system of linear equations with symmetric positive definite coefficient matrix, and more generally, those of the unsymmetric relaxation methods for the system of linear equations with positive definite matrix.
基金Project supported by the National Natural Science Foundation of China （Grant No.60672160）
文摘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.
基金Subsidized by the Special Funds for Major State Basic Research Projects G1999032803 and Suported bythe National Natural Scienc
文摘Presents preconditioning matrices having parallel computing function for the coefficient matrix and a class of parallel hybrid algebraic multilevel iteration methods for solving linear equations. Solution to elliptic boundary value problem; Discussion on symmetric positive definite matrix; Computational complexities.
基金National Natural Science Foundation of China! ( 6 98740 3 2 )The Youth Teacher Foundation of NPU
文摘The problem of analysis and synthesis of robust control is addressed in this work. The approach transferring the robust control design into Linear Matrix Inequality (LMI) is provided. The LMI standard structure of robust controller is also given and the controller is obtained through solving three LMIs. As an example, a robust control law is designed to the twin-spool turbojet engine system using the given approach. The result shows that LMI approach is feasible.
文摘In this paper, the matrix algebraic equations involved in the optimal control problem of time-invariant linear Ito stochastic systems, named Riccati- Ito equations in the paper, are investigated. The necessary and sufficient condition for the existence of positive definite solutions of the Riccati- Ito equations is obtained and an iterative solution to the Riccati- Ito equations is also given in the paper thus a complete solution to the basic problem of optimal control of time-invariant linear Ito stochastic systems is then obtained. An example is given at the end of the paper to illustrate the application of the result of the paper.
文摘In this paper we study a matrix equation AX+BX=C(I)over an arbitrary skew field,and give a consistency criterion of(I)and an explicit expression of general solutions of(I).A convenient,simple and practical method of solving(I)is also given.As a particular case,we also give a simple method of finding a system of fundamental solutions of a homogeneous system of right linear equations over a skew field.
基金Supported by the Education Department Foundation of Hebei Province(QN2015218)Supported by the Natural Science Foundation of Hebei Province(A2015403050)
文摘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.
文摘For M-matrix equations, we provide a necessary and sufficient condition for that the solution of the equations has the property p, which improves and generalizes the corresponding results of [1] and [2].
文摘The formulation of multibody dynamics was studied based on variational principle. The body coonection matrix was introduced to define the connection configuration. The expression for the system kinematics was obtained by using the body connection matrix. From variational principle the general dynamical equations for multibody system were derived and the dynamical equations were given for multibody system subjected to the constraints.
