Search arXivSearch

arXiv · 2407.12635

Dual Complex Adjoint Matrix: Applications in Dual Quaternion Research

Abstract

Dual quaternions and dual quaternion matrices have garnered widespread applications in robotic research, and its spectral theory has been extensively studied in recent years. This paper introduces the novel concept of the dual complex adjoint matrices for dual quaternion matrices. We delve into exploring the properties of this matrix, utilizing it to study eigenvalues of dual quaternion matrices and defining the concept of standard right eigenvalues. Notably, we leverage the properties of the dual complex adjoint matrix to devise a direct solution to the Hand-Eye calibration problem. Additionally, we apply this matrix to solve dual quaternion linear equations systems, thereby advancing the Rayleigh quotient iteration method for computing eigenvalues of dual quaternion Hermitian matrices, enhancing its computational efficiency. Numerical experiments have validated the correctness of our proposed method in solving the Hand-Eye calibration problem and demonstrated the effectiveness in improving the Rayleigh quotient iteration method, underscoring the promising potential of dual complex adjoint matrices in tackling dual quaternion-related challenges.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yongjun Chen, Liping Zhang. 2024-07-17. Dual Complex Adjoint Matrix: Applications in Dual Quaternion Research. https://arxiv.org/abs/2407.12635

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On solutions of singular Sylvester equations in quaternions

The quaternionic equations ax-xb=0 and ax-xb=c are investigated, which are called homogeneous and inhomogeneous Sylvester equations, respectively. Conditions for the existence of solutions are provided. In addition, the general and nonzero solutions to these equations are derived applying quaternion square roots.

math.RA

Positivity preservers over finite fields II

We say that a matrix over a finite field $\mathbb{F}_q$ is positive definite if it is symmetric and each of its leading principal minors is a nonzero square in $\mathbb{F}_q$. In previous work of the authors [J. Algebra, 2025], the entrywise positivity preservers on $M_n(\mathbb{F}_q)$ were classified in every case except when $n=2$, $q\equiv1\pmod4$, and $q$ is not a square. We settle this remaining case, thereby completing the classification of entrywise positivity preservers over every finite field and in every dimension $n\ge2$. Our proof is based on a novel idempotent reduction that not only resolves the remaining case but also yields a self-contained proof of the complete classification, while avoiding several technical results used in the earlier arguments. As a further application of the same reduction, we classify the entrywise preservers of strongly nonsingular matrices, i.e., matrices whose leading principal minors are all nonzero. We also prove a more general theorem in odd characteristic: for every prescribed sign pattern of nonzero leading principal minors of matrices of a fixed dimension $n\ge2$, the entrywise preservers are precisely the positive scalar multiples of field automorphisms. Thus, in odd characteristic, preserving any nonzero leading-principal-minor sign pattern surprisingly forces the preservation of every such sign pattern.

math.RA

Graphs of Moore-Penrose inverse of matrices possessing the treeangle property

It is known that the inverse of an invertible real square matrix satisfying the treeangle property, is a treediagonal matrix. A converse statement also holds. We show that the verbatim analogues are not true for the Moore-Penrose inverse, and obtain the precise structure of graphs corresponding to the Moore-Penrose inverse of matrices possessing the treeangle property.

math.RA