A two-sided randomized algorithm for low-rank quaternion matrix approximation
From MaRDI portal
Cites work
- A new real structure-preserving quaternion QR algorithm
- A new structure-preserving method for quaternion Hermitian eigenvalue problems
- A randomized tensor singular value decomposition based on the t-product.
- Color image inpainting via robust pure quaternion matrix completion: error bound and weighted loss
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Lanczos method for large-scale quaternion singular value decomposition
- Pass-efficient randomized algorithms for low-rank matrix approximation using any number of views
- Quaternion singular value decomposition based on bidiagonalization to a real or complex matrix using quaternion Householder transformations
- Quaternions and matrices of quaternions
- Randomized Quaternion Singular Value Decomposition for Low-Rank Matrix Approximation
- Randomized block Krylov subspace algorithms for low-rank quaternion matrix approximations
- Randomized quaternion QLP decomposition for low-rank approximation
- Real structure-preserving algorithms of Householder based transformations for quaternion matrices
This page was built for publication: A two-sided randomized algorithm for low-rank quaternion matrix approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6898084)