Efficient Low-Rank Approximation of Quaternion Matrices via Adaptive Cross Approximation
From MaRDI portal
Cites work
- Adaptive cross approximation for ill-posed problems
- Adaptive Cross Tubal Tensor Approximation
- Adaptive low-rank approximation of collocation matrices
- An efficient iterative algorithm for quaternionic least-squares problems over the generalized \(\eta\)-(anti-)bi-Hermitian matrices
- Approximation of boundary element matrices
- Generalised adaptive cross approximation for convolution quadrature based boundary element formulation
- Incomplete cross approximation in the mosaic-skeleton method
- Iterative algorithms for least-squares solutions of a quaternion matrix equation
- Iterative Methods for Computing the Moore--Penrose Inverse of Split-Quaternion Matrices with Applications
- Iterative Methods for Computing the Moore-Penrose Pseudoinverse of Quaternion Matrices, with Applications
- Pass-efficient Randomized Algorithms for Low-rank Approximation of Quaternion Matrices
- Singular value decomposition of quaternion matrices: a new tool for vector-sensor signal processing
- Solving a large dense linear system by adaptive cross approximation
- Topics in quaternion linear algebra
- TT-cross approximation for multidimensional arrays
This page was built for publication: Efficient Low-Rank Approximation of Quaternion Matrices via Adaptive Cross Approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7409108)