Efficient Low-Rank Approximation of Quaternion Matrices via Adaptive Cross Approximation
Abstract
The adaptive cross approximation (ACA) algorithm is a powerful tool for constructing low-rank matrix approximations using only a small subset of matrix entries. While extensively studied for real and complex matrices, its extension to quaternion algebras, remains largely unexplored. This paper presents the first comprehensive framework for adaptive cross approximation operating natively in the quaternion algebra H. Unlike approaches that rely on real embeddings or complexifications, our method preserves the algebraic structure of quaternions throughout the computation, avoiding information loss and maintaining the natural correlations between quaternion components. We develop a fully quaternionic ACA algorithm with rigorous theoretical foundations, including convergence analysis, error bounds, and complexity estimates. The algorithm achieves O(r(m+n)) complexity per iteration and demonstrates quasioptimal approximation properties comparable to the quaternion singular value decomposition (QSVD), but with significantly reduced computational cost. We provide a detailed MATLAB with numerical experiments on color image compression. Our results show that native quaternion ACA outperforms significantly the basic SVD algorithm in terms of computational efficiency, with very close approximation accuracy.
Related
- Diagonalization of skew-Hermitian dual quaternion matrices and ϕ-Hermitian dual quaternion matrices
- Unitary similarity for dual complex matrices and dual quaternion matrices
- Adaptive Randomized Pivoting for Tensor Cross Approximation in the T-Product Framework
- A Geometric View of Adaptive Cross Approximation via Exterior Algebra
- Eigenvalue and Eigenvector Approximation for Random Matrices Using Low-Degree Polynomials
BibTeX
@misc{ahmadiasl2026efficient,
title = {{Efficient Low-Rank Approximation of Quaternion Matrices via Adaptive Cross Approximation}},
author = {Salman Ahmadi-Asl and Yang Zhang},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.39901},
eprint = {2610.39901},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.39901},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Efficient Low-Rank Approximation of Quaternion Matrices via Adaptive Cross Approximation
AU - Salman Ahmadi-Asl
AU - Yang Zhang
PY - 2026
DA - 2026/10/29
PB - arXiv
DO - 10.48550/arxiv.2610.39901
UR - https://arxiv.org/abs/2610.39901
AB - The adaptive cross approximation (ACA) algorithm is a powerful tool for constructing low-rank matrix approximations using only a small subset of matrix entries. While extensively studied for real and complex matrices, its extension to quaternion algebras, remains largely unexplored. This paper presents the first comprehensive framework for adaptive cross approximation operating natively in the quaternion algebra H. Unlike approaches that rely on real embeddings or complexifications, our method preserves the algebraic structure of quaternions throughout the computation, avoiding information loss and maintaining the natural correlations between quaternion components. We develop a fully quaternionic ACA algorithm with rigorous theoretical foundations, including convergence analysis, error bounds, and complexity estimates. The algorithm achieves O(r(m+n)) complexity per iteration and demonstrates quasioptimal approximation properties comparable to the quaternion singular value decomposition (QSVD), but with significantly reduced computational cost. We provide a detailed MATLAB with numerical experiments on color image compression. Our results show that native quaternion ACA outperforms significantly the basic SVD algorithm in terms of computational efficiency, with very close approximation accuracy.
ER -