Mixed-precision fully-connected tensor network decomposition
From MaRDI portal
Cites work
- Accelerating the solution of linear systems by iterative refinement in three precisions
- Approximation strategy based on the T-product for third-order quaternion tensors with application to color video compression
- Efficient low-rank quaternion matrix completion under the learnable transforms for color image recovery
- Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train
- Factorization strategies for third-order tensors
- Fast Nonnegative Matrix/Tensor Factorization Based on Low-Rank Approximation
- Iterative refinement method by higher-order singular value decomposition for solving multi-linear systems
- Orthogonal nonnegative Tucker decomposition
- Provable stochastic algorithm for large-scale fully-connected tensor network decomposition
- Smooth PARAFAC Decomposition for Tensor Completion
- T-product based _1-norm tensor principal component analysis and a finite-step convergence algorithm
- Tensor networks for dimensionality reduction and large-scale optimization. I: Low-rank tensor decompositions
- Tensor-tensor products with invertible linear transforms
- Tensor-train decomposition
- Three-precision GMRES-based iterative refinement for least squares problems
This page was built for publication: Mixed-precision fully-connected tensor network decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7354861)