Structure-preserving low multilinear rank approximation of antisymmetric tensors

DOI10.1137/16M106618XzbMATH Open1373.65028arXiv1603.05010OpenAlexW3099740672MaRDI QIDQ5358301FDOQ5358301

Authors: Erna Begović Kovač, Daniel Kressner 

Publication date: 20 September 2017

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Abstract: This paper is concerned with low multilinear rank approximations to antisymmetric tensors, that is, multivariate arrays for which the entries change sign when permuting pairs of indices. We show which ranks can be attained by an antisymmetric tensor and discuss the adaption of existing approximation algorithms to preserve antisymmetry, most notably a Jacobi algorithm. Particular attention is paid to the important special case when choosing the rank equal to the order of the tensor. It is shown that this case can be addressed with an unstructured rank-$1$ approximation. This allows for the straightforward application of the higher-order power method, for which we discuss effective initialization strategies.

Full work available at URL: https://arxiv.org/abs/1603.05010

Recommendations

• Jacobi algorithm for the best low multilinear rank approximation of symmetric tensors
• Low rank symmetric tensor approximations
• Symmetric rank-1 approximation of symmetric high-order tensors
• On the rank and the approximation of symmetric tensors
• On the best rank-1 approximation to higher-order symmetric tensors

zbMATH Keywords

singular value decompositionantisymmetric tensorsJacobi rotationalgorithm: Jacobi algorithmmultilinear rank approximation

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Cites Work

• Tensor Decompositions and Applications
• Tensor-train decomposition
• A Multilinear Singular Value Decomposition
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• Algorithms for Numerical Analysis in High Dimensions
• On the best rank-1 approximation of higher-order supersymmetric tensors
• A literature survey of low-rank tensor approximation techniques
• Best rank one approximation of real symmetric tensors can be chosen symmetric
• Approximating a wavefunction as an unconstrained sum of Slater determinants
• Jacobi algorithm for the best low multilinear rank approximation of symmetric tensors

Cited In (7)

• Convergence of a Jacobi-type method for the approximate orthogonal tensor diagonalization
• Globally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization
• Hybrid CUR-type decomposition of tensors in the Tucker format
• Decomposition of Low Rank Multi-symmetric Tensor
• On the representation of symmetric and antisymmetric tensors
• Jacobi algorithm for the best low multilinear rank approximation of symmetric tensors
• CP decomposition and low-rank approximation of antisymmetric tensors

This page was built for publication: Structure-preserving low multilinear rank approximation of antisymmetric tensors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5358301)