• Mathematics, Computer Science
  • Published in
    SIAM J. Matrix Analysis…
    2014
  • DOI:10.1137/130916084

Canonical Polyadic Decomposition of Third-Order Tensors: Reduction to Generalized Eigenvalue Decomposition

@article{Domanov2014CanonicalPD,
  title={Canonical Polyadic Decomposition of Third-Order Tensors: Reduction to Generalized Eigenvalue Decomposition},
  author={Ignat Domanov and Lieven De Lathauwer},
  journal={SIAM J. Matrix Analysis Applications},
  year={2014},
  volume={35},
  pages={636-660}
}
Canonical polyadic decomposition (CPD) of a third-order tensor is decomposition in a minimal number of rank-1 tensors. We call an algorithm algebraic if it is guaranteed to find the decomposition when it is exact and if it relies only on standard linear algebra (essentially sets of linear equations and matrix factorizations). The known algebraic algorithms for the computation of the CPD are limited to cases where at least one of the factor matrices has full column rank. In this paper we present… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 50 CITATIONS

Time-Delay estimation via CPD-GEVD applied to tensor-based GNSS arrays with errors

  • 2017 IEEE 7th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)
  • 2017
VIEW 10 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Hypercomplex Tensor Completion via Convex Optimization

  • IEEE Transactions on Signal Processing
  • 2019
VIEW 1 EXCERPT
CITES METHODS

NLS Algorithm for Kronecker-Structured Linear Systems with a CPD Constrained Solution

  • 2019 27th European Signal Processing Conference (EUSIPCO)
  • 2019
VIEW 2 EXCERPTS
CITES BACKGROUND

FILTER CITATIONS BY YEAR

2014
2020

CITATION STATISTICS

  • 1 Highly Influenced Citations

  • Averaged 10 Citations per year from 2017 through 2019

References

Publications referenced by this paper.
SHOWING 1-10 OF 32 REFERENCES