EconPapers    
Economics at your fingertips  
 

Bounds on strongly orthogonal ranks of tensors

Shenglong Hu

Applied Mathematics and Computation, 2020, vol. 365, issue C

Abstract: A strongly orthogonal decomposition of a tensor is a rank-one tensor decomposition with the two component vectors in each mode of any two rank-one tensors are either colinear or orthogonal. A strongly orthogonal decomposition with the smallest possible number of rank-one tensors is a strongly orthogonal rank decomposition. Any tensor has a strongly orthogonal rank decomposition. The number of rank-one tensors in a strongly orthogonal rank decomposition is the strongly orthogonal rank. In this article, bounds on the strongly orthogonal rank of a real tensor are investigated. A universal upper bound, in terms of the multilinear ranks, for the strongly orthogonal ranks is given for an arbitrary tensor space. A formula for the expected strongly orthogonal rank of a given tensor space is also given, which is verified for a set of tensor spaces numerically.

Keywords: Strongly orthogonal decomposition of a tensor; Strongly orthogonal rank (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319307155
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:365:y:2020:i:c:s0096300319307155

DOI: 10.1016/j.amc.2019.124723

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().

 
Page updated 2025-03-19
Handle: RePEc:eee:apmaco:v:365:y:2020:i:c:s0096300319307155