CP decomposition and low-rank approximation of antisymmetric tensors

DOI10.1553/etna_vol62s72zbMATH Open1548.65105MaRDI QIDQ6611980

Erna Begović Kovač, Lana Periša

Publication date: 27 September 2024

Published in: Unnamed Author (Search for Journal in Brave)

zbMATH Keywords

Julialow-rank approximationstructure-preserving algorithmCP decompositionantisymmetric tensors

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Cites Work

• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• The expression of a tensor or a polyadic as a sum of products.
• Multiple invariants and generalized rank of a \(p\)-way matrix or tensor.
• Numerical optimization for symmetric tensor decomposition
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• Local Convergence of the Alternating Least Squares Algorithm for Canonical Tensor Approximation
• A new convergence proof for the higher-order power method and generalizations
• Julia: A Fresh Approach to Numerical Computing
• Variants of Alternating Least Squares Tensor Completion in the Tensor Train Format
• A Multilinear Singular Value Decomposition
• On the Representation of Symmetric and Antisymmetric Tensors
• Computation of the Canonical Decomposition by Means of a Simultaneous Generalized Schur Decomposition
• Generalized Canonical Polyadic Tensor Decomposition
• Symmetric Tensors and Symmetric Tensor Rank
• Structure-Preserving Low Multilinear Rank Approximation of Antisymmetric Tensors
• Multilinear Algebra
• CP decomposition for tensors via alternating least squares with QR decomposition

This page was built for publication: CP decomposition and low-rank approximation of antisymmetric tensors