四元数矩阵方程AXB+CXD=E的广义延拓解

本文在四元数体上讨论矩阵方程AXB+CXD=E的广义行（列）共轭延拓解问题.利用四元数矩阵的复与实分解,以及广义共轭延拓矩阵的结构特点,借助矩阵Kronecker积,把约束四元数矩阵方程转化为实数域上无约束方程,从而得到该方程具有广义行（列）共轭延拓解的充要条件及其通解表达式.最后通过数值算例说明所给算法的可行性.     

四元数矩阵方程AX+YA=C的两种最佳逼近解

利用四元数矩阵的广义Frobenius范数建立一个关于四元数矩阵的实函数,并讨论了它的极值问题,然后在四元数矩阵方程AX YA=C的一般解和自共轭解集合中分别导出了与给定相同类型矩阵的最佳逼近解的表达式.     

四元数体上共轭辛矩阵的结构及应用

把实数域上的辛矩阵概念推广到四元数体上形成共轭辛矩阵类.用矩阵四分块形式刻划了正定辛矩阵和自共轭辛矩阵的特征结构.作为应用,给出四元数矩阵方程AS=B存在四分块对角型共轭辛矩阵解的充要条件及其解的表达式,同时用数值算例说明所给方法的可行性.     

四元数体上一类矩阵方程的极小范数最小二乘解

借助于四元数体上自共轭矩阵的奇异值分解,给出了四元数矩阵方程AX＋XB＋CXD=F的极小范数最小二乘解.同时,在有解的条件下给出了Hermite最小二乘解及其通解的表达形式.     

分裂四元数矩阵的奇异值分解及应用

利用i-共轭重新定义了分裂四元数矩阵的共轭转置,在此基础上借助复表示和友向量研究了分裂四元数矩阵的奇异值分解,并利用所得结果解决了分裂四元数矩阵的极分解和分裂四元数矩阵方程AXB-CYD=E.     

四元数体上矩阵方程的自共轭解

利用矩阵的M-P逆和矩阵分块,给出了四元数体上矩阵方程XB=D在子空间上有自共轭解的充要条件以及解的一般形式,并由此给出了矩阵方程AXB=D有自共轭解的充要条件和解的一般形式.     

四元数矩阵的实表示与四元数矩阵方程

四元数矩阵与四元数矩阵方程在力学和工程问题的理论研究和实际数值计算中都起到重要的作用.该文借助四元数矩阵的实表示方法,研究了一般四元数矩阵方程AXB-CYD=E的解的问题,给出了一种求解四元数矩阵方程的算法技巧.该文还得到了四元数矩阵的Roth's定理.     

求解四元数矩阵方程X-AXB=CY+D的一种新方法（英文）

提出了四元数矩阵的一种实向量表示法,可以结合矩阵的半张量积研究四元数矩阵方程.给出了四元数矩阵方程X-AXB=CY+D的最小二乘Hermitian解的通解表达式,以及该方程具有Hermitian解的充要条件,通过数值实验,验证该方法的有效性.     

四元数矩阵方程AX-YB=C的最佳逼近解

本利用四元数矩阵的广义Frobenius范数建立一个关于四元数矩阵的实函数，并讨论了它的极值问题．然后在四元数矩阵方程AX-YB=C的解集合中导出了与给定矩阵的最佳逼近解的表达式．     

四元数自共轭矩阵乘积的特征值不等式

由于四元数对乘法无交换律,因而对四元数自共轭矩阵的特征值问题的讨论比复数矩阵的相应问题要困难得多,文[1]、[2]分别对四元数自共轭矩阵的特征值和两个四元数自共轭矩阵乘积的特征进行了估计,做了一定的工作,但与复数域上的有关结果相比较,还有较大差距.本文对四元数自共轭矩阵乘积的特征值进行了探讨.得到了较好的结论,推广了[1]、[2]中的结果。     

On a Solution of the Quaternion Matrix Equation X - A X B = C and Its Application

This paper first studies the solution of a complex matrix equation X - AXB = C, obtains an explicit solution of the equation by means of characteristic polynomial, and then studies the quaternion matrix equation X - A X B = C, characterizes the existence of a solution to the matrix equation, and derives closed-form solutions of the matrix equation in explicit forms by means of real representations of quaternion matrices. This paper also gives an application to the complex matrix equation X - AXB =C.     

四元数矩阵方程的复转化及保结构算法

给出四元数矩阵复表示运算定义及其相关性质,并运用复表示运算的保结构特性,讨论了四元数矩阵Moore-Penrose逆计算以及两类四元数矩阵方程AXB=C和AX-XB=C的数值求解方法.数值算例检验了所给算法的可行性.     

L-structured quaternion matrices and quaternion linear matrix equations

This paper focuses on L-structured quaternion matrices. L-structured real matrices, conditions for the existence of solutions and the general solution of linear matrix equations were studied in the paper [Magnus JR. L-structured matrices and linear matrix equations, Linear Multilinear Algebra 1983;14:67–88]. In this paper, we present a theoretical study extending L-structured real matrices to L-structured quaternion matrices, and introduce some L-structured quaternion matrices. Based on them, we then discuss their applications in quaternion matrix equations.     

四元数矩阵方程AXAH=B的最小二乘解

引入了四元数矩阵范数的概念，通过使用四无数矩阵的奇异值分解，给出了四元数矩阵方程AXA^H＝B在最小二乘意义下的Hermitian解以及Skew-Hermitian解．     

Algebraic methods for equality constrained least squares problems in commutative quaternionic theory

This paper, by means of two matrix representations of a commutative quaternion matrix, studies the relationship between the solutions of commutative quaternion equality constrained least squares (LSE) problems and that of complex and real LSE problems and derives two algebraic methods for finding the solutions of equality constrained least squares problems in commutative quaternionic theory.     

四元数广义奇异值分解及其应用

This paper derives a theorem of generalized singular value decomposition of quaternion matrices(QGSVD),studies the solution of general quaternion matrix equation AXB-CYD=E,and obtains quaternionic Roth's theorem.This paper also suggestssufficient and necessary conditions for the existence and uniqueness of solutions and explicit forms of the solutions of the equation.     

Robust quaternion matrix completion with applications to image inpainting

In this paper, we study robust quaternion matrix completion and provide a rigorous analysis for provable estimation of quaternion matrix from a random subset of their corrupted entries. In order to generalize the results from real matrix completion to quaternion matrix completion, we derive some new formulas to handle noncommutativity of quaternions. We solve a convex optimization problem, which minimizes a nuclear norm of quaternion matrix that is a convex surrogate for the quaternion matrix rank, and the ?₁‐norm of sparse quaternion matrix entries. We show that, under incoherence conditions, a quaternion matrix can be recovered exactly with overwhelming probability, provided that its rank is sufficiently small and that the corrupted entries are sparsely located. The quaternion framework can be used to represent red, green, and blue channels of color images. The results of missing/noisy color image pixels as a robust quaternion matrix completion problem are given to show that the performance of the proposed approach is better than that of the testing methods, including image inpainting methods, the tensor‐based completion method, and the quaternion completion method using semidefinite programming.