Search

This paper mainly studies the least-squares solutions of matrix equation $ AXB = C $ under a semi-tensor product. According to the definition of the semi-tensor product, the equation is transformed into an ordinary matrix equation. Then, the least-squares solutions of matrix-vector and matrix equations respectively investigated by applying the derivation of matrix operations. Finally, the specific form of the least-squares solutions is given.

In this study, we obtained results for the computation of eigen-pairs, singular value decomposition, pseudoinverse, and the least squares problem for elliptic quaternion matrices. Moreover, we established algorithms based on these results and provided illustrative numerical experiments to substantiate the accuracy of our conclusions. In the experiments, it was observed that the p-value in the algebra of elliptic quaternions directly affects the performance of the problem under consideration. Selecting the optimal p-value for problem-solving and the elliptic behavior of many physical systems make this number system advantageous in applied sciences.

This paper considers the Hermitian solutions of a new system of commutative quaternion matrix equations, where we establish both necessary and sufficient conditions for the existence of solutions. Furthermore, we derive an explicit general expression when it is solvable. In addition, we also provide the least squares Hermitian solution in cases where the system of matrix equations is not consistent. To illustrate our main findings, in this paper we present two numerical algorithms and examples.

In this article, our interest is the quaternion matrix equation (AXB,DXE)=(C,F), and we study its minimal norm centrohermitian least squares solution and skew centrohermitian least squares solution. By applying of the real representation matrices of quaternion matrices and relative properties, we convert the quaternion least squares problems with constrained variables into the corresponding real least squares problems with free variables, and then we obtain the solutions of corresponding problems. The final results can be expressed only by real matrices and vectors, and thus the corresponding algorithms only involves real operations and avoid complex quaternion operations. Therefore, they are portable and convenient. In the end, we give two examples to verify the effectiveness of the purposed algorithms.

In this paper, we propose an efficient method for some special solutions of the quaternion matrix equation AXB+CYD=E. By integrating real representation of a quaternion matrix with H-representation, we investigate the minimal norm least squares solution of the previous quaternion matrix equation over different constrained matrices and obtain their expressions. In this way, we first apply H-representation to solve quaternion matrix equation with special structure, which not only broadens the application scope of H-representation, but further expands the research idea of solving quaternion matrix equation. The algorithms only include real operations. Consequently, it is very simple and convenient, and it can be applied to all kinds of quaternion matrix equation with similar problems. The numerical example is provided to illustrate the feasibility of our algorithms.

In this paper, the idea of partitioning is used to solve quaternion least squares problem, we divide the quaternion Bisymmetric matrix into four blocks and study the relationship between the block matrices. Applying this relation, the real representation of quaternion, and M-P inverse, we obtain the least squares Bisymmetric solution of quaternion matrix equation AXB=C and its compatable conditions. Finally, we verify the effectiveness of the method through numerical examples.

In this paper, we study several constrainted least squares solutions of quaternion Sylvester matrix equation. We first propose a real vector representation of quaternion matrix and study its properties. By using this real vector representation, semi-tensor product of matrices, swap matrix and Moore-Penrose inverse, we derive compatible conditions and the expressions of several constrainted least squares solutions of quaternion Sylvester equation.

In this paper, we investigate the best fit solution for the second order differential problem with one initial and other integral conditions. We obtain the representation of that minimizer and present an example.paration.

Many real life situations can be described using twice continuously differentiable functions over convex sets with interior points. Such functions have an interesting separation property: At every interior point of the set they separate particular classes of quadratic convex functions from classes of quadratic concave functions. Using this property we introduce new characterizations of the derivative and its zero points. The results are applied to the study of sensitivity of the Cobb-Douglas production function. They are also used to describe the least squares solutions in linear and nonlinear regression.