A locally and cubically convergent algorithm for computing 𝒵‐eigenpairs of symmetric tensors
From MaRDI portal
Publication:3297078
DOI10.1002/nla.2284zbMath1474.65091OpenAlexW3005782740WikidataQ112878905 ScholiaQ112878905MaRDI QIDQ3297078
Mao-Lin Liang, Bing Zheng, Ruijuan Zhao, Yang-yang Xu
Publication date: 2 July 2020
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.2284
symmetric tensorscubical convergenceNewton correction method\(\mathcal{Z}\)-eigenpairs\(US\)-eigenpairsmodified normalized Newton method
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Multilinear algebra, tensor calculus (15A69)
Related Items
An adaptive cubic regularization algorithm for computing H- and Z-eigenvalues of real even-order supersymmetric tensors ⋮ A projection method based on discrete normalized dynamical system for computing C-eigenpairs ⋮ Shifted eigenvalue decomposition method for computing C-eigenvalues of a piezoelectric-type tensor ⋮ A general preconditioner accelerated SOR-type iterative method for multi-linear systems with \(\mathcal{Z}\)-tensors ⋮ Direct methods to compute all \(Z\)-eigenpairs of a tensor with dimension 2 or 3 ⋮ Z-eigenvalue intervals of even-order tensors with application to judge the strong ellipticity of an elasticity tensor
Uses Software