An alternating shifted higher order power method based algorithm for rank-R Hermitian approximation and solving Hermitian CP-decomposition problems

The Hermitian tensor is a higher order extension of the Hermitian matrix that can be used to represent quantum mixed states and solve problems such as entanglement and separability of quantum mixed states. In this paper, we propose a novel numerical algorithm, an alternating shifted higher order pow...

Full description

Saved in:
Bibliographic Details
Published inJournal of computational and applied mathematics Vol. 459; p. 116385
Main Authors Xin, Xiaofang, Ni, Guyan, Li, Ying
Format Journal Article
LanguageEnglish
Published Elsevier B.V 15.05.2025
Subjects
Online AccessGet full text
ISSN0377-0427
DOI10.1016/j.cam.2024.116385

Cover

More Information
Summary:The Hermitian tensor is a higher order extension of the Hermitian matrix that can be used to represent quantum mixed states and solve problems such as entanglement and separability of quantum mixed states. In this paper, we propose a novel numerical algorithm, an alternating shifted higher order power method (AS-HOPM), for rank-R Hermitian approximation, which can also be used to compute Hermitian Candecomp/Parafac (CP) decomposition. At the same time, for the choice of initial points, we give a Broyden–Fletcher–Goldfarb–Shanno (BFGS) method based on unconstrained optimization, and propose a BFGS-AS-HOPM algorithm for rank-R Hermitian approximation. For solving the Hermitian CP-decomposition problem, numerical experiments show that using the BFGS-AS-HOPM algorithm has a higher success rate than using the AS-HOPM algorithm alone.
ISSN:0377-0427
DOI:10.1016/j.cam.2024.116385