Search

In this paper, a new real representation of reduced biquaternion matrix is proposed, and the solutions of the reduced biquaternion matrix equations XF−AX=BY$$ XF- AX= BY $$ and XF−AX˜=BY$$ XF-A\tilde{X}= BY $$ are solved by means of this method. The corresponding numerical algorithm is provided, and the effectiveness of this method is verified by numerical examples. [ABSTRACT FROM AUTHOR]

In this paper, we consider the split quaternion matrix equation X − A f (X) B = C , f (X) ∈ { X , X H , X i H , X j H X k H } . The H representation method has the characteristics of transforming a matrix with a special structure into a column vector with independent elements. By using the real representation of split quaternion matrices, H representation method, the Kronecker product of matrices and the Moore-Penrose generalized inverse, we convert the split quaternion matrix equation into the real matrix equation, and derive the sufficient and necessary conditions and the general solution expressions for the (skew) bisymmetric solution of the original equation. Moreover, we provide numerical algorithms and illustrate the efficiency of our method by two numerical examples. [ABSTRACT FROM AUTHOR]

In this paper, we study the Gauss-Seidel and successive over-relaxation iteration methods for quaternion linear systems A x = b and obtain the structure-preserving algorithms of Gauss-Seidel and successive over-relaxation iteration methods for quaternion linear systems A x = b . The convergence and computational cost of these iteration methods are discussed. Numerical examples are given to demonstrate the efficiency of structure-preserving algorithms of Gauss-Seidel iteration and successive over-relaxation iteration methods. As an application, we apply two kinds of structure-preserving iterative algorithms to solve elliptic biquaternion linear systems A x = b . [ABSTRACT FROM AUTHOR]