Fast adaptive tubal-rank-revealing algorithm for t-product based tensor approximation
Authors:
- 22 September 2026
- journal article
- research article
- Published by Springer Nature in Calcolo
- Vol. 63 (4) , 32
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Natural Science Foundation of China (12471355)
- Natural Science Foundation of Shanghai Municipality (23ZR1422400)
This publication has 44 references indexed in Scilit:
- Leverage score-based quaternion CUR decomposition: Gap error analysis and applicationsBIT Numerical Mathematics, 2026
- Efficient quaternion CUR decomposition based on discrete empirical interpolation methodBIT Numerical Mathematics, 2025
- Single-pass randomized QLP decomposition for low-rank approximationCalcolo, 2022
- An Efficient Algorithm for Computing the Approximate t-URV and its ApplicationsJournal of Scientific Computing, 2022
- Randomized Quaternion QLP Decomposition for Low-Rank ApproximationJournal of Scientific Computing, 2022
- Robust tensor completion using transformed tensor singular value decompositionNumerical Linear Algebra with Applications, 2020
- Randomized algorithms for the approximations of Tucker and the tensor train decompositionsAdvances in Computational Mathematics, 2018
- A randomized tensor singular value decomposition based on the t‐productNumerical Linear Algebra with Applications, 2018
- TripleRank: Ranking Semantic Web Data by Tensor DecompositionLecture Notes in Computer Science, 2009
- Some Mathematical Notes on Three-Mode Factor AnalysisPsychometrika, 1966