Search arXivSearch

arXiv · 2506.18319

Solution Methods and Perturbation Analysis for the Equality-Constrained Total Least Squares Problem over Reduced Biquaternions

Abstract

This paper proposes a theoretical framework to address the reduced biquaternion equality-constrained total least squares (RBTLSE) problem. The objective is to find an approximate solution to the system $AX \approx B$, subject to linear constraints $CX = D$, while explicitly accounting for errors in both the coefficient matrix $A$ and the observation matrix $B$. We establish conditions under which real and complex solutions exist and develop corresponding solution methods using real and complex representations of reduced biquaternion matrices. To assess the sensitivity of the solutions to data perturbations, we derive relative normwise condition numbers and provide tight upper bounds on the relative forward errors. These results ensure the computational reliability of the proposed framework. Extensive numerical experiments validate the theoretical findings and demonstrate that the RBTLSE approach significantly outperforms the conventional reduced biquaternion equality-constrained least squares (RBLSE) method, particularly in noisy environments affecting both sides of the system.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Neha Bhadala. 2025-06-23. Solution Methods and Perturbation Analysis for the Equality-Constrained Total Least Squares Problem over Reduced Biquaternions. https://arxiv.org/abs/2506.18319

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