The properties and the low-rank approximation of a class of unitary decomposable fourth-order conjugate partial symmetric tensors

In this paper, we extend the notion of unitary decomposable tensors to general unitary decomposable tensors, and study the properties and the low-rank approximation of fourth-order general unitary decomposable tensors with conjugate partial symmetric (CPS) property. We show that the CPS rank one approximation problem for fourth-order general unitary decomposable CPS tensors is equivalent to maximizing a complex quadratic form with 1-norm constraint. For two classes of fourth-order general unitary decomposable CPS tensors, we show that the successive rank one approximation algorithm along with the successive rank two approximation algorithm can exactly recover the original tensor. For fourth-order partial symmetric (PS) tensors, we prove that when the rank of the tensor is smaller than its order, then the CP rank and the PS rank coincide. Based on this, we characterize the shape of all rank 2 fourth-order CPS tensors.

Authors

Publication Details

Journal
Scientia Sinica Mathematica
Published
2024-11-21
DOI
https://doi.org/10.1360/ssm-2024-0134
Primary Topic
Tensor decomposition and applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The properties and the low-rank approximation of a class of unitary decomposable fourth-order conjugate partial symmetric tensors

Qingzhi Yang
Scientia Sinica Mathematica
Tensor decomposition and applications
article

The properties and the low-rank approximation of a class of unitary decomposable fourth-order conjugate partial symmetric tensors

Qingzhi Yang
article en

Abstract

In this paper, we extend the notion of unitary decomposable tensors to general unitary decomposable tensors, and study the properties and the low-rank approximation of fourth-order general unitary decomposable tensors with conjugate partial symmetric (CPS) property. We show that the CPS rank one approximation problem for fourth-order general unitary decomposable CPS tensors is equivalent to maximizing a complex quadratic form with 1-norm constraint. For two classes of fourth-order general unitary decomposable CPS tensors, we show that the successive rank one approximation algorithm along with the successive rank two approximation algorithm can exactly recover the original tensor. For fourth-order partial symmetric (PS) tensors, we prove that when the rank of the tensor is smaller than its order, then the CP rank and the PS rank coincide. Based on this, we characterize the shape of all rank 2 fourth-order CPS tensors.

Scientia Sinica MathematicaVol. 55(2)
Openalex Percentile: Top 81%
Tensor decomposition and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.