Tensor Deflation for CANDECOMP/PARAFAC— Part II: Initialization and Error Analysis
From MaRDI portal
Publication:4580905
DOI10.1109/TSP.2015.2458789zbMATH Open1394.94462DBLPjournals/tsp/PhanTC15aOpenAlexW1649155767WikidataQ60486520 ScholiaQ60486520MaRDI QIDQ4580905FDOQ4580905
Andrzej Cichocki, Petr Tichavský, Anh-Huy Phan
Publication date: 22 August 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tsp.2015.2458789
Recommendations
- Tensor Deflation for CANDECOMP/PARAFAC— Part I: Alternating Subspace Update Algorithm
- scientific article; zbMATH DE number 1225903
- Parallel Candecomp/Parafac decomposition of sparse tensors using dimension trees
- A nonlinear GMRES optimization algorithm for canonical tensor decomposition
- On the optimization landscape of tensor decompositions
- Nonlinear least squares solver for evaluating canonical tensor decomposition
- Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition
- Deflated and restarted Krylov subspace methods for Sylvester tensor equations
- Low-rank tensor Krylov subspace methods for parametrized linear systems
This page was built for publication: Tensor Deflation for CANDECOMP/PARAFAC— Part II: Initialization and Error Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580905)