Robust quaternion matrix completion via fast randomized low-rank approximation.

DOI10.1002/NLA.70066MaRDI QIDQ6855381zbMATH OpenFDO

Authors Huan Ren, Xu-Yun Xu

Publication date 20 February 2026

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/NLA.70066

zbMATH Keywords

low-rank approximationnon-convex surrogatequaternion singular value thresholdingrandomized algorithmsrobust quaternion matrix completion

Mathematics Subject Classification ID

Matrix completion problems (15A83) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Cited in

(1)

• Multi-scale feature extraction and color image hashing based on SVD of split quaternion matrices

This page was built for publication: Robust quaternion matrix completion via fast randomized low-rank approximation.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6855381)