• Journal of applied mathematics & informatics
• /
• 제26권5_6호
• /
• pp.1011-1020
• /
• 2008

The problem of finding Cramer rule for solutions of some restricted linear equation Ax = b has been widely discussed. Recently Wang and Qiao consider the following more general problem AXB = D, $R(X){\subset}T$, $N(X){\supset}\tilde{S}$. They present the solution of above general restricted matrix equation by using generalized inverses and give an explicit expression for the elements of the solution matrix for the matrix equation. In this paper we re-consider the restricted matrix equation and give an equivalent matrix equation to it. Through the equivalent matrix equation, we derive condensed Cramer rule for above restricted matrix equation. As an application, condensed determinantal expressions for $A_{T,S}^{(2)}$ A and $AA_{T,S}^{(2)}$ are established. Based on above results, we present a method for computing the solution of a kind of restricted matrix equation.

• 대한수학회보
• /
• 제46권3호
• /
• pp.511-519
• /
• 2009

A matrix $P{\in}\mathbb{C}^{n{\times}n}$ is called a generalized reflection matrix if $P^*$ = P and $P^2$ = I. An $n{\times}n$ complex matrix A is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix P if A = PAP (A = -PAP). It is well-known that the reflexive and anti-reflexive matrices with respect to the generalized reflection matrix P have many special properties and widely used in engineering and scientific computations. In this paper, we give new necessary and sufficient conditions for the existence of the reflexive (anti-reflexive) solutions to the linear matrix equation AXB + CY D = E and derive representation of the general reflexive (anti-reflexive) solutions to this matrix equation. By using the obtained results, we investigate the reflexive (anti-reflexive) solutions of some special cases of this matrix equation.

• Journal of applied mathematics & informatics
• /
• 제13권1_2호
• /
• pp.117-123
• /
• 2003

For an n ${\times}$ n real matrix X, let ${\Phi}$(X) = X o (X$\^$-1/)$\^$T/, where o stands for the Hadamard (entrywise) product. Suppose A, B, G and D are n ${\times}$ n real nonsingular matrices, and among them there are at least one solutions to the equation (equation omitted). An equivalent condition which enable (equation omitted) become a real solution ot the equation (equation omitted), is given. As application, we get new real solutions to the matrix equation (equation omitted) by applying the results of Zhang. Yang and Cao [SIAM.J.Matrix Anal.Appl, 21(1999), pp: 642-645] and Chen [SIAM.J.Matrix Anal.Appl, 22(2001), pp:965-970]. At the same time, all solutions of the matrix equation (equation omitted) are also given.

• Journal of applied mathematics & informatics
• /
• 제31권3_4호
• /
• pp.545-558
• /
• 2013

In this paper, the formulas for calculating the extremal ranks and inertias of the Hermitian least squares solutions to matrix equation AX = B are established. In particular, the necessary and sufficient conditions for the existences of the positive and nonnegative definite solutions to this matrix equation are given. Meanwhile, the least squares problem of the above matrix equation with Hermitian R-symmetric and R-skew symmetric constraints are also investigated.

• 대한수학회지
• /
• 제55권2호
• /
• pp.327-342
• /
• 2018

In this paper, a homotopy continuation method for obtaining the unique Hermitian positive definite solution of the nonlinear matrix equation $X-{\sum_{i=1}^{m}}A^{\ast}_iX^{-p_i}A_i=I$ with $p_i$ > 1 is proposed, which does not depend on a good initial approximation to the solution of matrix equation.

• East Asian mathematical journal
• /
• 제29권3호
• /
• pp.327-335
• /
• 2013

In this paper we consider the quadratic matrix equation which can be defined by $$Q(X)=AX^2+BX+C=0$$, where X is a $n{\times}n$ unknown complex matrix, and A, B and C are $n{\times}n$ given matrices with complex elements. We first introduce a couple of condition numbers of the equation Q(X) and present normwise condition numbers. Finally, we compare the results and some numerical experiments are given.

• 제어로봇시스템학회논문지
• /
• 제19권7호
• /
• pp.577-582
• /
• 2013

In this paper Legendre wavelets are used to approximate the solutions of linear time-invariant system. The Legendre wavelet and its integral operational matrix are presented and an efficient algorithm to solve the Sylvester matrix equation is proposed. The algorithm is based on the decomposition of the Sylvester matrix equation and the preorder traversal algorithm. Using the special structure of the Legendre wavelet's integral operational matrix, the full order Sylvester matrix equation can be solved in terms of the solutions of pure algebraic matrix equations, which reduce the computation time remarkably. Finally a numerical example is illustrated to demonstrate the validity of the proposed algorithm.

• Journal of applied mathematics & informatics
• /
• 제15권1_2호
• /
• pp.485-493
• /
• 2004

This paper presents the interesting properties of a certain patterned matrix that plays an significant role in the statistical analysis. The necessary and sufficient condition on the existence of the inverse of the patterned matrix and its determinant are derived. In special cases of the patterned matrix, explicit formulas for its inverse, determinant and the characteristic equation are obtained.

• 한국컴퓨터정보학회논문지
• /
• 제20권12호
• /
• pp.67-74
• /
• 2015

The heat conduction equation, a type of a Poisson equation which can be applied in various areas of engineering is calculating its value with the iteration method in general. The equation which had difference discretization of the heat conduction equation is the simultaneous equation, and each line has the characteristic of expressing in sparse matrix of the equivalent number of none-zero elements with neighboring grids. In this paper, we propose a data structure for sparse matrix that can calculate the value faster with less memory use calculate the heat conduction equation. To verify whether the proposed data structure efficiently calculates the value compared to the other sparse matrix representations, we apply the representative iteration method, CG (Conjugate Gradient), and presents experiment results of time consumed to get values, calculation time of each step and relevant time consumption ratio, and memory usage amount. The results of this experiment could be used to estimate main elements of calculating the value of the general heat conduction equation, such as time consumed, the memory usage amount.

• Kyungpook Mathematical Journal
• /
• 제47권2호
• /
• pp.239-251
• /
• 2007

We show how the minimization can be used to solve the quadratic matrix equation and then compare two different types of conjugate gradient method which are Polak and Ribi$\acute{e}$re version and Fletcher and Reeves version. Finally, some results of the global and local convergence are shown.