This paper discusses the necessary and sufficient conditions for the existence of Hermite positive definite solutions of the quaternion matrix equation X<sup>m</sup>+ B*XB = C (m > 0) and its iterative ...This paper discusses the necessary and sufficient conditions for the existence of Hermite positive definite solutions of the quaternion matrix equation X<sup>m</sup>+ 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 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 de...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.展开更多
Let F be the strong p-division ring [4]. This paper is sequel to [1]. Metapositive definite self-conjugate matrix over F is defined and the necessary and sufficient conditions for determining whether a partitioned mat...Let F be the strong p-division ring [4]. This paper is sequel to [1]. Metapositive definite self-conjugate matrix over F is defined and the necessary and sufficient conditions for determining whether a partitioned matrix over F is metapositive definite self-conjugate are given.Moreover,a decomposition of pairwise matrices over F with the same numbers of columns is also presented. Whence some necessary and sufficient conditions for the existence of and the explicit expression for the metapositive definite self-conjugate solution of the matrix equation AXB=C over F are derived.展开更多
The range and existence conditions of the Hermitian positive definite solutions of nonlinear matrix equations Xs+A*X-tA=Q are studied, where A is an n×n non-singular complex matrix and Q is an n×n Hermitian ...The range and existence conditions of the Hermitian positive definite solutions of nonlinear matrix equations Xs+A*X-tA=Q are studied, where A is an n×n non-singular complex matrix and Q is an n×n Hermitian positive definite matrix and parameters s,t>0. Based on the matrix geometry theory, relevant matrix inequality and linear algebra technology, according to the different value ranges of the parameters s,t, the existence intervals of the Hermitian positive definite solution and the necessary conditions for equation solvability are presented, respectively. Comparing the existing correlation results, the proposed upper and lower bounds of the Hermitian positive definite solution are more accurate and applicable.展开更多
For the lower bound about the determinant of Hadamard product of A and B, where A is a n × n real positive definite matrix and B is a n × n M-matrix, Jianzhou Liu [SLAM J. Matrix Anal. Appl., 18(2)(1997): 30...For the lower bound about the determinant of Hadamard product of A and B, where A is a n × n real positive definite matrix and B is a n × n M-matrix, Jianzhou Liu [SLAM J. Matrix Anal. Appl., 18(2)(1997): 305-311]obtained the estimated inequality as follows det(A o B)≥a11b11 nⅡk=2(bkk detAk/detAk-1+detBk/detBk-1(k-1Ei=1 aikaki/aii))=Ln(A,B),where Ak is kth order sequential principal sub-matrix of A. We establish an improved lower bound of the form Yn(A,B)=a11baa nⅡk=2(bkk detAk/detAk-1+akk detBk/detBk-1-detAdetBk/detak-1detBk-1)≥Ln(A,B).For more weaker and practical lower bound, Liu given thatdet(A o B)≥(nⅡi=1 bii)detA+(nⅡi=1 aii)detB(nⅡk=2 k-1Ei=1 aikaki/aiiakk)=(L)n(A,B).We further improve it as Yn(A,B)=(nⅡi=1 bii)detA+(nⅡi=1 aii)detB-(detA)(detB)+max1≤k≤n wn(A,B,k)≥(nⅡi=1 bii)detA+(nⅡi=1 aii)detB-(detA)(detB)≥(L)n(A,B).展开更多
<span style="line-height:1.5;"><span>In this paper, we consider a constrained low rank approximation problem: </span><img src="Edit_57d85c54-7822-4512-aafc-f0b0295a8f75.png" wi...<span style="line-height:1.5;"><span>In this paper, we consider a constrained low rank approximation problem: </span><img src="Edit_57d85c54-7822-4512-aafc-f0b0295a8f75.png" width="100" height="24" alt="" /></span><span style="line-height:1.5;"><span>, where </span><i><span>E</span></i><span> is a given complex matrix, </span><i><span>p</span></i><span> is a positive integer, and </span></span><span style="line-height:1.5;"></span><span style="line-height:1.5;"><span> is the set of the Hermitian nonnegative-definite least squares solution to the matrix equation </span><img src="Edit_ced08299-d2dc-4dbb-907a-4d8d36d2e87a.png" width="60" height="16" alt="" /></span><span style="line-height:1.5;"><span>. We discuss the range of </span><i><span>p</span></i><span> and derive the corresponding explicit solution expression of the constrained low rank approximation problem by matrix decompositions. And an algorithm for the problem is proposed and the numerical example is given to show its feasibility.展开更多
In this paper,we find some mistakes in the paper “Several Inequalities of Matrix Traces” which was published in Chinese Quarterly Journal of Mathematics,Vol.10,No.2.
We discuss two-stage iterative methods for the solution of linear systemAx = b, and give a new proof of the comparison theorems of two-stage iterative methodfor an Hermitian positive definite matrix. Meanwhile, we put...We discuss two-stage iterative methods for the solution of linear systemAx = b, and give a new proof of the comparison theorems of two-stage iterative methodfor an Hermitian positive definite matrix. Meanwhile, we put forward two new versionsof well known comparison theorem and apply them to some examples.展开更多
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 fo...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.展开更多
It is proved that the set of all symmetric real matrices of order n with eigenvalues lying in the interval(α, β), denoted by Sn(α,β), is convex in Rn×n. With this result, some known results on positive(negati...It is proved that the set of all symmetric real matrices of order n with eigenvalues lying in the interval(α, β), denoted by Sn(α,β), is convex in Rn×n. With this result, some known results on positive(negative) definiteness, and Hurwitz(Shur) stability, as well as the aperiodic property of polytopes of symmetric matrices are generalized, and a series of insightful necessary and sufficient conditions for some general set of symmetric matrices contained in Sn(α,β) are presented,which are directly available for analysis of the positive(negative) definiteness, Hurwitz(Shur) stability and the aperiodic property of a wide class of sets of symmetric matrices.展开更多
In this paper, nonlinear matrix equations of the form X + A*f1 (X)A + B*f2 (X)B = Q are discussed. Some necessary and sufficient conditions for the existence of solutions for this equation are derived. It is s...In this paper, nonlinear matrix equations of the form X + A*f1 (X)A + B*f2 (X)B = Q are discussed. Some necessary and sufficient conditions for the existence of solutions for this equation are derived. It is shown that under some conditions this equation has a unique solution, and an iterative method is proposed to obtain this unique solution. Finally, a numerical example is given to identify the efficiency of the results obtained.展开更多
A new approach that bounds the largest eigenvalue of 3 × 3 correlation matrices is presented. Optimal bounds by given determinant and trace of the squared correlation matrix are derived and shown to be more strin...A new approach that bounds the largest eigenvalue of 3 × 3 correlation matrices is presented. Optimal bounds by given determinant and trace of the squared correlation matrix are derived and shown to be more stringent than the optimal bounds by Wolkowicz and Styan in specific cases.展开更多
For the expected value formulation of stochastic linear complementarity problem, we establish modulus-based matrix splitting iteration methods. The convergence of the new methods is discussed when the coefficient matr...For the expected value formulation of stochastic linear complementarity problem, we establish modulus-based matrix splitting iteration methods. The convergence of the new methods is discussed when the coefficient matrix is a positive definite matrix or a positive semi-definite matrix, respectively. The advantages of the new methods are that they can solve the large scale stochastic linear complementarity problem, and spend less computational time. Numerical results show that the new methods are efficient and suitable for solving the large scale problems.展开更多
This paper proposes an inner product Laplacian embedding algorithm based on semi-definite programming, named as IPLE algorithm. The new algorithm learns a geodesic distance-based kernel matrix by using semi-definite p...This paper proposes an inner product Laplacian embedding algorithm based on semi-definite programming, named as IPLE algorithm. The new algorithm learns a geodesic distance-based kernel matrix by using semi-definite programming under the constraints of local contraction. The criterion function is to make the neighborhood points on manifold as close as possible while the geodesic distances between those distant points are preserved. The IPLE algorithm sufficiently integrates the advantages of LE, ISOMAP and MVU algorithms. The comparison experiments on two image datasets from COIL-20 images and USPS handwritten digit images are performed by applying LE, ISOMAP, MVU and the proposed IPLE. Experimental results show that the intrinsic low-dimensional coordinates obtained by our algorithm preserve more information according to the fraction of the dominant eigenvalues and can obtain the better comprehensive performance in clustering and manifold structure.展开更多
文摘This paper discusses the necessary and sufficient conditions for the existence of Hermite positive definite solutions of the quaternion matrix equation X<sup>m</sup>+ 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 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.
文摘Let F be the strong p-division ring [4]. This paper is sequel to [1]. Metapositive definite self-conjugate matrix over F is defined and the necessary and sufficient conditions for determining whether a partitioned matrix over F is metapositive definite self-conjugate are given.Moreover,a decomposition of pairwise matrices over F with the same numbers of columns is also presented. Whence some necessary and sufficient conditions for the existence of and the explicit expression for the metapositive definite self-conjugate solution of the matrix equation AXB=C over F are derived.
基金The National Natural Science Foundation of China(No.11371089)the China Postdoctoral Science Foundation(No.2016M601688)
文摘The range and existence conditions of the Hermitian positive definite solutions of nonlinear matrix equations Xs+A*X-tA=Q are studied, where A is an n×n non-singular complex matrix and Q is an n×n Hermitian positive definite matrix and parameters s,t>0. Based on the matrix geometry theory, relevant matrix inequality and linear algebra technology, according to the different value ranges of the parameters s,t, the existence intervals of the Hermitian positive definite solution and the necessary conditions for equation solvability are presented, respectively. Comparing the existing correlation results, the proposed upper and lower bounds of the Hermitian positive definite solution are more accurate and applicable.
文摘We exploit the theory of reproducing kernels to deduce a matrix inequality for the inverse of the restriction of a positive definite Hermitian matrix.
文摘For the lower bound about the determinant of Hadamard product of A and B, where A is a n × n real positive definite matrix and B is a n × n M-matrix, Jianzhou Liu [SLAM J. Matrix Anal. Appl., 18(2)(1997): 305-311]obtained the estimated inequality as follows det(A o B)≥a11b11 nⅡk=2(bkk detAk/detAk-1+detBk/detBk-1(k-1Ei=1 aikaki/aii))=Ln(A,B),where Ak is kth order sequential principal sub-matrix of A. We establish an improved lower bound of the form Yn(A,B)=a11baa nⅡk=2(bkk detAk/detAk-1+akk detBk/detBk-1-detAdetBk/detak-1detBk-1)≥Ln(A,B).For more weaker and practical lower bound, Liu given thatdet(A o B)≥(nⅡi=1 bii)detA+(nⅡi=1 aii)detB(nⅡk=2 k-1Ei=1 aikaki/aiiakk)=(L)n(A,B).We further improve it as Yn(A,B)=(nⅡi=1 bii)detA+(nⅡi=1 aii)detB-(detA)(detB)+max1≤k≤n wn(A,B,k)≥(nⅡi=1 bii)detA+(nⅡi=1 aii)detB-(detA)(detB)≥(L)n(A,B).
文摘<span style="line-height:1.5;"><span>In this paper, we consider a constrained low rank approximation problem: </span><img src="Edit_57d85c54-7822-4512-aafc-f0b0295a8f75.png" width="100" height="24" alt="" /></span><span style="line-height:1.5;"><span>, where </span><i><span>E</span></i><span> is a given complex matrix, </span><i><span>p</span></i><span> is a positive integer, and </span></span><span style="line-height:1.5;"></span><span style="line-height:1.5;"><span> is the set of the Hermitian nonnegative-definite least squares solution to the matrix equation </span><img src="Edit_ced08299-d2dc-4dbb-907a-4d8d36d2e87a.png" width="60" height="16" alt="" /></span><span style="line-height:1.5;"><span>. We discuss the range of </span><i><span>p</span></i><span> and derive the corresponding explicit solution expression of the constrained low rank approximation problem by matrix decompositions. And an algorithm for the problem is proposed and the numerical example is given to show its feasibility.
文摘In this paper,we find some mistakes in the paper “Several Inequalities of Matrix Traces” which was published in Chinese Quarterly Journal of Mathematics,Vol.10,No.2.
基金This work is supported by NSF of Shanxi province,20011041.
文摘We discuss two-stage iterative methods for the solution of linear systemAx = b, and give a new proof of the comparison theorems of two-stage iterative methodfor an Hermitian positive definite matrix. Meanwhile, we put forward two new versionsof well known comparison theorem and apply them to some examples.
文摘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.
文摘It is proved that the set of all symmetric real matrices of order n with eigenvalues lying in the interval(α, β), denoted by Sn(α,β), is convex in Rn×n. With this result, some known results on positive(negative) definiteness, and Hurwitz(Shur) stability, as well as the aperiodic property of polytopes of symmetric matrices are generalized, and a series of insightful necessary and sufficient conditions for some general set of symmetric matrices contained in Sn(α,β) are presented,which are directly available for analysis of the positive(negative) definiteness, Hurwitz(Shur) stability and the aperiodic property of a wide class of sets of symmetric matrices.
文摘In this paper, nonlinear matrix equations of the form X + A*f1 (X)A + B*f2 (X)B = Q are discussed. Some necessary and sufficient conditions for the existence of solutions for this equation are derived. It is shown that under some conditions this equation has a unique solution, and an iterative method is proposed to obtain this unique solution. Finally, a numerical example is given to identify the efficiency of the results obtained.
文摘A new approach that bounds the largest eigenvalue of 3 × 3 correlation matrices is presented. Optimal bounds by given determinant and trace of the squared correlation matrix are derived and shown to be more stringent than the optimal bounds by Wolkowicz and Styan in specific cases.
文摘For the expected value formulation of stochastic linear complementarity problem, we establish modulus-based matrix splitting iteration methods. The convergence of the new methods is discussed when the coefficient matrix is a positive definite matrix or a positive semi-definite matrix, respectively. The advantages of the new methods are that they can solve the large scale stochastic linear complementarity problem, and spend less computational time. Numerical results show that the new methods are efficient and suitable for solving the large scale problems.
文摘This paper proposes an inner product Laplacian embedding algorithm based on semi-definite programming, named as IPLE algorithm. The new algorithm learns a geodesic distance-based kernel matrix by using semi-definite programming under the constraints of local contraction. The criterion function is to make the neighborhood points on manifold as close as possible while the geodesic distances between those distant points are preserved. The IPLE algorithm sufficiently integrates the advantages of LE, ISOMAP and MVU algorithms. The comparison experiments on two image datasets from COIL-20 images and USPS handwritten digit images are performed by applying LE, ISOMAP, MVU and the proposed IPLE. Experimental results show that the intrinsic low-dimensional coordinates obtained by our algorithm preserve more information according to the fraction of the dominant eigenvalues and can obtain the better comprehensive performance in clustering and manifold structure.
基金Supported by the Fund for Fostering Talents in Kunming University of Science and Technology(KKZ3202007048)National Natural Science Foundation of China(11801240)。