Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/65864
Title: Iterative algorithms for computing US- and U-eigenpairs of complex tensors
Authors: Che, M
Qi, L
Wei, Y
Keywords: Complex symmetric matrices
Complex symmetric tensors
Complex tensors
Takagi factorization
U-eigenpairs
US-eigenpairs
Issue Date: 2017
Publisher: North-Holland
Source: Journal of computational and applied mathematics, 2017, v. 317, p. 547-564 How to cite?
Journal: Journal of computational and applied mathematics 
Abstract: This paper is devoted to the computation of US-eigenpairs of complex symmetric tensors and U-eigenpairs of complex tensors. Based on the Takagi factorization of complex symmetric matrices, we derive an iterative algorithm for computing US-eigenpairs of complex symmetric tensors, denoted as QRCST Algorithm. We also observe that multiple US-eigenpairs can be found from a local permutation heuristic, which is effectively a tensor similarity transformation, resulting in the permuted version of QRCST. We then generalize our techniques to general complex tensors. Finally, we derive a higher order power type method for computing a US- or a U-eigenpair, similar to the higher-order power method for computing Z-eigenpairs of real symmetric tensors or a best rank-one approximation of real tensors. We illustrate our algorithms via numerical examples.
URI: http://hdl.handle.net/10397/65864
ISSN: 0377-0427
EISSN: 1879-1778
DOI: 10.1016/j.cam.2016.12.022
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

15
Last Week
1
Last month
Checked on Nov 12, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.