An ATLD-ALS method for the trilinear decomposition of large third-order tensors

DOI10.1007/s00500-019-04320-9zbMath1491.65035OpenAlexW2971919609WikidataQ114229199 ScholiaQ114229199MaRDI QIDQ2156526

Violetta Simonacci, Michele Gallo

Publication date: 18 July 2022

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-019-04320-9

zbMATH Keywords

degeneracycomputational efficiencyconvergence speedCP modelpolyadic form

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Numerical linear algebra (65F99)

Related Items (1)

rrcov3way

Uses Software

• R
• multiway

Cites Work

• Canonical polyadic decomposition of third-order tensors: relaxed uniqueness conditions and algebraic algorithm
• On uniqueness in CANDECOMP/PARAFAC
• Decompositions and biplots in three-way correspondence analysis
• A comparison of algorithms for fitting the PARAFAC model
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• On the Uniqueness of the Canonical Polyadic Decomposition of Third-Order Tensors---Part I: Basic Results and Uniqueness of One Factor Matrix
• On the Uniqueness of the Canonical Polyadic Decomposition of Third-Order Tensors---Part II: Uniqueness of the Overall Decomposition
• A robust Parafac model for compositional data
• Enhanced Line Search: A Novel Method to Accelerate PARAFAC
• Unnamed Item

This page was built for publication: An ATLD-ALS method for the trilinear decomposition of large third-order tensors