We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine that criterion in order to be able to give an explicit sufficient condition for a non-redundant decomposition of a tensor to be minimal and unique
This paper is a survey, with full proofs, of results about the problem of how to minimally represent...
The Schmidt-Eckart-Young theorem for matrices states that the optimal rank-r approximation to a matr...
In this paper, we propose three new tensor decompositions for even-order tensors correspond-ing resp...
We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine th...
We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine th...
The tensor rank decomposition problem consists of recovering the unique parameters of the decomposit...
In applications, one rarely works with tensors that admit an exact low-rank tensor decomposition due...
The tensor rank decomposition problem consists of recovering the unique parameters of the decomposit...
The tensor rank of a tensor is the smallest number r such that the tensor can be decomposed as a sum...
In this work we study different notions of ranks and approximation of tensors. We consider the tenso...
textabstractThe tensor rank of a tensor t is the smallest number r such that t can be decomposed as ...
International audienceComputations of low-rank approximations of tensors often involve path-followin...
Abstract. Necessary conditions are derived for a rank-r tensor to be a best rank-r approximation of ...
AbstractA lower bound on rank is constructed for arbitrary tensors over finite fields. For fields of...
The tensor rank decomposition is a decomposition of a tensor into a linear combination of rank-1 ten...
This paper is a survey, with full proofs, of results about the problem of how to minimally represent...
The Schmidt-Eckart-Young theorem for matrices states that the optimal rank-r approximation to a matr...
In this paper, we propose three new tensor decompositions for even-order tensors correspond-ing resp...
We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine th...
We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine th...
The tensor rank decomposition problem consists of recovering the unique parameters of the decomposit...
In applications, one rarely works with tensors that admit an exact low-rank tensor decomposition due...
The tensor rank decomposition problem consists of recovering the unique parameters of the decomposit...
The tensor rank of a tensor is the smallest number r such that the tensor can be decomposed as a sum...
In this work we study different notions of ranks and approximation of tensors. We consider the tenso...
textabstractThe tensor rank of a tensor t is the smallest number r such that t can be decomposed as ...
International audienceComputations of low-rank approximations of tensors often involve path-followin...
Abstract. Necessary conditions are derived for a rank-r tensor to be a best rank-r approximation of ...
AbstractA lower bound on rank is constructed for arbitrary tensors over finite fields. For fields of...
The tensor rank decomposition is a decomposition of a tensor into a linear combination of rank-1 ten...
This paper is a survey, with full proofs, of results about the problem of how to minimally represent...
The Schmidt-Eckart-Young theorem for matrices states that the optimal rank-r approximation to a matr...
In this paper, we propose three new tensor decompositions for even-order tensors correspond-ing resp...
DOI
Add to ORKG